Data Structures Lab detailed syllabus for Computer Engineering (Computer Engg) for 2015 revision curriculum has been taken from the SITTTRs official website and presented for the Computer Engg students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.
For Computer Engineering 4th Sem scheme and its subjects, do visit Computer Engg 4th Sem 2015 revision scheme. The detailed syllabus of data structures lab is as follows.
List of Experiments
- Implement Stack ADT using array.
- Implement an algorithm to convert infix to postfix expression using Stack ADT
- Implement an algorithm to evaluate a postfix expression using stack ADT
- Implement an algorithm to convert decimal number to its binary equivalent using stack ADT
- Implement a Queue ADT (circular queue) using array.
- Implement a List ADT (using array) with operations find(), makeEmpty(), printList(), findKth() etc.
- Implement a LinkedList ADT with operations find(), makeEmpty(), printList(), findKth(), insert(), delete() etc.
- Implement a stack using LinkedList ADT
- Implement a queue using LinkedList ADT
- Implement a Binary Search Tree ADT with operations inOrder(), preOrder(), postOrder(), insert(), delete(), find() etc.
- Implement a BST using BST ADT and find height of the tree
- Implement a BST using BST ADT and dermine the number of nodes
- Implement Graph ADT with operations dfs() and bfs()
- Implement Warshall’s algorithm to find the shortest path using Graph ADT
- Implement binary search algorithm
- Implement Quick sort algorithm
Software Requirement : Linux operating System and gcc/g++
For detailed syllabus of all other subjects of Computer Engineering, 2015 revision curriculum do visit Computer Engg 4th Sem subject syllabuses for 2015 revision.
To see the syllabus of all other branches of diploma 2015 revision curriculum do visit all branches of SITTTR diploma 2015 revision.