As you Asking for the Syllabus of the West Bengal University of Technology B,tech Computer Science Syllabus Data Structure and Algorithm the Syllabus is as Follow


Data Structure and Algorithm

Introduction (2L):
Why we need data structure?
Concepts of data structures: a) Data and data structure b) Abstract Data Type and Data Type. Algorithms and programs, basic idea of pseudo-code.
Algorithm efficiency and analysis, time and space analysis of algorithms – order notations.

Array (2L):
Different representations – row major, column major.
Sparse matrix - its implementation and usage. Arrayrepresentation of polynomials.

Linked List (4L):
Singly linked list, circular linked list, doubly linked list, linked list representation of polynomialand applications. Module -II: [7L] Linear Data Structure

[Stack and Queue (5L):
Stack and its implementations (using array, using linked list), applications.
Queue, circular queue, dequeue. Implementation of queue- both linear and circular (using array, using linked list),
applications.

Recursion (2L):
Principles of recursion – use of stack, differencesbetween recursion and iteration, tail recursion. Applications - The Tower of Hanoi, Eight Queens Puzzle.

Module -III. [15L] Nonlinear Data structures
Trees (9L):
Basic terminologies, forest, tree representation (using array, using linked list).
Binary trees - binary tree traversal (pre-, in-, post- order), threaded binary tree (left, right, full) - non-recursive traversal algorithms using threaded binary tree, expression tree. Binary search tree- operations (creation, insertion, deletion, searching).
Height balanced binary tree – AVL tree (insertion, deletion with examples only).

B- Trees – operations (insertion, deletion with examples only).
Graphs (6L):
Graph definitions and concepts (directed/undirected graph, weighted/un-weighted edges, sub-graph, degree, cutvertex/articulation point, pendant node, clique, complete graph, connected components – strongly connected
component, weakly connected component, path, shortest path, isomorphism).
Graph representations/storage implementations – adjacency matrix, adjacency list, adjacency multi-list.

Graph traversal and connectivity – Depth-first search (DFS), Breadth-first search (BFS) – concepts of edges used in
DFS and BFS (tree-edge, back-edge, cross-edge, forward-edge), applications.
Minimal spanning tree – Prim’s algorithm (basic idea of greedy methods).

Module - IV. Searching, Sorting (10L):
Sorting Algorithms (5L): Bubble sort and its optimizations, insertion sort, shell sort, selection sort, merge sort, quick
sort, heap sort (concept of max heap, application –priority queue), radix sort.
Searching (2L): Sequential search, binary search, interpolation search.
Hashing (3L):Hashing functions, collision resolution techniques.


For any Queries you may contact to the West Bengal University of Technology the contact details are as Follow

Contact details
West Bengal University of Technology
Address: BF 142, Sector 1, Salt Lake City, Kolkata, West Bengal 700064
Phone: 033 2321 1327