Recent activity by lgau0522 / GATE Overflow for GATE CSE

8 answers

1

GATE CSE 2007 | Question: 44
In the following C function, let $n \geq m$. int gcd(n,m) { if (n%m == 0) return m; n = n%m; return gcd(m,n); } How many recursive calls are made by this function? $\Theta(\log_2n)$ $\Omega(n)$ $\Theta(\log_2\log_2n)$ $\Theta(\sqrt{n})$

In the following C function, let $n \geq m$.int gcd(n,m) { if (n%m == 0) return m; n = n%m; return gcd(m,n); }How many recursive calls are made by this function?$\Theta(\...

26.7k views

commented Feb 1, 2015

6 answers

2

GATE CSE 2007 | Question: 60
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? ... immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.

Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What ...

23.7k views

commented Jan 21, 2015

11 answers

3

GATE CSE 2014 Set 2 | Question: 33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used

A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that ord...

28.8k views

commented Jan 20, 2015

15 answers

4

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.1k views

commented Jan 18, 2015

3 answers

5

GATE CSE 2011 | Question: 16, UGCNET-June2013-III: 65
A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? OS ... thread OS does not maintain virtual memory state for each thread OS does not maintain a separate stack for each thread

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to th...

17.3k views

commented Jan 18, 2015

5 answers

6

GATE CSE 1998 | Question: 2.17, UGCNET-Dec2012-III: 43
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get ... $q \leq \frac{t-ns}{n+1}$ $q \geq \frac{t-ns}{n+1}$

Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the over...

22.2k views

commented Jan 18, 2015

11 answers

7

GATE CSE 2014 Set 3 | Question: 27
Every host in an $\textsf{IPv4}$ network has a $1\text{-second}$ resolution real-time clock with battery backup. Each host needs to generate up to $1000$ ... globally unique ID for this purpose. After what period (in seconds) will the identifiers generated by a host wrap around?

Every host in an $\textsf{IPv4}$ network has a $1\text{-second}$ resolution real-time clock with battery backup. Each host needs to generate up to $1000$ unique identifie...

21.8k views

answered Jan 16, 2015

3 answers

8

GATE CSE 2011 | Question: 62
$P, Q, R$ and $S$ are four types of dangerous microbes recently found in a human habitat. The area of each circle with its diameter printed in brackets represents the growth of a single microbe surviving human immunity system within $24$ hours of ... against the most dangerous microbe. Which microbe should the company target in its first attempt? $P$ $Q$ $R$ $S$

$P, Q, R$ and $S$ are four types of dangerous microbes recently found in a human habitat. The area of each circle with its diameter printed in brackets represents the gro...

7.9k views

answered Jan 11, 2015

17 answers

9

GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units

A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both com...

32.8k views

commented Jan 4, 2015

2 answers

10

GATE CSE 2003 | Question: 75
Consider the following class definitions in a hypothetical Object Oriented language that supports inheritance and uses dynamic binding. The language should not be assumed to be either Java or C++, though the syntax is similar. Class P { Class Q subclass of P { void f(int ... P. The output produced by executing the above program fragment will be 1 2 1 2 1 1 2 1 2 2 2 2

Consider the following class definitions in a hypothetical Object Oriented language that supports inheritance and uses dynamic binding. The language should not be assumed...

5.5k views

commented Jan 3, 2015

4 answers

11

GATE CSE 2002 | Question: 9
Consider the following $32\text{-bit}$ floating-point representation scheme as shown in the format below. A value is specified by $3$ fields, a one bit sign field (with $0$ for positive and $1$ ... the hexadecimal. What is the largest value that can be represented using this format? Express your answer as the nearest power of $10$.

Consider the following $32\text{-bit}$ floating-point representation scheme as shown in the format below. A value is specified by $3$ fields, a one bit sign field (with $...

11.5k views

comment edited Jan 3, 2015

3 answers

12

Does PDA accepts L={a^n b^n | n>=0 , n!=13}???
If it does, how??

If it does, how??

2.3k views

asked Dec 20, 2014

2 answers

13

MadeEasy Test Series: Programming & DS - Hashing
Consider a hash table using uniform hashing with number of slots as $m=6$ and number of keys, $k=8$. Collisions are resolved by chaining. Assuming direct hashing is used, what is the expected number of slots that ends not being empty?

Consider a hash table using uniform hashing with number of slots as $m=6$ and number of keys, $k=8$. Collisions are resolved by chaining. Assuming direct hashing is used,...

3.1k views

commented Dec 16, 2014

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