Recent activity by d3ba / GATE Overflow for GATE CSE

3 answers

1

ISRO2020-74
Following declaration of an array of struct, assumes size of byte, short, int and long are $1,2,3$ and $4$ respectively. Alignment rule stipulates that $n$ - byte field must be located at an address divisible by $n$, the fields in the struct are not rearranged, padding is used ... is located at an address divisble by $8$, what is the total size of $C$, in bytes? $150$ $160$ $200$ $240$

Following declaration of an array of struct, assumes size of byte, short, int and long are $1,2,3$ and $4$ respectively. Alignment rule stipulates that $n$ – byte field...

3.5k views

commented Aug 3, 2023

8 answers

2

GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$

A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a mess...

19.2k views

commented Sep 1, 2020

6 answers

3

GATE CSE 2020 | Question: 44
A processor has $64$ registers and uses $16$-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a register name, and a $4$-bit immediate value. Each R-type instruction ... two register names. If there are $8$ distinct I-type opcodes, then the maximum number of distinct R-type opcodes is _______.

A processor has $64$ registers and uses $16$-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a re...

28.9k views

commented May 22, 2020

10 answers

4

GATE CSE 2020 | Question: 53
Consider a paging system that uses $1$-level page table residing in main memory and a $\textsf{TLB}$ for address translation. Each main memory access takes $100$ ns and $\textsf{TLB}$ lookup takes $20$ ns. Each page transfer to/from the disk ... $1$ decimal places) is ___________

Consider a paging system that uses $1$-level page table residing in main memory and a $\textsf{TLB}$ for address translation. Each main memory access takes $100$ ns and $...

47.2k views

commented Feb 18, 2020

4 answers

5

GATE CSE 2020 | Question: 43
Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this processor. Overheads associated with pipelining force you to ... , the speedup achieved by the pipelined processor over the non-pipelined processor (round off to $2$ decimal places) is_____________.

Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this p...

16.7k views

commented Feb 16, 2020

4 answers

6

GATE CSE 2020 | Question: 2
For parameters $a$ and $b$, both of which are $\omega(1)$, $T(n) = T(n^{1/a})+1$, and $T(b)=1$. Then $T(n)$ is $\Theta (\log_a \log _b n)$ $\Theta (\log_{ab} n$) $\Theta (\log_{b} \log_{a} \: n$) $\Theta (\log_{2} \log_{2} n$)

For parameters $a$ and $b$, both of which are $\omega(1)$, $T(n) = T(n^{1/a})+1$, and $T(b)=1$. Then $T(n)$ is$\Theta (\log_a \log _b n)$ $\Theta (\log_{ab} n$)$\Thet...

19.7k views

commented Feb 15, 2020

4 answers

7

GATE CSE 2020 | Question: 41
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$

In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported ...

22.1k views

commented Feb 13, 2020

9 answers

8

GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$

What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order?$\Theta(n)$$\Theta(n...

26.7k views

commented Feb 12, 2020

8 answers

9

GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.

16.7k views

answer edited Feb 12, 2020

6 answers

10

GATE CSE 2020 | Question: 12
Consider the following statements about process state transitions for a system using preemptive scheduling. A running process can move to ready state. A ready process can move to running state. A blocked process can move to running state. A blocked process can move to ready state. ... TRUE? I, II, and III only II and III only I, II, and IV only I, II, III and IV only

Consider the following statements about process state transitions for a system using preemptive scheduling.A running process can move to ready state.A ready process can m...

13.0k views

commented Feb 12, 2020

7 answers

11

GATE CSE 2020 | Question: 10
Consider the language $L = \{a^{n}\mid n \geq 0\} \cup \{a^{n}b^{n}\mid n \geq 0\}$ and the following statements. $L$ is deterministic context-free. $L$ is context-free but not deterministic context-free. $L$ is not $LL(k)$ for any $k$. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Ⅰ and Ⅲ only Ⅲ only

Consider the language $L = \{a^{n}\mid n \geq 0\} \cup \{a^{n}b^{n}\mid n \geq 0\}$ and the following statements.$L$ is deterministic context-free.$L$ is context-free but...

20.2k views

commented Feb 12, 2020

2 answers

12

GATE CSE 2020 | Question: 6
What is the worst case time complexity of inserting $n^{2}$ elements into an AVL-tree with $n$ elements initially? $\Theta (n^{4})$ $\Theta (n^{2})$ $\Theta (n^{2}\log n)$ $\Theta (n^{3})$

What is the worst case time complexity of inserting $n^{2}$ elements into an AVL-tree with $n$ elements initially?$\Theta (n^{4})$$\Theta (n^{2})$$\Theta (n^{2}\log n)$$\...

13.9k views

commented Feb 12, 2020

3 answers

13

GATE CSE 2020 | Question: 54
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{12 bytes}$ ... that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is _______

Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{...

22.7k views

answered Feb 12, 2020

5 answers

14

GATE CSE 2020 | Question: 37
Consider a schedule of transactions $T_1$ and $T_2$ ...

Consider a schedule of transactions $T_1$ and $T_2$:$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline T_1 & RA & & & RC & & WD & & WB & \text{Commit} & \\ \hline T_2 & & R...

12.0k views

answered Feb 12, 2020

3 answers

15

ISRO2020-2
Statements associated with registers of a CPU are given. Identify the false statement. The program counter holds the memory address of the instruction in execution Only opcode is transferred to the control unit An instruction in the instruction register consists of the ... The value of the program counter is incremented by $1$ once its value has been read to the memory address register

Statements associated with registers of a CPU are given. Identify the false statement.The program counter holds the memory address of the instruction in executionOnly opc...

3.9k views

commented Jan 20, 2020

1 answer

16

Test by Bikram | Data Structures | Test 2 | Question: 14
If memory is limited and the entire dictionary cannot be stored in a hash table, we can still get an efficient algorithm that almost always works. We declare an array H_TABLE of bits (initialized to zeros) from $0$ to TABLE_SIZE $- 1$. As ... If a word hashes to a location with value $2$, the word is not in the dictionary. None of the above.

If memory is limited and the entire dictionary cannot be stored in a hash table, we can still get an efficient algorithm that almost always works. We declare an array H_T...

551 views

commented Jan 17, 2020

2 answers

17

Test by Bikram | Databases | Test 1 | Question: 7
Consider the following schedule for transactions T1, T2 , these transactions have two phase locking: T1: lock- S(A) Read (A) Lock -X (B) Read (B) B = A +B Write (B) Unlock (A) Unlock(B) T2 lock-X(A) Lock- S(B) write (A ... about T1 and T2? T1 and T2 are deadlock free T1 and T2 results in a deadlock T1 and T2 are serial schedule none of the above

Consider the following schedule for transactions T1, T2 , these transactions have two phase locking:T1:lock- S(A)Read (A)Lock –X (B)Read (B)B = A +BWrite (B)Unlock (A) ...

972 views

commented Jan 4, 2020

4 answers

18

GATE CSE 2012 | Question: 43
Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a foreign key that refers to $C$ in $R_{2}$. If data in $r_{1}$ and $r_{2}$ satisfy referential ... $\prod_{B}(r_{1}) = \prod _{C}(r_{2})$ $\prod_{B}(r_{1}) - \prod _{C}(r_{2}) \neq \varnothing$

Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a for...

11.4k views

commented Dec 6, 2019

4 answers

19

GATE CSE 2006 | Question: 84
Which one of the following grammars generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$? $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid a\mid b$ $A\rightarrow aA\mid \varepsilon$ $B\rightarrow Bb\mid \varepsilon$ ... $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \varepsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$

Which one of the following grammars generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$?$S\rightarrow AC\mid CB$$C\rightarrow aCb\mid a\mid b$$A\rightar...

12.2k views

commented Nov 23, 2019

1 answer

20

Test by Bikram | Mock GATE | Test 4 | Question: 26
Consider the languages $A$ and $B$, each over the alphabet set $\left \{ a,b \right \}$. Here, $B=\{ w \mid w$ contains some $x \in A$ as a sub-string $\}.$ Which of the following is TRUE about $A$ and $B$? If $A$ is regular, ... then $B$ is recursive. If $A$ is context-free, then $B$ is context-free. II only II and III I and III only I, II and III

Consider the languages $A$ and $B$, each over the alphabet set $\left \{ a,b \right \}$.Here, $B=\{ w \mid w$ contains some $x \in A$ as a sub-string $\}.$Which of the f...

711 views

commented Nov 17, 2019

6 answers

21

GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free

In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...

13.7k views

commented Nov 10, 2019

1 answer

22

what will be the output??

379 views

answered Jul 29, 2018

1 answer

23

SELF DOUBT PLEASE GIVE EXAMPLE
PLEASE FRAME AN EXAMPLE TO EXPLAIN THE CASES MENTIONED IN THIS The third major event that must be handled by the TCP sender is the arrival of an acknowledgment segment (ACK) from the receiver (more specifically, a segment containing a valid ACK field value) ... control, that data from above is less than MSS in size, and that data transfer is in one direction only. */

PLEASE FRAME AN EXAMPLE TO EXPLAIN THE CASES MENTIONED IN THIS The third major event that must be handled by the TCP sender is the arrival of anacknowledgment segment (...

336 views

answer edited Jul 28, 2018

1 answer

24

Process Synchronization
Is there any difference between busy waiting and spinlock What is the meaning of this statement "advantage of a spinlock is that no context switch is required when a process must wait on lock, and a context switch may takes considerable ... expected to be held for short time spinlock are useful" I can't understand this statement Please tell with example..

Is there any difference between busy waiting and spinlockWhat is the meaning of this statement"advantage of a spinlock is that no context switch is required when a proces...

1.3k views

answered Jul 28, 2018

2 answers

25

#preemption
If a process comes from block state to ready state then what can be said about preemption ?

If a process comes from block state to ready state then what can be said about preemption ?

365 views

answered Jul 28, 2018

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