*The Mini Project or internship (4 weeks) will be done during summer break after 4 th Semester and will be assessed

during
V semester.

SYLLABUS

BCS301 DATA STRUCTURE

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to understand

Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by
CO 1 K1, K2
the algorithms and their common applications.
CO 2 Discuss the computational efficiency of the sorting and searching algorithms. K2

CO 3 Implementation of Trees and Graphs and perform various operations on these data structure. K3
Understanding the concept of recursion, application of recursion and its implementation and removal
CO 4 K4
of recursion.
Identify the alternative implementations of data structures with respect to its performance to solve a
CO 5 K5, K6
real world problem.

DETAILED SYLLABUS 3-1-0

Proposed
Unit Topic
Lecture
Introduction: Basic Terminology, Elementary Data Organization, Built in Data Types in C.
Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations:
Big Oh, Big Theta and Big Omega, Time-Space trade-off. Abstract Data Types (ADT)
Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row
I Major Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-D,3-D and 08
n-D Array Application of arrays, Sparse Matrices and their representations.
Linked lists: Array Implementation and Pointer Implementation of Singly Linked Lists,
Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion,
Traversal, Polynomial Representation and Addition Subtraction & Multiplications of Single
variable & Two variables Polynomial.
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked
Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions,
II Evaluation of postfix expression, Iteration and Recursion- Principles of recursion, Tail
recursion, Removal of recursion Problem solving using iteration and recursion with 08
examples such as binary search, Fibonacci numbers, and Hanoi towers. Tradeoffs
between iteration and recursion.
Queues: Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues,
Array and linked implementation of queues in C, Dequeue and Priority Queue.
Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary
III Search. Concept of Hashing & Collision resolution Techniques used in Hashing. Sorting: 08
Insertion Sort, Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.
 Trees: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Array
Representation and Pointer(Linked List) Representation, Binary Search Tree, Strictly
IV Binary Tree ,Complete Binary Tree . A Extended Binary Trees, Tree Traversal algorithms:
Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal, 08
Operation of Insertation , Deletion, Searching & Modification of data in Binary Search .
Threaded Binary trees, Traversing Threaded Binary trees. Huffman coding using Binary
Tree. Concept & Basic Operations for AVL Tree , B Tree & Binary Heaps

Graphs: Terminology used with Graph, Data Structure for Graph Representations:
Adjacency Matrices, Adjacency List, Adjacency. Graph Traversal: Depth First Search and
V Breadth First Search, Connected Component, Spanning Trees, Minimum Cost Spanning 08
Trees: Prims and Kruskal algorithm. Transitive Closure and Shortest Path algorithm:
Warshal Algorithm and Dijikstra Algorithm.

Text books:

1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, “Data Structures Using C and C++”, PHI Learning
Private Limited, Delhi India.
2. Gilberg ,Forouzan, Data Structures: A Pseudocode Approach with C 3rd edition , Cengage Learning publication.
3. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt Ltd Delhi India.
4. Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd.
5. Thareja, “Data Structure Using C” Oxford Higher Education.
6. AK Sharma, “Data Structure Using C”, Pearson Education India.
7. Rajesh K. Shukla, “Data Structure Using C and C++” Wiley Dreamtech Publication.
8. Michael T. Goodrich, Roberto Tamassia, David M. Mount “Data Structures and Algorithms in C++”,
Wiley India.
9. P. S. Deshpandey, “C and Data structure”, Wiley Dreamtech Publication.
10. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education.
11. Berztiss, AT: Data structures, Theory and Practice, Academic Press.
12. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with applications”,
McGraw Hill.
13. Adam Drozdek “Data Structures and Algorithm in Java”, Cengage Learning