Answers by Prasanna / GATE Overflow for GATE CSE

0 votes

1

IITD_2011 Interview
#IITD_2011 If we are give a sorted array and we have to find two elements which sum to a number x.

#IITD_2011If we are give a sorted array and we have to find two elements which sum to a number x.

437 views

answered Feb 23, 2016

11 votes

2

GATE2015 EC-1: GA-9
A cube of side $3$ units is formed using a set of smaller cubes of side $1$ unit. Find the proportion of the number of faces of the smaller cubes visible to those which are NOT visible. $ 1: 4$ $ 1: 3$ $ 1: 2$ $ 2: 3$

A cube of side $3$ units is formed using a set of smaller cubes of side $1$ unit. Find the proportion of the number of faces of the smaller cubes visible to those which a...

5.8k views

answered Feb 12, 2016

2 votes

3

Unix Inode file system
Consider a file system that uses UNIX like inodes to keep track of the sectors allocated to files. Assume that disk blocks are 1 KB in size, disk block addresses are 32 bits and the inode has space for 8 direct blocks, 1 singly indirect blocks, 1 doubly ... B) 234 bytes (C) 210 bytes (D) 242 byte Is there asked about total size of file system? whats difference between them?

Consider a file system that uses UNIX like inodes to keep track of the sectors allocated to files. Assume that disk blocks are 1 KB in size, disk block addresses are 32 b...

10.1k views

answered Feb 4, 2016

1 votes

4

Serializability
Consider the following schedule S : r1(A) w2(A) commit2, w1(A) w3(A) commit3, commit1 Which of the following is true? a) Schedule is view serializable schedule and strict recoverable schedule b) Schedule is non serializable ... c) Schedule is non serializable schedule and not strict recoverable schedule d)Schedule is serializable schedule and not strict recoverable schedule

Consider the following schedule S : r1(A) w2(A) commit2, w1(A) w3(A) commit3, commit1Which of the following is true?a) Schedule is view serializable schedule a...

3.4k views

answered Feb 4, 2016

0 votes

5

How to find logarithmic values in GATE Exam?
Hello y'all. How can I find log values in Gate exam? Do they provide any calculator or log tables? Also, is there any manual way to find log values. Example What will be the values of log2(6729) ? how would one solve this in gate exam. Thanks!

Hello y'all. How can I find log values in Gate exam? Do they provide any calculator or log tables?Also, is there any manual way to find log values.Example What will be th...

2.1k views

answered Feb 1, 2016

0 votes

6

What is the complixity of following recurrence

501 views

answered Feb 1, 2016

30 votes

7

GATE CSE 2015 Set 2 | Question: 11
Consider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; } The return value of $fun(5)$ is ______.

Consider the following C function.int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; }The return value of $fun(5)$...

21.3k views

answered Jan 29, 2016

12 votes

8

GATE IT 2004 | Question: 88
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the connection is in slow-start phase with a current transmit window of $4000$ $\text{bytes}$. ... transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$

Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the co...

24.1k views

answered Jan 27, 2016

1 votes

9

How to solve this Recurrence ?
T(n) = $\sum_{0}^{n-1}$ T(i) + cn

T(n) = $\sum_{0}^{n-1}$ T(i) + cn

411 views

answered Jan 26, 2016

2 votes

10

VIRTUAL_GATE
Consider a file system that uses UNIX like inodes to keep track of the sectors allocated to files. Assume that disk blocks are 1 KB in size, disk block addresses are 32 bits and the inode has space for 8 direct blocks, 1 singly indirect blocks, 1 doubly indirect block and ... disk drive that could be fully utilized by this system? (A) 232 bytes (B) 234 bytes (C) 210 bytes (D) 242 bytes

Consider a file system that uses UNIX like inodes to keep track of the sectors allocated to files. Assume that disk blocks are 1 KB in size, disk block addresses are 32 b...

1.3k views

answered Jan 26, 2016

0 votes

11

Find TLB Hit Ratio
Suppose TLB used in one level paging system with each look-up time of TLB 40 msec. Memory reference takes 120 msec. If the effective memory reference time is 180 msec then page table references are found in TLB is ______ Answer Given in booklet (0.833)

Suppose TLB used in one level paging system with each look-up time of TLB 40 msec. Memory reference takes 120 msec. If the effective memory reference time is 180 msec the...

3.8k views

answered Jan 25, 2016

10 votes

12

GATE IT 2007 | Question: 12
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ bytes per page is $\text{0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0410.}$ Suppose that the memory can store only one page and ... to $\text{x + 99}$ are loaded on to the memory. How many page faults will occur? $0$ $4$ $7$ $8$

The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ bytes per page is$\text{0100, 0200, 0430, 0499, 0510, 0...

15.1k views

answered Jan 24, 2016

76 votes

13

GATE CSE 2004 | Question: 21, ISRO2007-44
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by the instruction set architecture page size number of processes in memory physical memory size

The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined bythe instruction set architecturepage sizenum...

23.9k views

answered Jan 24, 2016

31 votes

14

GATE CSE 2010 | Question: 39
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$

Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular express...

22.4k views

answered Jan 22, 2016

2 votes

15

Sorting - which will perform Better
If input is sorted in reverse order , then which sorting algorithm will perform best - A) Insertion Sort B) Merge Sort C) Heap Sort D) Quick Sort

If input is sorted in reverse order , then which sorting algorithm will perform best -A) Insertion SortB) Merge SortC) Heap SortD) Quick Sort

1.8k views

answered Jan 17, 2016

–1 votes

16

GATE CSE 2000 | Question: 17
An array contains four occurrences of $0$, five occurrences of $1$, and three occurrences of $2$ in any order. The array is to be sorted using swap operations (elements that are swapped need to be adjacent). What is the minimum number of swaps ... ? Give an ordering of elements in the above array so that the minimum number of swaps needed to sort the array is maximum.

An array contains four occurrences of $0$, five occurrences of $1$, and three occurrences of $2$ in any order. The array is to be sorted using swap operations (elements t...

11.1k views

answered Jan 10, 2016

3 votes

17

GATE CSE 2014 Set 3 | Question: 42
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order. int ProcessArray(int *listA, int x, int n) { int i, j, k; i = 0; j = n-1; do { k = (i+j)/2; if ... implementation of binary search. It will always find the maximum element in $listA$. It will return −$1$ even when $x$ is present in $listA$.

Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order.int ProcessArray(int *listA, int x, int n) { in...

13.6k views

answered Jan 9, 2016

4 votes

18

GATE CSE 2007 | Question: 50
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed? At least $2n-c$ comparisons, for ... $c$ are needed. At most $1.5n-2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above

An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is T...

29.6k views

answered Jan 7, 2016

1 votes

19

CN: Subnetting
Two computers A and B are configured as follows. A has IP address 203.197.17.157 and netmask 255.255.128.0. B has IP address 203.192.192.201 and netmask 255.255.192.0. Which one of the following statements is true? A. A and B both assume they are on same ... . A assumes B is on same network, B assumes A is on a different network. D. A and B both assume they are on different networks.

Two computers A and B are configured as follows. A has IP address 203.197.17.157 and netmask 255.255.128.0. B has IP address 203.192.192.201 and netmask 255.255.192.0. Wh...

1.8k views

answered Jan 4, 2016

0 votes

20

Slow start
my ans 65ms

my ans 65ms

589 views

answered Jan 4, 2016

18 votes

21

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

answered Dec 27, 2015

45 votes

22

GATE CSE 2005 | Question: 62
Consider the following circuit involving a positive edge triggered D FF. Consider the following timing diagram. Let $A_{i}$ represents the logic level on the line $A$ in the $i$-th clock period. Let $A'$ represent the complement of $A$. The correct output sequence on $Y$ over the ... $A_{1} A_{2}' A_{3} A_{4} A_{5}'$

Consider the following circuit involving a positive edge triggered D FF.Consider the following timing diagram. Let $A_{i}$ represents the logic level on the line $A$ in t...

17.2k views

answered Dec 23, 2015

8 votes

23

GATE CSE 1995 | Question: 2.2
The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many separate address and data lines are needed for a memory of $4K \times 16$? $10$ address, $16$ data lines $11$ address, $8$ data lines $12$ address, $16$ data lines $12$ address, $12$ data lines

The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many separate address and data lines are needed for a memory of...

11.8k views

answered Dec 19, 2015

1 votes

24

how to construct BST by given preorder and postorder traversal
Given preorder and postorder traversal of binary search tree. Preorder: 50, 27, 16, 4, 12, 34, 29, 44, 88, 65, 52, 77, 93, 92 Postorder: 12, 4, 16, 29, 44, 34, 27, 52, 77, 65, 92, 93, 88, 50 The number of nodes present at level 3 are _________. Assume root is present at level 0.

Given preorder and postorder traversal of binary search tree.Preorder: 50, 27, 16, 4, 12, 34, 29, 44, 88, 65, 52, 77, 93, 92Postorder: 12, 4, 16, 29, 44, 34, 27, 52, 77, ...

4.4k views

answered Dec 8, 2015

62 votes

25

GATE CSE 2015 Set 1 | Question: 8
For computer based on three-address instruction formats, each address field can be used to specify which of the following: (S1) A memory operand (S2) A processor register (S3) An implied accumulator register Either $S1$ or $S2$ Either $S2$ or $S3$ Only $S2$ and $S3$ All of $S1$, $S2$ and $S3$

For computer based on three-address instruction formats, each address field can be used to specify which of the following:(S1) A memory operand(S2) A processor register(S...

18.9k views

answered Dec 5, 2015

3 votes

26

What is the time complexity of job sequencing with deadline using greedy algorithm?
What is the time complexity of job sequencing with deadline using greedy algorithm? O(n) O(log n) O(n log n) O(n2) Made Easy Full Syllabus Test-6 : Basic Level : Practice Test-14 Q 19 Please give reference for this answer to this algorithm.

What is the time complexity of job sequencing with deadline using greedy algorithm?O(n)O(log n)O(n log n)O(n2)Made EasyFull Syllabus Test-6 : Basic Level : Practice Test-...

23.9k views

answered Dec 1, 2015

1 votes

27

Please suggest some good online material(other than video) for Data structure? If anyone has idea about NLC(nlcindia.com) GET interview, please suggest what to prepare?

Please suggest some good online material(other than video) for Data structure? If anyone has idea about NLC(www.nlcindia.com) GET interview, please suggest what to prepar...

612 views

answered Dec 1, 2015

11 votes

28

What do you suggest to study for WiFi and IPv6?
Topics such as WiFi IPv6 are introduced for the first time in the revised syllabus for GATE. If there are people working in this area or are in proximity of the topics above, please suggest what are technically important areas among these technologies. Provide sources and references for them.

Topics such as WiFiIPv6are introduced for the first time in the revised syllabus for GATE. If there are people working in this area or are in proximity of the topics abov...

7.2k views

answered Dec 1, 2015

0 votes

29

how to hack wifi on android?
I have used bcmon.apk and reaver for android.apk but they don't meet my hardware requirements . but I need a universal solution for it regardless of any WiFi chipset structure.

I have used bcmon.apk and reaver for android.apk but they don't meet my hardware requirements . but I need a universal solution for it regardless of any WiFi chipset str...

477 views

answered Dec 1, 2015

1 votes

30

longest common subsequence
For X= BDCABA and Y=ABCBDAB find length of lcs and no of such lcs..(solve it using table method)

For X= BDCABA and Y=ABCBDAB find length of lcs and no of such lcs..(solve it using table method)

9.4k views

answered Dec 1, 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