Scribd
Upload
49 views

Proposed-Data Structure Syllabus

This document outlines a course on data structures. The course is a core theory course worth 2 credits that teaches linear data structures like stacks, queues, and linked lists as well as non-linear data structures like trees and graphs. It has 5 units covering these topics as well as sorting and searching algorithms. The goal is for students to understand and apply various data structures to solve problems. Recommended prerequisites are computer programming courses.

Uploaded by

sovitsovitsovitsovit
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
49 views

Proposed-Data Structure Syllabus

This document outlines a course on data structures. The course is a core theory course worth 2 credits that teaches linear data structures like stacks, queues, and linked lists as well as non-linear data structures like trees and graphs. It has 5 units covering these topics as well as sorting and searching algorithms. The goal is for students to understand and apply various data structures to solve problems. Recommended prerequisites are computer programming courses.

Uploaded by

sovitsovitsovitsovit
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Computer Science and Engineering

Subject Name: DATA STRUCTURE

Regulation Year: 2023-24


Course Code: Credit: 02
Course Category: Core Theory Contact hours: Theory 03Hrs/Week
Recommended Pre-requisite: Computer Programming
COURSE OUTCOMES:
CO1:Understanding of linear data structure such as Queue and Stack for solving
problems.
CO2:Analyse linear data structure such as Linked List for solving problems.
CO3:Apply non-linear data structure such as Tree for solving problems.
CO4:Apply non-linear data structure such as Graph for solving problems.

CO5:Create a program using different sorting and searching mechanisms.

COXX

Course Details:
UNIT 1: Introduction & Linear Data Structures Part-I : Stack & Queue
(7 Hrs)

Definitions, Abstract Data Types (ADT) with examples (Types: Primitive,


Non-primitive), Categories of Data Structures: Linear vs Nonlinear, Static vs
Dynamic Data Structures. Stack: Fundamentals of stack, representation using
array, Applications of stack: Recursion, Expression conversions and
evaluations, etc. Queue: Fundamentals of queue, representation using array,
Circular queues, Double ended queues (Dequeue), Applications of queue to
solve problems.

UNIT2: Linear Data Structures Part-II : Linked List (7 Hrs)

Single linked lists: operations and implementation. Double linked list:


operations and implementations. Circular linked list: concepts and
implementation. Applications: Stack & Queue implementation using linked
list, Polynomial manipulation using linked list.
UNIT 3: Nonlinear Data Structures Part-I : Tree (7 Hrs)

Basic terminology, Representation using array and linked list, Complete Binary
Tree. Tree Traversals: Recursive and Non-recursive. Operations on binary tree:
Finding Height, Leaf nodes, Counting number of nodes, etc. Construction of
binary tree from traversal paths. Binary Search Trees (BST): Insertion, Deletion
of nodes to/from BST. Height Balanced Tree (AVL): Insertion, Deletion,
Rotations on AVL tree, Searching.

UNIT 4: Nonlinear Data Structures Part-II : Graph (7 Hrs)

Graphs: Graph terminology, Representation of graphs (Adjacency Matrix,


Adjacency List), Path matrix. Traversals: Breadth First Search (BFS), Depth
First Search (DFS). Spanning Trees, Minimum Spanning Trees. Shortest
Paths: Bellman’s Ford Algorithm (Single Source).

Unit 5: Sorting & Searching (7 Hrs)

Sorting techniques: Bubble Sort, Selection Sort, Insertion Sort, Counting Sort.
Heaps: Max Heap, Min Heap, Heap Sort. Searching techniques: Linear and
Binary search methods (recursive and non-recursive). Hashing: Different hash
functions, Collision resolution techniques.

Note: Five assignments to be given to the students on self study, comprising of one
assignment from each unit.

Text books:

1. “Data Structure: A Pseudo code approach with C”,Richard F. Gilberg and


Behrouz A. Forouzan, Thomson publication., Second Edition.
2. “Data structure in C”, A.M.Tanenbaum, Y. Langsam, M. J. Augenstein, PHI
publication / Pearson publication., Seventh Edition.

Reference Books:

1. “Data Structures with C”– (Schaums Series), Seymour Lipschutz Tata-McGraw-


Hill., First Edition.
2. “Fundamentals of Data Structure in C”– Horowitz, Sahani & Freed, Computer
Science Press., Second Edition.
3. “Data Structure Through C: A Practical Approach” by G. S. Baluja, DhanpatRai
Publications., First Edition.
4. ”Data Structures & Algorithms; Concepts, Techniques & Algorithms ” by Pai,
Tata McGraw Hill., First Edition.
5. “Data Structures Using C”, Reema Thareja, Oxford University Press, Second
Edition.
Open Sources:
1. https://nptel.ac.in/courses/106/104/106104128/ (Introduction to
Programming in C)
2. https://nptel.ac.in/courses/106/105/106105171/ (Problem solving
through Programming in C)

Course Designed by:Madhusmita Sahu, Mamata Das, Anjana Mishra


Course Approved by:

Computer Science and Engineering

You might also like