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

This section includes 282 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.

101.

If two different keys yield the same hash address, it is called _______ .

A. binary search
B. sequential search
C. collision
D. rotation
Answer» D. rotation
Discussion
102.

This data structure allows deletions at both ends of the list but insertion at only one end.

A. Input-restricted deque
B. Output-restricted deque
C. Priority queues
D. None of the above
Answer» B. Output-restricted deque
Discussion
103.

________ is a list in which the order of the items is significant, and the items are not necessarily sorted.

A. ordered list
B. indexed list
C. sequential list
D. unordered list
Answer» D. unordered list
Discussion
104.

_____operation of word processing invovles replacing one string in the text by another.

A. insertion
B. deletion is easier
C. searching
D. replacement
Answer» E.
Discussion
105.

What is error in following declaration?struct outer{ int a;struct inner{char c;};};

A. nesting of structure is not allowed in c
B. it is necessary to initialize the member variable
C. inner structure must have name
D. outer structure must have name
Answer» D. outer structure must have name
Discussion
106.

The process of accessing and processing each element of an array A, exactly once is called _______.

A. deleting
B. inserting
C. traversing
D. searching
Answer» D. searching
Discussion
107.

An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of

A. f(n) x g(n)
B. max ( f(n),g(n))
C. min (f(n),g(n))
D. f(n) + g(n)
Answer» C. min (f(n),g(n))
Discussion
108.

Time required to delete a node with given address in a linked list is____

A. 0(n)
B. 0(log n)
C. 0(1)
D. 0(n log n)
Answer» B. 0(log n)
Discussion
109.

how many vlue can held by an array A(-1…m,1…m)?

A. m
B. m^2
C. m(m+1)
D. m(m+2)
Answer» E.
Discussion
110.

#include #include int main(){int i=0;for(;i<=2;)printf(" %d",++i); return 0;}

A. 0 1 2 3
B. 0 1 2
C. 1 2 3
D. compiler error
Answer» D. compiler error
Discussion
111.

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

A. Counting the number of key operations
B. Counting the number of statements
C. Counting the kilobytes of algorithm
D. None of the above
Answer» B. Counting the number of statements
Discussion
112.

Big O notation is defined for

A. time and space complexity
B. optimality
C. seaching
D. none of the above
Answer» B. optimality
Discussion
113.

The memory address of the first element of an array is called

A. base address
B. floor address
C. foundation address
D. first address
Answer» B. floor address
Discussion
114.

The following data structure can’t store the non-homogeneous data elements

A. Arrays
B. Records
C. Pointers
D. None of the above
Answer» B. Records
Discussion
115.

When converting binary tree into extended binary tree, all the original nodes in binary tree are

A. internal nodes on extended tree
B. external nodes on extended tree
C. vanished on extended tree
D. None of the above
Answer» B. external nodes on extended tree
Discussion
116.

The result of 0001 1010 >>2 is____

A. 0101 1100
B. 0010 1110
C. 0000 0110
D. none of these
Answer» D. none of these
Discussion
117.

What will be output if you will compile and execute the following c code?#include #include int main(){char c='\08';printf("%d",c); return 0;}

A. 8
B. \8\
C. 9
D. compiler error
Answer» E.
Discussion
118.

The following data structure store the ho- mogeneous data elements

A. Arrays
B. Records
C. Pointers
D. None of the above
Answer» C. Pointers
Discussion
119.

What will be output if you will compile and execute the following c code? #includeint * call();int main(){ int *ptr;ptr=call();printf("%d",*ptr); return 0;} int * call(){int a=25;a++;return &a;}

A. 25
B. 26
C. any adress
D. garbage value
Answer» E.
Discussion
120.

List pointer variable in linked list contains address of the

A. following node in the first
B. current node in the first
C. first node in the first
D. none of the above
Answer» D. none of the above
Discussion
121.

If address of the 8th element in a linked list of integers is1022,then address of the 9th element is

A. 1024
B. 1026
C. 1023
D. unknown
Answer» E.
Discussion
122.

The program fragmentint i = 263 ;putchar (i) ;prints

A. 263
B. ascii equivalent of 263
C. rings the bell
D. garbage
Answer» D. garbage
Discussion
123.

The____linked list can be processed in either direction.

A. singly
B. singly circular
C. doublyly
D. none of these
Answer» D. none of these
Discussion
124.

What will be output if you will compile and execute the following c code? #includeint main(){char *str="Hello world";printf("%d",printf("%s",str)); return 0;}

A. 10hello world
B. 11hello world
C. hello world12
D. hello world13
Answer» E.
Discussion
125.

In a linked list, the pointer of the last node contains a special value, called the ______ pointer.

A.
Answer» B.
Discussion
126.

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
Answer» D. None of above
Discussion
127.

Give timing complexities of three sorting algorithms bubble sort,selection sort,insertion sort respectively.

A. 0(log n), 0(log n), o(log n)
B. o(n2), o(n2), o(n2)
C. o(n2), o(n log n), o(n log n)
D. o(n log n), o(n2), o(n log n)
Answer» C. o(n2), o(n log n), o(n log n)
Discussion
128.

________ is an organization that provides faster request and return time response.

A. stack
B. queue
C. buddy system
D. recursion
Answer» D. recursion
Discussion
129.

What will be output if you will compile and execute the following c code? #includeint main(){char c=125;c=c+10;printf("%d",c); return 0;}

A. 135
B. +inf
C. -121
D. -8
Answer» D. -8
Discussion
130.

Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?

A. o(1)
B. o(log2n)
C. o(n)
D. o(n^2)
Answer» E.
Discussion
131.

Linked lists are best suited 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» C. both of above situation
Discussion
132.

Each array declaration need not give, implicitlyor explicitly, the information about the

A. name of array
B. data type of array
C. first data from the set to be stored
D. index set of the array
Answer» D. index set of the array
Discussion
133.

The number K in A[K] is called the subscript or the ________.

A. size
B. index
C. variable
D. constant
Answer» C. variable
Discussion
134.

What will be output if you will compile and execute the following c code? #includeint main(){int a=2;if(a==2){a=~a+2<<1;printf("%d",a);}else{break;} return 0;}

A. it will print nothing
B. -3
C. -2
D. compiler error
Answer» E.
Discussion
135.

Matrices with relatively high proportion of zero entries are called ______ matrices.

A. triangular
B. diagonal
C. sparse
D. adjacency
Answer» D. adjacency
Discussion
136.

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
Answer» B. free(head)
Discussion
137.

What will be output if you will compile and execute the following c code? #include#define x 5+2int main(){int i;i=x*x*x;printf("%d",i); return 0;}

A. 343
B. 27
C. 133
D. compiler error
Answer» C. 133
Discussion
138.

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» E.
Discussion
139.

Null pointer is used to tell

A. end of linked list
B. empty pointer field of a structure
C. the linked list is empty
D. all of the above
Answer» E.
Discussion
140.

A matrix in which non-zero entries can only occur on the diagonal or on elements immediately above or below the diagonal, is called ______ matrix.

A. triangular
B. tridiagonal
C. sparse
D. simple
Answer» D. simple
Discussion
141.

The function islower(char)checks whether a character is in lower case or not.Therefore it should return______

A. 0 or 1
B. -1, 0 or 1
C. a character
D. nothing
Answer» B. -1, 0 or 1
Discussion
142.

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» E.
Discussion
143.

NurseryLand.Nursery.Students = 10;

A. the structure students is nested within the structure nursery
B. the structure nurseryland is nested within the structure nursery.
C. the structure nursery is nested within the structure nurseryland.
D. the structure nursery is nested within the structure students
Answer» D. the structure nursery is nested within the structure students
Discussion
144.

Consider the following definition in c programming languagestruct node{int data;struct node * next;}typedef struct node NODE;NODE *ptr;Which of the following c code is used to create new node?

A. ptr=(node*)malloc(sizeof(node));
B. ptr=(node*)malloc(node);
C. ptr=(node*)malloc(sizeof(node*));
D. ptr=(node)malloc(sizeof(node));
Answer» B. ptr=(node*)malloc(node);
Discussion
145.

Programming languages like FORTRAN and PASCAL allocate memory space for arrays ______.

A. dynamically
B. statically
C. successively
D. alternatively
Answer» C. successively
Discussion
146.

What will be output if you will compile and execute the following c code? #includeint main(){int x;for(x=1;x<=5;x++);printf("%d",x); return 0;}

A. 4
B. 5
C. 6
D. compiler error
Answer» D. compiler error
Discussion
147.

A polynominal in single variable should be handled using__

A. an array of structure
B. singly linked list
C. gll
D. both (a) and (b)
Answer» E.
Discussion
148.

NULL link is not present in…

A. singly linked list
B. doubly linked list
C. circular linked list
D. none of these
Answer» D. none of these
Discussion
149.

The result of 0001 1010 / 0001 0101 is

A. 0001 1111
B. 1111 0001
C. 0001 0000
D. none of these
Answer» B. 1111 0001
Discussion
150.

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