Recent activity by umang_16 / GATE Overflow for GATE CSE

0 answers

1

General Query regarding Interview
I have been shortlisted for CDS interview at IISc. They have suggested some paper reading but when I google those papers all I get is abstract and introduction. Is this what I am supposed to prepare for interview ? Or there is some other ... research papers ? What should be kept in mind and anything regarding it. Because I don't have any experience in it.

I have been shortlisted for CDS interview at IISc.They have suggested some paper reading but when I google those papers all I get is abstract and introduction.Is this wha...

1.1k views

commented May 10, 2017

2 answers

2

SQL <=ALL Query
select studentid, studentname from student where birthyear <=ALL( select birthyear from student); Returns detail of the youngest student Returns detail of oldest student Should not the answer be 2) ?

select studentid, studentname from student where birthyear <=ALL( select birthyear from student);Returns detail of the youngest studentReturns detail of oldest studentSho...

624 views

commented Jan 29, 2017

6 answers

3

GATE CSE 2014 Set 1 | Question: 9
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ instructions, which have an immediate operand in ... to two register operands. Assuming that the immediate operand is an unsigned integer, the maximum value of the immediate operand is ____________

A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ ins...

18.4k views

comment edited Dec 31, 2016

0 answers

4

pipeLine

726 views

commented Dec 30, 2016

0 answers

5

Made Easy CO
Suppose that in 1000 memory references there are 40 misses in L1 and 20 misses in L2 cache. Assume miss penalty from L2 to memory is 100 cycles. The hit time of L2 is 10 clock cycles. The hit time of L1 is 1 clock cycle. What is the average memory access time ?

Suppose that in 1000 memory references there are 40 misses in L1 and 20 misses in L2 cache. Assume miss penalty from L2 to memory is 100 cycles. The hit time of L2 is 10 ...

369 views

asked Dec 26, 2016

2 answers

6

GATE Overflow | Algorithms | Test 1 | Question: 27
Consider a hash table of size $m = 10$ and a corresponding hash function $h(k) = k A \mod m$ for $A = 5$ where collisions are resolved by quadratic probing. The location (starting from 1) to which the key 65 is mapped if the current contents of hashtable is $4 \;8 \;\_ \;\_ \;7 \;8 \;6 \;\_\; 0\; \_$ is _______

Consider a hash table of size $m = 10$ and a corresponding hash function $h(k) = k A \mod m$ for $A = 5$ where collisions are resolved by quadratic probing. The location...

756 views

commented Dec 26, 2016

1 answer

7

GATE Overflow | Algorithms | Test 1 | Question: 9
Let we have 3 steps of an arbitrary program fragment whose running times are $O(n^2), \: O(n^3)$ and $O(n\log n)$, then the running time of whole program is $O(n^3)$ $\Omega(n^3)$ $\Omega(n \log n)$ $\Theta(n^6 \log n)$

Let we have 3 steps of an arbitrary program fragment whose running times are $O(n^2), \: O(n^3)$ and $O(n\log n)$, then the running time of whole program is$O(n^3)$$\Omeg...

529 views

commented Dec 26, 2016

1 answer

8

which of the following is true
Consider the following statements : S1: Variables/function calls have nested lifetime in case of stack allocation. S2: Variables/function calls have arbitrary lifetime in case of heap allocation. Which of the following statement is/are true?

Consider the following statements :S1: Variables/function calls have nested lifetime in case of stack allocation.S2: Variables/function calls have arbitrary lifetime in c...

913 views

commented Dec 18, 2016

1 answer

9

compiler grammar
Give a grammar which is LL(1) but not LALR(1) .

Give a grammar which is LL(1) but not LALR(1) .

501 views

answered Dec 18, 2016

1 answer

10

SELF DOUBT
Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each track contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder-wise and the addressing format is <cylinder no., ... in contiguous manner?? PS: MY DOUBT IS THAT WHETHER I SHOULD CONVERT 5200 INTO CHS OR 5199 BECAUSE SECTOR NO STARTS WITH 0??

Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each track contains 64 sectors (0-63). Data storage capacity in each sector is...

565 views

commented Dec 17, 2016

0 answers

11

MST-2
#plz check??

#plz check??

417 views

commented Dec 16, 2016

0 answers

12

Insertion Sort

1.2k views

commented Dec 16, 2016

2 answers

13

Compiler
Consider the grammar given below. It is E -> T+E | T T -> a a. SLR(1) but not LL(1) b. Not an operator grammar c. Ambiguous d. None of these

Consider the grammar given below. It isE - T+E | TT - aa. SLR(1) but not LL(1)b. Not an operator grammarc. Ambiguousd. None of these

651 views

commented Dec 16, 2016

1 answer

14

Let A,B are 4 digited numbers, how many possible cases are there to have B≥A?
Let A,B are 4 digited numbers, how many possible cases are there to have B≥A? 144 136 120 216

Let A,B are 4 digited numbers, how many possible cases are there to have B≥A? 144 136 120 216

355 views

commented Dec 16, 2016

2 answers

15

speed , time and distance
Point X and Y are 90 km apart from each other at highway. A car starts from X and another from Y at the same time . If they go in the same direction they meet in 9 hrs and if they go in opposite direction they meet in 9/7 hrs. The max speed of the car among the 2 cars is a)20 km/hr b)30 km/hr c)40 km/hr d)50 km/hr

Point X and Y are 90 km apart from each other at highway. A car starts from X and another from Y at the same time . If they go in the same direction they meet in 9 hrs ...

1.1k views

answered Dec 13, 2016

1 answer

16

KSET -2016
How many different Boolean functuons involved in N boolean variables?

How many different Boolean functuons involved in N boolean variables?

242 views

answered Dec 13, 2016

3 answers

17

counting
how many number are possible of 4 digits whose sum is 12.

how many number are possible of 4 digits whose sum is 12.

1.5k views

commented Dec 10, 2016

1 answer

18

sorting

571 views

comment edited Dec 10, 2016

1 answer

19

number of strings

263 views

answered Dec 9, 2016

3 answers

20

TOC Turing Machine
Consider the following languages L1 = {< M, q > |M is a turing machine that visits state q on some input within 10 steps} L2 = {< M > |M is a turing machine, |M | < 100 where |M | is number of states in machine} Which of ... L1 nor L2 is decidable In L2, if the states are unreachable, then will it be possible to detect whether machine has less than 100 states ???

Consider the following languagesL1 = {< M, q |M is a turing machine that visits state q on some input within 10 steps}L2 = {< M |M is a turing machine, |M | < 100 where...

1.9k views

asked Nov 15, 2016

4 answers

21

Complexity of AVL
What is the worst case time complexity to construct an AVL tree from an array which satisfies the min heap property ? a) O(n log n) b) O(n2) c) O(n2 log n) d) O(n)

What is the worst case time complexity to construct an AVL tree from an array which satisfies the min heap property ?a) O(n log n)b) O(n2)c) O(n2 log n)d) O(n)

5.8k views

commented Oct 23, 2016

1 answer

22

#recurrence relation
Find the recurrence relation for the number of binary strings not containing two consecutive zeros or two consecutive ones.

Find the recurrence relation for the number of binary strings not containing two consecutive zeros or two consecutive ones.

716 views

answered Oct 23, 2016

1 answer

23

time complexity

703 views

commented Dec 8, 2015

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