Dark Mode

Answers by akash.dinkar12

4 votes

1

GATE2010 MN: GA-4
Choose the most appropriate word from the options given below to complete the following sentence$:$ If the country has to achieve real prosperity, it is _______ that the fruits of progress reach all, and in equal measure$.$ inevitable contingent oblivious imperative

answered in Verbal Aptitude May 19, 2019

743 views

3 votes

2

GATE2010 MN: GA-1
Which of the following options is the closest in meaning to the word below$:$ Exhort urge condemn restrain scold

answered in Verbal Aptitude May 19, 2019

779 views

2 votes

3

GATE2010 MN: GA-3
Choose the most appropriate word from the options given below to complete the following sentence$:$ The committee wrote a _______ report$,$ extolling only the strengths of the proposal$.$ reasonable supportive biased fragmented

answered in Verbal Aptitude May 19, 2019

818 views

11 votes

4

GATE2013 CE: GA-3
Which of the following options is the closest in meaning to the word given below: Primeval Modern Historic Primitive Antique

answered in Verbal Aptitude Oct 13, 2018

3.2k views

4 votes

5

answered in Verbal Aptitude Sep 26, 2018

288 views

2 votes

6

GATE2018 CH: GA-1
"When she fell down the ________ , she received many _________ but little help." The words that best fill the blanks in the above sentence are stairs, stares stairs, stairs stares, stairs stares, stares

answered in Verbal Aptitude Jul 21, 2018

1.5k views

3 votes

7

GATE2018 CH: GA-6
An automobile travels from city $A$ to city $B$ and returns to city $A$ by the same route. The speed of the vehicle during the onward and return journeys were constant at $60km/h$ and $90 km/h$, respectively. What is the average speed in $km/h$ for the entire journey? $72\hspace{0.2cm} km/h$ $73\hspace{0.2cm} km/h$ $74\hspace{0.2cm} km/h$ $75 \hspace{0.2cm}km/h$

answered in Quantitative Aptitude Feb 20, 2018

4.7k views

1 vote

8

throughput
The 5 stages of processor fetch, decode, execute, memory and writeback have the following delays 100, 120, 200, 110 and 150 nanoseconds respectively. Assume that when pipelining, each pipeline stage costs 20ns extra for the registers between pipeline stages. If one of ... throughput, what is the new throughput (in Million Instructions per second) 3.44 MIPS 10 MIPS 5.88 MIPS 6.55 MIPS

answered in CO and Architecture Nov 1, 2017

1.2k views

11 votes

9

GATE CSE 1988 | Question: 12iv
Select SNAME from S Where SNOin (select SNO from SP where PNOin (select PNO from P Where COLOUR='BLUE')) What relations are being used in the above SQL query? Given at least two attributes of each of these relations.

answered in Databases Oct 28, 2017

1.3k views

79 votes

10

GATE CSE 2017 Set 1 | Question: 54
A cache memory unit with capacity of $N$ words and block size of $B$ words is to be designed. If it is designed as a direct mapped cache, the length of the $\textsf{TAG}$ field is $10$ bits. If the cache unit is now designed as a $16$-way set-associative cache, the length of the $\textsf{TAG}$ field is ____________ bits.

answered in CO and Architecture Oct 9, 2017

19.5k views

1 vote

11

Regular Expression

answered in Theory of Computation Oct 5, 2017

351 views

6 votes

12

NIELIT Scientific Assistant A 2020 November: 118
The $\text{LL(1)}$ and $\text{LR(0)}$ techniques are ___________ Both same in power Both simulate reverse of right most derivation Both simulate reverse of left most derivation Incomparable

answered in Compiler Design Sep 18, 2017

1.0k views

3 votes

13

functional dependency
Let the relation R(X, Y, Z, A, B) with given functional dependencies X -> YZ Z -> A A -> B AZ -> X The number of super keys possible__________ ? Please answer with an explanation.

answered in Databases Aug 29, 2017

1.2k views

2 votes

14

Test by Bikram | Databases | Test 2 | Question: 8
Consider the following schedule: ... Which of the following transaction problems is present in the given schedule ? Lost update Dirty Rea Unrepeatable read Both (A) & (B)

answered in Databases Aug 28, 2017

400 views

4 votes

15

Test by Bikram | Databases | Test 2 | Question: 24
Consider the relation schemas: Rank (name, rank) and student (name, country), where name in student table is a foreign key in table Rank. Which of the following TRC Queries displays all the student names from India along with their respective ranks? ...

answered in Databases Aug 28, 2017

374 views

7 votes

16

Test by Bikram | Databases | Test 2 | Question: 25
Consider a relational table $T$ with sufficient number of records having attributes $T1, T2, \dots ,Tn$ (where $1 \leq p \leq n)$ Two queries $S1$ and $S2$ ... queries. Hashing will outperform ordered indexing on $S2$ but not $S1$. Hashing will outperform ordered indexing on $S1$ but not $S2$.

answered in Databases Aug 27, 2017

304 views

1 vote

17

answered in Programming in C Aug 19, 2017

475 views

4 votes

18

Infix to prefix
Convert (A - B^C + H)*D + E^5. Is the answer +*+-A^BCHD^E5 ?

answered in Programming in C Aug 19, 2017

905 views

6 votes

19

Test by Bikram | Mock GATE | Test 4 | Question: 63
A glass contained a mixture of two different flavoured liquids, $j$ and $k$ in the ratio $4 : 1$. When $10$ litres of the mixture was replaced with liquid $k$, the ratio became $2 : 3$. The volume of liquid $j$ originally present in the jar, therefore, was ________ litres.

answered in Quantitative Aptitude Aug 19, 2017

586 views

22 votes

20

Test by Bikram | Mock GATE | Test 4 | Question: 20
Consider the $5\times 5$ matrix below : $\begin{bmatrix} 1&0 &0 &0 &1 \\ 0& 1 & 1 & 1 & 0\\ 0& 1 &1 &1 &0 \\ 0& 1 &1 &1 &0 \\ 1 & 0 & 0 & 0 & 1 \end{bmatrix}$ The product of the non-zero eigenvalues of the matrix is _____.

answered in Linear Algebra Aug 16, 2017

801 views

12 votes

21

GATE CSE 1996 | Question: 13
Let $Q=\left( \left\{q_1,q_2 \right\}, \left\{a,b\right \}, \left\{a,b,\bot \right\}, \delta, \bot, \phi \right)$ ... $\delta(q_2,b,b) = \left\{(q_2, \epsilon)\right\}$ $\delta(q_2,\epsilon,\bot) = \left\{(q_2, \epsilon)\right\}$

answered in Theory of Computation Aug 16, 2017

5.6k views

123 votes

22

GATE CSE 2017 Set 1 | Question: 7
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this representation is $2^{-f}$ to $2^{i}$ $2^{-f}$ to $\left ( 2^{i} - 2^{-f} \right )$ 0 to $2^{i}$ 0 to $\left ( 2^{i} - 2^{-f} \right )$

answered in Digital Logic Aug 12, 2017

16.5k views

4 votes

23

Test by Bikram | Mock GATE | Test 4 | Question: 60
5 9 15 16 29 ? 49 89 147 $\begin{array}{|c|c|c|} \hline 5 & 9 & 15 \\ \hline 16 & 29 & ? \\ \hline 49 & 89 & 147 \\ \hline \end{array}$ The missing number is ________.

answered in GATE Aug 8, 2017

398 views

0 votes

24

Which of the following represents the number of labeled binary trees with ‘n’ node, which have same preorder ?

answered in Programming in C Aug 5, 2017

2.1k views

3 votes

25

Test by Bikram | Mock GATE | Test 4 | Question: 47
An undirected graph has $5$ nodes and $3$ edges. Let $P$ and $Q$, respectively, be the maximum and minimum number of connected components of the graph. If the graph has no self-loops and there is at most one edge between any pair of nodes, then which of the following conditions is always TRUE? $P=5, Q=2$ $P=4, Q=2$ $P=3, Q=2$ $P=5, Q=3$

answered in Graph Theory Aug 5, 2017

470 views

2 votes

26

Test by Bikram | Mock GATE | Test 4 | Question: 55
Consider the proposition given below: $\text{Hate} (a, b)$ denotes $a$ hates $b$ ... hates everybody except Michael. Marlyn only hates Michael. Marlyn loves everybody except Michael. Marlyn is loved only by Michael.

answered in Mathematical Logic Aug 4, 2017

272 views

3 votes

27

Test by Bikram | Mock GATE | Test 4 | Question: 53
Which of the following languages over the alphabet set $\{ a, b \}$ is described by the regular expression $a^\ast b$(aa)$^\ast b$ ? The set of all strings containing exactly two $b's$ ... ending with $ b'$. The set of all strings ending with $ b'$. The set of all strings having sub sequence $bb$.

answered in Theory of Computation Aug 3, 2017

376 views

8 votes

28

Test by Bikram | Mock GATE | Test 4 | Question: 50
A computer has $170$ different operations. Memory is word addressable where word size is $4$ bytes and each instruction requires one word. All instructions have two addresses – one for register and one for memory. If there are $37$ registers, then what is the memory size? $256\; MB$ $32\; MB$ $18\; MB$ $1\; MB$

answered in CO and Architecture Aug 3, 2017

424 views

1 vote

29

Test by Bikram | Mock GATE | Test 4 | Question: 65
“If one can do it, anyone can do it. If no one does it, I will do it.” The person who says the above statement seems to be: Sarcastic Optimistic Pragmatic Agnostic

answered in Verbal Aptitude Aug 3, 2017

315 views

3 votes

30

Test by Bikram | Mock GATE | Test 4 | Question: 21
$\left ( G, . \right )$ is a group such that $\left ( x,y \right )^{-1} = x^{-1}y^{-1}, \forall \left ( x,y \right ) \in G$. Here, $G$ is a: Monoid Commutative semi group Abelian group Semi group

answered in GATE Aug 2, 2017

446 views

Page:

1
2
3
4
5
6
...
10
next »