3288: Data Structures Using C Lab Syllabus for Cyber Forensics & Information Security 3rd Sem 2021 Revision SITTTR

Data Structures Using C Lab detailed syllabus for Cyber Forensics & Information Security (CF) for 2021 revision curriculum has been taken from the SITTTRs official website and presented for the Cyber Forensics & Information Security 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 Cyber Forensics & Information Security 3rd Sem scheme and its subjects, do visit Cyber Forensics & Information Security (CF) 3rd Sem 2021 revision scheme. The detailed syllabus of data structures using c lab is as follows.

Course Objectives:

• Implement different Searching and Sorting Algorithms
• Implement linear data structures in C like Array, Stack, Queue, and Linked List
• Implement Non-linear Data Structures in C like Tree and Graph.

Course Outcomes:

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

1. Demonstrate the concept of Pointers, Structures and Files in C
2. Implement Searching and Sorting Algorithms in C
3. Develop Programs to Construct Stack, Queue, and Linked List
4. Develop programs to implement Graphs, Binary Search Tree and perform the basic on Graphs & Trees.

Module 1:

1. Implement C program to demonstrate Pointers.
2. Develop C program to demonstrate the concept of Files.
3. Develop a C program to demonstrate the concept of Structures.

Module 2:

1. Implement Linear Search and Binary Search in C
2. Implement Bubble Sort, Selection Sort, Quick Sort and Merge Sort in C

Module 3:

1. Implement Stack and Queue using Array in C
2. Develop C program for Infix to Postfix conversion and Postfix Evaluation using Stack
3. Implement Linked List operations – insertion, deletion, searching, etc. in C
4. Develop C program to construct Stack and Queue using Linked List.

Module 4:

1. Develop C Program to implement Graph
2. Implement Graph Traversal Algorithms in C
3. Develop C Program to Construct and Perform various Operations in Binary Search Tree
4. Develop C program to perform the various traversals in a Binary Search Tree.
5. Develop C Program to Print number of nodes and height of BST

Text Books:

1. Data Structures using C by E. Balaguruswamy – Tata McGraw-Hill Education

Reference Books:

1. Data Structures using C by Aaron M Tenenbaum – Pearson Education India
2. Reema Thareja, “Data and File Structures using C”, Oxford University Press.
3. Andrew S. Tanenbaum, “Data Structures using C & C++”, PHI.
4. Jean-Paul Tremblay and Paul G. Sorenson, “An Introduction to Data Structures with Applications”,Tata McGraw Hill.

Online Resources

1. https://www.cet.edu.in/noticefiles/280_DS%20Complete.pdf
2. http://www.tutorialspoint.com/cprogramming/
3. http://www.indiabix.com/online-test/c-programming-test

For detailed syllabus of all other subjects of Cyber Forensics & Information Security (CF), 2021 revision curriculum do visit Cyber Forensics & Information Security 3rd 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 Cyber Forensics & Information Security (CF) of diploma 2021 revision curriculum do visit SITTTR diploma Cyber Forensics & Information Security (CF) results..

For all Cyber Forensics & Information Security academic calendars, visit Cyber Forensics & Information Security all semesters academic calendar direct link.