UG - COMPUTER SCIENCE & ENGG. / COMPUTER SCIENCE / COMPUTER ENGG.

PRACTICAL SYLLABUS

1. To realize basic gates using universal gates.

2. To verifyDe-morgan’s theorem.
3. To design and setup the half adder using basic gates and universal gates.
4. To design and setup 4-bit adder subtractor using IC-7483.
5. To verify the truth tables of basic and universal gates.
6. To verifya SOP & POS expression using universal gates.
7. Using OpenMP, implement a parallelized Merge Sort algorithm to sort a given set
of elements and determine the time required to sort the elements. Repeat the
experiment for different values of n, the number of elements in the list to be sorted
and plot a graph of the time taken versus n. The elements can be read from a file or
can be generated using the random number generator.
8. From a given vertex in a weighted connected graph, find shortest paths to other
vertices using Dijkstra's algorithm.
9. Implement 0/1 Knapsack problem using Dynamic Programming.
10. Perform 8-bit Addition, Subtraction, Multiplication and Division.
11. Write a program for code conversion, sorting and searching.
12. Write a program to check password.
13. Perform 16-bit Addition, Subtraction, Multiplication and Division.
14. Design a lexical analyser for given language and the lexical analyser should ignore
redundant spaces, tabs and new lines. It should also ignore comments. Although
the syntax specification states that identifiers can be arbitrarily long, you may
restrict the length to some reasonable value.
15. Write a C program to identify whether a given line is a comment or not.
16. Write a C program to recognize strings under 'a', 'a*b+', 'abb'.
17. Write a C program for constructing of LL (1) parsing.
18. Write a C program for constructing recursive descent parsing.
19. Write a C program to simulate lexical analyser for validating operators.
20. Write a C program to test whether a given identifier is valid or not.
21. Install NS3 in Linux.
22. Write a program in NS3 to connect two nodes.
23. Write a program in NS3 to implement star topology.
24. Write a program in NS3 to implement FTP using TCP bulk transfer.
25. Write a program in NS3 for connecting three nodes considering one node as a
central node.
26. Implement the data link layer framing methods suchas character, character stuffing
and bit stuffing.
27. Implement on a data set of characters the three CRCpolynomials – CRC 12, CRC
16 and CRC CCIP 15.
28. Take an example subnet graph with weights indicating delay between nodes. Now
obtain Routing table art each node using distance vector routing algorithms.
29. Implement Dijkstra‘s algorithm to compute the Shortest path through a graph.
30. Take an example subnet of hosts. Obtain broadcast tree for it.
31. Take a 64 bit playing text and encrypt the same using DES algorithm.
32. Write a program to break the DES coding.
33. Using RSA algorithm encrypt a text data and Decrypt the same.
34. Write the working of 8085 simulators GNUsim8085 and basic architecture of 8085
along with small introduction.
35. Write an assembly language code in GNUsim8085 to implement data transfer
instruction.
36. Write an assembly language code in GNUsim8085 to store numbers in reverse
order in memory location.
37. Write an assembly language code in GNUsim8085 to add two numbers using lxi
instruction.
38. Write an assembly language code in GNUsim8085 to add two 8 bit numbers stored
in memory and also storing the carry.
39. To create a DDL to perform creation of table, alter, modify and drop column.
40. To implement built in functions in SQL.
41. Write Cursor program for electricity bill calculation.
42. To study the various DML commands and implement them on the database.
43. Write a sql program for bonus calculation.
44. Write a trigger for displaying grade of the student.
45. To study the various DML commands and implement them on the database.
46. Write programs using the following system calls of UNIX operating system: fork,
exec, getpid, exit, wait, close, stat, opendir, readdir.
47. Write programs using the I/O system calls of UNIX operating system (open, read,
write, etc).
48. Implement the Producer–Consumer problem using semaphores (using UNIX
system calls).
49. Implement memory management schemes.
50. Implement file allocation techniques (Linked, Indexed or Contiguous).

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