Recent activity by Markzuck / GATE Overflow for GATE CSE

9 answers

1

GATE CSE 2019 | Question: 25
Consider a sequence of $14$ elements: $A=[-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]$. The sequence sum $S(i,j) = \Sigma_{k=i}^j A[k]$. Determine the maximum of $S(i,j)$, where $0 \leq i \leq j <14$. (Divide and conquer approach may be used.) Answer: ___________

Consider a sequence of $14$ elements: $A=[-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]$. The sequence sum $S(i,j) = \Sigma_{k=i}^j A[k]$. Determine the maximum of ...

19.3k views

answered Feb 7, 2019

11 answers

2

GATE CSE 2019 | Question: 45
A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a cache miss, the memory controller first takes $1$ cycle to accept ... for the memory system when the program running on the processor issues a series of read operations is ______$\times 10^6$ bytes/sec.

A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a ...

20.5k views

commented Feb 6, 2019

1 answer

3

Gate 2019
What is the answer for the question given a statement about beggars?

What is the answer for the question given a statement about beggars?

753 views

answered Feb 4, 2019

1 answer

4

gate 2019
What is the answer for the predicate logic question,in which a formula was given and asked to find the sets satisying it?

What is the answer for the predicate logic question,in which a formula was given and asked to find the sets satisying it?

348 views

answered Feb 4, 2019

1 answer

5

Gate 2019 CSE
DRAMA= 60 Dance = 30 Math = 12 Drama and dance and math = 2 Dance and drama = 40 Dance and math = 15 Drama and math = 7 75 % of total students not participate in any the club. Total number of students?? A) 900 B) 975 C) 1000 D) 225 (Please correct the data if wrong.)

DRAMA= 60Dance = 30Math = 12Drama and dance and math = 2Dance and drama = 40Dance and math = 15Drama and math = 775 % of total students not participate in any the club. ...

5.5k views

answered Feb 4, 2019

4 answers

6

GATE CSE 2019 | Question: 4
In $16$-bit $2$’s complement representation, the decimal number $-28$ is: $1111 \: 1111 \: 0001 \: 1100$ $0000 \: 0000 \: 1110 \: 0100$ $1111 \: 1111 \: 1110 \: 0100$ $1000 \: 0000 \: 1110 \: 0100$

In $16$-bit $2$’s complement representation, the decimal number $-28$ is:$1111 \: 1111 \: 0001 \: 1100$$0000 \: 0000 \: 1110 \: 0100$$1111 \: 1111 \: 1110 \: 0100$$1000...

11.2k views

commented Feb 4, 2019

2 answers

7

GATE 2019
What is the complexity of finding median of medians of N lists containing N elements each. N is odd and the lists are unsorted and no 2 lists have same element.

What is the complexity of finding median of medians of N lists containing N elements each. N is odd and the lists are unsorted and no 2 lists have same element.

1.7k views

commented Feb 3, 2019

6 answers

8

GATE CSE 2019 | Question: 49
Consider that $15$ machines need to be connected in a LAN using $8$-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is ______

Consider that $15$ machines need to be connected in a LAN using $8$-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum ...

20.0k views

commented Feb 3, 2019

1 answer

9

Self doubt- TCP congestion control
When during TCP congestion control, timeout occurs in 5th transition, then shall those packets be considered as received or shall be resent? Asking for if question asks for number of transmission to send given number of packets using TCP congestion slow start phase.

When during TCP congestion control, timeout occurs in 5th transition, then shall those packets be considered as received or shall be resent?Asking for if question asks fo...

462 views

commented Feb 1, 2019

3 answers

10

GATE CSE 1994 | Question: 1.24
Consider the following heap (figure) in which blank regions are not in use and hatched region are in use. The sequence of requests for blocks of sizes $300, 25, 125, 50$ can be satisfied if we use either first fit or best fit policy (any one) first fit but not best fit policy best fit but not first fit policy None of the above

Consider the following heap (figure) in which blank regions are not in use and hatched region are in use.The sequence of requests for blocks of sizes $300, 25, 125, 50$ c...

12.1k views

commented Jan 20, 2019

3 answers

11

GATE CSE 2015 Set 2 | Question: 30
Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$and $250$ $\text{KB}$, where $\text{KB}$refers to $\text{kilobyte}$. These partitions need to be allotted to four processes of ... and $250$ $\text{KB}$ $250$ $\text{KB}$ and $300$ $\text{KB}$ $300$ $\text{KB}$ and $400$ $\text{KB}$

Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$and $250$ $\text{KB}$, where $\text{K...

7.3k views

commented Jan 20, 2019

3 answers

12

GATE CSE 2018 | Question: 23
A $32\text{-bit}$ wide main memory unit with a capacity of $1\;\textsf{GB}$ is built using $256\textsf{M} \times 4\text{-bit}$ DRAM chips. The number of rows of memory cells in the DRAM chip is $2^{14}$. The ... The percentage (rounded to the closest integer) of the time available for performing the memory read/write operations in the main memory unit is _________.

A $32\text{-bit}$ wide main memory unit with a capacity of $1\;\textsf{GB}$ is built using $256\textsf{M} \times 4\text{-bit}$ DRAM chips. The number of rows of memory ce...

25.9k views

commented Jan 20, 2019

4 answers

13

GATE CSE 2005 | Question: 68
A $5$ stage pipelined CPU has the following sequence of stages: IF - instruction fetch from instruction memory RD - Instruction decode and register read EX - Execute: ALU operation for data and address computation MA - Data memory access - for write access, the ... taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$

A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ...

46.4k views

commented Jan 19, 2019

1 answer

14

GATE 2012 EXAM congestion control modified question
Consider an instance of TCP's Additive Increase Multiplicative Decrease(AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 12 ... afterwards additive increase mechanism or it will additive increase after 8mss straight away to 9mss then 10mss.. please help

Consider an instance of TCP’s Additive Increase Multiplicative Decrease(AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the thre...

1.2k views

commented Jan 18, 2019

5 answers

15

GATE CSE 2015 Set 2 | Question: 46
Consider a simple checkpointing protocol and the following set of operations in the log. (start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7); (checkpoint); (start, T2); (write, T2, x, 1, 9); (commit, T2); (start, T3); ( ... Undo: T3, T1; Redo: T2 Undo: T3, T1; Redo: T2, T4 Undo: none; Redo: T2, T4, T3, T1 Undo: T3, T1, T4; Redo: T2

Consider a simple checkpointing protocol and the following set of operations in the log.(start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7)...

24.9k views

commented Jan 17, 2019

9 answers

16

GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$

The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is$\Theta(1)$$\Theta(\sqrt{\log} n)$$\Theta(\frac{\log n}{\log \log n})$$\Theta(\log n)...

28.3k views

commented Jan 15, 2019

4 answers

17

MadeEasy Test Series: Combinatory - Permutations And Combinations
MY SOLUTION : Fix the root then next level 2 elements ( 2! possibilities) next level 4 elements( 4! possibilities) last level 2 elements ( 2! possibilities) total possibility = 2! * 4! * 2! = 2 * 24 * 2 = 96 what ... that if node of above graph is filled with these elements it satisfies max heap property a)96 b)896 c)2688 d) none

MY SOLUTION :Fix the rootthen next level 2 elements ( 2! possibilities)next level 4 elements( 4! possibilities)last level 2 elements ( 2! possibilities)total possibility ...

3.8k views

commented Jan 15, 2019

0 answers

18

Madeeasy Max Heap 2019
Please explain the logic behind this shortcut and when to be used?

Please explain the logic behind this shortcut and when to be used?

1.2k views

asked Jan 13, 2019

0 answers

19

Composition of a relation- Madeeasy 2019
How to take composition of a Relation? here used concept of function but when to go with the transitivity rule concept as mentioned below? Please clarify in general when to use which method

How to take composition of a Relation? here used concept of function but when to go with the transitivity rule concept as mentioned below?Please clarify in general when t...

3.3k views

asked Jan 10, 2019

1 answer

20

MadeEasy Test Series 2019: Programming & DS - Programming In C
Please explained detialed execution of this code, I am not getting how int stored in char, like we can interchange using ASCII but still cant store right?

Please explained detialed execution of this code, I am not getting how int stored in char, like we can interchange using ASCII but still cant store right?

531 views

asked Jan 10, 2019

1 answer

21

MadeEasy Test Series 2019: Computer Networks - Congestion Control
here TOTAL 2000 segments need to be sent, and after x RTT, it will send 2001 segments but for total we shall take count of addition of all the previous also na?

here TOTAL 2000 segments need to be sent, and after x RTT, it will send 2001 segments but for total we shall take count of addition of all the previous also na?

944 views

commented Jan 10, 2019

4 answers

22

Madeeasy- Types of Dependencies
Please clarify along with the names.

Please clarify along with the names.

1.4k views

asked Jan 9, 2019

1 answer

23

Hamming Error Correction- Madeeasy 2019
someone please post detailed solution pic for this procedure- I am getting bits 1 and 2 as errorneous.

someone please post detailed solution pic for this procedure- I am getting bits 1 and 2 as errorneous.

1.6k views

asked Jan 9, 2019

2 answers

24

MadeEasy Test Series 2019: Computer Networls - Congestion Control
Please help, I am getting total number of transmission to get BACK TO 38 as 14 and NOT 15. after 14th, it would have became 38, so no need to consider 15th segment right?

Please help, I am getting total number of transmission to get BACK TO 38 as 14 and NOT 15.after 14th, it would have became 38, so no need to consider 15th segment right?

1.0k views

commented Jan 8, 2019

1 answer

25

MadeEasy Test Series: Complier Design - Intermediate Code
someone please share detailed rules for this along with solution- would be of great help. and we usually dont take start and end state- arent they extra here? coz count comes different

someone please share detailed rules for this along with solution- would be of great help.and we usually dont take start and end state- arent they extra here? coz count co...

768 views

asked Jan 8, 2019

1 answer

26

MadeEasy Test Series: Computer Networks - IP Packet
Fragmentation is only done at the DATA part of the IP layer and NOT the IP header right? in above, 1st should be 920 instead of 940 as 20B of IP header shall not be counted in fragmentation right? please help with a detailed solution.

Fragmentation is only done at the DATA part of the IP layer and NOT the IP header right?in above, 1st should be 920 instead of 940 as 20B of IP header shall not be counte...

674 views

asked Jan 7, 2019

1 answer

27

MadeEasy Test Series: Algorithms - Time Complexity
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?

Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?

507 views

asked Jan 6, 2019

6 answers

28

GATE CSE 2017 Set 2 | Question: 29
In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory is $18$ clock cycles. The miss rate of $L_1$ cache is twice that of $L_2$. The average ... respectively are $0.111$ and $0.056$ $0.056$ and $0.111$ $0.0892$ and $0.1784$ $0.1784$ and $0.0892$

In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory i...

28.7k views

commented Jan 3, 2019

0 answers

29

MadeEasy Test Series 2019: Programming & DS - Programming In C
Please explain the solution, whats the actual logic in questions of Preprocessor codes?

Please explain the solution, whats the actual logic in questions of Preprocessor codes?

396 views

asked Dec 30, 2018

1 answer

30

#Graphs #DS BFS AND DFS Question?
Can BFS and DFS both work cyclic and acyclic graphs?! Kindly explain for each of 'em. Thank you!

Can BFS and DFS both work cyclic and acyclic graphs?! Kindly explain for each of 'em. Thank you!

709 views

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