Recent activity by psrock541 / GATE Overflow for GATE CSE

1 answer

1

GATE Overflow Test Series | Mock GATE | Test 3 | Question: 17
Statement $1$ : In $IPv6$ fragmentation may only be performed by routers along a packet's delivery path. Statement $2$ : IP does not guarantee that all data will be delivered or that the data that are delivered will arrive in ... True but Statement $2$ is False Both statements are False Statement $2$ is True but Statement $1$ is False

Statement $1$ : In $IPv6$ fragmentation may only be performed by routers along a packet’s delivery path.Statement $2$ : IP does not guarantee that all data will be deli...

433 views

commented Feb 3, 2021

1 answer

2

GATE Overflow Test Series | Operating Systems | Test 2 | Question: 4
Consider a file system with $\text{512-byte}$ blocks. Assume an inode of a file holds pointers to $8$ direct data blocks, and a pointer to a single indirect block. Further, assume that the single indirect block can ... other data blocks. The maximum file size in bytes that can be supported by such an inode design will be ________

Consider a file system with $\text{512-byte}$ blocks. Assume an inode of a file holds pointers to $8$ direct data blocks, and a pointer to a single indirect block. Furthe...

295 views

commented Jan 24, 2021

1 answer

3

GATE Overflow Test Series | Operating Systems | Test 1 | Question: 28
$5$ processes $P_{0}$ through $P_{4}; 3$ resource types $\text{A (10 instances), B (5 instances), and C (7 instances)}$ Snapshot at time $T_{0}:$ ... permitted. All of $\text{REQ1, REQ2 and REQ3}$ can be permitted. None of $\text{REQ1, REQ2 or REQ3}$ can be permitted.

$5$ processes $P_{0}$ through $P_{4}; 3$ resource types $\text{A (10 instances), B (5 instances), and C (7 instances)}$Snapshot at time $T_{0}:$$$\begin{array}{|c|c|c|c|}...

385 views

commented Jan 24, 2021

1 answer

4

GATE Overflow Test Series | Mixed Subjects | Test 3 | Question: 10
Which of the following statements is/are correct? (Mark all the appropriate choices) With strict $\text{2PL,}$ transactions can be serialized in the order in which they commit Strict $\text{2PL,}$ holds only exclusive ... of the transaction With rigorous $\text{2PL,}$ transactions can be serialized in the order in which they commit

Which of the following statements is/are correct? (Mark all the appropriate choices)With strict $\text{2PL,}$ transactions can be serialized in the order in which they co...

182 views

commented Jan 20, 2021

1 answer

5

GATE Overflow Test Series | Algorithms | Test 2 | Question: 29
Consider a weighted undirected graph with distinct positive edge weights and let $(u,v)$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u$ has weight $36$ and the shortest path from $s$ to $v$ has weight $44$. ... $(u, v) \leq 8$ weight $(u, v) > 8$ weight $(u, v) \geq 8$

Consider a weighted undirected graph with distinct positive edge weights and let $(u,v)$ be an edge in the graph. It is known that the shortest path from the source verte...

252 views

commented Dec 22, 2020

2 answers

6

NIELIT Scientist B 2020 November: 102
_____________ has a feature of remote access through which a customer can access the data from anywhere and at any time with the help of internet connection. IaaS PaaS NaaS SaaS

_____________ has a feature of remote access through which a customer can access the data from anywhere and at any time with the help of internet connection.IaaSPaaSNaaSS...

418 views

answered Dec 18, 2020

1 answer

7

NIELIT Scientist B 2020 November: 103
The physical location of a record is determined by a mathematical formula that transforms a file key into a record location is: B-Tree File Hashed File Indexed File Sequential File

The physical location of a record is determined by a mathematical formula that transforms a file key into a record location is:B-Tree FileHashed FileIndexed FileSequentia...

306 views

answered Dec 18, 2020

1 answer

8

NIELIT Scientist B 2020 November: 92
Match the following: ... $\text{1-d, 2-b, 3-a, 4-c}$ $\text{1-c, 2-a, 3-b, 4-d}$

Match the following:$$\begin{array}{|l|l|l|l|} \hline (1) \text{Waterfall model} & (a) \text{Specifications can be developed} \\& \text{incrementally} \\\hline (2) \tex...

344 views

answered Dec 18, 2020

1 answer

9

NIELIT Scientist B 2020 November: 94
Which of the following tag is used intended for navigation in $HTML5?$ nav footer section navigation tag

Which of the following tag is used intended for navigation in $HTML5?$navfootersectionnavigation tag

303 views

answered Dec 18, 2020

1 answer

10

NIELIT Scientist B 2020 November: 91
What is the advantage of bubble sort over other sorting techniques? It is faster Consumes less memory Detects whether the input is already sorted All of the options

What is the advantage of bubble sort over other sorting techniques?It is fasterConsumes less memoryDetects whether the input is already sortedAll of the options

438 views

answered Dec 18, 2020

1 answer

11

NIELIT Scientist B 2020 November: 66
Which of the following can be used when creating a pool of global addresses instead of the netmask command? /(slash notation) prefix-length no mask block-size

Which of the following can be used when creating a pool of global addresses instead of the netmask command?/(slash notation)prefix-lengthno maskblock-size

430 views

answered Dec 18, 2020

1 answer

12

GATE Overflow Test Series | Algorithms | Test 1 | Question: 9
In a hashtable with $20$ slots $30$ records are inserted with collisions being resolved by chaining. What is the expected number of key comparisons in an unsuccessful search assuming uniform hashing?

In a hashtable with $20$ slots $30$ records are inserted with collisions being resolved by chaining. What is the expected number of key comparisons in an unsuccessful sea...

638 views

commented Dec 16, 2020

2 answers

13

GATE Overflow Test Series | Digital Logic | Test 1 | Question: 10
Assume that the propagation delay in each gate in a $16$-bit ripple carry adder (made of AND, OR and NOT gates only with upto $3$ inputs) is $1ns.$ Time taken in $\text{nanoseconds}$ to perform a $16$-bit addition is $\_\_\_\_\_\_.$

Assume that the propagation delay in each gate in a $16$-bit ripple carry adder (made of AND, OR and NOT gates only with upto $3$ inputs) is $1ns.$ Time taken in $\text{n...

896 views

commented Dec 5, 2020

7 answers

14

GATE CSE 2013 | Question: 37
In an IPv4 datagram, the $M$ bit is $0$, the value of $HLEN$ is $10$, the value of total length is $400$ and the fragment offset value is $300$. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, ... , $2400$ and $2789$ First fragment, $2400$ and $2759$ Last fragment, $2400$ and $2759$ Middle fragment, $300$ and $689$

In an IPv4 datagram, the $M$ bit is $0$, the value of $HLEN$ is $10$, the value of total length is $400$ and the fragment offset value is $300$. The position of the datag...

31.9k views

commented Nov 8, 2020

8 answers

15

GATE CSE 2005 | Question: 74
Suppose the round trip propagation delay for a $10\text{ Mbps}$ Ethernet having $48\text{-bit}$ jamming signal is $46.4\ \mu s$. The minimum frame size is: $94$ $416$ $464$ $512$

Suppose the round trip propagation delay for a $10\text{ Mbps}$ Ethernet having $48\text{-bit}$ jamming signal is $46.4\ \mu s$. The minimum frame size is:$94$$416$$464$$...

49.8k views

commented Nov 8, 2020

4 answers

16

multilevel paging technique
A virtual memory system is able to support virtual address space of 256 GB. An entry in the page table is 4 bytes long. (i) Calculate the minimum page size required for a three-level paging scheme. (ii) Draw a diagram indicating how the bits of a ... (and how many) are used to index the page tables at each level, and which bits form the page offset for the case above.

A virtual memory system is able to support virtual address space of 256 GB. An entryin the page table is 4 bytes long.(i) Calculate the minimum page size required for a t...

7.8k views

commented Nov 4, 2020

2 answers

17

GATE Overflow Test Series | Discrete Mathematics | Test 2 | Question: 21
The number of non-empty partitions of a set of size $5$ is $\_\_\_\_\_$

The number of non-empty partitions of a set of size $5$ is $\_\_\_\_\_$

403 views

commented Oct 27, 2020

2 answers

18

GATE Overflow Test Series | Discrete Mathematics | Test 2 | Question: 15
Number of positive integer solutions to the equation $4x+y+z = 21$ is $\_\_\_\_$

Number of positive integer solutions to the equation $4x+y+z = 21$ is $\_\_\_\_$

433 views

commented Oct 27, 2020

3 answers

19

Mathematics: GATE 2013 EC-A-27
Let A be an mxn matrix and B an nxm matrix. It is given that determinant ( Im + AB ) = determinant ( In + BA ) , where Ik is the k k identity matrix. Using the above property, the determinant of the matrix given below is ... A) 2 B) 5 C) 8 D) 16

Let A be an mxn matrix and B an nxm matrix.It is given that determinant ( Im + AB ) = determinant ( In + BA ) , where Ik is the k×k identity matrix. Using the above prop...

5.9k views

commented Oct 16, 2020

2 answers

20

GATE CSE 1993 | Question: 7.6
A simple two-pass assembler does the following in the first pass: It allocates space for the literals. It computes the total length of the program. It builds the symbol table for the symbols and their values. It generates code for all the load and store register instructions. None of the above.

A simple two-pass assembler does the following in the first pass:It allocates space for the literals.It computes the total length of the program.It builds the symbol tabl...

19.8k views

commented Sep 22, 2020

1 answer

21

GATE CSE 1990 | Question: 16b
Consider the grammar: $G_{2}$: Para $\rightarrow$ Sentence RP | Sentence RP $\rightarrow$ b Sentence RP | b Sentence Sentence $\rightarrow$ Word b Sentence | Word Word $\rightarrow$ letter * word | letter letter $\rightarrow$ ... to use a stack algorithm to parse the following string$id*id\;b\; id * id$ The parse should generate a rightmost derivation.

Consider the grammar:$G_{2}$:Para $\rightarrow$ Sentence RP | SentenceRP $\rightarrow$ b Sentence RP | b SentenceSentence $\rightarrow$ Word b Sentence | WordWord $\right...

665 views

commented Sep 14, 2020

3 answers

22

GATE IT 2005 | Question: 62
Two shared resources $R_1$ and $R_2$ are used by processes $P_1$ and $P_2$. Each process has a certain priority for accessing each resource. Let $T_{ij}$ denote the priority of $P_i$ for accessing $R_j$. A process $P_i$ can snatch a resource $R_k$ from process $P_j$ ... that $P_1$ and $P_2$ can never deadlock? (I) and (IV) (II) and (III) (I) and (II) None of the above

Two shared resources $R_1$ and $R_2$ are used by processes $P_1$ and $P_2$. Each process has a certain priority for accessing each resource. Let $T_{ij}$ denote the prior...

8.9k views

commented Aug 11, 2020

5 answers

23

GATE CSE 1990 | Question: 3-ii
Indicate which of the following statements are true: A relational database which is in $3$NF may still have undesirable data redundancy because there may exist: Transitive functional dependencies Non-trivial functional dependencies ... dependencies involving prime attributes only on the left-side. Non-trivial functional dependencies involving only prime attributes.

Indicate which of the following statements are true:A relational database which is in $3$NF may still have undesirable data redundancy because there may exist:Transitive ...

14.5k views

commented Aug 8, 2020

9 answers

24

GATE CSE 2014 Set 1 | Question: 43
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executing on this $6$-stage pipeline, the speedup achieved with respect to non-pipelined execution if $25$% of the instructions incur $2$ pipeline stall cycles is ____________

Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...

20.0k views

commented Jul 4, 2020

9 answers

25

GATE CSE 2016 Set 1 | Question: 33
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is $\Theta (1)$ $\Theta (\log(n))$ $\Theta (\sqrt{n})$ $\Theta (n)$)

Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is$\Theta (1)$$\...

31.0k views

answered Jun 15, 2020

7 answers

26

GATE IT 2008 | Question: 18
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame? $10,000$ bytes $12,000$ bytes $15,000$ bytes $27,000$ bytes

How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame?$10,000...

16.1k views

commented Jun 7, 2020

6 answers

27

GATE IT 2007 | Question: 64
A broadcast channel has $10$ nodes and total capacity of $10$ Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of $80$ μs to poll the next node. Whenever a node is polled, it is allowed to transmit a maximum of $1000$ bytes. The maximum throughput of the broadcast channel is: $1$ Mbps $100/11$ Mbps $10$ Mbps $100$ Mbps

A broadcast channel has $10$ nodes and total capacity of $10$ Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of $80$...

10.8k views

answered Jun 6, 2020

6 answers

28

GATE IT 2005 | Question: 76
A company has a class $C$ network address of $204.204.204.0$. It wishes to have three subnets, one with $100$ hosts and two with $50$ ... $204.204.204.128/255.255.255.128$ $204.204.204.64/255.255.255.192$ $204.204.204.0/255.255.255.192$

A company has a class $C$ network address of $204.204.204.0$. It wishes to have three subnets, one with $100$ hosts and two with $50$ hosts each. Which one of the followi...

15.3k views

commented Jun 6, 2020

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