4133: Data Structures KL Diploma Syllabus for Computer Hardware 4th Sem 2015 Revision SITTTR

Data Structures detailed syllabus for Computer Hardware (Computer Hardware) for 2015 revision curriculum has been taken from the SITTTRs official website and presented for the Computer Hardware 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 4th Sem scheme and its subjects, do visit Computer Hardware 4th Sem 2015 revision scheme. The detailed syllabus of data structures is as follows.

Course General Outcomes:

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

Specific outcomes:

MODULE I STACK AND QUEUE

1. Introduction to different Data Structures
   1. Explain efficiency of algorithms, complexity and big O notation.
   2. Describe different data structures-linear and non linear
   3. Describe basic data structure operations – insertion, deletion, search, traverse
   4. Explain about Abstract Data Types (ADTs) and C++ classes
   5. Explain the use of iterators
   6. Describe the Array as an ADT with printArray() operation.
2. Understanding Stack and its operations
   1. Describe Stack and its operations – Push and Pop.
   2. Explain about array representation of stacks
   3. Describe Stack ADT with push(), pop(), stackfull() and stackempty()
   4. Describe infix, prefix and postfix Expressions
   5. Explain infix to postfix conversion using Stack ADT
   6. Explain evaluation of postfox expression using stack ADT
3. Understanding Queues and its operations
   1. Describe Queue and its operations – Insert and Delete.
   2. Describe circular queue and its array representation
   3. Describe Queue ADT (for circular queue) with insert(), delete(), QEmpty() and QFull().
   4. Describe Priority Queue and Dequeue

MODULE II LIST AND LINKED LIST

1. Understanding list and its operations
   1. Describe list (using array) and its operations – Find, MakeEmpty, PrintList etc.
   2. Describe List ADT with find(), makeEmpty(), printList(), findKth() etc.
2. Understanding linked list and its operations
   1. Explain linked list and its operations – Find, MakeEmpty, PrintList, FindKth, Insert, Delete, Successor, Predecessor etc.
   2. Describe the methods of memory allocation and deallocation for nodes.
   3. Describe LinkedList ADT with find(), makeEmpty(), printList(), findKth(), insert(), delete() etc.
   4. Describe algorithm for implementing stack with LinkedList ADT.
   5. Describe algorithm for implementing queue with LinkedList ADT.
   6. Discribe about doubly linked lists and circular linked lists.

MODULE III TREES

1. Understanding Trees and its operations
   1. Explain binary tree, key terms related to trees and traversal methods.
   2. Explain Linked representation of binary trees
   3. Explain binary search trees (BST) and its operations – traversals, insertion, deletion and find.
   4. Describe BST ADT with inOrder(), preOrder(), postOrder(), insert(), delete(), find() etc.
   5. Describe Expression trees and Threaded binary trees.

MODULE IV GRAPH

1. Understanding Graph and its operations
   1. Explain graph and key terms related to graphs
   2. Explain graph representations – adjacency matrix mehod and adjacency list method.
   3. Describe graph traversals – DFS and BFS
   4. Describe Graph ADT with dfs() and bfs() methods.
   5. Describe and implement Warshall’s algorithm for all-pairs shortest path
2. Understanding Searching and Sorting
   1. Explain and implement linear search and binary search algorithms
   2. Explain and implement bubble sort and quick sort algorithms

MODULE I : STACK AND QUEUE

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 II : LIST AND LINKED LIST

List using array – List ADT – find(), makeEmpty(), printList() and findKth() operations. Linked List -Memory allocation and de-allocation – LinkedList ADT – find(), makeEmpty(), printList(), findKth(), insert() operations – stack with LinkedList, queue with LinkedList – doubly linked list and circular list

MODULE III : TREES

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 IV : GRAPH

Graph Definition- Key terms – Representations – Traversal Algorithms – BFS,DFS – Graph ADT – All-pairs Shortest Path Algorithm. Searching and Sorting Algorithms-Linear search and Binary search – Bubble sort and Quick sort algorithms.

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

Reference Books:

1. Data Structures, Algorithms and Applications in C++, Sartaj Sahni, University Press
2. Data Structures using C and C++ by Yedidyah Langsam, Moshe J. Augenstein and Aron M. Tananbaum, PHI.2002

For detailed syllabus of all other subjects of Computer Hardware, 2015 revision curriculum do visit Computer Hardware 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.