4138: Data Structures Lab Syllabus for Computer Engineering 4th Sem 2021 Revision SITTTR

Data Structures Lab detailed syllabus for Computer Engineering (CT) for 2021 revision curriculum has been taken from the SITTTRs official website and presented for the Computer Engineering 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 Engineering (CT) 4th Sem 2021 revision scheme. The detailed syllabus of data structures lab is as follows.

Course Objectives:

• Provide hands-on experience on developing elementary data structures.
• Understand the applications of data structures in developing efficient algorithms.

Course Outcomes:

On completion of the course, the student will be able to:

1. Construct Stack and Queue using array and apply it to solve problems using C.
2. Implement Linked List operations.
3. Develop programs to implement Binary Search Tree and perform the basic operations.
4. Apply Traversal Algorithms on Graphs. 1

Module 1:

1. Implement Stack using array.
2. Develop simple applications using stack
3. Implement infix to postfix conversion and evaluation of a postfix expression
4. Implement Queue using array.

Module 2:

1. Implement Linked List operations – insertion, deletion, searching, etc
2. Construct Stack using Linked List.
3. Construct Queue using Linked List.

Module 3:

1. Create a Binary Search Tree using Linked List.
2. Develop programs to perform the various traversals in a Binary Search Tree.
3. Develop programs to perform deletion of a node in a Binary Search Tree.

Module 4:

1. Implement the Depth first search Traversal and Breadth first search Traversal.
2. Open Ended Experiments**

Suggested Open Ended Experiments

(Not for End Semester Examination but compulsory to be included in Continuous Internal Evaluation. Students can do open ended experiments as a group of 2-3. There is no duplication in experiments between groups)

• Split a queue to more than one queue depending on a criteria say for example split data in odd positions and even positions to two queues.
• Perform polynomial addition using a suitable data structure

Text Books:

1. Samanta Debasis, Classic Data Structures, Prentice Hall of India, 2nd ed., 2009
2. Reema Thareja, Data Structures Using C, Oxford University Press India.

Reference Books:

1. Lipschutz S, Theory and Problems of Data Structures with Applications, Tata McGrawHill, 1995
2. Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudocode approach with C, 2nd ed., Cengage Learning, India, 2005
3. E.Balagurusamy, Programming in ANSI C, Tata Mc-Graw Hill, 3rd ed.

Online Resources

1. https://www.tutorialspoint.com/data_structures_algorithms/index.htm
2. https://www.programiz.com/dsa
3. https://www.programmingsimplified.com/c/data-structures
4. https://www.sanfoundry.com

For detailed syllabus of all other subjects of Computer Engineering (CT), 2021 revision curriculum do visit Computer Engineering 4th Sem subject syllabuses for 2021 revision.

To see the syllabus of all other branches of diploma 2021 revision curriculum do visit SITTTR diploma all branches syllabus..

To see the results of Computer Engineering (CT) of diploma 2021 revision curriculum do visit SITTTR diploma Computer Engineering (CT) results..

For all Computer Engineering academic calendars, visit Computer Engineering all semesters academic calendar direct link.