Recent activity by gurjit / GATE Overflow for GATE CSE

13 answers

1

GATE IT 2007 | Question: 29
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$

When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order gi...

39.8k views

commented Jul 28, 2019

3 answers

2

Why L = { w x w ∣ w , x ∈ ( a + b ) + } is not regular?
We can say there are four types of strings in the language so the regex will be: a(a+b)+a + b(a+b)+b + a(a+b)+b + b(a+b)+a Please expleain where I am wrong

We can say there are four types of strings in the language so the regex will be: a(a+b)+a + b(a+b)+b + a(a+b)+b + b(a+b)+a Please expleain where I am wrong

5.6k views

commented Jul 26, 2019

15 answers

3

GATE CSE 2003 | Question: 78
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns

A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addres...

50.5k views

commented Jul 26, 2019

1 answer

4

UGC NET CSE | June 2019 | Part 1 | Question: 27
Given below are two premises with four conclusions drawn from them. Which of the following conclusions could be validly drawn from the premises? Premises: No paper is pen Some paper are handmade Conclusions: All paper are handmade Some handmade are pen Some handmade are not pen All handmade are paper

Given below are two premises with four conclusions drawn from them. Which of the following conclusions could be validly drawn from the premises?Premises:No paper is penSo...

950 views

commented Jul 24, 2019

11 answers

5

GATE CSE 2001 | Question: 2.13
Consider the following data path of a simple non-pipelined CPU. The registers $A, B$, $A_{1},A_{2}, \textsf{MDR},$ the $\textsf{bus}$ and the $\textsf{ALU}$ are $8$-$bit$ wide. $\textsf{SP}$ and $\textsf{MAR}$ are $16$-$bit$ registers. The ... $\textsf{CPU}$ clock cycles are required to execute the "push r" instruction? $2$ $3$ $4$ $5$

Consider the following data path of a simple non-pipelined CPU. The registers $A, B$, $A_{1},A_{2}, \textsf{MDR},$ the $\textsf{bus}$ and the $\textsf{ALU}$ are $8$-$bit$...

21.4k views

commented Jul 19, 2019

5 answers

6

IISc vs IITB
I've seen many questions, comparing IISc Banglore & IIT Bombay. But to be honest I did not find it complete. So I'm asking question here, for comparing IISc and IIT Bombay on following points => 1. Placement opportunities 2. Research opportunities ... Also does by choosing IITB over IISc, what one will miss/gain in long run ? Will there be any significant difference ?

I've seen many questions, comparing IISc Banglore & IIT Bombay. But to be honest I did not find it complete.So I'm asking question here, for comparing IISc and IIT Bomba...

31.8k views

commented Jun 1, 2019

3 answers

7

GATE CSE 2005 | Question: 84b
We are given $9$ tasks $T_1, T_2, \dots, T_9$. The execution of each task requires one unit of time. We can execute one task at a time. Each task $T_i$ has a profit $P_i$ and a deadline $d_i$. Profit $P_i$ is earned if the task is completed before the end ... $} & \text{$3$} \\\hline \end{array}$ What is the maximum profit earned? $147$ $165$ $167$ $175$

We are given $9$ tasks $T_1, T_2, \dots, T_9$. The execution of each task requires one unit of time. We can execute one task at a time. Each task $T_i$ has a profit $P_i$...

5.1k views

commented May 8, 2019

4 answers

8

GATE CSE 2016 Set 1 | Question: 36
What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed? a = 3; void n(x) { x = x * a; print (x); } void m(y) { a = 1 ; a = y - a; n(a); print (a); } void main () { m(a); } $6,2$ $6,6$ $4,2$ $4,4$

What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed? a = 3; void n(x) { x = x * a; ...

24.1k views

commented Mar 23, 2019

4 answers

9

time complexity
int fun(int n) { int count = 0; for (int i = n; i > 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; } what is the time complexity

int fun(int n) { int count = 0; for (int i = n; i 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; } what is the time complexity

24.6k views

commented Jan 7, 2017

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