The space factor when determining the effi- ciency of algorithm is measured by

Counting the minimum memory needed by the algorithm

Counting the maximum memory needed by the algorithm

Counting the minimum memory needed by the algorithm

Counting the average memory needed by the algorithm

Counting the maximum disk space needed by the algorithm

Arrays are best data structures for

the size of the structure and the data in the structure are constantly changing

relatively permanent collections of data

the size of the structure and the data in the structure are constantly changing

When representing any algebraic expression E the following uses only binary operations in a 2-tree

the operations in E will appear as exter- nal nodes and variables in internal nodes

the variable in E will appear as external nodes and operations in internal nodes

the operations in E will appear as exter- nal nodes and variables in internal nodes

the variables and operations in E will appear only in internal nodes

a-> is systematically correct if_____

a is a pointer to a structure in which b is a field

a is a structure and b is a pointer to a structure

a is a pointer to a structure and b is a structure

In linked list,a node contain

node,adrees field and data field

next adress field and information field

If a function is declared as void fn(int *p), then which of the following statements is valid to call function fn?

fn(&x) where x is defined as int *x;

fn(x) where x is defined as int x;

fn(x) where x is defined as int *x;

fn(&x) where x is defined as int *x;

fn(*x) where x is defined as int *x;

What is true about linked kist?

it is a linked structure,where each data gives the address of the next data

282 + Mcqs in Data Structure And Algorithms in Computer Science Engineering (CSE) Page 2 McqOptions

51.	The space factor when determining the effi- ciency 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» B. Counting the minimum memory needed by the algorithm

Discussion

52.	Arrays are best data structures for
A.	relatively permanent collections of data
B.	the size of the structure and the data in the structure are constantly changing
C.	both of above situation
D.	none of above situation
Answer» B. the size of the structure and the data in the structure are constantly changing

Discussion

53.	The members of the union are accessed by____
A.	dot operator
B.	pointer -> operator
C.	both a and b
D.	none of these
Answer» D. none of these

Discussion

54.	Array is a
A.	index data structure
B.	non liturenear data structure
C.	complx data structure
D.	none of the above
Answer» E.

Discussion

55.	In a ________ linked list, the last node's link field points to the first node of the list.
A.	circularly
B.	linearly
C.	sequentially
D.	indexed
Answer» B. linearly

Discussion

56.	____is a variable whose length may vary during the execution of a program.
A.	dynamic
B.	static
C.	semistatistic
D.	global
Answer» B. static

Discussion

57.	When representing any algebraic expression E the following uses only binary operations in a 2-tree
A.	the variable in E will appear as external nodes and operations in internal nodes
B.	the operations in E will appear as exter- nal nodes and variables in internal nodes
C.	the variables and operations in E will appear only in internal nodes
D.	None of the above
Answer» B. the operations in E will appear as exter- nal nodes and variables in internal nodes

Discussion

58.	A node of doubly linked contains
A.	pointer to predecessor
B.	pointer to sucessor
C.	both (a)and(b)
D.	only(a)
Answer» D. only(a)

Discussion

59.	What will be the output of the following code? Void main(){int a=10;int b=&a;int c=&b;printf("%d %d %d",a,b,**c);}
A.	10 10 garbage
B.	10 garbage garbage
C.	10 10 10
D.	syntax error
Answer» D. syntax error

Discussion

60.	a-> 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» B. a and b are structure

Discussion

61.	String with zero characters is called____string
A.
Answer» B.

Discussion

62.	You want to check whether a given set of items is sorted. Which of the following sorting methods will be most efficient if it is already in sorted order?
A.	bubble sort
B.	selection sort
C.	insertion sort
D.	merge sort
Answer» D. merge sort

Discussion

63.	Time required to search an element in a linked list is____
A.	0(n)
B.	0(log n)
C.	0(n2)
D.	0(n log n)
Answer» B. 0(log n)

Discussion

64.	Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time?i) Insertion at the front of the linked listii) Insertion at the end of the linked listiii) Deletion of the front node of the linked listiv) Deletion of the end node of the linked list
A.	i and ii
B.	i and iii
C.	i,ii and iii
D.	i,ii,iii and iv
Answer» E.

Discussion

65.	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
Answer» C. variable

Discussion

66.	In a circularly linked list organisation ,insertion of a record involves the modifications of
A.	no pointer
B.	1 pointer
C.	2 pointer
D.	3 pointer
Answer» C. 2 pointer

Discussion

67.	If the input array is unsorted, then only a linear ______ can be used.
A.	binary search
B.	sequential search
C.	indexed search
D.	jump search
Answer» C. indexed search

Discussion

68.	An algorithm that calls itself directly or indi- rectly is known as
A.	Recursion
B.	Polish notation
C.	Traversal algorithm
D.	None of the above
Answer» B. Polish notation

Discussion

69.	_______ refers to the operation of finding the location of a given item in a collection of items.
A.	sorting
B.	searching
C.	function
D.	complexity
Answer» C. function

Discussion

70.	In bubble sort,for a file of size n,after p iterations number of records in proper position is____
A.	n-p
B.	n-p+1
C.	n-p+2
D.	p
Answer» B. n-p+1

Discussion

71.	A ________ linked list is a linked list which always contains a special node, called the header node.
A.	circular
B.	grounded
C.	header
D.	doubly
Answer» D. doubly

Discussion

72.	Records can be stored in an area of memory called _______ memory.
A.	dynamic
B.	static
C.	simple
D.	parallel
Answer» B. static

Discussion

73.	_____ is a variable whose length may vary during the execution of a program.
A.	dynamic
B.	static
C.	semi static
D.	global
Answer» B. static

Discussion

74.	What will be output if you will compile and execute the following c code? #include#define call(x,y) x##yint main(){int x=5,y=10,xy=20;printf("%d",xy+call(x,y)); return 0;}
A.	35
B.	510
C.	15
D.	40
Answer» E.

Discussion

75.	If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and then removed one at a time, in what order will they be removed?
A.	abcd
B.	abdc
C.	dcab
D.	dcba
Answer» E.

Discussion

76.	To insert a node in a circular list at rear end it should be inserted at …...of the queue
A.	front position
B.	front-1position
C.	rear position
D.	rear-1 position
Answer» D. rear-1 position

Discussion

77.	The following sorting algorithm is of divide- and-conquer type
A.	Bubble sort
B.	Insertion sort
C.	Quick sort
D.	None of the above
Answer» C. Quick sort

Discussion

78.	In linked list,a node contain
A.	node,adrees field and data field
B.	node number and data field
C.	next adress field and information field
D.	none of the above
Answer» D. none of the above

Discussion

79.	What will be output if you will compile and execute the following c code? #include int main(){int array[]={10,20,30,40};printf("%d",-2[array]); return 0;}
A.	-60
B.	-30
C.	60
D.	garbage value
Answer» C. 60

Discussion

80.	A sort which compares adjacent elements in a list and switches wherever necessary is _______
A.	insertion sort
B.	bubble sort
C.	selection sort
D.	none of these
Answer» C. selection sort

Discussion

81.	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» C. variable length

Discussion

82.	If a function is declared as void fn(int *p), then which of the following statements is valid to call function fn?
A.	fn(x) where x is defined as int x;
B.	fn(x) where x is defined as int *x;
C.	fn(&x) where x is defined as int *x;
D.	fn(x) where x is defined as int x;
Answer» C. fn(&x) where x is defined as int *x;

Discussion

83.	The result of i)true AND false II)false or false
A.	i)is true and ii)is true
B.	i)is true and ii)is false
C.	i)is false and ii)is true
D.	i)is false and ii)is false
Answer» E.

Discussion

84.	A ________ linked list is a linked list structure in which each node has a pointer to both its successor and predecessor.
A.	circularly
B.	doubly
C.	linear
D.	sequential
Answer» C. linear

Discussion

85.	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» E.

Discussion

86.	Which of the following sorting methods would be most suitable for sorting a list which is almost sorted
A.	bubble sort
B.	selection sort
C.	insertion sort
D.	merge sort
Answer» B. selection sort

Discussion

87.	What is true about linked kist?
A.	it is a linked structure,where each data gives the address of the next data
B.	it is a dynamic data structure
C.	it is a static data structure
D.	both (a) and (b)
Answer» B. it is a dynamic data structure

Discussion

88.	What will be output if you will compile and execute the following c code? #includeint main(){double far* p,q;printf("%d",sizeof(p)+sizeof q); return 0; }
A.	12
B.	8
C.	4
D.	1
Answer» B. 8

Discussion

89.	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
Answer» B. p->next=q; q->next=p->next

Discussion

90.	A _______ list structure can be traversed in two directions-- in the forward direction from beginning of the list to end, or in the backward direction, from the end of the list to the beginning.
A.	one way
B.	linear array
C.	two way
D.	header
Answer» D. header

Discussion

91.	________ method of collision resolution involves maintaining two tables in memory.
A.	linear probing
B.	chaining
C.	quadratic probing
D.	double hashing
Answer» C. quadratic probing

Discussion

92.	let x be the adjacency matrix of a graph .G with no self loop.The entries along the principle diagonal of x are
A.	all "0"
B.	all "1"
C.	both 0&1
D.	different
Answer» B. all "1"

Discussion

93.	Give output of the following programint main(){inta[]={2,3,4,5,6};printf("%d",2[a]);}
A.	compilation error
B.	run time error
C.	4
D.	2
Answer» D. 2

Discussion

94.	A ______ is a list of a finite number of homogeneous data elements.
A.	linear array
B.	pointer
C.	linked list
D.	tree
Answer» B. pointer

Discussion

95.	Two dimensional arrays are also called
A.	tables arrays
B.	matrix arrays
C.	both of the above
D.	none of the above
Answer» D. none of the above

Discussion

96.	_________ header list combines the advantages of a two-way list and a circular header list.
A.	one way
B.	two way circular
C.	two way
D.	header
Answer» C. two way

Discussion

97.	Unsigned integers occupies
A.	two bytes
B.	four bytes
C.	one bytes
D.	eight bytes
Answer» D. eight bytes

Discussion

98.	A ______ is a data structure use foe a storage of a records.
A.	tree
B.	hash table
C.	stack
D.	graph
Answer» C. stack

Discussion

99.	If s1 is "ABC" and s2 is "DEF" then strcat(s1,s2)will give the following result.
A.	s1="abcdef" and s2="def"
B.	s1="abcdef" and s2="def"
C.	s1="abc" and s2="abcdef"
D.	s1="abc" and s2="abcdef"
Answer» B. s1="abcdef" and s2="def"

Discussion

100.	What will be the output of the following code? Int main(){char str[9]="My Computer";printf("%s\n",str);return 0;}
A.	mycompute
B.	syntax error
C.	runtime error
D.	none of these
Answer» C. runtime error

Discussion

Explore topic-wise MCQs in Computer Science Engineering (CSE).

The space factor when determining the effi- ciency of algorithm is measured by

Arrays are best data structures for

The members of the union are accessed by____

Array is a

In a ________ linked list, the last node's link field points to the first node of the list.

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

When representing any algebraic expression E the following uses only binary operations in a 2-tree

A node of doubly linked contains

What will be the output of the following code? Void main(){int a=10;int *b=&a;int **c=&b;printf("%d %d %d",a,*b,**c);}

a-> is systematically correct if_____

String with zero characters is called____string

You want to check whether a given set of items is sorted. Which of the following sorting methods will be most efficient if it is already in sorted order?

Time required to search an element in a linked list is____

Each node in a linear list contains an item called____which points to the next node in the list.

In a circularly linked list organisation ,insertion of a record involves the modifications of

If the input array is unsorted, then only a linear ______ can be used.

An algorithm that calls itself directly or indi- rectly is known as

_______ refers to the operation of finding the location of a given item in a collection of items.

In bubble sort,for a file of size n,after p iterations number of records in proper position is____

A ________ linked list is a linked list which always contains a special node, called the header node.

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

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

What will be output if you will compile and execute the following c code? #include#define call(x,y) x##yint main(){int x=5,y=10,xy=20;printf("%d",xy+call(x,y)); return 0;}

If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and then removed one at a time, in what order will they be removed?

To insert a node in a circular list at rear end it should be inserted at …...of the queue

The following sorting algorithm is of divide- and-conquer type

In linked list,a node contain

What will be output if you will compile and execute the following c code? #include int main(){int array[]={10,20,30,40};printf("%d",-2[array]); return 0;}

A sort which compares adjacent elements in a list and switches wherever necessary is _______

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.

If a function is declared as void fn(int *p), then which of the following statements is valid to call function fn?

The result of i)true AND false II)false or false

A ________ linked list is a linked list structure in which each node has a pointer to both its successor and predecessor.

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

Which of the following sorting methods would be most suitable for sorting a list which is almost sorted

What is true about linked kist?

What will be output if you will compile and execute the following c code? #includeint main(){double far* p,q;printf("%d",sizeof(p)+sizeof q); return 0; }

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

A _______ list structure can be traversed in two directions-- in the forward direction from beginning of the list to end, or in the backward direction, from the end of the list to the beginning.

________ method of collision resolution involves maintaining two tables in memory.

let x be the adjacency matrix of a graph .G with no self loop.The entries along the principle diagonal of x are

Give output of the following programint main(){inta[]={2,3,4,5,6};printf("%d",2[a]);}

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

Two dimensional arrays are also called

_________ header list combines the advantages of a two-way list and a circular header list.

Unsigned integers occupies

A ______ is a data structure use foe a storage of a records.

If s1 is "ABC" and s2 is "DEF" then strcat(s1,s2)will give the following result.

What will be the output of the following code? Int main(){char str[9]="My Computer";printf("%s\n",str);return 0;}