Saturday, April 17, 2010
firewall concepts
Today's Internet is a dangerous place for your computer; there's just no denying it. A few years ago you could happily go about your business on the web without any form of protection, and still face only a slim chance of being virus infested, hacked or otherwise interfered with. These days it's practically impossible. There are vast amounts of viruses and malware infections moving through the Internet daily, many of which need no prompting or permission to infect an unprotected computer.
backtrack 4 tutorial
BackTrack 2 Tool List
Complete tool list for BackTrack 2. This list is provided courtesy of the BackTrack wiki page.
* 1.1 Information Gathering
o 1.1.1 Ass
o 1.1.2 DMitry
o 1.1.3 DNS-Ptr
o 1.1.4 dnswalk
o 1.1.5 dns-bruteforce
o 1.1.6 dnsenum
o 1.1.7 dnsmap
o 1.1.8 DNSPredict
o 1.1.9 Finger Google
o 1.1.10 Firewalk
o 1.1.11 Goog Mail Enum
o 1.1.12 Google-search
o 1.1.13 Googrape
o 1.1.14 Gooscan
o 1.1.15 Host
o 1.1.16 Itrace
o 1.1.17 Netenum
o 1.1.18 Netmask
o 1.1.19 Pirana
o 1.1.20 Protos
o 1.1.21 QGoogle
o 1.1.22 Relay Scanner
o 1.1.23 SMTP-Vrfy
o 1.1.24 TCtrace
* 1.2 Network Mapping
o 1.2.1 Amap 5.2
o 1.2.2 Ass
o 1.2.3 Autoscan 0.99_R1
o 1.2.4 Fping
o 1.2.5 Hping
o 1.2.6 IKE-Scan
o 1.2.7 IKEProbe
o 1.2.8 Netdiscover
o 1.2.9 Nmap
o 1.2.10 NmapFE
o 1.2.11 P0f
o 1.2.12 PSK-Crack
o 1.2.13 Ping
o 1.2.14 Protos
o 1.2.15 Scanrand
o 1.2.16 SinFP
o 1.2.17 Umit
o 1.2.18 UnicornScan
o 1.2.19 UnicornScan pgsql 0.4.6e module version 1.03
o 1.2.20 XProbe2
o 1.2.21 PBNJ 2.04
+ 1.2.21.1 OutputPBNJ
+ 1.2.21.2 ScanPBNJ
+ 1.2.21.3 Genlist
* 1.3 Vulnerability Identification
o 1.3.1 Absinthe
o 1.3.2 Bed
o 1.3.3 CIRT Fuzzer
o 1.3.4 Cisco Auditing Tool
o 1.3.5 Cisco Enable Bruteforcer
o 1.3.6 Cisco Global Exploiter
o 1.3.7 Cisco Scanner
o 1.3.8 Cisco Torch
o 1.3.9 Curl
o 1.3.10 Fuzzer 1.2
o 1.3.11 GFI LanGuard 2.0
o 1.3.12 GetSids
o 1.3.13 HTTP PUT
o 1.3.14 Halberd
o 1.3.15 Httprint
o 1.3.16 Httprint GUI
o 1.3.17 ISR-Form
o 1.3.18 Jbrofuzz
o 1.3.19 List-Urls
o 1.3.20 Lynx
o 1.3.21 MS03-026
o 1.3.22 MS03-059
o 1.3.23 Merge Router Config
o 1.3.24 Metacoretex
o 1.3.25 Metoscan
o 1.3.26 Mezcal HTTP/S
o 1.3.27 Mibble MIB Browser
o 1.3.28 Mistress
o 1.3.29 Nikto
o 1.3.30 OAT
o 1.3.31 Onesixtyone
o 1.3.32 OpenSSL-Scanner
o 1.3.33 Paros Proxy
o 1.3.34 Peach
o 1.3.35 RPCDump
o 1.3.36 RevHosts
o 1.3.37 SMB Bruteforcer
o 1.3.38 SMB Client
o 1.3.39 SMB Serverscan
o 1.3.40 SMB-NAT
o 1.3.41 SMBdumpusers
o 1.3.42 SMBgetserverinfo
o 1.3.43 SNMP Scanner
o 1.3.44 SNMP Walk
o 1.3.45 SQL Inject
o 1.3.46 SQL Scanner
o 1.3.47 SQLLibf
o 1.3.48 SQLbrute
o 1.3.49 Samrdump
o 1.3.50 Smb4K
o 1.3.51 Snmp Check
o 1.3.52 Snmp Enum
o 1.3.53 Spike
o 1.3.54 Stompy
o 1.3.55 SuperScan
o 1.3.56 TNScmd
o 1.3.57 Taof
o 1.3.58 VNC Auth Scanner
o 1.3.59 Wapiti
o 1.3.60 Yersinia
o 1.3.61 sqlanlz
o 1.3.62 sqldict
o 1.3.63 sqldumplogins
o 1.3.64 sqlquery
o 1.3.65 sqlupload
* 1.4 Penetration
o 1.4.1 Framework3-MsfC
o 1.4.2 Framework3-MsfUpdate
o 1.4.3 Framework3-Msfcli
o 1.4.4 Framework3-Msfweb
o 1.4.5 Init Pgsql (autopwn)
o 1.4.6 Milw0rm Archive
o 1.4.7 MsfCli
o 1.4.8 MsfConsole
o 1.4.9 MsfUpdate
o 1.4.10 Ninja (autopwn)
o 1.4.11 OpenSSL-To-Open
o 1.4.12 Update Milw0rm
* 1.5 Privilege Escalation
o 1.5.1 Ascend attacker
o 1.5.2 CDP Spoofer
o 1.5.3 Cisco Enable Bruteforcer
o 1.5.4 Crunch Dictgen
o 1.5.5 DHCPX Flooder
o 1.5.6 DNSspoof
o 1.5.7 Driftnet
o 1.5.8 Dsniff
o 1.5.9 Etherape
o 1.5.10 EtterCap
o 1.5.11 File2Cable
o 1.5.12 HSRP Spoofer
o 1.5.13 Hash Collision
o 1.5.14 Httpcapture
o 1.5.15 Hydra
o 1.5.16 Hydra GTK
o 1.5.17 ICMP Redirect
o 1.5.18 ICMPush
o 1.5.19 IGRP Spoofer
o 1.5.20 IRDP Responder
o 1.5.21 IRDP Spoofer
o 1.5.22 John
o 1.5.23 Lodowep
o 1.5.24 Mailsnarf
o 1.5.25 Medusa
o 1.5.26 Msgsnarf
o 1.5.27 Nemesis Spoofer
o 1.5.28 NetSed
o 1.5.29 Netenum
o 1.5.30 Netmask
o 1.5.31 Ntop
o 1.5.32 PHoss
o 1.5.33 PackETH
o 1.5.34 Rcrack
o 1.5.35 SIPdump
o 1.5.36 SMB Sniffer
o 1.5.37 Sing
o 1.5.38 TFTP-Brute
o 1.5.39 THC PPTP
o 1.5.40 TcPick
o 1.5.41 URLsnarf
o 1.5.42 VNCrack
o 1.5.43 WebCrack
o 1.5.44 Wireshark
o 1.5.45 Wireshark Wifi
o 1.5.46 WyD
o 1.5.47 XSpy
o 1.5.48 chntpw
* 1.6 Maintaining Access
o 1.6.1 3proxy
o 1.6.2 Backdoors
o 1.6.3 CryptCat
o 1.6.4 HttpTunnel Client
o 1.6.5 HttpTunnel Server
o 1.6.6 ICMPTX
o 1.6.7 Iodine
o 1.6.8 NSTX
o 1.6.9 Privoxy
o 1.6.10 ProxyTunnel
o 1.6.11 Rinetd
o 1.6.12 TinyProxy
o 1.6.13 sbd
o 1.6.14 socat
* 1.7 Covering Tracks
o 1.7.1 Housekeeping
* 1.8 Radio Network Analysis
o 1.8.1 802.11
+ 1.8.1.1 AFrag
+ 1.8.1.2 ASLeap
+ 1.8.1.3 Air Crack
+ 1.8.1.4 Air Decap
+ 1.8.1.5 Air Replay
+ 1.8.1.6 Airmon Script
+ 1.8.1.7 Airpwn
+ 1.8.1.8 AirSnarf
+ 1.8.1.9 Airbase
+ 1.8.1.10 Airodump
+ 1.8.1.11 Airoscript
+ 1.8.1.12 Airsnort
+ 1.8.1.13 CowPatty
+ 1.8.1.14 FakeAP
+ 1.8.1.15 GenKeys
+ 1.8.1.16 Genpmk
+ 1.8.1.17 Hotspotter
+ 1.8.1.18 Karma
+ 1.8.1.19 Kismet
+ 1.8.1.20 Load IPW3945
+ 1.8.1.21 Load acx100
+ 1.8.1.22 MDK2
+ 1.8.1.23 MDK2 for Broadcom
+ 1.8.1.24 MacChanger
+ 1.8.1.25 Unload Drivers
+ 1.8.1.26 Wep_crack
+ 1.8.1.27 Wep_decrypt
+ 1.8.1.28 WifiTap
+ 1.8.1.29 Wicrawl
+ 1.8.1.30 Wlassistant
o 1.8.2 Bluetooth
+ 1.8.2.1 Bluebugger
+ 1.8.2.2 Blueprint
+ 1.8.2.3 Bluesnarfer
+ 1.8.2.4 Btscanner
+ 1.8.2.5 Carwhisperer
+ 1.8.2.6 CuteCom
+ 1.8.2.7 Ghettotooth
+ 1.8.2.8 HCIDump
+ 1.8.2.9 Ussp-Push
* 1.9 VOIP & Telephony Analysis
o 1.9.1 PcapSipDump
o 1.9.2 SIPSak
o 1.9.3 SIPcrack
o 1.9.4 SIPdump
o 1.9.5 SIPp
o 1.9.6 Smap
* 1.10 Digital Forensics
o 1.10.1 Allin1
o 1.10.2 Autospy
o 1.10.3 DCFLDD
o 1.10.4 DD_Rescue
o 1.10.5 Foremost
o 1.10.6 Magicrescue
o 1.10.7 Mboxgrep
o 1.10.8 Memfetch
o 1.10.9 Memfetch Find
o 1.10.10 Pasco
o 1.10.11 Rootkithunter
o 1.10.12 Sleuthkit
o 1.10.13 Vinetto
* 1.11 Reverse Engineering
o 1.11.1 GDB Console GUI
o 1.11.2 GDB GNU Debugger
o 1.11.3 GDB Server
o 1.11.4 GNU DDD
o 1.11.5 Hexdump
o 1.11.6 Hexedit
o 1.11.7 OllyDBG
Complete tool list for BackTrack 2. This list is provided courtesy of the BackTrack wiki page.
* 1.1 Information Gathering
o 1.1.1 Ass
o 1.1.2 DMitry
o 1.1.3 DNS-Ptr
o 1.1.4 dnswalk
o 1.1.5 dns-bruteforce
o 1.1.6 dnsenum
o 1.1.7 dnsmap
o 1.1.8 DNSPredict
o 1.1.9 Finger Google
o 1.1.10 Firewalk
o 1.1.11 Goog Mail Enum
o 1.1.12 Google-search
o 1.1.13 Googrape
o 1.1.14 Gooscan
o 1.1.15 Host
o 1.1.16 Itrace
o 1.1.17 Netenum
o 1.1.18 Netmask
o 1.1.19 Pirana
o 1.1.20 Protos
o 1.1.21 QGoogle
o 1.1.22 Relay Scanner
o 1.1.23 SMTP-Vrfy
o 1.1.24 TCtrace
* 1.2 Network Mapping
o 1.2.1 Amap 5.2
o 1.2.2 Ass
o 1.2.3 Autoscan 0.99_R1
o 1.2.4 Fping
o 1.2.5 Hping
o 1.2.6 IKE-Scan
o 1.2.7 IKEProbe
o 1.2.8 Netdiscover
o 1.2.9 Nmap
o 1.2.10 NmapFE
o 1.2.11 P0f
o 1.2.12 PSK-Crack
o 1.2.13 Ping
o 1.2.14 Protos
o 1.2.15 Scanrand
o 1.2.16 SinFP
o 1.2.17 Umit
o 1.2.18 UnicornScan
o 1.2.19 UnicornScan pgsql 0.4.6e module version 1.03
o 1.2.20 XProbe2
o 1.2.21 PBNJ 2.04
+ 1.2.21.1 OutputPBNJ
+ 1.2.21.2 ScanPBNJ
+ 1.2.21.3 Genlist
* 1.3 Vulnerability Identification
o 1.3.1 Absinthe
o 1.3.2 Bed
o 1.3.3 CIRT Fuzzer
o 1.3.4 Cisco Auditing Tool
o 1.3.5 Cisco Enable Bruteforcer
o 1.3.6 Cisco Global Exploiter
o 1.3.7 Cisco Scanner
o 1.3.8 Cisco Torch
o 1.3.9 Curl
o 1.3.10 Fuzzer 1.2
o 1.3.11 GFI LanGuard 2.0
o 1.3.12 GetSids
o 1.3.13 HTTP PUT
o 1.3.14 Halberd
o 1.3.15 Httprint
o 1.3.16 Httprint GUI
o 1.3.17 ISR-Form
o 1.3.18 Jbrofuzz
o 1.3.19 List-Urls
o 1.3.20 Lynx
o 1.3.21 MS03-026
o 1.3.22 MS03-059
o 1.3.23 Merge Router Config
o 1.3.24 Metacoretex
o 1.3.25 Metoscan
o 1.3.26 Mezcal HTTP/S
o 1.3.27 Mibble MIB Browser
o 1.3.28 Mistress
o 1.3.29 Nikto
o 1.3.30 OAT
o 1.3.31 Onesixtyone
o 1.3.32 OpenSSL-Scanner
o 1.3.33 Paros Proxy
o 1.3.34 Peach
o 1.3.35 RPCDump
o 1.3.36 RevHosts
o 1.3.37 SMB Bruteforcer
o 1.3.38 SMB Client
o 1.3.39 SMB Serverscan
o 1.3.40 SMB-NAT
o 1.3.41 SMBdumpusers
o 1.3.42 SMBgetserverinfo
o 1.3.43 SNMP Scanner
o 1.3.44 SNMP Walk
o 1.3.45 SQL Inject
o 1.3.46 SQL Scanner
o 1.3.47 SQLLibf
o 1.3.48 SQLbrute
o 1.3.49 Samrdump
o 1.3.50 Smb4K
o 1.3.51 Snmp Check
o 1.3.52 Snmp Enum
o 1.3.53 Spike
o 1.3.54 Stompy
o 1.3.55 SuperScan
o 1.3.56 TNScmd
o 1.3.57 Taof
o 1.3.58 VNC Auth Scanner
o 1.3.59 Wapiti
o 1.3.60 Yersinia
o 1.3.61 sqlanlz
o 1.3.62 sqldict
o 1.3.63 sqldumplogins
o 1.3.64 sqlquery
o 1.3.65 sqlupload
* 1.4 Penetration
o 1.4.1 Framework3-MsfC
o 1.4.2 Framework3-MsfUpdate
o 1.4.3 Framework3-Msfcli
o 1.4.4 Framework3-Msfweb
o 1.4.5 Init Pgsql (autopwn)
o 1.4.6 Milw0rm Archive
o 1.4.7 MsfCli
o 1.4.8 MsfConsole
o 1.4.9 MsfUpdate
o 1.4.10 Ninja (autopwn)
o 1.4.11 OpenSSL-To-Open
o 1.4.12 Update Milw0rm
* 1.5 Privilege Escalation
o 1.5.1 Ascend attacker
o 1.5.2 CDP Spoofer
o 1.5.3 Cisco Enable Bruteforcer
o 1.5.4 Crunch Dictgen
o 1.5.5 DHCPX Flooder
o 1.5.6 DNSspoof
o 1.5.7 Driftnet
o 1.5.8 Dsniff
o 1.5.9 Etherape
o 1.5.10 EtterCap
o 1.5.11 File2Cable
o 1.5.12 HSRP Spoofer
o 1.5.13 Hash Collision
o 1.5.14 Httpcapture
o 1.5.15 Hydra
o 1.5.16 Hydra GTK
o 1.5.17 ICMP Redirect
o 1.5.18 ICMPush
o 1.5.19 IGRP Spoofer
o 1.5.20 IRDP Responder
o 1.5.21 IRDP Spoofer
o 1.5.22 John
o 1.5.23 Lodowep
o 1.5.24 Mailsnarf
o 1.5.25 Medusa
o 1.5.26 Msgsnarf
o 1.5.27 Nemesis Spoofer
o 1.5.28 NetSed
o 1.5.29 Netenum
o 1.5.30 Netmask
o 1.5.31 Ntop
o 1.5.32 PHoss
o 1.5.33 PackETH
o 1.5.34 Rcrack
o 1.5.35 SIPdump
o 1.5.36 SMB Sniffer
o 1.5.37 Sing
o 1.5.38 TFTP-Brute
o 1.5.39 THC PPTP
o 1.5.40 TcPick
o 1.5.41 URLsnarf
o 1.5.42 VNCrack
o 1.5.43 WebCrack
o 1.5.44 Wireshark
o 1.5.45 Wireshark Wifi
o 1.5.46 WyD
o 1.5.47 XSpy
o 1.5.48 chntpw
* 1.6 Maintaining Access
o 1.6.1 3proxy
o 1.6.2 Backdoors
o 1.6.3 CryptCat
o 1.6.4 HttpTunnel Client
o 1.6.5 HttpTunnel Server
o 1.6.6 ICMPTX
o 1.6.7 Iodine
o 1.6.8 NSTX
o 1.6.9 Privoxy
o 1.6.10 ProxyTunnel
o 1.6.11 Rinetd
o 1.6.12 TinyProxy
o 1.6.13 sbd
o 1.6.14 socat
* 1.7 Covering Tracks
o 1.7.1 Housekeeping
* 1.8 Radio Network Analysis
o 1.8.1 802.11
+ 1.8.1.1 AFrag
+ 1.8.1.2 ASLeap
+ 1.8.1.3 Air Crack
+ 1.8.1.4 Air Decap
+ 1.8.1.5 Air Replay
+ 1.8.1.6 Airmon Script
+ 1.8.1.7 Airpwn
+ 1.8.1.8 AirSnarf
+ 1.8.1.9 Airbase
+ 1.8.1.10 Airodump
+ 1.8.1.11 Airoscript
+ 1.8.1.12 Airsnort
+ 1.8.1.13 CowPatty
+ 1.8.1.14 FakeAP
+ 1.8.1.15 GenKeys
+ 1.8.1.16 Genpmk
+ 1.8.1.17 Hotspotter
+ 1.8.1.18 Karma
+ 1.8.1.19 Kismet
+ 1.8.1.20 Load IPW3945
+ 1.8.1.21 Load acx100
+ 1.8.1.22 MDK2
+ 1.8.1.23 MDK2 for Broadcom
+ 1.8.1.24 MacChanger
+ 1.8.1.25 Unload Drivers
+ 1.8.1.26 Wep_crack
+ 1.8.1.27 Wep_decrypt
+ 1.8.1.28 WifiTap
+ 1.8.1.29 Wicrawl
+ 1.8.1.30 Wlassistant
o 1.8.2 Bluetooth
+ 1.8.2.1 Bluebugger
+ 1.8.2.2 Blueprint
+ 1.8.2.3 Bluesnarfer
+ 1.8.2.4 Btscanner
+ 1.8.2.5 Carwhisperer
+ 1.8.2.6 CuteCom
+ 1.8.2.7 Ghettotooth
+ 1.8.2.8 HCIDump
+ 1.8.2.9 Ussp-Push
* 1.9 VOIP & Telephony Analysis
o 1.9.1 PcapSipDump
o 1.9.2 SIPSak
o 1.9.3 SIPcrack
o 1.9.4 SIPdump
o 1.9.5 SIPp
o 1.9.6 Smap
* 1.10 Digital Forensics
o 1.10.1 Allin1
o 1.10.2 Autospy
o 1.10.3 DCFLDD
o 1.10.4 DD_Rescue
o 1.10.5 Foremost
o 1.10.6 Magicrescue
o 1.10.7 Mboxgrep
o 1.10.8 Memfetch
o 1.10.9 Memfetch Find
o 1.10.10 Pasco
o 1.10.11 Rootkithunter
o 1.10.12 Sleuthkit
o 1.10.13 Vinetto
* 1.11 Reverse Engineering
o 1.11.1 GDB Console GUI
o 1.11.2 GDB GNU Debugger
o 1.11.3 GDB Server
o 1.11.4 GNU DDD
o 1.11.5 Hexdump
o 1.11.6 Hexedit
o 1.11.7 OllyDBG
Information technology in India
In India there has been the profound influence of the mushrooming software/ICT professionals (commonly known as knowledge workers) who at present constitute the majority of the upper-middle class, working population. These professionals are pushing the boundaries of change within the social fabric, and demanding higher participation in the governance enabled through ICTs.
In 1999, Government of India decided to set up a National Institute of Smart Government as a tripartite venture between government, business and community. Although India’s teledensity is 2 fixed lines per 100 persons, and is very low on PC ownership due to purchasing power, the ministry of Information technology envisions Internet based information facilitation for the common public by various government agencies by establishing 100 million Internet connections and one million Information kiosks (ie 1-2 connections per village) by 2008 with private sector and unorganized sector participation; promotion of Indian language content over the Internet; re-engineering of government processes leading to Governance and launching of mass campaign on IT awareness. Together with Nasscom, the government of India is committed to push eGovernance with high priority.
Most National and State Administrations have websites that are comprehensive and multi-lingual. They are informative, but not very interactive at this stage. Center for Development of Advanced Computing through GIST technology with directives from the government initiated and commissioned the project of developing Indian language tools with natural language processing in evolving script and font standards to run a common eGovernance thread through the 95% population speaking 18 officially recognized, disparate languages.
Linux tutorial
Thus, if the fruits of information technology revolution have to spread to all these participating members, in Government and public, it is best done through the use of computers in their own languages. Out of a billion population, there are only 11% people in India who know or speak English, with the rest speaking in at least 18 different officially recognized languages. This poses both a challenge and an opportunity. Significant parameters of this initiative were:
* Improve government's own functioning
*
Provide better service to citizens in a transparent manner
*
Potential Priorities for e- Governance Pilot Projects
*
Strengthening the pressure points
*
Local "external drivers" are to be used on a priority basis. This would mean targeting three sectors – (a) independent media (b) local NGOs and (c) public libraries, community centers, post offices and other access points which provide information to citizens.
*
Priority should be given to building data and management information systems, and there after moving on to institutional links and finally to intermediate citizen related projects.
*
Projects that will be used as demonstration sites should get priority as they build knowledge.
*
Supportive cross cutting development priorities
Over the last two to three years e-governance has caught up with the state governments around the country. Today most of the state governments have a degree of departmental computerization, many have basic information websites, and even IT secretaries and state IT policies. The state governments are competing with one another to bring in transformation in governance through the IT.(7) Political parties see this as a vehicle to have access to wider range of information relating to development, citizen services, etc. which was otherwise being camouflaged by the government bureaucracy.
Almost all the states have an IT policy, which not only intend to facilitate investments in IT but also include governance related issues. The southern states of Andhra Pradesh, Karnataka, Tamil Nadu have taken the lead in terms of implementing these projects at different citizen government interface departments. Other states like Rajasthan, Gujarat, Maharashtra and West Bengal have been catching up fast. (18)
Andhra Pradesh has covered a long distance towards egovernance. Twenty-three districts of the state, 1125 mandals, 295 assembly constituencies and 28245 revenue villages are being connected through a state wide area network called APSWAN.(2) With the establishment of such a network, the state administration is geared up to tackle several issues and help extend the reach of people and government alike. Over 70 markets across the state are computerized and networked to the Agricultural Market Yard department at the state government headquarters. This provides total on-line connectivity to monitor arrivals of the commodities and the prevailing prices. This enables the farmer to get a better deal for their produce. The information available in the network enables the government to monitor the functioning of the markets and also in formulating appropriate strategic plans for the state. Karnataka government has also taken similar project.
Specific action agenda chalked down points to the direction in which e-governance is heading in the country. True appreciation of egovernance comes when its impact is reflected in accountability and transparency in activities at the grassroots level with regard to finances, providing minimum wages, and determining greater
In 1999, Government of India decided to set up a National Institute of Smart Government as a tripartite venture between government, business and community. Although India’s teledensity is 2 fixed lines per 100 persons, and is very low on PC ownership due to purchasing power, the ministry of Information technology envisions Internet based information facilitation for the common public by various government agencies by establishing 100 million Internet connections and one million Information kiosks (ie 1-2 connections per village) by 2008 with private sector and unorganized sector participation; promotion of Indian language content over the Internet; re-engineering of government processes leading to Governance and launching of mass campaign on IT awareness. Together with Nasscom, the government of India is committed to push eGovernance with high priority.
Most National and State Administrations have websites that are comprehensive and multi-lingual. They are informative, but not very interactive at this stage. Center for Development of Advanced Computing through GIST technology with directives from the government initiated and commissioned the project of developing Indian language tools with natural language processing in evolving script and font standards to run a common eGovernance thread through the 95% population speaking 18 officially recognized, disparate languages.
Linux tutorial
Thus, if the fruits of information technology revolution have to spread to all these participating members, in Government and public, it is best done through the use of computers in their own languages. Out of a billion population, there are only 11% people in India who know or speak English, with the rest speaking in at least 18 different officially recognized languages. This poses both a challenge and an opportunity. Significant parameters of this initiative were:
* Improve government's own functioning
*
Provide better service to citizens in a transparent manner
*
Potential Priorities for e- Governance Pilot Projects
*
Strengthening the pressure points
*
Local "external drivers" are to be used on a priority basis. This would mean targeting three sectors – (a) independent media (b) local NGOs and (c) public libraries, community centers, post offices and other access points which provide information to citizens.
*
Priority should be given to building data and management information systems, and there after moving on to institutional links and finally to intermediate citizen related projects.
*
Projects that will be used as demonstration sites should get priority as they build knowledge.
*
Supportive cross cutting development priorities
Over the last two to three years e-governance has caught up with the state governments around the country. Today most of the state governments have a degree of departmental computerization, many have basic information websites, and even IT secretaries and state IT policies. The state governments are competing with one another to bring in transformation in governance through the IT.(7) Political parties see this as a vehicle to have access to wider range of information relating to development, citizen services, etc. which was otherwise being camouflaged by the government bureaucracy.
Almost all the states have an IT policy, which not only intend to facilitate investments in IT but also include governance related issues. The southern states of Andhra Pradesh, Karnataka, Tamil Nadu have taken the lead in terms of implementing these projects at different citizen government interface departments. Other states like Rajasthan, Gujarat, Maharashtra and West Bengal have been catching up fast. (18)
Andhra Pradesh has covered a long distance towards egovernance. Twenty-three districts of the state, 1125 mandals, 295 assembly constituencies and 28245 revenue villages are being connected through a state wide area network called APSWAN.(2) With the establishment of such a network, the state administration is geared up to tackle several issues and help extend the reach of people and government alike. Over 70 markets across the state are computerized and networked to the Agricultural Market Yard department at the state government headquarters. This provides total on-line connectivity to monitor arrivals of the commodities and the prevailing prices. This enables the farmer to get a better deal for their produce. The information available in the network enables the government to monitor the functioning of the markets and also in formulating appropriate strategic plans for the state. Karnataka government has also taken similar project.
Specific action agenda chalked down points to the direction in which e-governance is heading in the country. True appreciation of egovernance comes when its impact is reflected in accountability and transparency in activities at the grassroots level with regard to finances, providing minimum wages, and determining greater
opensource concepts
Most software that you buy or download only comes in the compiled ready-to-run version. Compiled means that the actual program code that the developer created, known as the source code, has run through a special program called a compiler that translates the source code into a form that the computer can understand (see How C Programming Works for details on compilers). It is extremely difficult to modify the compiled version of most applications and nearly impossible to see exactly how the developer created different parts of the program. Most commercial software manufacturers see this as an advantage that keeps other companies from copying their code and using it in a competing product. It also gives them control over the quality and features found in a particular product.
Open source software is at the opposite end of the spectrum. The source code is included with the compiled version and modification or customization is actually encouraged. The software developers who support the open source concept believe that by allowing anyone who's interested to modify the source code, the application will be more useful and error-free over the long term.
To be considered as open source software by the software development industry, certain criteria must be met:
* The program must be freely distributed (It can be part of a package that is sold though, such as Red Hat has done with Linux in the example below).
* Source code must be included.
* Anyone must be allowed to modify the source code.
* Modified versions can be redistributed.
* The license must not require the exclusion of other software or interfere with the operation of other software.
Let's take a look at a real world example of open source software. In 1991, Linus Torvalds, a student at the University of Helsinki in Finland, developed a new operating system based on Minix, a derivative of Unix, which he dubbed Linux. Torvalds released version 0.02 of Linux under the GNU General Public License, which provides a good legal definition of open source software. A lot of people around the world downloaded Linux and began working with it. Many of these users were programmers in their own right and made modifications to the source code that Torvalds had included. Over the next three years, Torvalds received these modified versions from the other programmers and incorporated many of the changes into the baseline version and released Linux version 1.0 in 1994.
A common concern for end-users who wish to use open source software is the lack of a warranty and technical support. Because the software's license encourages modification and customization, it is nearly impossible to support. This is why Red Hat Software, founded in 1994, created the "Official Red Hat Linux" and is able to sell this normally "free" software. The main value that Red Hat adds to the package is a warranty and technical support. For most businesses, the assurance of technical support has been a key factor in the decision to buy Linux instead of simply downloading it for free. In addition to Red Hat, there are several other companies that have packaged Linux, usually with additional software, for resale.
Besides Linux, Mozilla (Netscape browser core), Apache (Web server), PERL (Web scripting language) and PNG (graphics file format) are all examples of very popular software that is based on open source
learn unix
hars disk
A hard disk is part of a unit, often called a "disk drive," "hard drive," or "hard disk drive," that stores and provides relatively quick access to large amounts of data on an electromagnetically charged surface or set of surfaces. Today's computers typically come with a hard disk that contains several billion bytes (gigabytes) of storage.
A hard disk is really a set of stacked "disks," each of which, like phonograph records, has data recorded electromagnetically in concentric circles or "tracks" on the disk. A "head" (something like a phonograph arm but in a relatively fixed position) records (writes) or reads the information on the tracks. Two heads, one on each side of a disk, read or write the data as the disk spins. Each read or write operation requires that data be located, which is an operation called a "seek." (Data already in a disk cache, however, will be located more quickly.)
A hard disk/drive unit comes with a set rotation speed varying from 4500 to 7200 rpm. Disk access time is measured in milliseconds. Although the physical location can be identified with cylinder, track, and sector locations, these are actually mapped to a logical block address (LBA) that works with the larger address range on today's hard disks.
computer science review
computer language concepts
Web server application
Taking a big step back, a Web server serves pages for viewing in a Web browser, while an application server provides methods that client applications can call. A little more precisely, you can say that:
A Web server exclusively handles HTTP requests, whereas an application server serves business logic to application programs through any number of protocols.
Let's examine each in more detail.
The Web server
A Web server handles the HTTP protocol. When the Web server receives an HTTP request, it responds with an HTTP response, such as sending back an HTML page. To process a request, a Web server may respond with a static HTML page or image, send a redirect, or delegate the dynamic response generation to some other program such as CGI scripts, JSPs (JavaServer Pages), servlets, ASPs (Active Server Pages), server-side JavaScripts, or some other server-side technology. Whatever their purpose, such server-side programs generate a response, most often in HTML, for viewing in a Web browser.
Understand that a Web server's delegation model is fairly simple. When a request comes into the Web server, the Web server simply passes the request to the program best able to handle it. The Web server doesn't provide any functionality beyond simply providing an environment in which the server-side program can execute and pass back the generated responses. The server-side program usually provides for itself such functions as transaction processing, database connectivity, and messaging.
While a Web server may not itself support transactions or database connection pooling, it may employ various strategies for fault tolerance and scalability such as load balancing, caching, and clustering—features oftentimes erroneously assigned as features reserved only for application servers.
The application server
As for the application server, according to our definition, an application server exposes business logic to client applications through various protocols, possibly including HTTP. While a Web server mainly deals with sending HTML for display in a Web browser, an application server provides access to business logic for use by client application programs. The application program can use this logic just as it would call a method on an object (or a function in the procedural world).
Such application server clients can include GUIs (graphical user interface) running on a PC, a Web server, or even other application servers. The information traveling back and forth between an application server and its client is not restricted to simple display markup. Instead, the information is program logic. Since the logic takes the form of data and method calls and not static HTML, the client can employ the exposed business logic however it wants.
In most cases, the server exposes this business logic through a component API, such as the EJB (Enterprise JavaBean) component model found on J2EE (Java 2 Platform, Enterprise Edition) application servers. Moreover, the application server manages its own resources. Such gate-keeping duties include security, transaction processing, resource pooling, and messaging. Like a Web server, an application server may also employ various scalability and fault-tolerance techniques.
computer science concepts
A Web server exclusively handles HTTP requests, whereas an application server serves business logic to application programs through any number of protocols.
Let's examine each in more detail.
The Web server
A Web server handles the HTTP protocol. When the Web server receives an HTTP request, it responds with an HTTP response, such as sending back an HTML page. To process a request, a Web server may respond with a static HTML page or image, send a redirect, or delegate the dynamic response generation to some other program such as CGI scripts, JSPs (JavaServer Pages), servlets, ASPs (Active Server Pages), server-side JavaScripts, or some other server-side technology. Whatever their purpose, such server-side programs generate a response, most often in HTML, for viewing in a Web browser.
Understand that a Web server's delegation model is fairly simple. When a request comes into the Web server, the Web server simply passes the request to the program best able to handle it. The Web server doesn't provide any functionality beyond simply providing an environment in which the server-side program can execute and pass back the generated responses. The server-side program usually provides for itself such functions as transaction processing, database connectivity, and messaging.
While a Web server may not itself support transactions or database connection pooling, it may employ various strategies for fault tolerance and scalability such as load balancing, caching, and clustering—features oftentimes erroneously assigned as features reserved only for application servers.
The application server
As for the application server, according to our definition, an application server exposes business logic to client applications through various protocols, possibly including HTTP. While a Web server mainly deals with sending HTML for display in a Web browser, an application server provides access to business logic for use by client application programs. The application program can use this logic just as it would call a method on an object (or a function in the procedural world).
Such application server clients can include GUIs (graphical user interface) running on a PC, a Web server, or even other application servers. The information traveling back and forth between an application server and its client is not restricted to simple display markup. Instead, the information is program logic. Since the logic takes the form of data and method calls and not static HTML, the client can employ the exposed business logic however it wants.
In most cases, the server exposes this business logic through a component API, such as the EJB (Enterprise JavaBean) component model found on J2EE (Java 2 Platform, Enterprise Edition) application servers. Moreover, the application server manages its own resources. Such gate-keeping duties include security, transaction processing, resource pooling, and messaging. Like a Web server, an application server may also employ various scalability and fault-tolerance techniques.
computer science concepts
computer language concepts
Computer science concepts
linux tutorial
Unix tutorial
CS 1101. Introduction to Program Design.
Cat. I
This course introduces principles of computation and programming with an emphasis on program design. Topics include design and implementation of programs that use a variety of data structures (such as records, lists, and trees), functions, conditionals, and recursion. Students will be expected to design, implement, and debug programs in a functional programming language.
Intended audience: students desiring an introduction to programming and program design.
Recommended background: none. Either CS 1101 or CS 1102 provide sufficient background for further courses in the CS department. Undergraduate credit may not be earned for both this course and CS 1102.
Undergraduate credit may not be earned both for this course and for CS 2135.
CS 1102. Accelerated Introduction to Program Design.
Cat. I
This course provides an accelerated introduction to design and implementation of functional programs. The course presents the material from CS 1101 at a fast pace (so students can migrate their programming experience to functional languages), then covers several advanced topics in functional programming (potential topics include macros, lazy programming with streams, and programming with higher-order functions). Students will be expected to design, implement, and debug programs in a functional programming language.
Intended audience: students starting with substantial previous programming background.
Recommended background: prior programming background covering lists, trees, functions, and recursion.
Undergraduate credit may not be earned for both this course and CS 1101. Undergraduate credit may not be earned both for this course and for CS 2135.
CS 2011. Introduction to Machine Organization and Assembly Language.
Cat. I
This course introduces students to the structure and behavior of digital computers at several levels of abstraction. Using a bottom-up approach, the course starts by examining logic gates and digital circuits. The student is then introduced to virtual machines at successively higher levels of abstraction, beginning with the Von Neumann model of execution, and progressing through machine language, assembly language, and high-level languages. Topics include the functional organization of computer hardware, the functions of assemblers, linkers, and loaders, representations of numbers in computers, basic assembly language instruction sets, addressing modes, stacks and procedures, low-level I/O, concepts and examples of microprogramming, and logic circuits.
Students will be expected to design, implement, and debug programs in an assembly language.
Intended audience: computer science students, and those desiring a deeper understanding of the low-level functionality of a computer.
Recommended background: CS 2303 or CS 2301.
CS 2022/MA 2201. Discrete Mathematics.
Cat. I
This course serves as an introduction to some of the more important concepts, techniques, and structures of discrete mathematics, providing a bridge between computer science and mathematics.
Topics include functions and relations, sets, countability, groups, graphs, propositional and predicate calculus, and permutations and combinations.
Students will be expected to develop simple proofs for problems drawn primarily from computer science and applied mathematics.
Intended audience: computer science and mathematical sciences majors.
Undergraduate credit may not be earned both for this course and for CS 501.
Recommended background: none.
CS 2102. Object-Oriented Design Concepts.
Cat. I
This course introduces students to an object-oriented model of programming. Building from the design methodology covered in CS 1101/CS 1102, this course shows how programs can be decomposed into classes and objects. By emphasizing design, this course shows how to implement small defect-free programs and evaluate design decisions to select an optimal design under specific assumptions. Topics include inheritance, exceptions, interface, design by contract, basic design patterns, and reuse. Students will be expected to design, implement, and debug object-oriented programs composed of multiple classes and over a variety of data structures.
Intended audience: students with prior program design experience who desire to learn object-oriented design.
Recommended background: CS 1101 or CS 1102.
Undergraduate credit may not be earned both for this course and for CS 2136.
CS 2118. Object-Oriented Design Concepts for Business Applications.
Cat. I
This course introduces students to an object-oriented model of programming, with an emphasis on the programming approaches useful in creating business applications. Building from the design methodology covered in CS 1101/ CS 1102, this course shows how programs can be decomposed into classes and objects.
Students will be expected to design, implement, and debug object-oriented programs in Visual Basic.
Topics include inheritance, building user interfaces, and database access. Intended audience: non-CS majors with an interest in building business applications who have prior program design experience.
Recommended background: CS 1101 or CS 1102.
Students may receive credit for only one of the following: MG 2720, MIS 2720, or CS 2118.
CS 2223. Algorithms.
Cat. I
Building on a fundamental knowledge of data structures, data abstraction techniques, and mathematical tools, a number of examples of algorithm design and analysis, worst case and average case, will be developed.
Topics include greedy algorithms, divide-and-conquer, dynamic programming, heuristics, and probabilistic algorithms. Problems will be drawn from areas such as sorting, graph theory, and string processing. The influence of the computational model on algorithm design will be discussed.
Students will be expected to perform analysis on a variety of algorithms.
Intended audience: computer science and computer engineering students, and those desiring a deeper understanding of algorithm design and analysis.
Undergraduate credit may not be earned both for this course and for CS 507.
Recommended background: CS 2102 and CS 2022.
CS 2301. Systems Programming for Non-Majors.
Cat. I
This course helps students with prior program design experience migrate their skills to a model of programming where the programming language exposes details of how the hardware stores and executes software. Building from the design concepts covered in CS 1101/CS 1102, this course covers manual memory management, pointers, the machine stack, and input/output mechanisms. Students will be expected to design, implement, and debug programs in C.
Intended audience: non-computer science majors who wish to take upper-level courses in the systems area of the computer science curriculum.
Recommended background: CS 1101 or CS 1102. CS majors and other students wishing to prepare for upper-level CS courses in both systems and software engineering should take CS 2303 instead of CS 2301. Students who have credit for CS 2303 may not receive subsequent credit for CS 2301.
Undergraduate credit may not be earned both for this course and for CS 2005.
linux tutorial
Unix tutorial
CS 1101. Introduction to Program Design.
Cat. I
This course introduces principles of computation and programming with an emphasis on program design. Topics include design and implementation of programs that use a variety of data structures (such as records, lists, and trees), functions, conditionals, and recursion. Students will be expected to design, implement, and debug programs in a functional programming language.
Intended audience: students desiring an introduction to programming and program design.
Recommended background: none. Either CS 1101 or CS 1102 provide sufficient background for further courses in the CS department. Undergraduate credit may not be earned for both this course and CS 1102.
Undergraduate credit may not be earned both for this course and for CS 2135.
CS 1102. Accelerated Introduction to Program Design.
Cat. I
This course provides an accelerated introduction to design and implementation of functional programs. The course presents the material from CS 1101 at a fast pace (so students can migrate their programming experience to functional languages), then covers several advanced topics in functional programming (potential topics include macros, lazy programming with streams, and programming with higher-order functions). Students will be expected to design, implement, and debug programs in a functional programming language.
Intended audience: students starting with substantial previous programming background.
Recommended background: prior programming background covering lists, trees, functions, and recursion.
Undergraduate credit may not be earned for both this course and CS 1101. Undergraduate credit may not be earned both for this course and for CS 2135.
CS 2011. Introduction to Machine Organization and Assembly Language.
Cat. I
This course introduces students to the structure and behavior of digital computers at several levels of abstraction. Using a bottom-up approach, the course starts by examining logic gates and digital circuits. The student is then introduced to virtual machines at successively higher levels of abstraction, beginning with the Von Neumann model of execution, and progressing through machine language, assembly language, and high-level languages. Topics include the functional organization of computer hardware, the functions of assemblers, linkers, and loaders, representations of numbers in computers, basic assembly language instruction sets, addressing modes, stacks and procedures, low-level I/O, concepts and examples of microprogramming, and logic circuits.
Students will be expected to design, implement, and debug programs in an assembly language.
Intended audience: computer science students, and those desiring a deeper understanding of the low-level functionality of a computer.
Recommended background: CS 2303 or CS 2301.
CS 2022/MA 2201. Discrete Mathematics.
Cat. I
This course serves as an introduction to some of the more important concepts, techniques, and structures of discrete mathematics, providing a bridge between computer science and mathematics.
Topics include functions and relations, sets, countability, groups, graphs, propositional and predicate calculus, and permutations and combinations.
Students will be expected to develop simple proofs for problems drawn primarily from computer science and applied mathematics.
Intended audience: computer science and mathematical sciences majors.
Undergraduate credit may not be earned both for this course and for CS 501.
Recommended background: none.
CS 2102. Object-Oriented Design Concepts.
Cat. I
This course introduces students to an object-oriented model of programming. Building from the design methodology covered in CS 1101/CS 1102, this course shows how programs can be decomposed into classes and objects. By emphasizing design, this course shows how to implement small defect-free programs and evaluate design decisions to select an optimal design under specific assumptions. Topics include inheritance, exceptions, interface, design by contract, basic design patterns, and reuse. Students will be expected to design, implement, and debug object-oriented programs composed of multiple classes and over a variety of data structures.
Intended audience: students with prior program design experience who desire to learn object-oriented design.
Recommended background: CS 1101 or CS 1102.
Undergraduate credit may not be earned both for this course and for CS 2136.
CS 2118. Object-Oriented Design Concepts for Business Applications.
Cat. I
This course introduces students to an object-oriented model of programming, with an emphasis on the programming approaches useful in creating business applications. Building from the design methodology covered in CS 1101/ CS 1102, this course shows how programs can be decomposed into classes and objects.
Students will be expected to design, implement, and debug object-oriented programs in Visual Basic.
Topics include inheritance, building user interfaces, and database access. Intended audience: non-CS majors with an interest in building business applications who have prior program design experience.
Recommended background: CS 1101 or CS 1102.
Students may receive credit for only one of the following: MG 2720, MIS 2720, or CS 2118.
CS 2223. Algorithms.
Cat. I
Building on a fundamental knowledge of data structures, data abstraction techniques, and mathematical tools, a number of examples of algorithm design and analysis, worst case and average case, will be developed.
Topics include greedy algorithms, divide-and-conquer, dynamic programming, heuristics, and probabilistic algorithms. Problems will be drawn from areas such as sorting, graph theory, and string processing. The influence of the computational model on algorithm design will be discussed.
Students will be expected to perform analysis on a variety of algorithms.
Intended audience: computer science and computer engineering students, and those desiring a deeper understanding of algorithm design and analysis.
Undergraduate credit may not be earned both for this course and for CS 507.
Recommended background: CS 2102 and CS 2022.
CS 2301. Systems Programming for Non-Majors.
Cat. I
This course helps students with prior program design experience migrate their skills to a model of programming where the programming language exposes details of how the hardware stores and executes software. Building from the design concepts covered in CS 1101/CS 1102, this course covers manual memory management, pointers, the machine stack, and input/output mechanisms. Students will be expected to design, implement, and debug programs in C.
Intended audience: non-computer science majors who wish to take upper-level courses in the systems area of the computer science curriculum.
Recommended background: CS 1101 or CS 1102. CS majors and other students wishing to prepare for upper-level CS courses in both systems and software engineering should take CS 2303 instead of CS 2301. Students who have credit for CS 2303 may not receive subsequent credit for CS 2301.
Undergraduate credit may not be earned both for this course and for CS 2005.
Subscribe to:
Posts (Atom)