Data Structures detailed syllabus for Computer Hardware Engineering (CM) for 2021 revision curriculum has been taken from the SITTTRs official website and presented for the Computer Hardware Engineering (CM) 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 Hardware Engineering 5th Sem scheme and its subjects, do visit Computer Hardware Engineering (CM) 5th Sem 2021 regulation scheme. For Professional Elective-I scheme and its subjects refer to Computer Hardware Engineering (CM) Professional Elective-I syllabus scheme. The detailed syllabus of data structures is as follows.
Course Objectives:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.
Course Outcomes:
On completion of the course,the student will be able to:
- Implement the primitive operations and applications of stacks & queues. 1
- Implement the different operations of linked lists
- Illustrate different types of binary trees and operations on it.
- Illustrate graph traversal algorithms.
Module 1:
Introduction to Data Structures: Basic Terminology – Classification – Operations on Data Structures, Linear Data Structures, Stacks: Introduction to Stacks – Array Representation of Stacks – Operations on a Stack – Applications of Stacks – Infix-to-Postfix Conversion -Evaluating Postfix Expressions, Queues: Introduction to Queues – Array Representation of Queues – Operations on a Queue – Types of Queues: Circular Queue – Dequeue – Priority queue.
Module 2:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Module 4:
Non Linear Data Structures – Graphs: Graph Terminologies – Vertex, Edge, Adjacent vertices, Self-loop, Parallel edges, Isolated vertex, Degree of vertex, Pendant vertex, Subgraph, Paths and Cycles, – Types of Graphs – Directed, Undirected, Simple, Complete, Cyclic, Acyclic, Bipartite, Complete Bipartite, Connected, Disconnected and Regular, -Representation of Graphs – Set – Linked – Matrix – Graph Traversals – Warshall’s Shortest path algorithm.
Text Books:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
- Samanta Debasis, Classic Data Structures, Prentice Hall of India, 2nd ed., 2009
Reference Books:
- Reema Thareja, Data Structures Using C, Oxford University Press India.
- Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudo code approach with C, 2nd ed., Cengage Learning, India, 2005
- Lipschutz S, Theory and Problems of Data Structures with Applications, Tata McGrawHill, 1995
- Horowitz, Ellis, Sahni, Sartaj, Anderson-Freed, Susan, Fundamentals of Data Structure in C, University Press, India.
Online Resources
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
For detailed syllabus of all other subjects of Computer Hardware Engineering, 2021 revision curriculum do visit Computer Hardware Engineering (CM) 5th 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 Hardware Engineering of diploma 2021 revision curriculum do visit SITTTR diploma results..
For all Computer Hardware Engineering academic calendars, visit Computer Hardware Engineering all semesters academic calendar direct link.