Note: This syllabus is same for CSE, IT/CST, Electronics and Computer Engineering.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
II Year B.Tech. CSE- I Sem L T/P/D C
- -/3/- 2

DATA STRUCTURES LAB

---

Objectives:

• To write and execute programs in C to solve problems using data structures such as arrays, linked lists, stacks, queues, trees, graphs, hash tables and search trees.
• To write and execute write programs in C to implement various sorting and searching methods. 

Recommended Systems/Software Requirements:

• Intel based desktop PC with minimum of 166 MHZ or faster processor with at least 64 MB RAM and 100 MB free disk space.
• C compiler.

Week 1: Write a C program that uses functions to perform the following:

1. Create a singly linked list of integers.
2. Delete a given integer from the above linked list.
3. Display the contents of the above list after deletion.

Week 2: Write a C program that uses functions to perform the following:

1. Create a doubly linked list of integers.
2. Delete a given integer from the above doubly linked list.
3. Display the contents of the above list after deletion.

Week 3: Write a C program that uses stack operations to convert a given infix expression into its postfix Equivalent, Implement the stack using an array.

Week 4: Write C programs to implement a double ended queue ADT using i)array and ii)doubly linked list respectively.

Week 5: Write a C program that uses functions to perform the following:

1. Create a binary search tree of characters.
2. Traverse the above Binary search tree recursively in Postorder.

Week 6: Write a C program that uses functions to perform the following:

1. Create a binary search tree of integers.
2. Traverse the above Binary search tree non recursively in inorder.

Week 7: Write C programs for implementing the following sorting methods to arrange a list of integers in Ascending order :

1. Insertion sort
2. Merge sort

Week 8: Write C programs for implementing the following sorting methods to arrange a list of integers in ascending order:

1. Quick sort
2. Selection sort

Week 9:

1. Write a C program to perform the following operation:
   1. Insertion into a B-tree.
2. Write a C program for implementing Heap sort algorithm for sorting a given list of integers in ascending order.

Week 10: Write a C program to implement all the functions of a dictionary (ADT) using hashing.

Week 11: Write a C program for implementing Knuth-Morris- Pratt pattern matching algorithm.

Week 12: 

Write C programs for implementing the following graph traversal algorithms:

1. Depth first traversal
2. Breadth first traversal

TEXT BOOKS:

1. C and Data Structures, Third Edition, P.Padmanabham, BS Publications.
2. C and Data Structures, Prof. P.S.Deshpande and Prof. O.G. Kakde, Dreamtech Press.
3. Data structures using C, A.K.Sharma, 2nd edition, Pearson.
4. Data Structures using C, R.Thareja, Oxford University Press.
5. C and Data Structures, N.B.Venkateswarlu and E.V.Prasad,S.Chand.
6. C Programming and Data Structures, P.Radha Krishna, Hi-Tech Publishers.

Outcomes:

• Ability to identify the appropriate data structure for given problem.
• Graduate able to design and analyze the time and space complexity of algorithm or program.
• Ability to effectively use compilers includes library functions, debuggers and trouble shooting.