Recent activity by Amcodes / GATE Overflow for GATE CSE

1 answer

1

GATE CSE 2021 Set 2 | Question: 21
A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}$. The size of a record pointer for this disk is $7$ bytes. ... that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is ________

A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}...

9.2k views

commented May 4, 2021

1 answer

2

IIT Guwahati Form Filling
I couldn't find separate application forms for mtech in cs and mtech in data science at IIT Guwahati. The following is the link to apply for mtech: http://www.iitg.ac.in/acad/Admission_July2019/mtech.html But nowhere have they mentioned to choose data science or computer science in the form. Is there a separate form for both?

I couldn't find separate application forms for mtech in cs and mtech in data science at IIT Guwahati.The following is the link to apply for mtech:http://www.iitg.ac.in/ac...

1.2k views

commented Feb 20, 2021

0 answers

3

iit admissions
I have been shortlisted for Mtech iit Bhubaneshwar and most likely would be for iit Guwahati data science but on the day of written test i have BTech final year exam what should I do?

I have been shortlisted for Mtech iit Bhubaneshwar and most likely would be for iit Guwahati data science but on the day of written test i have BTech final year exam what...

710 views

commented Feb 20, 2021

2 answers

4

GATE CSE 2021 Set 2 | Question: 14
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling? Turnaround time includes waiting time The goal is to only maximize $\text{CPU}$ utilization and minimize throughput Round-robin policy ... $\text{CPU}$ time required by each of the processes is not known apriori Implementing preemptive scheduling needs hardware support

Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling?Turnaround time includes waiting timeThe goal is to only maximize $\text{CPU}...

10.6k views

commented Feb 18, 2021

3 answers

5

GATE CSE 2021 Set 2 | Question: 39
For constants $a \geq 1$ and $b>1$, consider the following recurrence defined on the non-negative integers: $T(n) = a \cdot T \left(\dfrac{n}{b} \right) + f(n)$ Which one of the following options is correct about the recurrence $T(n)$? If $f(n)$ is $n \log_2(n)$, ... $f(n)$ is $\Theta(n^{\log_b(a)})$, then $T(n)$ is $\Theta(n^{\log_b(a)})$

For constants $a \geq 1$ and $b>1$, consider the following recurrence defined on the non-negative integers:$$T(n) = a \cdot T \left(\dfrac{n}{b} \right) + f(n)$$ Which on...

8.2k views

commented Feb 18, 2021

4 answers

6

GATE CSE 2021 Set 2 | Question: 42
Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes spawns two threads $T_1$ and $T_2$: int x = 0; // global Lock L1; // global main () { create a ... the value of $y$ as $2.$ Both $T_1$ and $T_2$, in both the processes, will print the value of $y$ as $1.$

Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes ...

10.4k views

commented Feb 18, 2021

3 answers

7

GATE CSE 2021 Set 2 | Question: 55
In a directed acyclic graph with a source vertex $\textsf{s}$, the $\textit{quality-score}$ of a directed path is defined to be the product of the weights of the edges on the path. Further, for a vertex $v$ other than $\textsf{s}$, the quality ... $\textsf{s}$ is assumed to be $1$. The sum of the quality-scores of all vertices on the graph shown above is _______

In a directed acyclic graph with a source vertex $\textsf{s}$, the $\textit{quality-score}$ of a directed path is defined to be the product of the weights of the edges on...

7.2k views

commented Feb 18, 2021

5 answers

8

GATE CSE 2021 Set 2 | Question: 47
Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string $\epsilon$ is divisible by three. $(0+1(01^*0)^*1)^*$ $(0+11+10(1+00)^*01)^*$ $(0^*(1(01^*0)^*1)^*)^*$ $(0+11+11(1+00)^*00)^*$

Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string $\epsilon$ is divisible by three...

12.4k views

commented Feb 18, 2021

1 answer

9

GATE CSE 2021 Set 2 | Question: 45
Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is shown below. The objective is to find the shortest-cost path from the router $R$ to routers $P$ and $Q$. Assume that $R$ does not initially ... a packet from $R$ to $P$ is $Y$ The next hop router for a packet from $R$ to $Q$ is $Z$

Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is shown below.The objective is to find ...

5.1k views

commented Feb 18, 2021

2 answers

10

GATE CSE 2021 Set 2 | Question: 35
Consider the following $\text{ANSI C}$ program: #include <stdio.h> #include <stdlib.h> struct Node{ int value; struct Node *next;}; int main( ) { struct Node *boxE, *head, *boxN; int index=0; boxE=head= (struct ... which will be reported as an error by the compiler It dereferences an uninitialized pointer that may result in a run-time error

Consider the following $\text{ANSI C}$ program:#include <stdio.h #include <stdlib.h struct Node{ int value; struct Node *next;}; int main( ) { struct Node *boxE, *head, *...

9.7k views

commented Feb 18, 2021

2 answers

11

GATE CSE 2021 Set 2 | Question: 32
Let $S$ be the following schedule of operations of three transactions $T_1$, $T_2$ and $T_3$ in a relational database system: $R_2(Y), R_1(X), R_3(Z), R_1(Y)W_1(X), R_2(Z), W_2(Y), R_3(X), W_3(Z)$ Consider the statements $P$ and $Q$ below: $P$ ... Both $P$ and $Q$ are true $P$ is true and $Q$ is false $P$ is false and $Q$ is true Both $P$ and $Q$ are false

Let $S$ be the following schedule of operations of three transactions $T_1$, $T_2$ and $T_3$ in a relational database system:$$R_2(Y), R_1(X), R_3(Z), R_1(...

7.2k views

commented Feb 18, 2021

3 answers

12

GATE CSE 2021 Set 2 | Question: 20
Consider a computer system with $\text{DMA}$ support. The $\text{DMA}$ module is transferring one $8$-bit character in one $\text{CPU}$ cycle from a device to memory through cycle stealing at regular intervals. Consider a $\text{2 MHz}$ ... $\text{DMA}$, the data transfer rate of the device is __________ bits per second.

Consider a computer system with $\text{DMA}$ support. The $\text{DMA}$ module is transferring one $8$-bit character in one $\text{CPU}$ cycle from a device to memory thro...

11.4k views

commented Feb 18, 2021

3 answers

13

GATE CSE 2021 Set 2 | Question: 9
Let $L \subseteq \{0,1\}^*$ be an arbitrary regular language accepted by a minimal $\text{DFA}$ with $k$ states. Which one of the following languages must necessarily be accepted by a minimal $\text{DFA}$ with $k$ states? $L-\{01\}$ $L \cup \{01\}$ $\{0,1\}^* – L$ $L \cdot L$

Let $L \subseteq \{0,1\}^*$ be an arbitrary regular language accepted by a minimal $\text{DFA}$ with $k$ states. Which one of the following languages must necessarily be ...

9.3k views

commented Feb 18, 2021

4 answers

14

GATE CSE 2021 Set 2 | Question: 8
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size $n$? $\Theta ( \sqrt{n})$ $\Theta (\log _2(n))$ $\Theta(n^2)$ $\Theta(n)$

What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size $n$?$\Theta ( \sqrt{n})$$\Theta (\log _2(n))$$\Theta...

12.0k views

commented Feb 18, 2021

1 answer

15

GATE2018 ME-2: GA-10
An unbiased coin is tossed six times in a row and four different such trials are conducted. One trial implies six tosses of the coin. If H stands for head ans T stands for tail, the following are the observations from the four trials. HTHTHT TTHHHT HTTHHT HHHT_ _ Which ... correct? Two T will occur. One H and one T will occur. Two H will occur. One H will be followed by one T.

An unbiased coin is tossed six times in a row and four different such trials are conducted. One trial implies six tosses of the coin. If H stands for head ans T stands fo...

3.7k views

commented Jan 22, 2021

8 answers

16

GATE2012 CY: GA-7
$A$ and $B$ are friends. They decide to meet between 1:00 pm and 2:00 pm on a given day. There is a condition that whoever arrives first will not wait for the other for more than $15$ minutes. The probability that they will meet on that day is $1/4$ $1/16$ $7/16$ $9/16$

$A$ and $B$ are friends. They decide to meet between 1:00 pm and 2:00 pm on a given day. There is a condition that whoever arrives first will not wait for the other for m...

17.2k views

commented Jan 22, 2021

4 answers

17

GATE CSE 2003 | Question: 63, ISRO2009-25
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements in the set. Deletion of the smallest element Insertion of an ... used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used

A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements...

20.3k views

commented Jan 17, 2021

9 answers

18

GATE CSE 2015 Set 1 | Question: 54
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.

Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.

24.7k views

commented Jan 8, 2021

3 answers

19

GATE CSE 2013 | Question: 49
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. ... without any spill to memory? Do not apply any optimization other than optimizing register allocation. 3 4 5 6

The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and on...

6.9k views

commented Jan 8, 2021

4 answers

20

GATE CSE 1996 | Question: 25
A hard disk is connected to a $50$ MHz processor through a DMA controller. Assume that the initial set-up of a DMA transfer takes $1000$ clock cycles for the processor, and assume that the handling of the interrupt at DMA completion requires $500$ ... What fraction of the processor time is consumed by the disk, if the disk is actively transferring $100\%$ of the time?

A hard disk is connected to a $50$ MHz processor through a DMA controller. Assume that the initial set-up of a DMA transfer takes $1000$ clock cycles for the processor, ...

10.3k views

commented Jan 5, 2021

2 answers

21

GATE CSE 1994 | Question: 2.8
Let $A, B,$ and $C$ be independent events which occur with probabilities $0.8, 0.5,$ and $0.3$ respectively. The probability of occurrence of at least one of the event is _______

Let $A, B,$ and $C$ be independent events which occur with probabilities $0.8, 0.5,$ and $0.3$ respectively. The probability of occurrence of at least one of the event is...

4.6k views

commented Jan 3, 2021

1 answer

22

Exponential Back off Algorithm
Assume that X and Y are the only two stations on an ethernet. Each has a steady queue of frames to send. Both X and Y attempt to transmit a frame, collide and Y wins the first backoff race. At the end of this successful transmission by Y, both X and Y ... X wins the second backoff race is I think it should be 0.03125 or 1/32. But the answer given is 0.125 or 1/8.

Assume that X and Y are the only two stations on an ethernet. Each has a steadyqueue of frames to send. Both X and Y attempt to transmit a frame, collide and Ywins the fi...

2.0k views

commented Dec 26, 2020

12 answers

23

GATE CSE 2014 Set 1 | Question: 53
Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE? $(( p \leftrightarrow q) \wedge r) \vee (p \wedge q \wedge \sim r)$ $( \sim (p \leftrightarrow q) \wedge r)\vee (p \wedge q \wedge \sim r)$ ... $(\sim (p \leftrightarrow q) \wedge r) \wedge (p \wedge q \wedge \sim r) $

Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE?$(( p \leftrightarrow q) \wedge r) \vee (p \wedge q \wedge...

13.8k views

answered Dec 24, 2020

9 answers

24

GATE CSE 2019 | Question: 46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.

Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at ...

30.8k views

answered Dec 20, 2020

11 answers

25

TIFR CSE 2012 | Part A | Question: 1
Amar and Akbar both tell the truth with probability $\dfrac{3 } {4}$ and lie with probability $\dfrac{1}{4}$. Amar watches a test match and talks to Akbar about the outcome. Akbar, in turn, tells Anthony, "Amar told me that India won". What ... $\left(\dfrac{7}{16}\right)$ $\left(\dfrac{10}{16}\right)$ None of the above

Amar and Akbar both tell the truth with probability $\dfrac{3 } {4}$ and lie with probability $\dfrac{1}{4}$. Amar watches a test match and talks to Akbar about the outco...

9.4k views

commented Dec 17, 2020

3 answers

26

GATE CSE 1988 | Question: 10iib
Given below is solution for the critical section problem of two processes $P_0$ and $P_1$ ... until false Determine of the above solution is correct. If it is incorrect, demonstrate with an example how it violates the conditions.

Given below is solution for the critical section problem of two processes $P_0$ and $P_1$ sharing the following variables:var flag :array [0..1] of boolean; (initially fa...

4.2k views

commented Dec 12, 2020

4 answers

27

GATE2012 AR: GA-5
Ten teams participate in a tournament. Every team plays each of the other teams twice. The total number of matches to be played is $20$ $45$ $60$ $90$

Ten teams participate in a tournament. Every team plays each of the other teams twice. The total number of matches to be played is $20$$45$$60$$90$

4.6k views

answered Dec 10, 2020

5 answers

28

GATE CSE 2010 | Question: 51
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... weight of a path $P$ from vertex $1$ to vertex $2$ in this graph such that $P$ contains at most $3$ edges? $7$ $8$ $9$ $10$

Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$$$W=\begin{pmatrix} 0...

14.9k views

commented Dec 3, 2020

9 answers

29

GATE IT 2005 | Question: 52
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having ... $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.

Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which ...

20.8k views

commented Dec 3, 2020

11 answers

30

GATE CSE 2008 | Question: 45
Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance to only vertex $a$ only vertices $a, e, f, g, h$ only vertices $a, b, c, d$ all the vertices

Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance toonly vertex $a$only vertices $...

27.7k views

commented Dec 2, 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