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

43 votes
8 answers
571
GATE CSE 2014 Set 2 | Question: 4
If the matrix $A$ is such that $A= \begin{bmatrix} 2\\ −4\\7\end{bmatrix}\begin{bmatrix}1& 9& 5\end{bmatrix}$ then the determinant of $A$ is equal to ______.
If the matrix $A$ is such that $$A= \begin{bmatrix} 2\\ −4\\7\end{bmatrix}\begin{bmatrix}1& 9& 5\end{bmatrix}$$ then the determinant of $A$ is equal to ______.
User Avatar
24 votes
2 answers
573
GATE CSE 2014 Set 2 | Question: GA-5
The value of $\sqrt{12+\sqrt{12+\sqrt{12+\dots}}} $is $3.464$ $3.932$ $4.000$ $4.444$
The value of $\sqrt{12+\sqrt{12+\sqrt{12+\dots}}} $is$3.464$$3.932$$4.000$$4.444$
User Avatar
19 votes
4 answers
576
GATE CSE 2014 Set 1 | Question: 46
The function $f(x) =x \sin x$ satisfies the following equation: $f''(x) + f(x) +t \cos x = 0$The value of $t$ is______.
The function $f(x) =x \sin x$ satisfies the following equation: $$f''(x) + f(x) +t \cos x = 0$$The value of $t$ is______.
User Avatar
54 votes
4 answers
577
GATE CSE 2014 Set 1 | Question: 36
Which of the regular expressions given below represent the following DFA? $0^*1(1+00^*1)^* $ $0^*1^*1+11^*0^*1 $ $(0+1)^*1$ I and II only I and III only II and III only I, II and III
Which of the regular expressions given below represent the following DFA?$0^*1(1+00^*1)^* $$0^*1^*1+11^*0^*1 $$(0+1)^*1$I and II onlyI and III onlyII and III onlyI, II an...
User Avatar
44 votes
4 answers
578
GATE CSE 2006 | Question: 52
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot? $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$ $\Theta (n^{3})$
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot?$\T...
User Avatar
29 votes
5 answers
581
GATE CSE 2014 Set 1 | Question: 16
Consider the finite automaton in the following figure: What is the set of reachable states for the input string $0011$? $\{q_0,q_1,q_2\}$ $\{q_0,q_1\}$ $\{q_0,q_1,q_2,q_3\}$ $\{q_3\}$
Consider the finite automaton in the following figure: What is the set of reachable states for the input string $0011$?$\{q_0,q_1,q_2\}$$\{q_0,q_1\}$$\{q_0,q_1,q_2,q_3\}$...
User Avatar
22 votes
3 answers
587
GATE CSE 1998 | Question: 2.8
Which of the following operations is commutative but not associative? AND OR NAND EXOR
Which of the following operations is commutative but not associative?ANDORNANDEXOR
User Avatar
23 votes
3 answers
588
GATE CSE 1998 | Question: 2.6
Which of the following statements is false? Every finite subset of a non-regular set is regular Every subset of a regular set is regular Every finite subset of a regular set is regular The intersection of two regular sets is regular
Which of the following statements is false?Every finite subset of a non-regular set is regularEvery subset of a regular set is regularEvery finite subset of a regular set...
User Avatar
31 votes
8 answers
591
GATE CSE 1998 | Question: 1.34
Which normal form is considered adequate for normal relational database design? $2NF$ $5NF$ $4NF$ $3NF$
Which normal form is considered adequate for normal relational database design?$2NF$$5NF$$4NF$$3NF$
User Avatar
19 votes
4 answers
592
GATE CSE 1998 | Question: 1.31
A counting semaphore was initialized to $10$. Then $6 P$ (wait) operations and $4V$ (signal) operations were completed on this semaphore. The resulting value of the semaphore is $0$ $8$ $10$ $12$
A counting semaphore was initialized to $10$. Then $6 P$ (wait) operations and $4V$ (signal) operations were completed on this semaphore. The resulting value of the semap...
User Avatar
32 votes
3 answers
593
GATE CSE 1998 | Question: 1.30
When the result of a computation depends on the speed of the processes involved, there is said to be cycle stealing race condition a time lock a deadlock
When the result of a computation depends on the speed of the processes involved, there is said to becycle stealingrace conditiona time locka deadlock
User Avatar
46 votes
2 answers
595
GATE CSE 1998 | Question: 1.27
Type checking is normally done during lexical analysis syntax analysis syntax directed translation code optimization
Type checking is normally done duringlexical analysissyntax analysissyntax directed translationcode optimization
User Avatar
26 votes
3 answers
596
GATE CSE 1998 | Question: 1.22
Give the correct matching for the following pairs: ... $\text{A-R B-P C-S D-Q}$ $\text{A-P B-R C-S D-Q}$ $\text{A-P B-S C-R D-Q}$
Give the correct matching for the following pairs: $$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(P)} & \text{Selection} \\\hline \text{(B)} & \t...
User Avatar
25 votes
2 answers
597
GATE CSE 1998 | Question: 1.21, ISRO2008-16
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph? Dynamic programming Backtracking Greedy Divide and Conquer
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?Dynamic programmingBacktrackingGreedyDivide and Conqu...
User Avatar
40 votes
4 answers
598
GATE CSE 1998 | Question: 1.19
Which of the following addressing modes permits relocation without any change whatsoever in the code? Indirect addressing Indexed addressing Base register addressing PC relative addressing
Which of the following addressing modes permits relocation without any change whatsoever in the code?Indirect addressingIndexed addressingBase register addressingPC relat...
User Avatar
24 votes
1 answer
599
GATE CSE 1998 | Question: 1.14
A multiplexer with a $4-bit$ data select input is a $4:1$ multiplexer $2:1$ multiplexer $16:1$ multiplexer $8:1$ multiplexer
A multiplexer with a $4-bit$ data select input is a$4:1$ multiplexer$2:1$ multiplexer$16:1$ multiplexer$8:1$ multiplexer
User Avatar
41 votes
7 answers
600
GATE CSE 1998 | Question: 1.12
The string $1101$ does not belong to the set represented by $110^*(0 + 1)$ $1(0 + 1)^*101$ $(10)^*(01)^*(00 + 11)^*$ $(00 + (11)^*0)^*$
The string $1101$ does not belong to the set represented by$110^*(0 + 1)$$1(0 + 1)^*101$$(10)^*(01)^*(00 + 11)^*$$(00 + (11)^*0)^*$
User Avatar
Page: