Recent questions tagged easy
Register

Recent questions tagged easy

Recent questions tagged easy
1 vote
2 answers 564 views
GATE CSE 2021 Set 2 | Question: 31 | Video Solution
Arjun asked in Databases Feb 18, 2021
by Arjun
1.4k points
564 views
0 votes
0 answers 52 views
Platform Technologies
Pretend you are ready to buy a new computer for personal use. First, take a look at ads form various magazines and newspapers and list items you don't quite understand. Look these terms and give a brief written explanation. Decide what factors are ... them. After you select the system you would like to buy, identify which terms refer to hardware and which refer to software.
ragnarok_29 asked in CO & Architecture Nov 29, 2020
by ragnarok_29
5 points
52 views
0 votes
0 answers 29 views
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.
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
29 views
0 votes
0 answers 25 views
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
admin asked in Operating System Apr 18, 2020
by admin
585 points
25 views
0 votes
0 answers 74 views
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)$
admin asked in Algorithms Apr 18, 2020
by admin
585 points
74 views
0 votes
0 answers 30 views
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
admin asked in Databases Apr 18, 2020
by admin
585 points
30 views
0 votes
0 answers 21 views
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
admin asked in Algorithms Apr 18, 2020
by admin
585 points
21 views
0 votes
0 answers 27 views
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$
admin asked in Algorithms Apr 18, 2020
by admin
585 points
27 views
0 votes
0 answers 22 views
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$
admin asked in Operating System Apr 18, 2020
by admin
585 points
22 views
0 votes
0 answers 24 views
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$
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
24 views
0 votes
0 answers 23 views
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$
admin asked in Operating System Apr 18, 2020
by admin
585 points
23 views
0 votes
0 answers 20 views
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
admin asked in Algorithms Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 18 views
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
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 21 views
GATE1999-1.17 Video Solution
Which of the following is the most powerful parsing method? LL (1) Canonical LR SLR LALR
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
21 views
0 votes
0 answers 27 views
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
admin asked in Programming Apr 18, 2020
by admin
585 points
27 views
0 votes
0 answers 18 views
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
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 28 views
GATE1998-1.27 Video Solution
Type checking is normally done during lexical analysis syntax analysis syntax directed translation code optimization
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
28 views
0 votes
0 answers 27 views
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})$
admin asked in Algorithms Apr 18, 2020
by admin
585 points
27 views
0 votes
0 answers 19 views
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.
admin asked in DS Apr 18, 2020
by admin
585 points
19 views
0 votes
0 answers 20 views
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
admin asked in Algorithms Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 22 views
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
admin asked in Algorithms Apr 18, 2020
by admin
585 points
22 views
0 votes
0 answers 53 views
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$
admin asked in Databases Apr 18, 2020
by admin
585 points
53 views
0 votes
0 answers 18 views
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
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 26 views
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
admin asked in DS Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 18 views
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..
admin asked in Operating System Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 22 views
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$
admin asked in Algorithms Apr 18, 2020
by admin
585 points
22 views
0 votes
0 answers 29 views
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
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
29 views
0 votes
0 answers 17 views
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 ____.
admin asked in Operating System Apr 18, 2020
by admin
585 points
17 views
0 votes
0 answers 26 views
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
admin asked in DS Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 21 views
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
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
21 views
0 votes
0 answers 22 views
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
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
22 views
0 votes
0 answers 33 views
GATE2002-1.25, ISRO2008-30, ISRO2016-6 Video Solution
admin asked in Graph Theory Apr 18, 2020
by admin
585 points
33 views
0 votes
0 answers 17 views
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
admin asked in Programming Apr 18, 2020
by admin
585 points
17 views
0 votes
0 answers 22 views
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
admin asked in Operating System Apr 18, 2020
by admin
585 points
22 views
Page:
Ask a Question
Quick search syntax
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Developed by Chun