Recent questions tagged gate2007 - GATE CSE Doubts

0 votes

0 answers

GATE2007-67, ISRO2016-72 Video Solution
The address of a class $B$ host is to be split into subnets with a $6$-$bit$ subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? $62$ subnets and $262142$ hosts. $64$ subnets and $262142$ hosts. $62$ subnets and $1022$ hosts. $64$ subnets and $1024$ hosts.

asked Apr 19 in Computer Networks by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-15,ISRO2016-26 Video Solution
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$

asked Apr 19 in Algorithms by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-53 Video Solution
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

asked Apr 19 in Compiler Design by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-80 Video Solution
Consider a machine with a byte addressable main memory of $2^{16}$ bytes. Assume that a direct mapped data cache consisting of $32$ lines of $64$ $bytes$ each is used in the system. A $50$ x $50$ two-dimensional array of bytes is stored in the main ... the data cache do not change in between the two accesses. How many data misses will occur in total? $48$ $50$ $56$ $59$

asked Apr 19 in CO & Architecture by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-63, ISRO2016-59 Video Solution
The order of a leaf node in a B$^+$ - tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1K$ $bytes$, data record pointer is $7$ $bytes$ long, the value field is $9$ $bytes$ long and a block pointer is $6$ $bytes$ long, what is the order of the leaf node? $63$ $64$ $67$ $68$

asked Apr 19 in Databases by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-60 Video Solution
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.

asked Apr 19 in Databases by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-45 Video Solution
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$

asked Apr 19 in Algorithms by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-34 Video Solution
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of $n$ variables. What is the minimum size of the multiplexer needed? $2^n$ line to $1$ line $2^{n+1}$ line to $1$line $2^{n-1}$ line to $1$line $2^{n-2}$ line to $1$line

asked Apr 19 in Digital Logic by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-61 Video Solution
Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department 5 has more than one employee, and we want to find the employees who get higher salary than anyone in the department 5, which one ... $Q_1$ and $Q_2$ produce the same answer Neither $Q_1$ nor $Q_2$ is the correct query

asked Apr 19 in Databases by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-8, ISRO2011-31 Video Solution
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates? $7$ $8$ $9$ $10$

asked Apr 19 in Digital Logic by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-36 Video Solution
The control signal functions of a $4$-$bit$ binary counter are given below (where $X$ ... through the following sequence: $0, 3, 4$ $0, 3, 4, 5$ $0, 1, 2, 3, 4$ $0, 1, 2, 3, 4, 5$

asked Apr 19 in Digital Logic by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-68, ISRO2016-73 Video Solution
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$

asked Apr 19 in Computer Networks by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-44 Video Solution
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})$

asked Apr 19 in Algorithms by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-71 Video Solution
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... word addressable. The number of memory references for accessing the data in executing the program completely is $10$ $11$ $20$ $21$

asked Apr 19 in CO & Architecture by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-11, ISRO2009-36, ISRO2016-21 Video Solution

asked Apr 19 in Operating System by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-50 Video Solution
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 some ... $c$ are needed. At most $1.5n-2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above

asked Apr 19 in Algorithms by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-58 Video Solution
Two processes, $P1$ and $P2$, need to access a critical section of code. Consider the following synchronization construct used by the processes: /* P1 */ while (true) { wants1 = true; while (wants2 == true); /* Critical ... waiting. It requires that processes enter the critical section in strict alteration. It does not prevent deadlocks, but ensures mutual exclusion.

asked Apr 19 in Operating System by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-23 Video Solution
Which of the following graphs has an Eulerian circuit? Any $k$-regular graph where $k$ is an even number. A complete graph on $90$ vertices. The complement of a cycle on $25$ vertices. None of the above

asked Apr 19 in Graph Theory by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2007-21 Video Solution
How many different non-isomorphic Abelian groups of order $4$ are there? $2$ $3$ $4$ $5$

asked Apr 19 in Set Theory & Algebra by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-59 Video Solution
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{studId}},{\text{ courseId}})$ gives which student has enrolled for ( ... Courses in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above

asked Apr 19 in Databases by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-69 Video Solution
The distance between two stations $M$ and $N$ is $L$ kilometers. All frames are $K$ bits long. The propagation delay per kilometer is $t$ seconds. Let $R$ bits/second be the channel capacity. Assuming that the processing delay is negligible, the $\text{minimum}$ number ... $\lceil \log_2 \frac{2LtR +K}{K} \rceil$ $\lceil \log_2 \frac{2LtR +2K}{2K} \rceil$

asked Apr 19 in Computer Networks by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-62, UGCNET-June2014-II-47 Video Solution

asked Apr 19 in Databases by admin (3.6k points) | 6 views

0 votes

0 answers

GATE2007-13 Video Solution
The maximum number of binary trees that can be formed with three unlabeled nodes is: $1$ $5$ $4$ $3$

asked Apr 19 in DS by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-37, ISRO2009-37 Video Solution
Consider a pipelined processor with the following four stages: IF: Instruction Fetch ID: Instruction Decode and Operand Fetch EX: Execute WB: Write Back The IF, ID and WB stages take one clock cycle each to complete the operation. The number of clock cycles for the EX stage ... $ R5$-$R4} \\ \end{array}$ $7$ $8$ $10$ $14$

asked Apr 19 in CO & Architecture by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-47 Video Solution
Consider the process of inserting an element into a $Max \: Heap$, where the $Max \: Heap$ is represented by an $array$. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of $comparisons$ performed is: $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$ $\Theta(n)$ $\Theta(n\log_2n)$

asked Apr 19 in DS by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-12 Video Solution
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height $h$ is: $2^h -1$ $2^{h-1} -1$ $2^{h+1} -1$ $2^{h+1}$

asked Apr 19 in DS by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-48 Video Solution
Which of the following is TRUE about formulae in Conjunctive Normal Form? For any formula, there is a truth assignment for which at least half the clauses evaluate to true. For any formula, there is a truth assignment for which all the clauses evaluate ... a formula such that for each truth assignment, at most one-fourth of the clauses evaluate to true. None of the above.

asked Apr 19 in Digital Logic by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-56 Video Solution
A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements: P: Increasing the number of page frames allocated to a process sometimes increases the page fault rate. Q: Some ... are true, but Q is not the reason for P. P is false but Q is true Both P and Q are false.

asked Apr 19 in Operating System by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-24 Video Solution
Suppose we uniformly and randomly select a permutation from the $20 !$ permutations of $1, 2, 3\ldots ,20.$ What is the probability that $2$ appears at an earlier position than any other even number in the selected permutation? $\left(\dfrac{1}{2} \right)$ $\left(\dfrac{1}{10}\right)$ $\left(\dfrac{9!}{20!}\right)$ None of these

asked Apr 19 in Probability by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-43 Video Solution
A complete $n-ary$ tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complete $n-ary$ tree. If $L = 41$ and $I = 10$, what is the value of $n$? $3$ $4$ $5$ $6$

asked Apr 19 in DS by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-41 Video Solution
In an unweighted, undirected connected graph, the shortest path from a node $S$ to every other node is computed most efficiently, in terms of time complexity, by Dijkstra’s algorithm starting from $S$. Warshall’s algorithm. Performing a DFS starting from $S$. Performing a BFS starting from $S$.

asked Apr 19 in Algorithms by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2007-38, ISRO2016-27 Video Solution
The following postfix expression with single digit operands is evaluated using a stack: $8 \ 2 \ 3 \ {}^\hat{\mkern6mu} / \ 2 \ 3 * + 5 \ 1 * -$ Note that $^\hat{}$ is the exponentiation operator. The top two elements of the stack after the first $*$ is evaluated are $6, 1$ $5, 7$ $3, 2$ $1, 5$

asked Apr 19 in DS by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-54 Video Solution
In a simplified computer the instructions are: $\begin{array}{|l|l|} \hline \text {OP $R _j , R _i$} & \text{Perform $R _j $OP $R _i$ and store the result in register $R _j$ } \\\hline \text{OP $m,R _i$} & \text{Perform $ ... computation should be in memory. What is the minimum number of MOV instructions in the code generated for this basic block? $2$ $3$ $5$ $6$

asked Apr 19 in CO & Architecture by admin (3.6k points) | 0 views

0 votes

0 answers

GATE2007-51 Video Solution
Consider the following C program segment: int IsPrime (n) { int i, n; for (i=2; i<=sqrt(n);i++) if(n%i == 0) {printf("Not Prime \n"); return 0;} return 1; } Let $T(n)$ denote number of times the $for$ loop is executed by the program on input $n$. Which of the ... $T(n) = O(n) \: \text{ and } T(n) = \Omega(\sqrt{n})$ None of the above

asked Apr 19 in Algorithms by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-26 Video Solution
Consider the set $S =\{ a , b , c , d\}.$ Consider the following $4$ partitions $π_1,π_2,π_3,π_4$ on $S : π_1 =\{\overline{abcd}\},\quad π_2 =\{\overline{ab}, \overline{cd}\},$ ... $π_i \prec π_j$ if and only if $π_i$ refines $π_j$. The poset diagram for $(S',\prec)$ is:

asked Apr 19 in Set Theory & Algebra by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-35 Video Solution
In a look-ahead carry generator, the carry generate function $G_i$ and the carry propagate function $P_i$ for inputs $A_i$ and $B_i$ are given by: $P_i = A_i \oplus B_i \text{ and }G_i = A_iB_i$ The expressions for the sum bit $S_i$ and the carry bit $C_{i+1}$ of ... adder with $S_3, S_2, S_1, S_0$ and $C_4$ as its outputs are respectively: $6, 3$ $10, 4$ $6, 4$ $10, 5$

asked Apr 19 in Digital Logic by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-84 Video Solution
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. How many distinct paths are there for the robot ... $(10,10)$ starting from the initial position $(0,0)$? $^{20}\mathrm{C}_{10}$ $2^{20}$ $2^{10}$ None of the above

asked Apr 19 in Combinatory by admin (3.6k points) | 1 view

0 votes

0 answers

GATE2007-65 Video Solution
There are $n$ stations in slotted LAN. Each station attempts to transmit with a probability $p$ in each time slot. What is the probability that ONLY one station transmits in a given time slot? $np(1-p)^{n-1}$ $(1-p)^{n-1}$ $p(1-p)^{n-1}$ $1-(1-p)^{n-1}$

asked Apr 19 in Computer Networks by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-27 Video Solution
Consider the set of (column) vectors defined by$X = \left \{x \in R^3 \mid x_1 + x_2 + x_3 = 0, \text{ where } x^T = \left[x_1,x_2,x_3\right]^T\right \}$ ... independent set, but it does not span $X$ and therefore is not a basis of $X$. $X$ is not a subspace of $R^3$. None of the above

asked Apr 19 in Linear Algebra by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2007-25 Video Solution
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $I$ is the $4 \times 4$ identity matrix? $-5$ $-7$ $2$ $1$

asked Apr 19 in Linear Algebra by admin (3.6k points) | 3 views

Page:

1
2
3
next »

7,536 questions

1,781 answers

10,866 comments

90,472 users