Basics Data Structure & Algorithms detail syllabus for Manufacturing Technology (MT), 2019-20 scheme is taken from AKTU official website and presented for AKTU students. The course code (KOE035), and for exam duration, Teaching Hr/Week, Practical Hr/Week, Total Marks, internal marks, theory marks, and credits do visit complete sem subjects post given below.
For all the other mt 3rd sem syllabus for b.tech 2019-20 scheme aktu you can visit MT 3rd Sem syllabus for B.Tech 2019-20 Scheme AKTU Subjects. For all the other Select Subject-1 subjects do refer to Select Subject-1. The detail syllabus for basics data structure & algorithms is as follows.
Course Outcomes:
At the end of course, the student will be able to understand:
- Understand and analyze the time and space complexity of an algorithm.
- Understand and implement fundamental algorithms (including sorting algorithms, graph algorithms, and dynamic programming).
- Discuss various algorithm design techniques for developing algorithms.
- Discuss various searching, sorting and graph traversal algorithms.
- Understand operation on Queue, Priority Queue, D-Queue.
Unit I
For complete syllabus, results, class timetable and more kindly download iStudy. It is a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.
Unit II
Stack And Queue and Link List: Stack operation, PUSH and POP, Array representation of stacks, Operation associated with stacks Application of stacks, Recursion, Polish experession, Representation Queue, operation on Queue, Priority Queue, D-Queue, Singly and circularly linked list, List operations Lists implementations.
Unit III
Trees: Basic terminology, Binary Trees, Binary tree representation, Algebraic/expressions, Complete Binary Trees, Extended binary tree, representing binary tress in memory, linked representation of Binary trees, Traversing binary trees & Searching in binary trees, Inserting in binary search trees, Complexity of searching algorithm, Heaps, general trees, Threaded binary tree.
Unit IV
For complete syllabus, results, class timetable and more kindly download iStudy. It is a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.
Unit V
Searching and Sorting: Linear search, binary Search, Internal and External sorting, Bubble sorting, selection sort, Insertion sort, quick sort, Two way merge sort, Heap sort, sorting on different keys, practical consideration for internal sorting, External Sorting.
Storage Devices: Magnetic tapes, Disk Storage, Sorting with disks and Indexing techniques, introduction to B tree and B+ tree, File organization and storage management, Introduction to hoisting.
Text Books:
- Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, Introduction to Algorithms, PHI.
- Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publication.
- Weiss, “Data Structure & Algorithm Analysis in C”, Addision Wesley.
- Basse, “computer Algorithms: Introduction to Design & Analysis”, Addision Wesley.
- Lipschutz, “Data structure, “Schaum series.
- Aho, hopcropt, Ullman, Data Structure & Algorithm”, Addision Wesley.
- Aho, Hopcraft, Ullman, The Design and Analysis of Computer Algorithms Pearson Education, 200.
For the detailed syllabus of all the other subjects of B.Tech Mt, 2019-20 regulation do visit Mt 3rd Sem syllabus for 2019-20 Regulation.
Dont forget to download iStudy for latest syllabus, results, class timetable and more.