[go: up one dir, main page]
Scribd
Upload
29 views2 pages

DS Syllabus

Uploaded by

priyadharshini
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views2 pages

DS Syllabus

Uploaded by

priyadharshini
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Code Course Title L T P C

BSCS202 Data Structures 3 0 2 4

Course Objectives
• To understand the basics of all data structures.
• To choose the appropriate data structure for specific application.
• To understand and analyse various searching and sorting algorithms.
• To solve the complex problem using hashing, trees and graph.

Course Contents

UNIT-I
Introduction to Data Structures, need and advantages of data structure. Array, Pointers: basics, pointer
with function, array of pointers, pointer to array, applications, advantages and disadvantages of pointer.
Linear data structures: Stack, Queue, Linked list. Stack: Fundamentals, stack implementation using
array and linked list, infix to postfix conversion and vice versa, postfix expression evaluation, recursion,
stack operations: Traversing, insertion, deletion, searching (linear search and binary search), sorting
(insertion sort, selection sort, bubble sort, quick sort, merge sort)
.
UNIT-II
Queue: Fundamentals, queue implementation using array and linked list. Queue operations: traversing,
insertion and deletion. Double ended queue: Basics, implementation, operations. Circular queue:
Basics, implementation, operations. Application of queue.

UNIT-III
Linked list: Fundamentals, difference between array and linked list. Single linked list: basics,
representation, operations: insertion, deletion, traversing. Double linked list: basics, representation,
operations: insertion, deletion, traversing. Circular linked list: basics, representation, operations:
insertion, deletion, traversing.

UNIT-IV
Tree: Fundamentals, representation. Binary tree: Basics, representation, complete binary tree, tree,
traversal: Inorder, preorder, postorder traversal, searching, sorting (heap sort, radix sort). Binary search
tree: Basic, Inorder, preorder, postorder traversal, searching, sorting (heap sort, radix sort). B+ tree:
Basic, traversing, searching, sorting. Red-black tree: Basic, traversing, searching, sorting. AVL tree:
traversing, searching, sorting. Threaded binary tree: Basic, traversing, searching, sorting.

UNIT- V
Graph: Basics, Representation: adjacency matrix. Cyclic graph: basics, Acyclic graph: Basics,
Traversal: Depth first search, Breadth first search. Minimum spanning tree, shortest path (Dijkstra
algorithm), Prim’s algorithm. Hashing.

Text Books:
Fundamentals of Data structures in C, E. Horowitz, S. Sahni and Susan Anderson-Freed,
Universities Press. , 2nd Edition , 2007.

114
Reference Books:
Data Structures, S. Lipscutz, Schaum’s Outlines, Tata. McGraw Hill Education; 1st edition, July
2017.
Data structures: A Pseudo code Approach with C, R. F. Gilberg and B. A. Forouzan, Cengage
Learning, 2nd edition , November 2007.
Data structures A Programming Approach with C, D. S. Kushwaha and A.K. Misra, PHI. Learning
Pvt Ltd , 1st edition, February 10, 2011.

Learning Outcomes
Upon successful completion of the course, student will be able to:
Understand how to use data structure concepts for realistic problems.
Ability to identify appropriate data structure for solving computing problems in respective
language.
Ability to solve problems independently and think critically

115

You might also like