UNIQUE SERIES AKTU Syllabus
BCS351BCS351H

Data Structure Lab

L-T-P0-0-2 Credits1 Session2023-24 TypeLab / Practical
Appears in 14 semesters · 14 branches

B.Tech Computer Science & Engineering · Sem 3 (Lab, code BCS351) · B.Tech Information Technology · Sem 3 (Lab, code BCS351) · B.Tech Artificial Intelligence & Machine Learning · Sem 3 (Lab, code BCS351) · B.Tech Artificial Intelligence & Data Science · Sem 3 (Lab, code BCS351) · B.Tech CSE (Artificial Intelligence) · Sem 3 (Lab, code BCS351) · B.Tech CSE (AI & ML) · Sem 3 (Lab, code BCS351) · B.Tech CSE (Data Science) · Sem 3 (Lab, code BCS351) · B.Tech CSE (Cyber Security) · Sem 3 (Lab, code BCS351) · B.Tech CSE (Internet of Things) · Sem 3 (Lab, code BCS351) · B.Tech Computer Science & Design · Sem 3 (Lab, code BCS351) · B.Tech Computer Science (Hindi) · Sem 3 (Lab, code BCS351H) · B.Tech Computer Science & Business Systems · Sem 3 (Lab, code BCS351) · B.Tech Cyber Security · Sem 3 (Lab, code BCS351) · B.Tech Data Science · Sem 3 (Lab, code BCS351)

Download PDF

List of Experiments / Activities

  1. List of Experiments (Indicative & not limited to)
  2. 1Implementing Sorting Techniques: Bubble Sort, Insertion Sort, Selection Sort, Shell , Sort, Radix Sort, Quick sort
  3. 2Implementing Searching and Hashing Techniques: Linear search, Binary search, Methods for Hashing: Modulo Division, Digit Extraction, Fold shift, Fold Boundary, Linear Probe for Collision Resolution. Direct and Subtraction hashing
  4. 3Implementing Stacks: Array implementation, Linked List implementation, Evaluation of postfix expression and balancing of parenthesis , Conversion of infix notation to postfix notation
  5. 4Implementing Queue: Linked List implementation of ordinary queue, Array implementation of circular queue, Linked List implementation of priority queue, Double ended queue
  6. 5Implementing Linked List: Singly Linked Lists, Circular Linked List, Doubly Linked Lists : Insert, Display, Delete, Search, Count, Reverse(SLL), Polynomial , Addition , Comparative study of arrays and linked list
  7. 6Implementing Trees: Binary search tree : Create, Recursive traversal: preorder, post order, in order, Search Largest , Node, Smallest Node, Count number of nodes, Heap: Min Heap, Max Heap: reheap Up, reheap Down, Delete , Expression Tree, Heapsort
  8. 7Implementing Graphs: Represent a graph using the Adjacency Matrix, BFS, Find the minimum spanning tree (using any method Kruskal’s Algorithm or Prim’s Algorithm) Self Learning Topics : Shortest Path Algorithm

Official AKTU syllabus

This subject is on page 8 of the original AKTU PDF.

Official AKTU syllabus PDF ↗