Data Structure detail syllabus for Information Technology (It), 2019-20 scheme is taken from AKTU official website and presented for AKTU students. The course code (KCS301), and for exam duration, Teaching Hr/Week, Practical Hr/Week, Total Marks, internal marks, theory marks, duration, and credits do visit complete sem subjects post given below.
For all other it 3rd sem syllabus for b.tech 2019-20 scheme aktu you can visit IT 3rd Sem syllabus for B.Tech 2019-20 Scheme AKTU Subjects. The detail syllabus for data structure is as follows.
Unit I
For the complete syllabus, results, class timetable and more kindly download iStudy. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.
Unit II
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Iteration and Recursion-Principles of recursion, Tail recursion, Removal of recursion Problem solving using iteration and recursion with 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.
Unit III
Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary Search. Concept of Hashing & Collision resolution Techniques used in Hashing. Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.
Unit IV
For the complete syllabus, results, class timetable and more kindly download iStudy. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.
Unit V
Trees: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Array Representation and Pointer(Linked List) Representation, Binary Search Tree, Strictly Binary Tree, Complete Binary Tree . A Extended Binary Trees, Tree Traversal algorithms: Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal, 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.
Course Outcomes:
- Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by the algorithms and their common applications.
- Discuss the computational efficiency of the sorting and searching algorithms.
- Implementation of Trees and Graphs and perform various operations on these data structure.
- Understanding the concept of recursion, application of recursion and its implementation and removal of recursion.
- Identify the alternative implementations of data structures with respect to its performance to solve a real world problem.
Reference Books:
- Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, Data Structures Using C and C++,
- PHI Learning Private Limited, Delhi India Horowitz and Sahani, Fundamentals of Data Structures, Galgotia Publications Pvt Ltd Delhi India.
- Lipschutz, Data Structures Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd.
- Thareja, Data Structure Using C Oxford Higher Education.
- AK Sharma, Data Structure Using C, Pearson Education India.
- Rajesh K. Shukla, Data Structure Using C and C++ Wiley Dreamtech Publication.
- Michael T. Goodrich, Roberto Tamassia, David M. Mount Data Structures and Algorithms in C++,
- Wiley India. P. S. Deshpandey, C and Data structure, Wiley Dreamtech Publication.
- R. Kruse etal, Data Structures and Program Design in C, Pearson Education.
- Berztiss, AT: Data structures, Theory and Practice, Academic Press.
- Jean Paul Trembley and Paul G. Sorenson, An Introduction to Data Structures with applications,
- McGraw Hill. Adam Drozdek Data Structures and Algorithm in Java, Cengage Learning.
For detail syllabus of all other subjects of B.Tech It, 2019-20 scheme do visit It 3rd Sem syllabus for 2019-20 scheme.
Don’t forget to download iStudy for the latest syllabus, results, class timetable and more.