175
86.4k

340+ Data Structure and Algorithms (DSA) Solved MCQs

These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Electronics and Communication Engineering , Common Topics in Competitive and Entrance exams .

1.

It exports a set of operations

A. true, false
B. false, true
C. true, true
D. false, false
Answer» C. true, true
2.

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

A. true, false, true
B. true, true, false
C. true, true, true
D. false, true, true
Answer» B. true, true, false
3.

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

A. a-iii, b-ii, c-i
B. a-i, b-ii, c-iii
C. a-iii, b-i, c-ii
D. a-i, b-iii, c-ii
Answer» C. a-iii, b-i, c-ii
4.

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

A. true, false
B. false, true
C. false, false
D. true, true
Answer» D. true, true
5.

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

A. true, true
B. false, true
C. false, false
D. true, false
Answer» A. true, true
6.

To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

A. i-only
B. ii-only
C. both i and ii
D. none of both
Answer» C. both i and ii
7.

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

A. true, true
B. true, false
C. false, true
D. false, false
Answer» C. false, true
8.

A node is child node if out degree is one.

A. true, true
B. true, false
C. false, true
D. false, false
Answer» B. true, false
9.

Insertion b) Deletion c) Retrieval d) Traversal

A. only a,b and c
B. only a and b
C. all of the above
D. none of the above
Answer» D. none of the above
10.

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

A. true, false
B. false, true
C. true, true
D. false, false
Answer» C. true, true
11.

The complexity of the average case of an algorithm is

A. much more complicated to analyze than that of worst case
B. much more simpler to analyze than that of worst case
C. sometimes more complicated and some other times simpler than that of worst case
D. none or above
Answer» A. much more complicated to analyze than that of worst case
12.

The Average case occur in linear search algorithm

A. when item is somewhere in the middle of the array
B. when item is not in the array at all
C. when item is the last element in the array
D. when item is the last element in the array or is not there at all
Answer» A. when item is somewhere in the middle of the array
13.

Which of the following case does not exist in complexity theory

A. best case
B. worst case
C. average case
D. null case
Answer» D. null case
14.

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

A. counting the maximum memory needed by the algorithm
B. counting the minimum memory needed by the algorithm
C. counting the average memory needed by the algorithm
D. counting the maximum disk space needed by the algorithm
Answer» A. counting the maximum memory needed by the algorithm
15.

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

A. counting microseconds
B. counting the number of key operations
C. counting the number of statements
D. counting the kilobytes of algorithm
Answer» B. counting the number of key operations
16.

Two main measures for the efficiency of an algorithm are

A. processor and memory
B. complexity and capacity
C. time and space
D. data and space
Answer» C. time and space
17.

Computers are used for processing numerical data called _______ data.

A. float
B. local
C. character
D. non-local
Answer» C. character
18.

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

A. character
B. integer
C. float
D. numeric
Answer» A. character
19.

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

A. array
B. list
C. string
D. block
Answer» C. string
20.

String with zero characters is called ________ string.

A. null
B. binary
C. totalled
D. list
Answer» A. null
21.

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

A. memory addressable
B. byte addressable
C. bit
D. byte
Answer» B. byte addressable
22.

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

A. main strings
B. substring
C. index
D. block
Answer» B. substring
23.

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

A. length
B. breath
C. width
D. none
Answer» A. length
24.

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

A. insertion
B. deletion
C. searching
D. replacement
Answer» D. replacement
25.

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

A. pattern matching
B. searching
C. sorting
D. deletion
Answer» A. pattern matching
26.

________ is a linearly ordered sequence of memory cells.

A. node
B. link
C. variable
D. null
Answer» A. node
27.

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

A. node
B. link
C. variable
D. null
Answer» B. link
28.

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

A. dynamic
B. static
C. semi static
D. global
Answer» C. semi static
29.

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.

A. fixed length
B. linked list
C. variable length
D. sequential
Answer» B. linked list
30.

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

A. insertion
B. deletion
C. concatenation
D. replacement
Answer» C. concatenation
31.

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

A. dynamic
B. static
C. semi static
D. global
Answer» A. dynamic
32.

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

A. linked list
B. array
C. pointer
D. stack
Answer» B. array
33.

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

A. linear array
B. pointer
C. linked list
D. tree
Answer» A. linear array
34.

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

A. upper bound
B. lower bound
C. size
D. variable
Answer» C. size
35.

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

A. size
B. index
C. variable
D. constant
Answer» B. index
36.

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

A. name of the array
B. data type of the array
C. index set of the array
D. length of the array
Answer» D. length of the array
37.

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

A. dynamically
B. statically
C. successively
D. alternatively
Answer» B. statically
38.

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

A. deleting
B. inserting
C. traversing
D. searching
Answer» C. traversing
39.

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

A. searching
B. sorting
C. traversing
D. inserting
Answer» B. sorting
40.

Two dimensional arrays are sometimes called _______ arrays.

A. integer
B. boolean
C. matrix
D. real
Answer» C. matrix
41.

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

A. ordered list
B. indexed list
C. sequential list
D. unordered list
Answer» C. sequential list
42.

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

A. row-major
B. row
C. column-major
D. column
Answer» A. row-major
43.

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

A. triangular
B. diagonal
C. sparse
D. adjacency
Answer» C. sparse
44.

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

A. one dimensional
B. parallel
C. two dimensional
D. static
Answer» B. parallel
45.

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

A. dynamic
B. static
C. simple
D. parallel
Answer» A. dynamic
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.

A. triangular
B. tridiagonal
C. sparse
D. simple
Answer» C. sparse
47.

Elements of of an arrays are accessed by

A. accessing fuction in built in data structure
B. mathematical fuction
C. index
D. none of the above
Answer» C. index
48.

Array is a

A. index data structure
B. non liturenear data structure
C. complx data structure
D. none of the above
Answer» D. none of the above
49.

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

A. all elements of a row are stored in memory in sequence followed by next row in sequence,and so on
B. all elements of row are stored in memory in sequence followed by next column in sequence ,and so on
C. all elements of row are stored in memory in sequence followed by next column in sequence
D. none of the above
Answer» A. all elements of a row are stored in memory in sequence followed by next row in sequence,and so on
50.

Array is

A. data in physical order
B. data in logical order
C. both a& b
D. none of the above
Answer» A. data in physical order

Done Studing? Take A Test.

Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.