Register

These questions are basic level ones and can be answered in less than a minute if you have seen the topic.

Recent questions tagged easy

3 votes
1 answer
92
TIFR CSE 2022 | Part B | Question: 1
Which data structure is commonly used to implement breadth first search in a graph? A queue A stack A heap A hash table A splay tree
Which data structure is commonly used to implement breadth first search in a graph?A queueA stackA heapA hash tableA splay tree
User Avatar
1 votes
1 answer
98
GATE ECE 2022 | GA Question: 1
Mr. $\text{X}$ speaks __________ Japanese ____________ Chinese. neither /or either / nor neither / nor also / but
Mr. $\text{X}$ speaks __________ Japanese ____________ Chinese.neither /oreither / norneither / noralso / but
User Avatar
3 votes
1 answer
102
GATE Civil 2021 Set 1 | GA Question: 9
A function, $\lambda$, is defined by $\lambda \left ( p,q \right )=\left\{\begin{matrix} \left ( p-q \right )^{2}, & \text{if} \:p\geq q, \\ p+q, &\text{if} \: p< q.\end{matrix}\right.$ ... $-1$ $0$ $\frac{16}{3}$ $16$
A function, $\lambda$, is defined by$\lambda \left ( p,q \right )=\left\{\begin{matrix} \left ( p-q \right )^{2}, & \text{if} \:p\geq q, \\ p+q, &\text{if} \: p< q.\end{m...
User Avatar
6 votes
1 answer
103
GATE Electrical 2021 | GA Question: 1
The people _______________ were at the demonstration were from all sections of society. whose which who whom
The people _______________ were at the demonstration were from all sections of society.whosewhichwhowhom
User Avatar
13 votes
5 answers
105
GATE CSE 2021 Set 1 | Question: 16
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
User Avatar
10 votes
3 answers
106
GATE CSE 2021 Set 1 | Question: 21
Consider the following sequence of operations on an empty stack.$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\textsf{pop}();$ ... $\textsf{s+q}$ is ___________.
Consider the following sequence of operations on an empty stack.$$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\texts...
User Avatar
1 votes
1 answer
108
NIELIT Scientific Assistant A 2020 November: 64
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respectively? $O(n)$ $O(w)$ $O(nw)$ $O(n+w)$
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respecti...
User Avatar
1 votes
1 answer
110
NIELIT Scientific Assistant A 2020 November: 96
In an undirected graph, if we add the degrees of all vertices, it is: odd even cannot be determined always $n+1,$ where $n$ is number of nodes
In an undirected graph, if we add the degrees of all vertices, it is:oddevencannot be determinedalways $n+1,$ where $n$ is number of nodes
User Avatar
1 votes
1 answer
112
NIELIT Scientific Assistant A 2020 November: 117
In the following addressing mode, which of them performs better for accessing, array? Register addressing mode Direct addressing mode Displacement addressing mode Index addressing mode
In the following addressing mode, which of them performs better for accessing, array?Register addressing modeDirect addressing modeDisplacement addressing modeIndex addre...
User Avatar
Page: