Data structure MCQ Quiz Hub

Data Structure and Algorithms (DSA) set 1

Choose a topic to test your knowledge and improve your Data structure skills

1. It exports a set of operations




2. A graph is said to be complete if there is no edge between every pair of vertices.




3. Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.




4. The time complexity of binary search is O(logn).




5. A graph is said to be complete if there is an edge between every pair of vertices.




6. Nodes that are not root and not leaf are called as internal nodes.




7. A node is child node if out degree is one.




8. Insertion b) Deletion c) Retrieval d) Traversal




9. In strictly binary tree, the out-degree of every node is either o or 2.




10. The complexity of the average case of an algorithm is




11. The Average case occur in linear search algorithm




12. Which of the following case does not exist in complexity theory




13. The space factor when determining the efficiency of algorithm is measured by




14. The time factor when determining the efficiency of algorithm is measured by




15. Computers are used for processing numerical data called _______ data.




16. Each programming language contains a ______ set that is used to communicate with the computer.




17. Finite sequence S of zero or more characters is called _______.




18. String with zero characters is called ________ string.




19. A computer which can access an individual byte is called a ________ machine.




20. Groups of consecutive elements in a string, such as words, phrases and sentences are called ________.




21. The number of characters in a string is called its ______.




22. ______ operation of word processing involves replacing one string in the text by another.




23. _______ is the problem of deciding whether or not a given String pattern P appears in a text T.




24. _____ is a linearly ordered sequence of memory cells.




25. Each node in a linear list contains an item called _______ which points to the next node in the list.




26. ____ is a variable whose length may vary during the execution, but the length cannot exceed a maximum values defined before the program is executed.




27. In _______ storage, each cell is divided into two parts---- the path stores a single character, while the second part contains the address of the cell containing the next character.




28. If string 1 = John, and string 2 = Rivers are merged, the process is called ----




29. _____ is a variable whose length may vary during the execution of a program.




30. _____ is a structure used to represent the linear relationship between elements by means of sequential memory locations.




31. A ______ is a list of a finite number of homogeneous data elements.




32. The number of elements n is called the length or _____ of the array.




33. The number K in A[K] is called the subscript or the ________.




34. Which of the following items are not part of the array declaration?




35. Programming languages like FORTRAN and PASCAL allocate memory space for arrays ______




36. The process of accessing and processing each element of an array A, exactly once is called _______.




37. ______ refers to the operations of rearranging the elements of an array A so that they are in increasing order.




38. Two dimensional arrays are sometimes called _______ arrays.




39. ______ is a list in which the order of the items is significant, and the items are not necessarily sorted.




40. Representation of a two dimensional as one single column of rows and mapping it sequentially is called _______ representation.




41. Matrices with relatively high proportion of zero entries are called ______ matrices.




42. _____ arrays are where the elements in the different arrays with the same subscript belongs to the same record.




43. ____ arrays are where the elements in the different arrays with the same subscript belongs to the same record.




44. Records can be stored in an area of memory called _______ memory.




45. Records can be stored in an area of memory called _______ memory.




46. A matrix in which non-zero entries can only occur on the diagonal or on elements immediately above or below the diagonal, is called ______ matrix.




47. Elements of of an arrays are accessed by




48. Array is a




49. Row -major order in two -dimentional array refers to an arrangement where




50. Array is