Instruction Plan for CSE240 Lab on Data Structure and N/Ws Term: 4

th

Course No: CSE240 Course Title: Lab on Data Structures and Networks L: 0 T: 0 P: 4 Textbook: 1. Data Structures Seymour Lipschutz :India Adapted Edition 2006 2. Data communication and networks- Forouzan-4TH Edition Reference Books: 3.Data Structures & Algorithms Using C- R.S Salaria-2nd Edition 4.Data Structures,Algorithms and applications in C++ --Sartaj Sahni2nd Edition 5.PC Hardware in a Nutshell-Robert Bruce Thomsan and Barbara Fritchman ThomsanJuly2003 :Second Edition Other readings: Sr.No. Journal articles as compulsory readings (Complete reference) 6. Cisco system advanced exam guide-CISCO press 7. Cisco system CCNA Exam dump guide CISCO press Relevant websites: S.No. Web address 8. http://www.java2s.com/Tutorial/C/0260__Data-Structure 9. 10. 11. 12. http://www.java2s.com/Code/C/Data-Structure-Algorithm/CatalogData-StructureAlgorithm.htm http://www.petri.co.il/ how_to_install_active_ directory_on_windows_2003.htm http://www.petri.co.il/csc_basics_of_cisco_switch_administration_01.htm http://www.petri.co.il/csc_basics_of_cisco_switch_administration_02.htm Salient Features A web page on Data Structure in C A web page on Searching/Sorting Techniques in C Web page based on Active Directory Web Page based on Switch Administration Web Page based on Switch Administration

List of experiments (Should plan for 12 weeks of teaching: 6 before MTE and 6 after MTE) Expt. No. 1 2 3 4 Title Program to implement the concept of recursion. Program that show the effect of recursion on space and run time requirements. Basic Networking: Punching and Crimping tools, Connecting two Pcs. Peer to peer Connection and Client Server Networking. Arrays:Programs related to arrays.Traversal of arrays,implement Linear Search and Binary Search Objective Students would able to know about the use of recursion and its effect on time and space requirements. Students would able to understand the basic concept of networking, tools used to punch and crimp the wires then how we connect two pcs and other things etc. Students would able to implement the arrays and dynamic memory allocation using Pointers Equipment used Turbo C or any C/C++ Compiler Turbo C++ or any other C/C++ Compiler Networking cables #1, Connectors #2 Punching and crimping tools and PCs

Turbo C or any C/C++ Compiler

Dynamic memory allocation using Pointers:Introduction to pointers,Basic Arithmatic operations on Pointer,Usage of Pointers Use of functions calloc(),malloc(),realloc(),free() using pointers Internetwork Architecture: Cables, Sockets ,Ethernet and layer system Students would able to understand the use of layer system which devices are used at which layer and other etc. Students would able to understand the use of IP addresses and how Create Subnet and assign gateway addresses.

Turbo C or any C/C++ Compiler

Networking cables #1, Connectors #2 Punching and crimping tools and PCs Client/Server Connection

10

Planning a IP addressing Key management: Basics of IP Addressing,Classes,Classless and Classful IP Addressing. IP addressing, setting IP addresses, Planning and how to implement these addresses. Creating Subnet, Setting gateway addresses. Link Lists: Program to create a link list, traverse a link list. Program to insert a node in a link list. Program to Delete a node from a link list. Program to search a from a link list. Installing/configuring aServer: Planning a server implementation Install operating system 2003 server enterprise edition. Configure PDA, BDA and exchange server. Stacks: program to create stacks. Program to perform push and pop operation on stacks. Program to traverse the stack elements and search a element from a stack. Planning the active directory and configuring Accounts: Planning the active directory and security, , Sharing resources like printers on network Configuring for clients account, How to create and access the accounts Services providing in account option Queues: program to create a queue.

11 12 13 14 15 16 17 18 19 20 21 22

Students would able to implement the link list, insert in a link list, delete from a link list and search a node from a link list.

Turbo C or any C/C++ Compiler

Students would able to plan a server implementation i.e would able to understand the installation of OS 2000 server enterprise edition and to configure the exchange server.. Students would able to implement stacks, perform push and pop operation and search a element from a stack.

OS#6

Turbo C or any C/C++ Compiler

23 24 25

Students would able to Create their own accounts, what rights to be given to the accounts and how they would be able to share printers and other resources.

Students would able to implement queues and

Turbo C or any C/C++ Compiler

26 27 28

Program to implement the insert,Delete operation in Queue Program to search a particular element from queue. Client server programming: Simulation using network sockets. Installing Firewalls and settings: (Software Firewalls): Design issue password authentication, Access control, Trusted system2 Trees and Graphs: program to create a tree and a graph. Program to insert a node in tree, delete a node from a tree. Program to search a particular element from a tree. Program to traverse the elements in tree. Managing Hub/Switch: Configure the switch; Manage the hub slots (connective). Server monitoring in LINUX operating System. Managing Two Router: Configuring to two router, Working condition for two networks (in over campus), Router series (2610, 2615, 3210 etc ) Sorting Algorithms: Program to implement Bubble Sort, Quick Sort. Program to implement Selection and insertion sort. Program to implement Merge sort and Radix sort. Call Center Network: Management based call center (like wipro/nexus/compat ) using the different types of server and router series. Problem solving and Troubleshooting of computer network Troubleshooting Cables, Sockets, Devices (router, hub, switch), Port services Wireless concept: standards, Wi fi Installation IEEE

29 30 31 32 33 34 35 36 37

would able to understand the run-time and space requirements of this technique Students would able to undertand the use of socket programming. . Students would able to install fire walls and access control Students would be able to implement tree and graphs, and they would able to apply the various operation applied on tree and graph.

Simulators

H/W,S/W Firewalls implemented in LPU Turbo C or any C/C++ Compiler

Students would able to understand the use of switch and hub and how to configure these devices. Students would able to configure the routers and would able to make the router in working condition. Students would able to configure the routers and would able to make the router in working condition. Students would able to understand the various sorting techniques.

Switch #3 Hub #4, OS #6, Switch #3 Hub #4, OS #6,

39

40 41 42 43

Students would able to set a network of their own.

Networking between PC,VoIP

44

Students would able to understand the various problems faced with the devices and network media

45

46

47

Internetworking: (Zones Queries):

Students would able to understand the various IEEE Standards and would able to understand the WiFi installation. Students would able to

Creating Straight,cross over Cables/Troubleshooting Problems based on IP related problems(eg use of release,renew,flushdns like commands) Wireless network based various standars/WI-Fi Network established in LPU Joining systems on

48

Internetworking concepts, Uses of domain names concept, Uses of domain name services, Bugs-Debugging, Setting of Internetworking

understand the use of domain name service and would able to remove the bugs and other etc.

Domains/Use of DNS/DHCP etc

#1 Following cables are required for demonstrations: Twisted Pair Cable (UTP-5 and UTP-6), Coaxial Cable, Fibre-optic Cable with gel. #2- Following connectors are required for demonstration: RJ45 and RJ11, BNC, ST and SE Connectors #3- Switch with 32 and 64 port #4- Hub 8, 16, 32, 64 (Any as per requirement) port #5- Router series (2610, 2615, 3210) #6- OS required for installing and configuring server: OS 2000 server enterprise edition, LINUX OS. Note :- CPU & Computer accessories components. required for demo of assembling PC parts. SATA

Plan of experiments: 1) No Grouping will be done for conduct of labs except in the practical of sr. No. 40 and 41. For rest all the required equipment will be made available in four labs : 4-304X, 4-304Y, 4-306X and 4-306Y. 2) For topics mentioned in Sr. No. 40 & 41, the hardware available centrally in Polytechnic will be demonstrated Sr. No 1 2 Attendance Component Frequency in term Marks

Total

Calculated at the 10 end of the term Lab Assessments Once in a week 90 For Lab Assessment, Student will be evaluated every week & marks will be allocated as per the following proportion: 1) Execution / Job Work ---- 50% 2) Written Work ---- 20% 3) Viva Voce ---- 30% Evaluations done every week will be combined to get the total lab assessment. 100

Proposed Changes from the standard pedagogy for the course:

_______________________ Prepared by (Instructional Planner: Name, signature & date)

Comments of HoD(Chief Academic Officer) Signature & Date

Comments of Dean of Faculty Signature & Date