Basics Data Structure & Algorithms detail syllabus for Food Technology (FT), 2019-20 scheme is taken from AKTU official website and presented for AKTU students. The course code (KOE045), 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 ft 4th sem syllabus for b.tech 2019-20 scheme aktu you can visit FT 4th Sem syllabus for B.Tech 2019-20 Scheme AKTU Subjects. For all the other Select Subject-3 subjects do refer to Select Subject-3. The detail syllabus for basics data structure & algorithms is as follows.
Unit I
Introduction to data structure and Algorithms: Performance analysis of Algorithm, time complexity, Big-oh notation, Elementary data organization data structure operations, Recurrences, Arrays, Operation on arrays, representation of arrays in memory, single dimensional and multidimensional arrays, spare matrices, Character storing in C, String operations.
Unit II
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 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
Graphs: Terminology & representations, Graphs & Multigraphs, Directed Graphs, Sequential representation of graphs, adjacency Matrices, Transversal, connected component and spanning trees, Minimum Cost spanning tree, Prims and Kruskal Algorithm, BFS, DFS, Shortest path and transitive closure, Activity networks, topological sort and critical paths.
Unit V
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.
Course Outcomes:
- 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.
Reference 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 Ft, 2019-20 regulation do visit Ft 4th Sem syllabus for 2019-20 Regulation.
Dont forget to download iStudy for latest syllabus, results, class timetable and more.