What is a Data Structure? Explain the types of Data Structures.
[3 marks]Differentiate between LIFO and FIFO data structures with suitable examples.
[4 marks]What do you mean by the time complexity of an algorithm? Write an algorithm to perform binary search operation on an array.
[7 marks]Explain the advantages of a circular queue over a simple queue.
[3 marks]Write an algorithm to concatenate string1 and string2, and store the result in string3.
[4 marks]Write a Cprogram to compare two strings and check whether they are equal or not.
[7 marks]Write a Cprogram to count the number of nodes in a singly linked list.
[7 marks]What is a stack overflow condition? How to check stack overflow condition in algorithm?
[3 marks]Explain the formula for finding address of an element in 1-d and 2-d array with the help of example.
[4 marks]Is a stack a linear or non-linear data structure? Write a program to perform push and pop operations on a stack using an array.
[7 marks]What is dynamic memory allocation in Data Structures? Explain how it helps in managing memory efficiently.
[3 marks]Write a Cprogram to copy one string into another string.
[4 marks]What is a queue? Write an algorithm for insertion and deletion operations on a queue.
[7 marks]Explain the types and structure of all types of linked lists along with their advantages and disadvantages. Page 1 of
[3 marks]What do you mean by collision in hashing? Explain the linear probing collision resolution technique with an example.
[4 marks]Write algorithms to insert and delete a node at the beginning of a singly linked list.
[7 marks]How do you delete a node from a Binary Search Tree (BST) if the node has two children? Explain with a simple example.
[3 marks]What is hashing? Explain any three hashing techniques with proper examples.
[4 marks]Write algorithms to insert and delete a node at the beginning of a doubly linked list.
[7 marks]Construct a Binary Search Tree (BST) for the following sequence. 50, 30, 70, 20, 40, 60, 80, 10, 25, 35, 45, 55, 65, 75, 90
[3 marks]Answer the following in short: i. Which node has its outdegree as zero in a tree? ii. If two trees have the same structure but different contents, are they called similar binary trees or copies of binary trees? iii. What do you mean by a forest tree? iv. True or False: In a binary tree, every node must have two children.
[4 marks]Write an algorithm for merge sort to sort an array.
[7 marks]Find the Inorder, Preorder, and Postorder traversals for the binary tree given below: Page 2 of
[3 marks]Answer the following in short. i. How many passes does Bubble Sort require to sort 'n' elements? ii. Which sorting algorithm is considered the best and why? iii. What do you mean by a pivot element? iv. To sort an array that contains only numbers, how many pockets/ bins are required in Radix Sort?
[4 marks]Write an algorithm for Quick sort to sort an array. Page 3 of
[3 marks]