Create the adjacency and incidence matrices for the graph above. What are the advantages of using an adjacency matrix over an adjacency list for graph traversal?

Create the adjacency and incidence matrices for the graph above. What are the advantages of using an adjacency matrix over an adjacency list for graph traversal?

Write down the differences between the two algorithms (Name of a) and b)→ what problems the algo solved→ specify their time and space complexity)

Consider the array, A = [12, 45, 23, 67, 34]. Perform the following: a) Find the position of 67 using linear search. Show each comparison. [2 Marks] b) Before performing binary search, sort the array in ascending order. Then find the position of 45 using binary search. Show all steps. [3 Marks]

Write down the reasons of studying data structures in Computer science and engineering. (What data structure means why it helps in CSE Examples)

Define Data Structure. Briefly explain common types of data structures along with their real life applications.

Differentiate between data types and data structures. Provide examples of each.

Why is knowledge of data structures important for computer science students?

Define and explain the concept of an Abstract Data Type (ADT). How does it relate to data structures?

Consider the following data list: A = [10, 13, 18, 20, 23, 26, 28, 30, 48, 67, 89, 98, 101, 107] i) Use binary search to find the element 101. Show step-by-step calculations of the mid index and mention the number of iterations required. ii) Write the pseudocode for binary search.

Consider the array, A = [12, 45, 23, 67, 34]. Perform the following: a) Find the position of 67 using linear search. Show each comparison. [2 Marks] b) Before performing binary search, sort the array in ascending order. Then find the position of 45 using binary search. Show all steps. [3 Marks]

Consider the given binary tree and answer the following questions: a) Perform inorder, preorder, and postorder traversals and show the result. b) If one node is deleted, explain which node will replace it in a complete binary tree.

You are given the following sequence of numbers to insert into a BST: 50, 30, 70, 20, 40, 60, 80 a) Construct the BST. b) Show the steps to search for the key 40. c) If node 30 is deleted, which node will replace it? Justify your answer.

Insert and delete elements in a Binary Search Tree (BST) using the numbers 33, 50, 45, 52, 12, 10. Draw the tree after each operation.

Define complete binary tree. Traverse the given tree using In-order, Preorder and Post-order traversals.

Compare and contrast BSTs and heaps. When would you prefer one over the other?

Consider the array, A = [29, 10, 14, 37, 13]. a) Sort the array using Selection sort. Show all passes. [3 Marks] b) Write Pseudocode or algorithm for bubble sort. [2 Marks]

A hospital uses a queue to manage patient appointments. a) Illustrate how patients are inserted and removed in a linear queue. b) Explain what happens when the queue becomes full but has empty slots at the front (illustrate with an example). c) How does a circular queue solve this problem?

Define and explain the concept of an Abstract Data Type (ADT). How does it relate to data structures?

How can you differentiate hash table from the direct addressing table?

What do you mean by disjoint set data structure? Suppose that CONNECTED- COMPONENTS is run on the undirected graph G=(V,E), where V = { a, b, c, d, e, f, g, h, i, j, k} and the edges of E are processed in the order (d, i), (f, k), (g, i), (b, g), (a, h), (i, j), (d, k), (b, j), (d, f), (g, j), (a, e). List the vertices in each connected component after each iteration of lines 3-5.

Define divide and conquer. How does it apply to Merge Sort and Quick Sort.

Define divide and conquer. A well-known problem in UVA- 374: Big Mod Problem, calculate B^P % M for large B, P and M using an efficient algorithm. Write down the program for calculating the solutions.

Solve the problems Longest Common Subsequence (LCS) using dynamic programming for strings ABCBDAB and BDCAB. Write the DP table and explain the solution.

Draw a graph from the adjacency list: adj (y) = [x], adj (x) = [z], adj (z) = [y, w], adj (w) = [x], adj (s) = [z, w], adj (v) = [s, w], adj (t) = [u, v], adj (u) = [v].

Identify the tree, back, forward, and cross edges for the graph.

What do you mean by MST? Find the MST for the following graph using PRIM'S algorithm. Is prims a Greedy algorithm?

What do you mean by growth of function? Briefly describe the following (a), (b) and (c) of the figure.

Use a hash table of size 7 with separate chaining, linear probing, and double hashing to insert: 19, 26, 13, 48, 17. Show the resulting tables.

How can you differentiate hash table from the direct addressing table?

Compare and contrast BSTs and heaps. When would you prefer one over the other?

Define heap. Write down the heap sort algorithms or program for the heap sort. (heap definition→ why array represented as heap→ write all steps of heap sort algorithms such as parent, left, right, max heapify, build max heap→ finally heap sort)

Define a heap. Represent the heap as an array and perform the following operations: · Insert 25. · Delete 86 and 11 from the heap. . Sort the elements in descending order using Heap Sort.

Write down the algorithm for Insertion Sort and analyze its time complexity in best, average, and worst cases.

Explain the difference between linear data structures and non-linear data structures.

Consider the array, A = [12, 45, 23, 67, 34]. Perform the following: a) Find the position of 67 using linear search. Show each comparison. [2 Marks] b) Before performing binary search, sort the array in ascending order. Then find the position of 45 using binary search. Show all steps. [3 Marks]

Perform insert and delete operations in a Linked List. Illustrate with examples.

Draw a simple diagram of a singly linked list with 5 nodes and indicate the head and tail.

Solve the problems Longest Common Subsequence (LCS) using dynamic programming for strings ABCBDAB and BDCAB. Write the DP table and explain the solution.

Define divide and conquer. How does it apply to Merge Sort and Quick Sort.

What do you mean by MST? Find the MST for the following graph using PRIM'S algorithm. Is prims a Greedy algorithm?

Explain the difference between linear data structures and non-linear data structures.

What do you mean by MST? Find the MST for the following graph using PRIM'S algorithm. Is prims a Greedy algorithm?

Describe how a priority queue can be used to implement: • A FIFO queue. • A stack

A hospital uses a queue to manage patient appointments. a) Illustrate how patients are inserted and removed in a linear queue. b) Explain what happens when the queue becomes full but has empty slots at the front (illustrate with an example). c) How does a circular queue solve this problem?

Implement a queue using two stacks. Analyze the time complexity of enqueue and dequeue operations.

Define divide and conquer. How does it apply to Merge Sort and Quick Sort.

Using Quick Sort, sort the array A = (2, 8, 7, 1, 3, 5, 6, 4). Describe the role of the partition function and how to select the pivot.

What data structure is commonly used to implement recursion? Why?

Consider the array, A = [29, 10, 14, 37, 13]. a) Sort the array using Selection sort. Show all passes. [3 Marks] b) Write Pseudocode or algorithm for bubble sort. [2 Marks]

Sort the following items using the Shell Sort algorithm: {7, 19, 24, 13, 31, 8, 82, 18, 44, 63, 5, 29}

Draw a simple diagram of a singly linked list with 5 nodes and indicate the head and tail.

Write down the differences between the two algorithms (Name of a) and b)→ what problems the algo solved→ specify their time and space complexity)

Write down the algorithm for Insertion Sort and analyze its time complexity in best, average, and worst cases.

What do you mean by stable sorting? Sort the following data <3, 27, 5, 4, 2, 6, 1> with details using an algorithms you like. (Definition of Stable Sorting → Name the sorting you like show all steps with explanation of your desired algorithms using the data.)

Consider a stack implemented using an array with maximum size 5. Initially, the stack is empty. a) Perform the following operations and show the stack after each step: Push(10), Push(20), Push(30), Pop(), Push(40), Pop(), Push(50) [3 Marks] b) Explain how to handle stack overflow and underflow. Give examples for each case. [2 Marks]

Describe how a priority queue can be used to implement: • A FIFO queue. • A stack

Write down the differences between the two algorithms (Name of a) and b)→ what problems the algo solved→ specify their time and space complexity)

Write down the algorithm for Insertion Sort and analyze its time complexity in best, average, and worst cases.

Implement a queue using two stacks. Analyze the time complexity of enqueue and dequeue operations.

Define Data Structure. Briefly explain common types of data structures along with their real life applications.

Write recursive formulas for: • Fibonacci sequence. • GCD calculation. • Tower of Hanoi problem.

For a circular queue with FRONT = 2, REAR = 4, and QUEUE: __, A, C, D, __, __, describe the state after: • Adding F. • Deleting two elements. • Adding K, L, M. • Deleting two elements.

Explain how collision resolution techniques like chaining and double hashing affect performance.

Why do we need postfix and prefix notation over infix notation? Translate the infix notation A*(B+D)/E-F*(G+H/K) to its equivalent postfix notation using stack.

A well renowned UVA Problem: 10334, Suppose we put two panes of glass back-to-back. How many ways an are there for light rays to pass through or be reflected after changing direction n times? Following figure shows the situations when the value of n is 0. 1 and 2. Now your task is to write down the program for input 0, 1, 2: output will be 1, 2, and 3 re Figure for Q-8(a)(ii)

Working Modulo With q = 11, how many spurious hits does Rabin-Karp encounter when looking for pattern, P = 26 in text, T = 3141592653589793? Elaborate your answer.