Data Structures MCQs

Multiple Choice Questions 33 Pages

Mahatma Gandhi University

BSc Computer Science

MPC

Contributed by

Manpreet Prasad Chaudhuri

DATA STRUCTURES
For Off Campus BSc Computer Science Programme

UNIT 1

1. Theoretical computer science refers to the collection of such topics that focus on
the__________, as well as mathematical aspects of computing.
A. Abstract
B. Logical
C. Both (a) and (b)
D. None of the above
2.___________ is neither an algorithm nor a program:
A. Computing
B. Pseudo code
C. Computer science
D. None of the above
3. ________ is an art of expressing a program in simple English that parallels the forms of a
computer language:
A. Computing
B. Pseudo code
C. Computer science
D. None of the above
4. A main procedural program contains modules. These modules are also called____________.
A. Packages
B. Units
C. Both (a) and (b)
D. None of the above
5. Programming languages are the tools that allow communicating between__________-:
A. Developer
B. Computer
C. Developer and data
D. Both (a) and (b)
6. The computer languages allow solving real-world problems in the ________of the real world.
A. Context
Page 1
B. Language
C. Both (a) and (b)
D. None of the above
7. The concepts in programming languages are essential knowledge to anyone who wants to
become skilled in_________________.

A. Computer programming
B. Data structures
C. Decoding
D. None of the above
8. What is a set of steps for carrying out a specific task called?
A. Programming
B. Source code
C. Data packages
D. Algorithm
9. A real world example of an algorithm would be a___________.
A. Recipe
B. Unit
C. Food item
D. None of the above
10. The actual text used to write the instructions for a computer program is called
a_______________.
A. Source code
B. Compiler
C. Both (a) and (b)
D. Algorithm
11. A compiler is a software tool that translates ___________that the computer can understand.
A. Algorithm into data
B. Source code into data
C. Computer language into data
D. None of the above
12. The object code is then passed through a program called a ___________ which turns it into
an executable program.
A. Integer
B. Source code
C. Linker
Page 2
D. None of the above
13. Data type is the classification of pieces of information in a____________.
A. Linker
B. Code
C. Program
D. None of the above
14. ____________ is a container that represents a value in a program.
A. Compiler
B. Variable
C. Data type
D. None of the above
15. To distinguish between different data types, a computer uses special__________.
A. Internal codes
B. External codes
C. Compilers
D. None of the above
16. ____________is the same thing as a variable with one major difference. the value of a
constant does not change, while the value of a variable can change throughout a program.
A. Variable
B. Conditional
C. Constant
D. None of the above
17. Array is a special type of variable used in many programming languages, such as_________.
A. C
B. C++
C. Java
D. All of the above
18. What is a segment of code that executes repeatedly based on a certain condition?
A. Function
B. Array
C. Loop
D. None of the above
19. What is defined as a set of code used to carry out specific tasks?
A. Function
Page 3
B. Class
C. Loop
D. None of the above
20. What is used for a real world object that is to be used in a program?
A. Program
B. Template
C. Car class
D. None of the above
21. ________ is object oriented programming language that uses virtual functions, multiple
inheritance, exception handling, polymorphism, etc.
A. C++
B. C
C. GUI
D. None of the above
22. C++ provides comprehensive coverage of abstract classes, such as___________-.
A. Interfaces
B. Regular error handling, standard strings
C. I/O strings
D. All of the above
23. Making a selection of a choice from two alternatives of a group of alternatives refers
to___________.
A. Selection
B. Transfer of control
C. Both (a) and (b)
D. None of the above
24. Which model is used to organize data in the main memory is called data structure?
A. Logical
B. Mathematical
C. Debugging
D. All of the above
25. An index or subscript is a _________ integer value, which indicates the position of a
particular element in the array.
A. Negative
B. Positive
C. Plain
Page 4
D. Both (a) and (b)
26. In which languages, the smallest subscript value is 1 and the largest subscript value is n.
A. C
B. C++ 12423
C. BASIC, PASCAL and FORTRAN
D. Java
27. A linked list is a linear collection of similar data elements called_________.
A. Subscript
B. Index
C. Nodes
D. Null
28. A ________is a linear list of data elements in which the addition of a new element or the
deletion of an element occurs only at one end.
A. Top
B. Push and pop
C. Stack
D. None of the above
29. The hierarchical relationship between data elements can be easily represented using a
nonlinear
data structure called_______.
A. Tree
B. Root node
C. Child nodes
D. None of the above
30. What is the process of finding the location of a given data element in the data structure
called?
A. Deletion
B. Insertion
C. Traversing
D. Searching

Page 5
UNIT -2

31. Who should know about the basic algorithmic toolbox structures that allow efficient
organization and retrieval of data frequently used algorithms and basic techniques for modeling,
understanding and solving algorithmic problems?
A. Computer scientist
B. Professional programmers
C. Both (a) and (b)
D. None of the above
32. Algorithms are at the heart of every non-trivial computer application and also a modern and
active area of ____________-.
A. Programming
B. Computer processing
C. Computer science
D. None of the above
33. Operations performed on scalar quantities are termed simple, while operations on vector data
normally termed as_______.
A. Complex
B. Not very complex
C. Simple
D. None of the above
34. An algorithm may have __________‘inputs’ quantities.
A. One or more
B. Zero or more
C. Two or more
D. None of the above
35.___________ refers to a finite set of steps, which, when followed, solves a particular
problem.
A. Algorithm
B. Finiteness
C. Output
Page 6
D. None of the above
36. The two main resources that we consider for an algorithm are__________.
A. Memory space and processor time
B. Space complexity and time complexity
C. Input and output properties
D. None of the above
37. Space complexity of an algorithm is the maximum amount of _______ required by it during
execution.
A. Time
B. Operations
C. Memory space
D. None of the above
38. Frequently, the memory space required by an algorithm is a multiple of the size of input.
State if the statement is True or False or Maybe.
A. True
B. False
C. Maybe
D. None of the above
39. In which algorithm, the number of times comparison to be done is also affected by the
location of the value to be searched in the list?
A. Search
B. Space efficient
C. Searching
D. None of the above
40. For many problems such as sorting, there are many choices of algorithms to use, some
of which are extremely___________.
A. Space efficient
B. Time efficient
C. Both (a) and (b)
D. None of the above
41. In the analysis of algorithms, what plays an important role?
A. Analysis
B. Growth factor
C. Time
D. None of the above
Page 7
42. An algorithm performs lesser number of operations when the size of input is small, but
performs more operations when the size of input gets larger. State if the statement is True or
False or Maybe.
A. True
B. False
C. Maybe
D. None of the above

43.________________ is a powerful technique which is used to invoke a function.
A. Computing
B. Recursion
C. Big Oh Ο (f)
D. None of the above
44. A function, which invokes itself repeatedly until some condition is satisfied, is called
a_________.
A. Recursive function
B. Big Theta θ(f)
C. Big Omega Ω(f)
D. None of the above
45. The number of recursive calls is limited to the _____ of the stack.
A. Time
B. Ability
C. Quality
D. Size
46. ___________functions, which invoke (call) each other, are called mutually recursive
functions.
A. Two or more
B. One or more
C. Three or more
D. None of the above
47. For certain problems, a recursive solution is ____________as in the case of factorial of a
number:
A. Straightforward
B. Single
C. Both (a) and (b)
D. None of the above
Page 8
48. A recursive function is often less efficient compared to an iterative function. But it is
more________.
A. Elegant
B. Complex
C. Simple
D. None of the above
49. An iterative function is preferred when its recursive equivalent is__________.
A. Complex
B. Simple
C. Efficient
D. None of the above
50. What is a good approach to remove recursion from an algorithm?
A. Recursion
B. Stack implementation
C. Regressive
D. None of the above
51. To verify whether a function grows faster or slower than the other function, we have some
asymptotic or mathematical notations, which is_________.
A. Big Omega Ω (f)
B. Big Theta θ (f)
C. Big Oh O (f)
D. All of the above
52. A subroutine can be coded so that it may call itself recursively, at___________, in order to
perform its task.
A. One or more places
B. Two or more places
C. More places
D. None of the above
53. A function in which f(n) is Ω(g(n)), if there exist positive values k and c such that f(n)>=
c*g(n), for all n>=k. This notation defines a lower bound for a function f(n):
A. Big Omega Ω (f)
B. Big Theta θ (f)
C. Big Oh O (f)
D. None of the above
Page 9
54. An algorithm that indicates the amount of temporary storage required for running the
algorithm, i.e., the amount of memory needed by the algorithm to run to completion is termed
as_____.
A. Space complexity
B. Big Theta θ (f)
C. Big Oh O (f)
D. None of the above
55. The amount of time the computer needs to run to completion is known as_____:
A. Space complexity
B. Time complexity
C. Recursive function
D. None of the above
56. How many important properties (features) of algorithm are there?
A. Three
B. Five
C. Two
D. None of the above
57. ___________algorithm is one which utilizes minimum processor time and requires minimum
memory space during its execution.
A. Best
B. Efficient
C. Both (a) and (b)
D. None of the above
58. In simple terms, we can say that an algorithm is a step-by-step procedure for performing
some task in a finite amount of time. State if the statement is true or false.
A. False
B. True
C. Maybe
D. None of the above
59. Each operation must have a definite meaning and it must be perfectly clear. All steps of an
algorithm need to be precisely defined. The actions to be executed in each case should be
_____________.
A. Rigorously specified
B. Clearly specified
C. Both (a) and (b)
D. None of the above
60. In general, a problem may be defined as a state of thing that is not in the___________.
Page 10

Data Structures MCQs

Data Structures MCQs

Download this file to view remaining 23 pages