JNTUH B.Tech 2nd Year 1 sem Computer Science Engineering (2-1) Data Structures Lab Engineering R13.

JNTUH B.Tech 2nd year Data Structures Lab gives you detail information about Data Structures Lab Engineering R13 year subject. It will be help full you to understand you complete curriculum of the year.

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 in order.

Week 7

Write C programs for implementing the following sorting methods to arrange a list of integers in

Ascending order 

a) Insertion sort b) Merge sort

Week 8 

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

a) Quick sort b) Selection sort

Week 9

1. Write a C program to perform the following operation:
   a)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

• Depth first traversal
• Breadth first traversal

Download iStudy Android App for complete JNTUH syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier.

TEXT BOOKS:

• C and Data Structures, Third Edition, P.Padmanabham, BS Publications.
• C and Data Structures, Prof. P.S.Deshpande and Prof. O.G. Kakde, Dreamtech Press.
• Data structures using C, A.K.Sharma, 2nd edition, Pearson.
• Data Structures using C, R.Thareja, Oxford University Press.
• C and Data Structures, N.B.Venkateswarlu and E.V.Prasad,S.Chand.
• 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.

For more information about all JNTU updates please stay connected to us on FB and don’t hesitate to ask any questions in the comment.