COURSE SUMMARY
Course Title: 
Data Structures and Algorithms Lab
Course Code: 
18CSA283
Year Taught: 
2018
Semester: 
3
Degree: 
Undergraduate (UG)
School: 
School of Engineering
Campus: 
Amritapuri

'Data Structures and Algorithms Lab' is a course offered in the third semester of B. C. A. (Bachelor of Computer Applications) program at School of Engineering, Amrita Vishwa Vidyapeetham, Amritapuri.

Topic 1: Sorting – Searching

  • Write a program to implement Bubble Sort.
  • Write a program to implement selection sort.
  • Write a program to implement Quick Sort.
  • Write a program to implement Insertion Sort.
  • Write a program to implement Merge Sort.
  • Write a program to implement Binary Search.

Topic 2: Arrays –Stacks-Recursion

  • Write and test a function that transposes a square matrix.
  • Write and test a recursive function that prints all the permutations of the first n characters of a string.
  • Write and test a recursive function that returns the power xn
  • Write a program to implement a stack of strings (illustrate the operations push (), pop(), size(), empty() and top()).
  • Write a program to show the linked implementation of the Stack class.
  • Write a program to covert infix to postfix.
  • Write a program to implement Towers of Hanoi using Stack. Queues-Linked-Lists
  • Write a program to implement a linear list and perform the operation such as insert(), search() and delete().
  • Write a program to implement a queue by adding the functions such as (i) Determine the size (ii) input queue (iii) output a queue (iv) split a queue into two queues
  • Write a program to search a circular linked list with a header node.

Topic 3: Binary Trees - Binary Tree Traversal

  • Write a program to implement Binary Search Tree.
  • Priority queue implementation.
  • Write a program to create a binary tree and find the height of a binary tree.
  • Write a program to perform the binary tree traversals.
  • Write a program to perform a deletion from a Binary Tree (using a delete () function).

Topic 4: Graphs 20. Matrix representation of graphs

  • DFS traversal 22. BFS traversal