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

9 votes
2 answers
241
ISRO2017-19
The most appropriate matching for the following pairs : ... $\text{X-ii, Y-iii, Z-i}$ $\text{X-iii, Y-i, Z-ii}$ $\text{X-ii, Y-i, Z-iii}$
The most appropriate matching for the following pairs :$\begin{array}{clcl} \text{X.} & \text{Indirect Addressing} & \text{i.} & \text{Loop} \\ \text{Y.} & \text{Immedi...
User Avatar
0 votes
1 answer
242
web technology: servlet
The main reason for preferring servlet for web application development is : (A) Increased performance of web application (B) Easy to develop an application (C) Platform independent application (D) More secure application
The main reason for preferring servlet for web application developmentis :(A) Increased performance of web application(B) Easy to develop an application(C) Platform indep...
User Avatar
25 votes
7 answers
244
GATE CSE 2017 Set 1 | Question: 05
Consider the following table: ... $(P) \leftrightarrow (i), (Q) \leftrightarrow (ii), (R) \leftrightarrow (iii)$
Consider the following table:$$\begin{array}{|l|}\hline \textbf {Algorithms} & \textbf{Design Paradigms } & \\\hline \text{P. Kruskal} & \text{i. Divide and Conquer} \...
User Avatar
39 votes
5 answers
246
GATE CSE 2017 Set 2 | Question: 05
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it: ... $\text{P-iii; Q-iv; R-i; S-ii}$ $\text{P-i; Q-iv; R-ii; S-iii}$
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it:$$\begin{array}{|l|l|}\hline \text{P. Syntax t...
User Avatar
20 votes
8 answers
247
GATE CSE 2017 Set 1 | Question: GA-5
The probability that a $k$-digit number does NOT contain the digits $0, 5,$ or $9$ is $0.3^{k}$ $0.6^{k}$ $0.7^{k}$ $0.9^{k}$
The probability that a $k$-digit number does NOT contain the digits $0, 5,$ or $9$ is$0.3^{k}$$0.6^{k}$$0.7^{k}$$0.9^{k}$
User Avatar
38 votes
7 answers
248
GATE CSE 2017 Set 1 | Question: 20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
User Avatar
20 votes
7 answers
249
GATE CSE 2017 Set 1 | Question: 17
Consider the following grammar: $P\rightarrow xQRS$ $Q\rightarrow yz\mid z$ $R\rightarrow w\mid \varepsilon$ $S\rightarrow y$ What is FOLLOW($Q$)? $\left \{ R \right \}$ $\left \{ w \right \}$ $\left \{ w,y \right \}$ $\left \{ w,\$ \right \}$
Consider the following grammar:$P\rightarrow xQRS$$Q\rightarrow yz\mid z$$R\rightarrow w\mid \varepsilon$$S\rightarrow y$What is FOLLOW($Q$)?$\left \{ R \right \}$ ...
User Avatar
33 votes
10 answers
250
GATE CSE 2017 Set 1 | Question: 6
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are:Note: The height of a tree with a single node is $0$.$4$ and $15$ res...
User Avatar
25 votes
7 answers
251
GATE CSE 2017 Set 2 | Question: 54
Consider the following C program. #include<stdio.h> int main () { int m=10; int n, n1; n=++m; n1=m++; n--; --n1; n-=n1; printf(“%d”, n); return 0; } The output of the program is ______
Consider the following C program.#include<stdio.h int main () { int m=10; int n, n1; n=++m; n1=m++; n ; n1; n-=n1; printf(“%d”, n); return 0; }The output of the prog...
User Avatar
25 votes
7 answers
252
GATE CSE 2017 Set 2 | Question: 03
Match the algorithms with their time complexities: ... $P\rightarrow (iv) \quad Q \rightarrow(iii)\quad r \rightarrow(ii) \quad S\rightarrow(i)$
Match the algorithms with their time complexities:$$\begin{array}{|l|l|}\hline \textbf{Algorithms} & \textbf{Time Complexity} \\\hline \text{P. Tower of Hanoi with $n$...
User Avatar
0 votes
0 answers
253
Basic Calculus
what is the difference between Local maxima/minima and absolute maxima/minima ???? example would be great
what is the difference between Local maxima/minima and absolute maxima/minima ???? example would be great
User Avatar
2 votes
1 answer
254
Question Test series
900man & 500woman completes a task in 2 weeks , 1200 man & 250 woman took 3 weeks to complete d same task Then how many man required to complete d task in one week???
900man & 500woman completes a task in 2 weeks ,1200 man & 250 woman took 3 weeks to complete d same taskThen how many man required to complete d task in one week???
User Avatar
0 votes
1 answer
255
TesT series question
what is the remainder when 4^250 is divided by 14 2^500 /14 = 2^499 / 7 Applying fermats theorem 2^6 mod 7 =1 (2^498 * 2 ) / 7 = remainder should be 2 is it correct???
what is the remainder when 4^250 is divided by 142^500 /14 = 2^499 / 7 Applying fermats theorem 2^6 mod 7 =1 (2^498 * 2 ) / 7 = remainder should be 2 is i...
User Avatar
2 votes
1 answer
257
Transform the sentence to Logical Statement
" Lazy and Smart People Are Dangerous " What I think is that $\forall(x) (\text{Lazy}(x) \wedge\text{Smart}(x) \rightarrow Dangerous(s) )$ Is it correct ? If YES https://gateoverflow.in/800/gate2009-23 if NO Explain why ?
" Lazy and Smart People Are Dangerous "What I think is that $\forall(x) (\text{Lazy}(x) \wedge\text{Smart}(x) \rightarrow Dangerous(s) )$Is it correct ?If YEShttps://gate...
User Avatar
15 votes
2 answers
259
TIFR CSE 2017 | Part A | Question: 6
How many distinct words can be formed by permuting the letters of the word $\text{ABRACADABRA}?$ $\frac{11!}{5! \: 2! \: 2!}$ $\frac{11!}{5! \: 4! }$ $11! \: 5! \: 2! \: 2!\:$ $11! \: 5! \: 4!$ $11! $
How many distinct words can be formed by permuting the letters of the word $\text{ABRACADABRA}?$$\frac{11!}{5! \: 2! \: 2!}$$\frac{11!}{5! \: 4! }$$11! \: 5! \: 2! \: 2!\...
User Avatar
0 votes
1 answer
261
order of expression
User Avatar
3 votes
1 answer
262
ICMP_networking
User Avatar
14 votes
4 answers
264
GATE CSE 1988 | Question: 1iii
Quicksort is ________ efficient than heapsort in the worst case.
Quicksort is ________ efficient than heapsort in the worst case.
User Avatar
32 votes
8 answers
265
GATE CSE 1989 | Question: 3-ii
Context-free languages and regular languages are both closed under the operation (s) of : Union Intersection Concatenation Complementation
Context-free languages and regular languages are both closed under the operation (s) of :UnionIntersectionConcatenationComplementation
User Avatar
29 votes
3 answers
266
GATE CSE 1989 | Question: 2-ii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Base addressing} & \text{(p)} & \text{Reentranecy} \\\hline \text{(B)} & \text...
User Avatar
17 votes
2 answers
269
GATE CSE 1990 | Question: 3-v
The complexity of comparison based sorting algorithms is: $\Theta (n \log n)$ $\Theta (n)$ $\Theta \left(n^2\right)$ $\Theta (n\sqrt n)$
The complexity of comparison based sorting algorithms is:$\Theta (n \log n)$$\Theta (n)$$\Theta \left(n^2\right)$$\Theta (n\sqrt n)$
User Avatar
11 votes
1 answer
270
GATE CSE 1990 | Question: 2-vii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Strassen's matrix multiplication algorithm} & (p) & \text{Greedy method} \\\hline (...
User Avatar
Page: