| December 1st, 2020 12:53 PM | |
| ReenaK | Sathyabama Institute of Science and Technology B.Sc. Computer Science SBS1201 FUNDAMENTALS OF DATA STRUCTURES Syllabus Sathyabama Institute of Science and Technology B.Sc. Computer Science SBS1201 FUNDAMENTALS OF DATA STRUCTURES Syllabus SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING SBS1201 FUNDAMENTALS OF DATA STRUCTURES L T P Credits Total Marks 4 0 0 4 100 UNIT 1 12 Hrs. Arrays- Linked List - Single Linked List - Insertion and Deletion - Doubly Linked List.-Circular Linked List Stack- Queues- Array implementation of a Stack and queue - Linked List implementation of a Stack and Queue- Priority Queues UNIT 2 12 Hrs. Evaluation of arithmetic expression using stack- Prefix Infix-Postfix-notations, Converting infix expressions to postfix - Evaluation of postfix expression,-Towers of Hanoi problem. UNIT 3 12 Hrs. Tree Structures: Binary Trees- Implementation of Binary Trees- Linear Representation of Binary Tree-Linked representation of a Binary Tree. Binary Tree Traversal : Pre order In order - Post order. UNIT 4 12 Hrs. Sorting Techniques: Bubble Sort- Merge Sort - Shell Sort- Insertion Sort- Selection Sort-Quick Sort- Heap Sort. Searching Techniques: Sequential Search- Binary Search-Hashing- Indexing. UNIT 5 12 Hrs. Graphs and Networks: Implementation of Graphs - Adjacency Matrix- Depth First Search-Breath First Search. Networks: Minimum Spanning Tree - The Shortest path Algorithm. Max.60 Hours TEXT/ REFERENCE BOOKS 1. E. Horowitz, S. Sahni, Fundamentals of Data Structures. 2. Bhagat Singh and Thomas L, Introduction to Data Structures, Naps, TMH. 3. Helieman, Data Structures, Algorithms and Object Oriented Programming. 4. Thomas H Coreman, Charles E Leiseron, Ronald L Rivest, Introduction to Algorithms, PHI 2002. END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 Questions of 2 marks each uniformly distributed No choice 20 Marks PART B : 2 Questions from each unit of internal choice, each carrying 16 marks 80 Marks |
