Data Structure & Algorithm

Data Structures & Algorithms : 4L-0T-2P5 credits:

DATA Structure (CSE-305) by Vijay Bhaskar Semwal

Students can refer the all the question paper and study material form here:

Overview: The aim of the course is to provide students with a grasp of the principles of the fundamental data structures used in modern software.

Syllabus.

Prerequisite: Linear Algebra, C programming & Algorithm and Procedure.

The Course is divided into four modules:

Module-01:

  • Asymptotically Analysis of different Algorithm, Polynomially large and small function.
  • Recursion & Iteration, Master theorem, Arrays ( 1D,2D,3D), stacks, queues and linked lists.
  • Solvable & unsolvable, P, NP, NP Hard, NP complete problem,Seven Bridge of Konigsberg.
  • SVM and eigenvalue for fibonacci series, simplex method, gradient descent and ascent.

Module-02:Sorting:

  • Stable & Unstable, Inplace and not in place sorting
  • Merge, quick.
  • Insertion,.
  • radix & bucket sort.
  • selection and heap sort.

Module-03:Trees:

  • Traversals, binary search trees,
  • balanced binary search trees( AVL, Red& Black),
  • Priority queues and binary heaps.

Module-04:Dictionaries:

  • Skip-lists, hashing,
  • analysis of collision resolution techniques.

Module-05: Graph Theory:

  • Breadth-first search and connected components
  • Depth-first search in directed and undirected graphs,.
  • Dijkstra's Algorithm Single Source Shortest Path.
  • Prism and kruskal for Minimum spanning tree.
  • Bellman–Ford algorithm .

Module-06:

  • Union-find data structure and applications(Detection of Cycle in graph).
  • Directed acyclic graphs and topological.
  • Applications to discrete event simulation, sort.

Textbooks

Thomas H. Cormen et al. Introduction to Algorithms. 3rd ed. The MIT Press, 2009. isbn: 978-0-26203384-8. url: http://citc.ui.ac.ir/zamani/clrs.pdf.


Video Lectures :