Recent activity by reboot / GATE Overflow for GATE CSE

8 answers

1

GATE CSE 2006 | Question: 49
An implementation of a queue $Q$, using two stacks $S1$ and $S2$, is given below: void insert (Q, x) { push (S1, x); } void delete (Q) { if (stack-empty(S2)) then if (stack-empty(S1)) then { print( Q is empty ); return; } else while (!(stack-empty(S1))){ x=pop ... and $2m\leq y\leq 2n $ $ 2m\leq x<2n $ and $2m\leq y\leq n+m $ $ 2m\leq x<2n $ and $2m\leq y\leq 2n $

An implementation of a queue $Q$, using two stacks $S1$ and $S2$, is given below: void insert (Q, x) { push (S1, x); } void delete (Q) { if (stack-empty(S2)) then if (sta...

32.9k views

commented Aug 29, 2021

3 answers

2

GATE CSE 2021 Set 1 | Question: 19
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that: The fastest computer gets the toughest job and the slowest computer gets the easiest job. Every computer gets at least one job. The number of ways in which this can be done is ___________.

There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that:The fastest computer g...

11.8k views

commented Feb 27, 2021

3 answers

3

P and C doubt
Given a 4 *4 grid points , how many Triangles with vertices on the grid can be formed?

Given a 4 *4 grid points , how many Triangles with vertices on the grid can be formed?

1.3k views

answered Feb 24, 2021

1 answer

4

If L is any language accepted by DPDA with stack containing only one symbol. Then L can be

1.9k views

commented Feb 23, 2021

5 answers

5

ISI2018-MMA-3
The number of trailing zeros in $100!$ is $21$ $23$ $24$ $25$

The number of trailing zeros in $100!$ is$21$$23$$24$$25$

1.0k views

answered Feb 23, 2021

6 answers

6

GATE CSE 2021 Set 2 | Question: 44
If the numerical value of a $2$-byte unsigned integer on a little endian computer is $255$ more than that on a big endian computer, which of the following choices represent(s) the unsigned integer on a little endian computer? $0\text{x}6665$ $0\text{x} 0001$ $0\text{x} 4243$ $0\text{x} 0100$

If the numerical value of a $2$-byte unsigned integer on a little endian computer is $255$ more than that on a big endian computer, which of the following choices represe...

14.5k views

commented Feb 23, 2021

1 answer

7

GATE Overflow Test Series | Mock GATE | Test 5 | Question: 15
Consider a CPU where all the instructions require $4$ clock cycles to complete execution. There are $300$ instructions in the instruction set. It is found that $164$ control signals are needed to be generated by the control unit. ... word required is $\alpha$ and that of control address register is $\beta,\; \alpha+\beta = $ _________

Consider a CPU where all the instructions require $4$ clock cycles to complete execution. There are $300$ instructions in the instruction set. It is found that $164$ cont...

617 views

commented Feb 10, 2021

2 answers

8

GATE Overflow Test Series | Mock GATE | Test 5 | Question: 39
Consider the following C program: #include<stdio.h> #include<unistd.h> #define N 8 void fun1() { printf("%s", "hello"); } int main() { void fun1(); for(int i=0; i<N; i+=2) { fork(); fun1(); fflush(stdout); } } The total number of characters printed by the above program once executed is _________

Consider the following C program:#include<stdio.h #include<unistd.h #define N 8 void fun1() { printf("%s", "hello"); } int main() { void fun1(); for(int i=0; i<N; i+=2) {...

788 views

commented Feb 10, 2021

6 answers

9

GATE CSE 2016 Set 1 | Question: 53
An IP datagram of size $1000$ $\text{bytes }$arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is $100$ $\text{bytes }$. Assume that the size of the IP header is $20$ $\text{bytes }.$ The number of fragments that the IP datagram will be divided into for transmission is________.

An IP datagram of size $1000$ $\text{bytes }$arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is $100$ $\text{by...

16.7k views

commented Feb 7, 2021

6 answers

10

GATE IT 2004 | Question: 85
Consider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability $p$ = $0.2$ in every slot. There is no backoff and one frame can be transmitted in one slot. If more than one host transmits in the same slot, then ... if each host has to be provided a minimum throughput of $0.16$ frames per time slot? $1$ $2$ $3$ $4$

Consider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability $p$ = $0.2$ in every slot. There is no backoff and...

17.0k views

commented Feb 6, 2021

3 answers

11

TCP slow start
Suppose TCP’s additive increase and multiplicative decrease algorithm is used as a congestion control algorithm. The slow start phase begins with $4$ MSS and threshold at start of first transmission is $16$ MSS. Assume that a time-out occurs during $6$th transmission, what will be the congestion window at $10$th transmission.

Suppose TCP’s additive increase and multiplicative decrease algorithm is used as a congestion control algorithm. The slow start phase begins with $4$ MSS and threshold ...

3.4k views

commented Feb 6, 2021

2 answers

12

Cache Memory
Consider the following statements: S1 : Doubling the line size halves the number of tags in the cache. S2 : Doubling the associativity doubles the number of tags in the cache. S3 : Doubling the line size usually reduce compulsory misses. Which of the above statements is always true?

Consider the following statements:S1 : Doubling the line size halves the number of tags in the cache.S2 : Doubling the associativity doubles the number of tags in the cac...

2.2k views

commented Feb 6, 2021

1 answer

13

GATE Overflow Test Series | Spatial and Analytical Aptitude | Test 1 | Question: 28
Which of the following figures can be formed when the given figure is folded? (Mark all the appropriate choices)

Which of the following figures can be formed when the given figure is folded? (Mark all the appropriate choices)

140 views

commented Feb 5, 2021

1 answer

14

% time of CPU blocked in DMA
Please Explain the formulae for % time of CPU blocked in both Cycle Stealing mode and Burst mode of DMA

Please Explain the formulae for % time of CPU blocked in both Cycle Stealing mode and Burst mode of DMA

8.2k views

commented Feb 5, 2021

1 answer

15

MadeEasy CBT Test 2018: Algorithms - Minimum Spanning Trees
Consider a graph G with positive and distinct edge weights : $1)$ The highest weight edge will never be included in any MST : false if its in cut set $2)$ There will be different MST but with equal weights : False again because applying any algorithm either prim or kruskal it will give same MST G'. Please comment on my understanding.

Consider a graph G with positive and distinct edge weights :$1)$ The highest weight edge will never be included in any MST : false if its in cut set$2)$ There will be dif...

518 views

commented Feb 3, 2021

2 answers

16

GATE CSE 2004 | Question: 33
Consider the following C program segment: char p[20]; int i; char* s = "string"; int length = strlen(s); for(i = 0; i < length; i++) p[i] = s[length-i]; printf("%s", p); The output of the program is: gnirts string gnirt no output is printed

Consider the following C program segment:char p[20]; int i; char* s = "string"; int length = strlen(s); for(i = 0; i < length; i++) p[i] = s[length-i]; printf("%s", p);Th...

12.9k views

commented Feb 3, 2021

5 answers

17

GATE CSE 2012 | Question: 29
Let $G$ be a weighted graph with edge weights greater than one and $G'$ be the graph constructed by squaring the weights of edges in $G$. Let $T$ and $T'$ be the minimum spanning trees of $G$ and $G'$, respectively, with total weights $t$ ... $t' < t^2$ $T' \neq T$ but total weight $t' = t^2$ None of the above

Let $G$ be a weighted graph with edge weights greater than one and $G'$ be the graph constructed by squaring the weights of edges in $G$. Let $T$ and $T'$ be the minimum ...

16.4k views

commented Feb 3, 2021

2 answers

18

GATE CSE 1996 | Question: 1.21
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is $256 \times 16$ $64 K \times 8$ $4 K \times 16$ $64 K \times 16$

A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is$256 \times 16$$64 K \times 8$$4 K \times 16$$64 K \times...

18.6k views

commented Feb 2, 2021

1 answer

19

carry look ahead adder vs ripple carry
$Exclusive-OR$ gate has a propagation delay of $10$ ns and that the $AND$ or $OR$ gates have a propagation delay of $5$ ns.What is the total propagation delay time in the four-bit adder.Assume $FAN-IN =2$ $1)$ ripple adder $2)$ carry look ahead adder

$Exclusive-OR$ gate has a propagation delay of $10$ ns and that the $AND$ or $OR$ gates have a propagation delay of $5$ ns.What is the total propagation delay time in the...

1.1k views

commented Feb 1, 2021

2 answers

20

MadeEasy Workbook: Digital Logic - Adder
x and y are two n bit numbers. these numbers are added by n bit carry look ahead adder which uses k logic levels. if the average gate delay of carry look ahead adder is d then what will be the maximum Delay of carry look ahead adder circuit? N2 Kd Nkd Nd

x and y are two n bit numbers. these numbers are added by n bit carry look ahead adder which uses k logic levels. if the average gate delay of carry look ahead adder is d...

1.7k views

answered Feb 1, 2021

3 answers

21

GATE Overflow Test Series | Programming | Test 1 | Question: 1
Consider the following C code fragment ( denote further statements): int main() { int my_array[30][40][50]; init_array(&my_array); ... } Which of the following is a valid declaration for the function init_array? Mark all the correct ... array)[30][40][50]); void init_array(int *** array); void init_array(int ** array[30][40]);

Consider the following C code fragment (… denote further statements):int main() { int my_array[30][40][50]; init_array(&my_array); ... }Which of the following is a vali...

672 views

commented Feb 1, 2021

11 answers

22

GATE CSE 2015 Set 3 | Question: 26
Consider the following C program #include<stdio.h> int main() { static int a[] = {10, 20, 30, 40, 50}; static int *p[] = {a, a+3, a+4, a+1, a+2}; int **ptr = p; ptr++; printf("%d%d", ptr-p, **ptr); } The output of the program is _______.

Consider the following C program#include<stdio.h int main() { static int a[] = {10, 20, 30, 40, 50}; static int *p[] = {a, a+3, a+4, a+1, a+2}; int ptr = p; ptr++; print...

22.6k views

commented Jan 31, 2021

4 answers

23

GATE CSE 2014 Set 2 | Question: 42
Consider the C function given below. int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; } Which one of the following is TRUE? The function returns $0$ for all ... . The function returns $0$ when $j = 50$. The function will exhaust the runtime stack or run into an infinite loop when $j = 50$.

Consider the C function given below.int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; }Which one of the fol...

8.9k views

commented Jan 31, 2021

4 answers

24

GATE CSE 2014 Set 2 | Question: 11
Suppose $n$ and $p$ are unsigned int variables in a C program. We wish to set $p$ to $^nC_3$. If $n$ is large, which one of the following statements is most likely to set $p$ correctly? $p = n * (n-1) * (n-2) / 6;$ $p = n * (n-1) / 2 * (n-2) / 3;$ $p = n * (n-1) / 3 * (n-2) / 2;$ $p = n * (n-1) * (n-2) / 6.0;$

Suppose $n$ and $p$ are unsigned int variables in a C program. We wish to set $p$ to $^nC_3$. If $n$ is large, which one of the following statements is most likely to set...

15.6k views

commented Jan 31, 2021

2 answers

25

GATE IT 2008 | Question: 52
C program is given below: # include <stdio.h> int main () { int i, j; char a [2] [3] = {{'a', 'b', 'c'}, {'d', 'e', 'f'}}; char b [3] [2]; char *p = *b; for (i = 0; i < 2; i++) { for (j = 0; j < ... $\text{b e}$ $\text{c f}$ $\text{a c}$ $\text{e b}$ $\text{d f}$ $\text{a e}$ $\text{d c}$ $\text{b f}$

C program is given below:# include <stdio.h int main () { int i, j; char a [3] = {{'a', 'b', 'c'}, {'d', 'e', 'f'}}; char b [3] ; char *p = *b; for (i = 0; i < 2; i++)...

10.5k views

commented Jan 31, 2021

3 answers

26

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 30, 2021

2 answers

27

GATE Overflow Test Series | Programming | Test 1 | Question: 20
What will be the output of the following C program? #include <stdio.h> int main() { int a[10][20][30]={0}; printf("%d %d %d",&a+1 - &a, a[10][20] - a[10][10], a[10] - a[5]); return 0; } 1 300 100 600 300 100 1 100 5 None of the above

What will be the output of the following C program?#include <stdio.h int main() { int a[10][20][30]={0}; printf("%d %d %d",&a+1 - &a, a[10][20] - a[10][10], a[10] - a[5])...

769 views

commented Jan 30, 2021

2 answers

28

Suppose the element a,b in a group satisfies aba-1=b2 for b<>e

5.0k views

commented Jan 29, 2021

1 answer

29

Group Theory
Assume g is an element of the group.consider the following conditions of g with e as identity element. 1.g8=e 2.g2$\neq$e 3.Order of g is not 8. Find the order of g.

Assume g is an element of the group.consider the following conditions of g with e as identity element.1.g8=e2.g2$\neq$e3.Order of g is not 8.Find the order of g.

1.9k views

commented Jan 29, 2021

1 answer

30

TIFR2010-Maths-B-9
Let $G=\left \{ z \in \mathbb{C} \mid z^n = 1 \text{ for some positive integer } n \right \}$. Then under multiplication of complex numbers, $G$ is a group of finite order $G$ is a group of infinite order, but every element of $G$ has finite order $G$ is a cyclic group None of the above

Let $$G=\left \{ z \in \mathbb{C} \mid z^n = 1 \text{ for some positive integer } n \right \}$$. Then under multiplication of complex numbers,$G$ is a group of finite ord...

1.7k views

commented Jan 29, 2021

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