Differentiate Primitive and Non Primitive Data Structures
[3 marks]Derive basic operation of stack and write Cfunction to implement it.
[4 marks]Explain Row Major and Column Major with Example.
[7 marks]What is Sparse Matrix?
[3 marks]Translate infix expression into its equivalent post fix expression: A*(B+D)/E-F*(G+H/K)
[4 marks]Write a program to implement Circular queue and show how it differ from normal queue?
[7 marks]Explain the concept of Reverse Polish Notation (RPN) and describe the process for evaluating an RPN expression using a stack. Provide a detailed example of evaluating the following RPN expression: 5 1 2 + * + 3 -
[4 marks]Write an algorithm for Bubble sort.
[3 marks]Sort 20,35,40,100,3,10,15 using insertion sort. Show all passes.
[4 marks]Compare and contrast Depth First Search (DFS) and Breadth First Search (BFS) in terms of their algorithms, uses, and performance.
[7 marks]Write an algorithm for Merge Sort.
[3 marks]Sort the given values using Quick Sort? 65, 70, 75, 80, 85, 60, 55, 50, 45. Show all passes.
[4 marks]Describe the concept of hashing and explain different collision resolution techniques, including separate chaining and open addressing. Illustrate how each technique works with examples.
[7 marks]Define Graph and list any 3 uses of graph.
[3 marks]How to prove array is sequential and contiguous?
[4 marks]Explain the concept of a graph and its representations. Compare adjacency matrix and adjacency list representations in terms of space complexity and use cases.
[7 marks]List any three uses of linked list.
[3 marks]Write an algorithm to delete next element from doubly linked list from given position,
[4 marks]Write an algorithm to implement singly linked list and its operation such as insert element at front, last and at any position.
[7 marks]What is priority queue?
[3 marks]Write an algorithm to implement queue using Linked List.
[4 marks]Explain the concept of a binary search tree (BST) and its properties. Discuss how operations such as insertion, deletion, and searching are performed in a BST.
[7 marks]Define (1) Forest (2) Leaf Node (3) Tree
[3 marks]Construct tree from Following In order Traversal: D, B, E, A, F, C Pre order Traversal: A, B, D, E, C, F
[4 marks]Discuss the key concepts and techniques of AVL trees and 2-3 trees, focusing on their balance mechanisms and the impact on performance. Provide examples of insertions and deletions to illustrate how these trees maintain balance.
[7 marks]