Recent activity by indrajeet / GATE Overflow for GATE CSE

5 answers

1

GATE IT 2007 | Question: 65
Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with $1000$ tuples. Assume that the attribute values for $A$ among the tuples are uniformly distributed in the interval $[0, 500].$ Which one of the following options is the best estimate of the number of tuples returned by the given selection query ? $50$ $100$ $150$ $200$

Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with $1000$ tuples. Assume that the attribute values for $A$ among the tuples are unifo...

12.7k views

commented Nov 19, 2017

4 answers

2

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

commented Oct 16, 2017

1 answer

3

output type question
Ans given is D.I want to know the logic behind

Ans given is D.I want to know the logic behind

551 views

commented Oct 10, 2017

5 answers

4

GATE CSE 1997 | Question: 2.5
An N-bit carry lookahead adder, where $N$ is a multiple of $4$, employs ICs $74181$ ($4$ bit ALU) and $74182$ ( $4$ bit carry lookahead generator). The minimum addition time using the best architecture for this adder is proportional to $N$ proportional to $\log N$ a constant None of the above

An N-bit carry lookahead adder, where $N$ is a multiple of $4$, employs ICs $74181$ ($4$ bit ALU) and $74182$ ( $4$ bit carry lookahead generator).The minimum addition ti...

9.6k views

commented Oct 7, 2017

1 answer

5

Kenneth Rosen Edition 6th Exercise 1.2 Question 15 (Page No. 23)
Each inhabitant of a remote village always tells the truth or always lies. A villager will give only a Yes or a No response to a question a tourist asks. Suppose you are a tourist visiting this area and come to a ... is standing at the fork in the road. What one question can you ask the villager to determine which branch to take?

Each inhabitant of a remote village always tells the truth or always lies. A villager will give only a “Yes” or a “No” response to a question a tourist asks. Supp...

4.7k views

commented Jul 19, 2017

3 answers

6

ISI 2004 MIII
A club with $x$ members is organized into four committees such that each member is in exactly two committees, any two committees have exactly one member in common . Then $x$ has exactly two values both between $4$ and $8$. exactly one value and this lies between $4$ and $8$. exactly two values both between $8$ and $16$. exactly one value and this lies between $8$ and $16$.

A club with $x$ members is organized into four committees such that each member is in exactly two committees,any two committees have exactly one member in common .Then $x...

1.7k views

commented Jul 15, 2017

2 answers

7

DBMS Counting superkeys
R(ABCDEF) with candidate keys set { A,BC,CD}. Find number of superkeys?

R(ABCDEF) with candidate keys set { A,BC,CD}. Find number of superkeys?

644 views

answered Jul 11, 2017

3 answers

8

Kenneth Rosen Edition 6th Exercise 5.3 Question 37 (Page No. 362)
How many bit strings of length 10 contain at least three 1s and at least three 0s? My Approach:-> using product rule There are 3 subtask following (filling 3 ones in 10 places) = (filling 3 zeros in remaing 7 places) = ... greater than (total number of string). Now , i want to know what is wrong in my apporach. please explain..

How many bit strings of length 10 contain at least three 1s and at least three 0s?My Approach:->using product rule There are 3 subtask following (filling 3 ones in 10 pla...

1.8k views

asked Jul 11, 2017

3 answers

9

TIFR CSE 2014 | Part A | Question: 5
The rules for the University of Bombay five-a-side cricket competition specify that the members of each team must have birthdays in the same month. What is the minimum number of mathematics students needed to be enrolled in the department to guarantee that they can raise a team of students? $23$ $91$ $60$ $49$ None of the above

The rules for the University of Bombay five-a-side cricket competition specify that the members of each team must have birthdays in the same month. What is the minimum nu...

3.6k views

commented Jul 6, 2017

3 answers

10

T(n)=16T(n/4)+n! using the Master Theorem
how do i apply master theorem to this? https://s17.postimg.org/x7xld2nf3/Screenshot_82.png what is P and K here?

how do i apply master theorem to this?https://s17.postimg.org/x7xld2nf3/Screenshot_82.pngwhat is P and K here?

21.3k views

commented Mar 24, 2017

0 answers

11

Post Gate
Will IIT HYDERABAD selects student based on gate score for MTECH ?? if yes,then what is selection processs(DIRECT or INTERVIEW based)??

Will IIT HYDERABAD selects student based on gate score for MTECH ??if yes,then what is selection processs(DIRECT or INTERVIEW based)??

258 views

asked Mar 21, 2017

1 answer

12

Virtual Gate Test Series: Theory Of Computation - Regular Languages
Which one of the following languages over the alphabet ${0, 1}$ is regular$?$ $(A)$ The language of balanced parentheses where $0, 1$ are thought of as $(,)$ respectively $(B)$ The language of palindromes, i.e., bit strings $x$ ... The kleene closure $L^{*},$ where $L$ is the language in $(C)$ above Ans is $D$ please explain$?$

Which one of the following languages over the alphabet ${0, 1}$ is regular$?$$(A)$ The language of balanced parentheses where $0, 1$ are thought of as $(,)$ respectively$...

900 views

asked Feb 5, 2017

0 answers

13

B+ tree
Consider the B+ tree shown in Figure What is the minimum number of insertions of data entries with distinct keys that will cause the height of the original tree to change from its current value (of 1) to 3? please explain??

Consider the B+ tree shown in FigureWhat is the minimum number of insertions of data entries with distinct keys that will cause the height of the original tree to change ...

561 views

asked Feb 2, 2017

0 answers

14

set theory
Let S = {1, 2,......,10 }. The number of unordered pairs A, B where A and B are disjoint non-empty subsets of S is _________ (counting unordered pairs simply means we don’t distinguish the pair A,B and B,A)

Let S = {1, 2,......,10 }.The number of unordered pairs A, B where A and B are disjoint non-empty subsets of S is _________ (counting unordered pairs simply means we don&...

381 views

asked Feb 1, 2017

2 answers

15

recurrance relation
Let T(n) be defined by T(0) = T(1) = 4 and $T(n) = T(\left \lfloor \frac{n}{2} \right \rfloor) +T(\left \lfloor \frac{n}{4} \right \rfloor) + cn$ for all integers n >=2, where c is a positive constant. What is the asymptotic growth of T(n)? $\Theta(n)$ $\Theta(n \log n)$ $\Theta (n^2)$ $\Theta \left(n^{\log_{\frac{3}{4}}n}\right)$

Let T(n) be defined by T(0) = T(1) = 4 and $T(n) = T(\left \lfloor \frac{n}{2} \right \rfloor) +T(\left \lfloor \frac{n}{4} \right \rfloor) + cn$ for all integers n >=2,...

887 views

asked Feb 1, 2017

1 answer

16

tcp frame
Suppose a server transmits one frame of a video every second, and the client starts playing the video at one frame per second as soon as the first frame arrives. Suppose the first ten frames arrive at times 0, 1.2, 1.99, 4.17, 4.01, 5.03, 8.05, 7.50, 8.90, 8.99, all in seconds. Which frames reach the client too late for playout? (A) 7 (B) 3 (C) 6 (D) 5

Suppose a server transmits one frame of a video every second, and the client starts playing the video at one frame per second as soon as the first frame arrives. Suppose ...

699 views

asked Jan 25, 2017

1 answer

17

Consider the following languages
Consider the following languages $A=\left\{ \langle M\rangle \mid \text{ TM M accepts at most 2 distinct inputs} \right\}$ $B=\left\{\langle M \rangle \mid \text{ TM M accepts more than 2 distinct inputs} \right\}$ Identify the ... Turing recognizable $A$ is not Turing recognizable Both $A$ and $B$ are Turing recognizable Neither $A$ nor $B$ is Turing recognizable

Consider the following languages$A=\left\{ \langle M\rangle \mid \text{ TM M accepts at most 2 distinct inputs} \right\}$$B=\left\{\langle M \rangle \mid \text{ TM M acce...

10.7k views

commented Jan 20, 2017

1 answer

18

B-tree Insertion
An order 3 B-tree is an index tree where every node other than root has at most 2 keys and at least one key. Starting with an empty tree if following keys are inserted into the tree 1,2,3,4,5,6,7,8,9,10. (not necessarily in the given order.) What would be the minimum number of node splits possible, if node splitting algorithm is used?

An order 3 B-tree is an index tree where every node other than root has at most 2 keys and at least one key. Starting with an empty tree if following keys are inserted in...

989 views

asked Jan 18, 2017

2 answers

19

probability
A bag contains 12 pairs of socks .four socks are picked up at random.Find the probability that there is at least one pair

A bag contains 12 pairs of socks .four socks are picked up at random.Find the probability that there is at least one pair

799 views

commented Dec 27, 2016

4 answers

20

GATE CSE 2015 Set 1 | Question: 24
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is called Dense Sparse Clustered Unclustered

A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is calledDenseSparseCl...

16.3k views

commented Dec 27, 2016

0 answers

21

view serializable
S1: R(A) W(A) W(B) S2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3

S1: R(A) W(A) W(B)S2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(D) 3

496 views

asked Dec 25, 2016

6 answers

22

GATE CSE 2009 | Question: 56
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... $\text{2NF}$ but not in $\text{3NF}$ The schema is not in $\text{2NF}$

Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\tex...

28.2k views

commented Dec 15, 2016

0 answers

23

LR(1) parser
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false

Consider the following two statements:P: Every regular grammar is LL(1)Q: Every regular set has a LR(1) grammarWhich of the following is TRUE?Both P and Q are trueP is tr...

640 views

asked Dec 2, 2016

6 answers

24

GATE CSE 2006 | Question: 61
The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening access to the memory location $x$ ... a pair of normal load/store can be used The implementation of $V$ is wrong The code does not implement a binary semaphore

The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening a...

27.7k views

commented Nov 21, 2016

1 answer

25

fork() system call
MY QUESTION IS 1)WHY PRINTF() PRINT VIRTUAL ADDRESS(MENTIONED IN EXPLANTION) NOT PHYSICAL ADDRESS 2) WHY VIRTUAL ADDRESS(O/P OF PRINTF(&VAR)) OF A VARIABLE CHANGES WHEN WE RUN A PROGRAM MANY TIMES Consider the following code fragment: if (fork() = ... process and virtual address of a' doesn't change in child process. Therefore, we get same addresses in both parent and child.

MY QUESTION IS1)WHY PRINTF() PRINT VIRTUAL ADDRESS(MENTIONED IN EXPLANTION) NOT PHYSICAL ADDRESS2) WHY VIRTUAL ADDRESS(O/P OF PRINTF(&VAR)) OF A VARIABLE CHANGES WHEN WE ...

1.9k views

asked Nov 20, 2016

6 answers

26

GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free

In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...

13.4k views

commented Nov 19, 2016

6 answers

27

GATE CSE 2008 | Question: 41
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place? $3$ $4$ $5$ $6$

A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place?$3$$4$$5$$6$

21.8k views

commented Nov 18, 2016

2 answers

28

GATE CSE 1996 | Question: 3
Let $f$ be a function defined by $f(x) = \begin{cases} x^2 &\text{ for }x \leq 1\\ ax^2+bx+c &\text{ for } 1 < x \leq 2 \\ x+d &\text{ for } x>2 \end{cases}$ Find the values for the constants $a$, $b$, $c$ and $d$ so that $f$ is continuous and differentiable everywhere on the real line.

Let $f$ be a function defined by$$f(x) = \begin{cases} x^2 &\text{ for }x \leq 1\\ ax^2+bx+c &\text{ for } 1 < x \leq 2 \\ x+d &\text{ for } x>2 \end{cases}$$Find the va...

5.3k views

commented Nov 17, 2016

2 answers

29

GATE Overflow | Algorithms | Test 1 | Question: 22
Consider the below statements: Adding a constant to every edge weight does not change the solution to the single-source shortest-paths problem. Adding a constant to every edge weight does not change the solution to the minimum spanning tree problem. 1 is FALSE 2 is TRUE 1 is TRUE 2 is FALSE Both 1 and 2 are TRUE Both 1 and 2 are FALSE

Consider the below statements:Adding a constant to every edge weight does not change the solution to the single-source shortest-paths problem.Adding a constant to every e...

811 views

commented Nov 15, 2016

2 answers

30

GATE Overflow | Algorithms | Test 1 | Question: 25
Which of the below options is TRUE for this statement : Suppose we wish to repeatedly search a linked list of length N elements, each of which contains a very long string key. How might we take advantage of the hash value when ... precompute the hash value of each string in the list calculate hash value of the single string only none of the above

Which of the below options is TRUE for this statement :Suppose we wish to repeatedly search a linked list of length N elements, each of which contains a very long string ...

513 views

commented Nov 15, 2016

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