Recent activity by logan1x / GATE Overflow for GATE CSE

1 answer

1

GATE Overflow | General Aptitude | Test 1 | Question: 8
Scalpel: Surgeon :: ? razor: barber weed:gardner recipe:chef compass : engineer

Scalpel: Surgeon :: ?razor: barberweed:gardnerrecipe:chefcompass : engineer

281 views

commented Mar 13, 2020

1 answer

2

GATE Overflow | General Aptitude | Test 2 | Question: 8
Pick the word which does not fill the blank in the following sentence His $\_\_\_\_$ made the new comer nervous. jibe gibe taunt scoff

Pick the word which does not fill the blank in the following sentenceHis $\_\_\_\_$ made the new comer nervous. jibegibetauntscoff

463 views

commented Mar 5, 2020

3 answers

3

GATE2015 CE-2: GA-7
The given question is followed by two statements; select the most appropriate option that solves the question. Capacity of a solution tank $A$ is $\text{70%}$ of the capacity of tank $B$. How many gallons of solution are in tank $A$ and ... . Statement II alone is sufficient. Either statement I or II alone is sufficient. Both the statements I and II together are sufficient.

The given question is followed by two statements; select the most appropriate option that solves thequestion.Capacity of a solution tank $A$ is $\text{70%}$ of the capaci...

3.3k views

commented Feb 26, 2020

1 answer

4

ISI2012-PCB-A-2a
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of $30$; the two binary operators $'+'$ ... common multiple) and GCD (greatest common divisor) of two integer operands. Show that the two operations of $\mathcal{B}$ satisfy associativity commutativity distributivity.

Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where$B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of $3...

586 views

answered Feb 15, 2020

0 answers

5

ISI2014-PCB-CS-7b
A heavily loaded $1$ km long, $10$ Mbps token ring network has a propagation speed of $200$ meter per micro-second. Fifty stations are uniformly spaced around the ring. Each data packet is $256$ bits long, including $32$ bits of header. The token is of $8$ bits. What is the effective data rate of the network assuming the stations always have packets to transmit?

A heavily loaded $1$ km long, $10$ Mbps token ring network has a propagation speed of $200$ meter per micro-second. Fifty stations are uniformly spaced around the ring. E...

704 views

commented Feb 14, 2020

3 answers

6

CMI2011-B-06a
Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, $\text{dosas}$ or $\text{chapatis}$ of different sizes). We want to sort these disks in decreasing order according to their diameter so that the ... or $\text{chapatis}$ between two big spoons and flipping the stack.) Give an algorithm for sorting the disks using this operation.

Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, $\text{dosas}$ or $\text{chapatis}$ of different sizes). We wa...

1.8k views

commented Feb 13, 2020

1 answer

7

CMI2011-B-06b
Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, $\text{dosas}$ or $\text{chapatis}$ of different sizes). We want to sort these disks in decreasing order according to their diameter so that the ... $\text{chapatis}$ between two big spoons and flipping the stack.) How many steps will your algorithm take in the worst case?

Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, $\text{dosas}$ or $\text{chapatis}$ of different sizes). We wa...

507 views

commented Feb 13, 2020

0 answers

8

ISI2012-PCB-CS-5a
Suppose you have the following three subroutines: $\text{max}(A, i, j)$: returns the index of the maximum among the set of consecutive elements $A[i, \dots, j]$ of the array $A$. $\text{min}(A, i, j)$: returns the index of the minimum among the set of ... time complexity of the first two subroutines is $O(k)$, where $k = j − i$, and that for the third subroutine is $O(1)$.

Suppose you have the following three subroutines:$\text{max}(A, i, j)$: returns the index of the maximum among the set of consecutive elements $A[i, \dots, j]$ of the arr...

473 views

commented Feb 12, 2020

2 answers

9

GATE Overflow | Mock GATE | Test 1 | Question: 49
The path length of a node is defined as the number of edges from root to that node. For a given full binary tree, the sum of path length of all leaf nodes is equal to $16$ ... of all internal nodes? (Note: A full binary tree is a tree in which every node other than the leaves has 2 children)

The path length of a node is defined as the number of edges from root to that node. For a given full binary tree, the sum of path length of all leaf nodes is equal to $16...

2.2k views

commented Feb 2, 2020

1 answer

10

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$.

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 exact...

386 views

commented Jan 31, 2020

2 answers

11

Test by Bikram | Mock GATE | Test 4 | Question: 57
Fill in the blanks with meaningful pairs: If there is nothing to absorb the energy of sound, it travels on _________. However, its intensity ______ as it travels away from the source. E steadily, stabilizes forever, increases erratically, mitigates indefinitely, diminishes

Fill in the blanks with meaningful pairs:If there is nothing to absorb the energy of sound, it travels on _________. However, its intensity ______ as it travels away from...

239 views

answered Jan 30, 2020

1 answer

12

Test by Bikram | Mock GATE | Test 3 | Question: 43
The characteristic expression for a new $AB$-flip-flop is given below: $Q_{n+1}$\left ( A, B, Q_{n} \right )$ = $\sim A \sim Q_{n}$ $+$ $B$Q_{n}$ , where $\sim A$ means Not $A$ or $A$ $Bar$. Identify the CORRECT statement among ... $A = 0, B = 1$ then flip flop resets. If $A = 0, B = 0$ then toggles.

The characteristic expression for a new $AB$-flip-flop is given below:$Q_{n+1}$$\left ( A, B, Q_{n} \right )$ = $\sim A \sim Q_{n}$ $+$ $B$$Q_{n}$ , where $\sim A$ mea...

344 views

commented Jan 28, 2020

1 answer

13

Test by Bikram | Mock GATE | Test 3 | Question: 59
Out of six coins, four coins are tossed simultaneously. The number of possible outcomes where at most three of the coins turn up as heads is ______.

Out of six coins, four coins are tossed simultaneously.The number of possible outcomes where at most three of the coins turn up as heads is ______.

755 views

commented Jan 28, 2020

1 answer

14

ISRO2020-70
In a class definition with $10$ methods, to make the class maximally cohesive, number of direct and indirect connections required among the methods are $90,0$ $45,0$ $10,10$ $45,45$

In a class definition with $10$ methods, to make the class maximally cohesive, number of direct and indirect connections required among the methods are$90,0$$45,0$$10,10$...

2.5k views

commented Jan 25, 2020

2 answers

15

Test by Bikram | Mock GATE | Test 2 | Question: 53
A logic circuit has three input bits: $x_0$, $x_1$, and $x_2$, where $x_0$ is the least significant bit and $x_2$ is the most significant bit. The output from the circuit is $1$ when its input is any of the $3-bit$ numbers $1$, $4$, $5$, ... $\sim x_2x_0 + \sim x_2 +\sim x_1$ $x_2+ \sim x_1x_0$ $\sim x_1x_0+x_2 \sim x_0$

A logic circuit has three input bits: $x_0$, $x_1$, and $x_2$, where $x_0$ is the least significant bit and $x_2$ is the most significant bit. The output from the circuit...

7.5k views

commented Jan 22, 2020

1 answer

16

Test by Bikram | Mock GATE | Test 1 | Question: 61
The simplest animals are those whose bodies are simplest in structure and which do the things done by all living animals, such as eating, breathing, moving, and feeling, in the most ________ way. Haphazard Bizarre Primitive Advantageous

The simplest animals are those whose bodies are simplest in structure and which do the things done by all living animals, such as eating, breathing, moving, and feeling, ...

393 views

commented Jan 19, 2020

7 answers

17

GATE CSE 2017 Set 1 | Question: 33
Consider a combination of $\text{T}$ and $\text{D}$ flip-flops connected as shown below. The output of the $\text{D}$ flip-flop is connected to the input of the $\text{T}$ flip-flop and the output of the $\text{T}$ flip-flop is connected to the input of ... $3^{\text{rd}}$ cycle are $01$ and after the $4^{\text{th}}$ cycle are $01$ respectively.

Consider a combination of $\text{T}$ and $\text{D}$ flip-flops connected as shown below. The output of the $\text{D}$ flip-flop is connected to the input of the $\text{T}...

14.8k views

commented Jan 18, 2020

2 answers

18

ISRO2018-7
Assume $A$ and $B$ are non-zero positive integers. The following code segment: while(A!=B){ if*(A> B) A -= B; else B -= A; } cout<<A; // printing the value of A Computes the $LCM$ of two numbers Divides the larger number by the smaller number Computes the $GCD$ of two numbers Finds the smaller of two numbers

Assume $A$ and $B$ are non-zero positive integers. The following code segment:while(A!=B){ if*(A B) A -= B; else B -= A; } cout<<A; // printing the value of AComputes the...

4.2k views

commented Jan 11, 2020

3 answers

19

GATE2011 AG: GA-5
The question below consists of a pair of related words followed by four pairs of words. Select the pair that best expresses the relation in the original pair: $\textbf{Gladiator : Arena}$ dancer : stage commuter : train teacher : classroom lawyer : courtroom

The question below consists of a pair of related words followed by four pairs of words. Select the pair that best expresses the relation in the original pair:$\textbf{Gla...

4.0k views

commented Jan 4, 2020

1 answer

20

Test by Bikram | Theory of Computation | Test 2 | Question: 15
Which of the following languages is regular? $L = \{ bba (ba)^* a^{n-1} \mid n> 0 \}$ $L = \{a^nb^n \mid n < 1000 \}$ $L = \{a^nb^k \mid \text{ n is odd or k is even} \}$ $L = \{ wxw^R \mid w,x \in (0+1)^* \}$ $1$, $3$ and $4$ $2, 3, 4$ $2, 3$ $1, 2, 3, 4$

Which of the following languages is regular?$L = \{ bba (ba)^* a^{n-1} \mid n 0 \}$$L = \{a^nb^n \mid n < 1000 \}$$L = \{a^nb^k \mid \text{ n is odd or k is even} \}$$L ...

447 views

commented Jan 4, 2020

6 answers

21

GATE CSE 2004 | Question: 24
Consider the binary relation: $S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$ The reflexive transitive closure is $S$ ... $\left\{\left(x, y\right) \mid y \leq x \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$

Consider the binary relation:$S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$The reflexive transitive closure is $S$ is$\lef...

9.9k views

commented Jan 3, 2020

3 answers

22

ISRO 2017-5
Which of the following concurrency control protocol ensures both conflict and free from deadlock? , Time stamp ordering 2 Phase locking Both (a) and (b) None of the above

Which of the following concurrency control protocol ensures both conflict and free from deadlock? ,Time stamp ordering2 Phase lockingBoth (a) and (b)None of the above

5.1k views

answered Dec 21, 2019

2 answers

23

ISRO2008-3
The subnet mask $255.255.255.192$ extends the network portion to $16$ bits extends the network portion to $26$ bits extends the network portion to $36$ bits has no effect on the network portion of an IP address

The subnet mask $255.255.255.192$extends the network portion to $16$ bitsextends the network portion to $26$ bitsextends the network portion to $36$ bitshas no effect on ...

5.0k views

commented Dec 20, 2019

2 answers

24

Test by Bikram | Algorithms | Test 2 | Question: 6
$O(n^k)$ is complexity of the best method that finds longest Palindrome Substring in a word. For example, in the word "Atatb", the longest palindrome string is "tat". Then, the value of $10^*K$ is __________.

$O(n^k)$ is complexity of the best method that finds longest Palindrome Substring in a word. For example, in the word "Atatb", the longest palindrome string is "tat". The...

613 views

commented Dec 6, 2019

1 answer

25

Test by Bikram | Theory of Computation | Test 2 | Question: 4
Which of the following statements is FALSE? Recursive Enumerable Languages are not closed under set difference and complementation. Complement of context-free language must be recursive. If a problem $X$ is NP complete and $X \in P,$ then $NP = P$. Membership problem is not decidable for Recursive Languages.

Which of the following statements is FALSE?Recursive Enumerable Languages are not closed under set difference and complementation.Complement of context-free language must...

453 views

commented Dec 3, 2019

1 answer

26

Test by Bikram | Computer Networks | Test 1 | Question: 29
A selective repeat ARQ uses a window size of $26$ to send the data. The number of bits needed to define the sequence number is _____.

A selective repeat ARQ uses a window size of $26$ to send the data. The number of bits needed to define the sequence number is _____.

427 views

commented Nov 25, 2019

1 answer

27

Test by Bikram | Computer Networks | Test 1 | Question: 11
An organization with a class C IP address of $195.37.5.0$ wish to divide the network into different sub networks, the subnet mask is 255.255.255.192. Which one among these is not a broadcast address in any of the sub network? $195.37.5.127$ $195.37.5.191$ $195.37.5.31$ $195.37.5.255$

An organization with a class C IP address of $195.37.5.0$ wish to divide the network into different sub networks, the subnet mask is 255.255.255.192. Which one among thes...

435 views

commented Nov 25, 2019

3 answers

28

Test by Bikram | Data Structures | Test 2 | Question: 28
A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue and dequeue can be performed in constant time ? node next to front front node not possible with a single node rear node

A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue a...

828 views

answered Nov 16, 2019

1 answer

29

Test by Bikram | Data Structures | Test 2 | Question: 10
Consider the following nested representation of Binary Trees (ASD) where S and D are left and right subtrees of node A. Note that S and D may be NULL or further nested. In this scenario, which of the following representation is a valid Binary Tree? $(12(4567))$ $(1((234)56)7)$ $(1(234)(567))$ $(1(23 \text{NULL} )(45))$

Consider the following nested representation of Binary Trees (ASD) where S and D are left and right subtrees of node A. Note that S and D may be NULL or further nested.In...

256 views

commented Nov 15, 2019

1 answer

30

Test by Bikram | Data Structures | Test 2 | Question: 6
Assume that we have a ternary tree in which each node can have at most $3$ children, namely left, middle and right. Consider the following function to calculate total number of nodes with exactly $3$ children. int func Node *L { int i; if L==NULL return 0 ... -> right ; i+ func L -> left+ func L -> middle ; i + func L -> left ; i ;

Assume that we have a ternary tree in which each node can have at most $3$ children, namely left, middle and right. Consider the following function to calculate total num...

567 views

answered Nov 15, 2019

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true