721 + Mcqs in Data Structures McqOptions

1.	Variable which can be accessed by all modules of the program is called as __________.
A.	Global Variable
B.	Static Variable
C.	Auto Variable
D.	Local Variable
Answer» B. Static Variable

Discussion

2.	ADT is called as Abstract because
A.	It is completely independent data type
B.	It is collection of different data types
C.	Implementation Details are hidden
D.	None of these
Answer» D. None of these

Discussion

3.	Term Data Structure refers to _________ and interrelationship between them.
A.	Programming Language Statement
B.	Coding Standards
C.	Organization of data element
D.	None of these
Answer» D. None of these

Discussion

4.	Data must be represented, organized, stored, processed and managed in a way that facilitates_________.
A.	Easy access
B.	Retrieval
C.	Both (a) and (b)
D.	Withdrawal
Answer» D. Withdrawal

Discussion

5.	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
Answer» B. Root node

Discussion

6.	The OS of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called
A.	Concatenation
B.	Garbage collection
C.	Collision
D.	Dynamic Memory Allocation
Answer» C. Collision

Discussion

7.	__________ is a collection of data elements of similar data types.
A.	String
B.	Arrays
C.	Both (a) and (b)
D.
Answer» C. Both (a) and (b)

Discussion

8.	In an array representation of binary tree the right child of root will be at location of?
A.	2
B.	3
C.	4
D.	6
Answer» C. 4

Discussion

9.	Data items that cannot be divided are called as?
A.	Group Items
B.	Attribute and Entity
C.	Elementary Items
D.	File items
Answer» D. File items

Discussion

10.	Operation(s) that an algorithm must fulfill is/are
A.	Compute the function
B.	Convert each input to correct output
C.	Intented functional parameters
D.	All of the above
Answer» E.

Discussion

11.	___________ is neither an algorithm nor a program.
A.	Computing
B.	Pseudo code
C.	Computer science
D.	None of the above
Answer» C. Computer science

Discussion

12.	A collection of distinguishable members or elements is known to be
A.	Set
B.	Combination
C.	Composition
D.	Collaboration
Answer» B. Combination

Discussion

13.	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
Answer» B. Data structures

Discussion

14.	If elements of the data structure forms a sequence of list then it is called as ____________.
A.	Linear data structure
B.	Non-primitive data structure
C.	Primitive data structure
D.	None of these
Answer» B. Non-primitive data structure

Discussion

15.	Outputs of a function can also be referred to
A.	Instances
B.	Parameters
C.	Range
D.	Domain
Answer» D. Domain

Discussion

16.	Factorial's definition contains a recursive part and
A.	Data cases
B.	Symmetric case
C.	Reflexive cases
D.	Base cases
Answer» E.

Discussion

17.	Relation between two sets P and Q in qiven form is P ⊂ Q is
A.	P is subset of Q
B.	Q is subset of P
C.	All Elements are equal
D.	None of Elements are equal
Answer» B. Q is subset of P

Discussion

18.	The data structure which is one ended is ………………
A.	queue
B.	stack
C.	tree
D.	graph
Answer» C. tree

Discussion

19.	Which of the following can be used as a criterion for classification of data structures used in language processing ?
A.	nature of a data structure
B.	purpose of a data structure
C.	lifetime of a data structure
D.	all of the above.
Answer» E.

Discussion

20.	Linear arrays are also called ……………….
A.	Straight line array
B.	One-dimensional array
C.	Vertical array
D.	Horizontal array
Answer» C. Vertical array

Discussion

21.	Members of a set are drawn from a larger population known as
A.	Data type
B.	Primitive type
C.	Compound type
D.	Base type
Answer» E.

Discussion

22.	Atomic Data is also called as _____________.
A.	Scalar Data
B.	Dynamic Data
C.	Textual Data
D.	None of these
Answer» B. Dynamic Data

Discussion

23.	Non Primitive data Structures are those which define set of _________.
A.	Static Elements
B.	Primitive Elements
C.	Derived Elements
D.	None of these
Answer» D. None of these

Discussion

24.	Number of steps composed by an algorithm should be
A.	10
B.	20
C.	Finite
D.	Infinite
Answer» D. Infinite

Discussion

25.	What is true about Interface in data structure?
A.	Each data structure has an interface.
B.	Interface represents the set of operations that a data structure supports.
C.	An interface only provides the list of supported operations, type of parameters they can accept and return type of these operations.
D.	All of the above
Answer» E.

Discussion

26.	Single and non-decomposable data is called ______________.
A.	Composite Data
B.	Textual Data
C.	Atomic Data
D.	Numeric Data
Answer» D. Numeric Data

Discussion

27.	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
Answer» E.

Discussion

28.	A set cannot have
A.	Unique values
B.	Uniform values
C.	Duplicate values
D.	Sequenced values
Answer» D. Sequenced values

Discussion

29.	Set on which partial order is defined is called
A.	Poset
B.	Relation
C.	Sequence
D.	Coset
Answer» B. Relation

Discussion

30.	Interface of ADT can be defined in terms of
A.	Type
B.	Set of operations
C.	Set of assertions
D.	Both a and b
Answer» E.

Discussion

31.	Term that makes realization of a data type as a software component is called
A.	Actual data type
B.	Abstract data type
C.	Visual data type
D.	Component data type
Answer» C. Visual data type

Discussion

32.	A solution is assumed to be efficient if it is able to solve problem within required
A.	Constraints
B.	Processing
C.	Decision making
D.	Developers
Answer» B. Processing

Discussion

33.	An implementation for an ADT is called
A.	Data process
B.	Data movement
C.	Data structure
D.	Data member
Answer» D. Data member

Discussion

34.	A data item can be thought of a member of a
A.	Type
B.	Function
C.	Standard
D.	Structure
Answer» B. Function

Discussion

35.	Defining a data type in terms of an ADT is of form
A.	Logical
B.	Physical
C.	Composite
D.	Visual
Answer» B. Physical

Discussion

36.	An ADT doesn't specify implementation of
A.	Class
B.	Operations
C.	Datatype
D.	Interface
Answer» D. Interface

Discussion

37.	A simple type whose values contain no subparts, is called
A.	Integer type
B.	String type
C.	Boolean type
D.	Aggregate type
Answer» B. String type

Discussion

38.	Data types are of form
A.	Physical
B.	Logical
C.	Both a and b
D.	Composite
Answer» D. Composite

Discussion

39.	Data types formation can be of
A.	2 types
B.	3 types
C.	4 types
D.	5 types
Answer» B. 3 types

Discussion

40.	Critical resource for a program is most often its
A.	Running time
B.	Compile time
C.	Storage
D.	Testing time
Answer» B. Compile time

Discussion

41.	Algorithm that begins with First position in array and looks at each value in turn until it is found is known to be
A.	Linear seaching
B.	Binary searching
C.	Sequential searching
D.	Tree searching
Answer» D. Tree searching

Discussion

42.	Rate at which cost of algorithm grows as size of its input grows is called its
A.	Input growth
B.	Outcome growth
C.	Growth rate
D.	Processing rate
Answer» D. Processing rate

Discussion

43.	Efficiency of an algorithm is measured by
A.	Absolute analysis
B.	Cost analysis
C.	Relative analysis
D.	Asymptotic analysis
Answer» E.

Discussion

44.	A growth rate of n, is referred to as
A.	Absolute growth rate
B.	Linear growth rate
C.	Exponential growth rate
D.	Quadratic growth rate
Answer» C. Exponential growth rate

Discussion

45.	An analysis that estimates resource consumption of an algorithm is known to be
A.	Relative analysis
B.	Absolute analysis
C.	Asymptotic analysis
D.	Cost analysis
Answer» D. Cost analysis

Discussion

46.	Implementation of operations associated with an ADT is done by a
A.	Member function
B.	Member type
C.	Member object
D.	Member data-type
Answer» B. Member type

Discussion

47.	When data is input in numeric form, data type in program is classified as
A.	rational string
B.	string
C.	irrational string
D.	real integers
Answer» C. irrational string

Discussion

48.	When there are range of numbers involved in a program, it can be stored as
A.	real numbers
B.	original numbers
C.	rational numbers
D.	irrational numbers
Answer» B. original numbers

Discussion

49.	In line '200 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, NAME$ is classified as
A.	string variable
B.	string constant
C.	rational string
D.	irrational string
Answer» B. string constant

Discussion

50.	Data Structure in which one predecessor may have one or more successor , that data structure is called as __________.
A.	Non Linear Data Structure
B.	Linear Data Structure
C.	Primitive Data Structure
D.	Non Primitive Data Structure
Answer» B. Linear Data Structure

Discussion

Explore topic-wise MCQs in Testing Subject.

Variable which can be accessed by all modules of the program is called as __________.

ADT is called as Abstract because

Term Data Structure refers to _________ and interrelationship between them.

Data must be represented, organized, stored, processed and managed in a way that facilitates_________.

The hierarchical relationship between data elements can be easily represented using a nonlinear data structure called_______.

The OS of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called

__________ is a collection of data elements of similar data types.

In an array representation of binary tree the right child of root will be at location of?

Data items that cannot be divided are called as?

Operation(s) that an algorithm must fulfill is/are

___________ is neither an algorithm nor a program.

A collection of distinguishable members or elements is known to be

The concepts in programming languages are essential knowledge to anyone who wants to become skilled in_________________.

If elements of the data structure forms a sequence of list then it is called as ____________.

Outputs of a function can also be referred to

Factorial's definition contains a recursive part and

Relation between two sets P and Q in qiven form is P ⊂ Q is

The data structure which is one ended is ………………

Which of the following can be used as a criterion for classification of data structures used in language processing ?

Linear arrays are also called ……………….

Members of a set are drawn from a larger population known as

Atomic Data is also called as _____________.

Non Primitive data Structures are those which define set of _________.

Number of steps composed by an algorithm should be

What is true about Interface in data structure?

Single and non-decomposable data is called ______________.

What is the process of finding the location of a given data element in the data structure called?

A set cannot have

Set on which partial order is defined is called

Interface of ADT can be defined in terms of

Term that makes realization of a data type as a software component is called

A solution is assumed to be efficient if it is able to solve problem within required

An implementation for an ADT is called

A data item can be thought of a member of a

Defining a data type in terms of an ADT is of form

An ADT doesn't specify implementation of

A simple type whose values contain no subparts, is called

Data types are of form

Data types formation can be of

Critical resource for a program is most often its

Algorithm that begins with First position in array and looks at each value in turn until it is found is known to be

Rate at which cost of algorithm grows as size of its input grows is called its

Efficiency of an algorithm is measured by

A growth rate of n, is referred to as

An analysis that estimates resource consumption of an algorithm is known to be

Implementation of operations associated with an ADT is done by a

When data is input in numeric form, data type in program is classified as

When there are range of numbers involved in a program, it can be stored as

In line '200 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, NAME$ is classified as

Data Structure in which one predecessor may have one or more successor , that data structure is called as __________.