Recent questions tagged easy - 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 18 in Computer Networks by admin (3.6k points) | 4 views

0 votes

0 answers

GATE2005-22, ISRO2015-36 Video Solution
Increasing the RAM of a computer typically improves performance because: Virtual Memory increases Larger RAMs are faster Fewer page faults occur Fewer segmentation faults occur

asked Apr 18 in Operating System by admin (3.6k points) | 7 views

0 votes

0 answers

GATE2005-77, ISRO2016-55 Video Solution
The relation book (title,price) contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query list? select title from book as B where (select count(*) from ... books Title of the fifth most inexpensive book Title of the fifth most expensive book Titles of the five most expensive books

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

0 votes

0 answers

GATE2014-3-14 Video Solution
You have an array of $n$ elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is $O(n^2)$ $O(n \log n)$ $\Theta(n\log n)$ $O(n^3)$

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

0 votes

0 answers

GATE2012-15 Video Solution
Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used in ... Not all attributes used in the GROUP BY clause need to appear in the SELECT clause P and R P and S Q and R Q and S

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

0 votes

0 answers

GATE1996-2.13, ISRO2016-28 Video Solution
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above

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

0 votes

0 answers

GATE2004-29 Video Solution
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of $n$ $n^2$ $n \log n$ $n \log^2n$

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

0 votes

0 answers

GATE2015-2-23 Video Solution
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$

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

0 votes

0 answers

GATE2000-1.18, ISRO2015-25 Video Solution
The number of tokens in the following C statement is printf("i=%d, &i=%x", i, &i); $3$ $26$ $10$ $21$

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

0 votes

0 answers

GATE2011-6, UGCNET-June2013-III-62 Video Solution
Let the time taken to switch from user mode to kernel mode of execution be $T1$ while time taken to switch between two user processes be $T2$. Which of the following is correct? $T1 > T2$ $T1 = T2$ $T1 < T2$ Nothing can be said about the relation between $T1$ and $T2$

asked Apr 18 in Operating System by admin (3.6k points) | 6 views

0 votes

0 answers

GATE2006-12 Video Solution
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is: Queue Stack Heap B-Tree

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

0 votes

0 answers

GATE2003-16 Video Solution
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? Removing left recursion alone Factoring the grammar alone Removing left recursion and factoring the grammar None of the above

asked Apr 18 in Compiler Design by admin (3.6k points) | 1 view

0 votes

0 answers

GATE1999-1.17 Video Solution
Which of the following is the most powerful parsing method? LL (1) Canonical LR SLR LALR

asked Apr 18 in Compiler Design by admin (3.6k points) | 5 views

0 votes

0 answers

GATE2010-18 Video Solution
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$

asked Apr 18 in Databases by admin (3.6k points) | 10 views

0 votes

0 answers

GATE2003-2 Video Solution
Assume the following C variable declaration: int *A[10], B[10][10]; Of the following expressions: $A[2]$ $A[2][3]$ $B[1]$ $B[2][3]$ which will not give compile-time errors if used as left hand sides of assignment statements in a C program? I, II, and IV only II, III, and IV only II and IV only IV only

asked Apr 18 in Programming by admin (3.6k points) | 2 views

0 votes

0 answers

GATE1999-1.18, ISRO2016-53 Video Solution
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are $m+n$ and $0$ $mn$ and $0$ $m+n$ and $|m-n|$ $mn$ and $m+n$

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

0 votes

0 answers

GATE2004-18, ISRO2007-31 Video Solution
In an $SR$ latch made by cross-coupling two NAND gates, if both $S$ and $R$ inputs are set to $0$, then it will result in $Q = 0, Q' = 1$ $Q = 1, Q' = 0$ $Q = 1, Q' = 1$ Indeterminate states

asked Apr 18 in Digital Logic by admin (3.6k points) | 2 views

0 votes

0 answers

GATE1998-1.27 Video Solution
Type checking is normally done during lexical analysis syntax analysis syntax directed translation code optimization

asked Apr 18 in Compiler Design by admin (3.6k points) | 4 views

0 votes

0 answers

GATE2006-52 Video Solution
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot? $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$ $\Theta (n^{3})$

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

0 votes

0 answers

GATE2014-2-41 Video Solution
Suppose a stack implementation supports an instruction $REVERSE$, which reverses the order of elements on the stack, in addition to the $PUSH$ and $POP$ instructions. Which one of the following statements is TRUE (with respect to this modified ... takes a single instruction. A queue can be implemented where both $ENQUEUE$ and $DEQUEUE$ take a single instruction each.

asked Apr 18 in DS by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2006-14, ISRO2011-14 Video Solution
Which one of the following in place sorting algorithms needs the minimum number of swaps? Quick sort Insertion sort Selection sort Heap sort

asked Apr 18 in Algorithms 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 18 in Algorithms by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2004-14 Video Solution
Consider the following relation schema pertaining to a students database: Students (rollno, name, address) Enroll (rollno, courseno, coursename) where the primary keys are shown underlined. The number of tuples in the student and Enroll tables are $120$ and $8$ respectively. What ... (Student * Enroll), where *' denotes natural join? $8, 8$ $120, 8$ $960, 8$ $960, 120$

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

0 votes

0 answers

GATE2008-14, ISRO2016-74 Video Solution
What is the maximum size of data that the application layer can pass on to the TCP layer below? Any size $2^{16}$ bytes - size of TCP header $2^{16}$ bytes $1500$ bytes

asked Apr 18 in Computer Networks by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2001-2.16 Video Solution
What is the minimum number of stacks of size $n$ required to implement a queue of size $n$? One Two Three Four

asked Apr 18 in DS by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2008-65 Video Solution
Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes? In deadlock prevention, the request for resources is always granted if the resulting state is safe In deadlock avoidance, the request ... is safe Deadlock avoidance is less restrictive than deadlock prevention Deadlock avoidance requires knowledge of resource requirements apriori..

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

0 votes

0 answers

GATE2014-1-14 Video Solution
Let $P$ be quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by P for the inputs $[1 \ 2 \ 3 \ 4 \ 5]$ and $[4 \ 1 \ 5 \ 3 \ 2]$ respectively. Which one of the following holds? $t_1 = 5$ $t_1 < t_2$ $t_1>t_2$ $t_1 = t_2$

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

0 votes

0 answers

GATE2011-21 Video Solution
Consider a hypothetical processor with an instruction of type $\text{LW R1, 20(R2)}$, which during execution reads a $32-bit$ word from memory and stores it in a $32-bit$ register $\text{R1}$. The ... mode implemented by this instruction for the operand in memory? Immediate addressing Register addressing Register Indirect Scaled Addressing Base Indexed Addressing

asked Apr 18 in CO & Architecture by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2015-2-25 Video Solution
A computer system implements a $40-bit$ virtual address, page size of $8$ $\text{kilobytes}$, and a $128-entry$ translation look-aside buffer ($TLB$) organized into $32$ sets each having $4$ ways. Assume that the $TLB$ tag does not store any process id. The minimum length of the $TLB$ tag in bits is ____.

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

0 votes

0 answers

GATE2003-63, ISRO2009-25 Video Solution
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements in the set. Deletion of the smallest element Insertion of an ... used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used

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

0 votes

0 answers

GATE2005-23 Video Solution
Packets of the same session may be routed through different paths in: TCP, but not UDP TCP and UDP UDP, but not TCP Neither TCP nor UDP

asked Apr 18 in Computer Networks by admin (3.6k points) | 4 views

0 votes

0 answers

GATE2016-1-15 Video Solution
Consider the following C program. # include <stdio.h> void mystery (int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb =ptra; ptra = temp; } int main () { int a = 2016, b=0, c= 4, d = 42; mystery (&a, &b); if (a < c) mystery (&c, &a); mystery (&a, &d); print f("%d\n", a); } The output of the program is _________.

asked Apr 18 in Programming by admin (3.6k points) | 3 views

0 votes

0 answers

GATE2015-1-20 Video Solution
Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is 0, 1, 3, 7, 15, 14, 12, 8, 0 0, 1, 3, 5, 7, 9, 11, 13, 15, 0 0, 2, 4, 6, 8, 10, 12, 14, 0 0, 8, 12, 14, 15, 7, 3, 1, 0

asked Apr 18 in Digital Logic by admin (3.6k points) | 4 views

0 votes

0 answers

GATE2002-1.25, ISRO2008-30, ISRO2016-6 Video Solution

asked Apr 18 in Graph Theory by admin (3.6k points) | 11 views

0 votes

0 answers

GATE2000-1.17, ISRO2015-79 Video Solution
Consider the following C declaration: struct ( short x[5]; union { float y; long z; } u; )t; Assume that the objects of the type short, float and long occupy $2$ bytes, $4$ bytes and $8$ bytes, respectively. The memory requirement for variable $t$, ignoring alignment consideration, is: $22$ bytes $14$ bytes $18$ bytes $10$ bytes

asked Apr 18 in Programming by admin (3.6k points) | 2 views

0 votes

0 answers

GATE2000-2.22 Video Solution
Suppose the time to service a page fault is on the average $10$ milliseconds, while a memory access takes $1$ microsecond. Then a $99.99\%$ hit ratio results in average memory access time of $1.9999$ milliseconds $1$ millisecond $9.999$ microseconds $1.9999$ microseconds

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

0 votes

0 answers

GATE2001-2.20 Video Solution
Which of the following does not interrupt a running process? A device Timer Scheduler process Power failure

asked Apr 18 in Operating System by admin (3.6k points) | 4 views

0 votes

0 answers

GATE1994-1.12 Video Solution
Generation of intermediate code based on an abstract machine model is useful in compilers because it makes implementation of lexical analysis and syntax analysis easier syntax-directed translations can be written for intermediate code generation it enhances ... the compiler it is not possible to generate code for real machines directly from high level language programs

asked Apr 18 in Compiler Design by admin (3.6k points) | 5 views

0 votes

0 answers

GATE1997-3.10, ISRO2008-57, ISRO2015-64 Video Solution

asked Apr 18 in Operating System by admin (3.6k points) | 4 views

0 votes

0 answers

GATE2015-2-22 Video Solution
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is $\Theta(n \log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$

asked Apr 18 in Algorithms by admin (3.6k points) | 4 views

Page:

1
2
3
4
...
15
next »

7,751 questions

1,855 answers

11,222 comments

95,105 users