Top 350+ Solved Data Structure and Algorithms (DSA) MCQ Questions Answer

From 16 to 30 of 305

Q. 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

  • c. time and space

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

a. float

b. local

c. character

d. non-local

  • c. character

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

a. array

b. list

c. string

d. block

  • c. string

Q. String with zero characters is called ________ string.

a. null

b. binary

c. totalled

d. list

  • a. null

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

a. memory addressable

b. byte addressable

c. bit

d. byte

  • b. byte addressable

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

a. length

b. breath

c. width

d. none

  • c. width

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

a. insertion

b. deletion

c. searching

d. replacement

  • d. replacement

Q. ________ 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

  • a. pattern matching

Q. Select the set of instructions to insert a node pointed by q after a node pointed by p

a. q->next=p->next; p->next=q;

b. p->next=q; q->next=p->next

c. both (a)and(b)

d. none of these

  • a. q->next=p->next; p->next=q;

Q. select the set of operations to insert a node pointed by q at the beginning of the linked list

a. q->next=head; head=q;

b. head=q;q ->next=head;

c. both (a)and(b)

d. none of these

  • a. q->next=head; head=q;

Q. Select the set of operations to delete the first node from a linked list

a. p=head;head=head->next;free(p);

b. free(head)

c. head=head->next;p=head;free(p)

d. none of these

  • a. p=head;head=head->next;free(p);

Q. Select the correct looping condition for positioning apointer p on the second last in a linked list.Assume p=head,initially.

a. p->next->next!=null

b. p->next=null

c. p!=null

d. none of these

  • a. p->next->next!=null
Subscribe Now

Get All Updates & News