Scribd
Upload
2 views6 pages

More Mcqs Data Structure and Algorithms (Set 12)

The document contains a series of multiple-choice questions related to Data Structures and Algorithms (DSA). Each question presents a concept or definition, followed by four answer options, with the correct answer indicated. Topics covered include structure definitions, pointer behavior, sorting, recursion, and various data structures.

Uploaded by

mmaimsalim95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views6 pages

More Mcqs Data Structure and Algorithms (Set 12)

The document contains a series of multiple-choice questions related to Data Structures and Algorithms (DSA). Each question presents a concept or definition, followed by four answer options, with the correct answer indicated. Topics covered include structure definitions, pointer behavior, sorting, recursion, and various data structures.

Uploaded by

mmaimsalim95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Data Structure and Algorithms (DSA)

12 of 14 sets

551. A structure definition is called as


A. template
B. member
C. both 1 & 2
D. none of these
Answer:A

552. If a, b and c are integer variables with the values a=8, b=3 and c=-5. Then
what is the value of the arithmetic expression: 2 * b + 3 * (a-c)
A. 15
o m
B. 6
. c
C. -16
te
D. -1
a
Answer:A
q M
c
M
553. A global variable is a variable
A. declared in the main ( ) function
B. declared in any function other than the main ( ) function
C. declared outside the body of every function.
D. declared any where in the c program.
Answer:C

554. main ( ) is an example of


A. library function
B. user defined function
C. header
D. statement
Answer:A

555. While incrementing a pointer, its value gets increased by the length of the data
type to which it points. This length is called
A. scale factor
B. length factor
C. pointer factor
D. increment factor
Answer:A

556. a->b is systematically correct if_____


A. a is a npointer to a structure in which b is a field
B. a and b are structure
C. a is a structure and b is a pointer to a structure
D. a is a pointer to a structure and b is a structure
Answer:A

557. Which of the following best describes sorting ?


A. accessing and processing each record exactly once
B. finding the location of the record with a given key
C. arranging the data (record) in some given order
D. adding a new record to the data structure
Answer:C

558. A function which calls itself is called as


A. library function
B. directive
C. recursive function
D. none of above
Answer:C

559. Where do we use the operator -> ?


A. to access a member of structure
B. to access member of union
C. to access an array
D. both(a) and(b).
Answer:D

560. In selection sort of n elements,how many times is the swap function called in
the complete execution of the algorithm?

View all MCQ's at McqMate.com


A. 1
B. n-1
C. n(n-1)/2
D. none of these
Answer:B

561. a->b is systematically correct if_____


A. a is a pointer to a structure in which b is a field
B. a and b are structure
C. a is a structure and b is a pointer to a structure
D. a is a pointer to a structure and b is a structure
Answer:A

562. Literal means


A. string
B. string constant
C. character
D. alphabet
Answer:B

563. Each data item in a record may be a group item composed of sub-items; those
items which are indecomposable are called
A. Elementary items
B. Atoms
C. Scalars
D. All of above
Answer:D

564. Which of the following statement is false ?


A. Arrays are dense lists and static data structure
B. Data elements in linked list need not be stored in adjacent space in memory
C. Pointers store the next data element of a list
D. Linked lists are collection of the nodes that contain information part and next pointer
Answer:C

565. Binary search algorithm cannot be applied to

View all MCQ's at McqMate.com


A. Sorted binary trees
B. Sorted linear array
C. Pointer array
D. Sorted linked list
Answer:D

566. When new data are to be inserted into a data structure, but there is no
available space; this situation is usually called
A. Housefull
B. Saturated
C. Underflow
D. Overflow
Answer:D

567. The situation when in a linked list START=NULL is


A. Underflow
B. Overflow
C. Housefull
D. Saturated
Answer:A

568. The following is two-way list


A. Grounded header list
B. Circular header list
C. Linked list with header and trailer nodes
D. None of above
Answer:D

569. The following name does not relate to stacks


A. FIFO lists
B. LIFO list
C. Piles
D. Push-down lists
Answer:A

View all MCQ's at McqMate.com


570. In a binary tree, certain null entries are re- placed by special pointers which
point to nodes higher in tree for efficiency. These special pointers are called
A. Leaf
B. Branch
C. Path
D. Thread
Answer:D

571. In a graph if e=(u, v) means


A. e begins at u and ends at v
B. u is processor and v is successor
C. both B and C are true
D. none is true
Answer:C

572. If every node u in G is adjacent to every other node v in G, A graph is said to


be
A. Isolated
B. Complete
C. Finite
D. Strongly connected
Answer:B

573. A variable P is called pointer if


A. P points to the address of first element in DATA
B. P can store only memory addresses
C. P contain the DATA and the address of DATA
D. P contains the address of an element in DATA.
Answer:D

574. The Worst case occur in linear search algo- rithm when
A. Item is not in the array at all
B. Item is the last element in the array
C. Item is the last element in the array or is not there at all
D. None of above

View all MCQ's at McqMate.com


Answer:C

575. The Average case occur in linear search al- gorithm


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 ar- ray
D. All the above
Answer:A

View all MCQ's at McqMate.com

You might also like