PG - COMPUTER SCIENCE & ENGG.

PRACTICAL SYLLABUS

1. Implement using linked list: "Insert", "Delete" and "Search" Procedures.

2. Priority queue using heap: Implement "extract_min" and "decrease_key" in O(log n).
3. Graph Search: Graph must be represented as adjacency list. Implement DFS and find the
bi-connected components of the (un- directed)graph in O(n+e) time.
4. Dijkstra's Algorithm: Use binary heap to yield an O((n+e)log n) implementation with adj
acency listrepresentation of the Graph.
5. Kruskal's algorithm: Use "Union_Find" data structure to yield an implementation in O((n
+e)log n)complexity for graph represented by adjacency list.
6. Perform data preprocessing tasks and demonstrate.
7. Perform association rule mining on data sets.
8. Demonstrate classification on data sets.
9. Print all the nodes reachable from a given starting node in a given digraph using DFS.
10. Implement HORSPOOL algorithm for string matching.
11. Configure a DHCP Server to serve contiguous IP addresses to a pool of four IP devices
with a default gateway and a default DNS address. Integrate the DHCP server with a
BOOTP demon to automatically serve Windows and Linux OS Binaries based on client
MAC address.
12. Configure, implement and debug the following (Use open source tools for debugging
and diagnostics):
(a) ARP/RARP protocols
(b) RIP routing protocols
(c) BGP routing
(d) OSPF routing protocols
(e) Static routes (check using netstat)
13. Configure DNS: Make a caching DNS client, and a DNS Proxy; implement reverse DNS
and Forward DNS, using TCP dump/Wireshark characterize traffic when the DNS server
is up and when it isdown.
14. Configure FTP Server on a Linux/Windows machine using a FTP client/SFTP client-
characterize file-transfer rate for a cluster of small files 100k each and a video file of
700mb.Use a TFTP clientand repeatthe experiment.
15. Configure a mail server for IMAP/POP protocols and write a simple SMTP client
inC/C++/Java client tosend and receive mails.
16. Simulate all file allocation strategies
(a) Sequential
(b) Indexed
(c) Linked.
17. Implement process strategies: creation of child, zombie, and orphan process.
18. Implement file organization strategies
(a) single level
(b) Two level
(c) Hierarchical
19. Simulate Bankers Algorithm for Dead LockAvoidance.
20. Simulate Bankers Algorithm for Dead Lock Prevention.
21. Write a program to implement The Huffman- Coding Algorithm.
22. Configure snort to work as Intrusion Prevention System IPS.
23. Perform wireless audit on an access point or a router and decrypt WEP and WPA.
24. Demonstrate clustering rule process on datasets using simple k-means algorithms.
25. Write a program to implement binomial coefficient computation.

------****------