We Also Provide SYNOPSIS AND PROJECT.
Contact www.kimsharma.co.in for best and lowest cost solution or
Email: solvedstudymaterial@gmail.com
Call: +91 82907-72200 (Call/WhatsApp) or +91 88003-52777 (WhatsApp Only)
Q1. A two-dimensional array defined as a [4…7, -1 …….3] requires 2 bytes of storage space for each element. If the array is stored in row-major form, then calculate the address of element at location a[6,2]. Give the base address is 100.
Q2. Write a C program to implement bubble sort.
Q3. Write a program in C to show PUSH and POP operations in a stack.
Q4. Write the algorithms for the insertion and deletion operations performed on the circular queue.
Q5. What is double linked list? What are the advantage and disadvantage of double linked list ?
Q6. What is a binary search tree? Construct a binary search tree from these numbers – 50, 30, 60, 22, 38, 55, 34.
Q7. Explain the Dijkastra’s Algorithm.
Q8. What do you mean by the Hashing? Explain different method of hashing.
Q1. If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
Q2. What is the binary tree? What are threaded and properties of binary trees?
Q3. What is directed graph? Explain the various types of graph and traversal of directed graph.
1. The memory address of the first element of an array is called
2. memory address of fifth element of an array can be calculated by the formula
3. Which of the following data structures are indexed structures?
4. Which of the following is not the required condition for binary search algorithm?
5. Which of the following is not a limitation of binary search algorithm?
6. Two dimensional arrays are also called
7. A variable P is called pointer if
8. Which of the following data structure can’t store the non-homogeneous data elements?
9. Which of the following data structure store the homogeneous data elements?
10. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
11. The difference between linear array and a record is
12. Which of the following statement is false?
13. Binary search algorithm can not be applied to
14. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
15. The situation when in a linked list START=NULL is
16. Which of the following is two way lists?
17. Which of the following name does not relate to stacks?
18. The term “push” and “pop” is related to the
19. A data structure where elements can be added or removed at either end but not in the middle
20. When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return
21. Value of the first linked list index is________
22. A linked list index is ____ that represents the position of a node in a linked list
23. Why is the constructor of the Queue Linked List class empty?
24. _______ form of access is used to add and remove nodes from a queue
25. ______ form of access is used to add and remove nodes from a stack
26. New nodes are added to the _____ of the queue.
27. A _______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
28. In an array queue, data is stored in an _____ element
29. The pop () member function determines if the stack is empty by calling the _____ member function
30. What happens when you push a new node onto a stack?
31. Which of the following algorithm solves the all – pair shortest path problem?
32. The operation of processing each element in the list is known as
33. To delete a dynamically allocated array named `a`, the correct statement is
34. The memory address of the first element of an array is called
35. Which of the following data structure store the homogeneous data elements?
36. The number of possible binary trees with 4 nodes is
37. Which of the following data structure is not linear data structure?
38. Finding the location of the element with a given value is:
39. Preorder is same as
40. Which of the following is the feature of stack?
We Also Provide SYNOPSIS AND PROJECT.
Contact www.kimsharma.co.in for best and lowest cost solution or
Email: solvedstudymaterial@gmail.com
Call: +91 82907-72200 (Call/WhatsApp) or +91 88003-52777 (WhatsApp Only)