The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Ram Swaroop
User Ram Swaroop
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Ram Swaroop
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
GATE2020CS23
commented
7 hours
ago
in
Others

959
views
gate2020cs
numericalanswers
6
answers
2
GATE2020CS16
commented
1 day
ago
in
Others

2.8k
views
gate2020cs
2
answers
3
GATE2020CS19
A multiplexer is placed between a group of 32 registers and an accumulator to regulate data movement such that at any given point in time the content of only one register will move to the accumulator. The number of select lines needed for the multiplexer is ______.
answered
Feb 12
in
Others

729
views
gate2020cs
numericalanswers
4
answers
4
GATE2020CS18
Let G be a group of 35 elements. Then the largest possible size of a subgroup of G other than itself is _______.
answer edited
Feb 12
in
Others

819
views
gate2020cs
numericalanswers
3
answers
5
GATE2020CS17
Let R be the set of all binary relations on the set {1,2,3}. Suppose a relation is chosen from R at random. The probability that the chosen relation is reflexive (round off to 3 decimal places) is ______.
commented
Feb 12
in
Others

879
views
gate2020cs
numericalanswers
3
answers
6
GATE2020CS14
Which one of the following is used to represent the supporting manyone relationships of a weak entity set in an entityrelationship diagram? A. Diamonds with double/bold border B. Rectangles with double/bold border C. Ovals with double/bold border D. Ovals that contain underlined identifiers
answer edited
Feb 12
in
Others

719
views
gate2020cs
3
answers
7
GATE2020CS13
Consider a relational database containing the following schemes. Catalogue sno pno cost S1 P1 150 S1 P2 50 S1 P3 100 S2 P4 200 S2 P5 250 S3 P1 250 S3 P2 150 S3 P5 300 S3 P4 250 Suppliers sno sname location S1 M/s Royal furniture Delhi S2 M/s Balaji furniture Bangalore S3 M/s ... WHERE pno = P4' GROUP BY pno) ; The number of rows returned by the above SQL query is A. 5 B. 0 C. 2 .
commented
Feb 12
in
Others

731
views
gate2020cs
2
answers
8
GATE2020CS9
commented
Feb 12
in
Others

959
views
gate2020cs
3
answers
9
GATE2020CS7
commented
Feb 12
in
Others

1.3k
views
gate2020cs
4
answers
10
GATE2020CSGA6
Goods and Services Tax (GST) is an indirect tax introduced in India in 2017 that is imposed on the supply of goods and services, and it subsumes all indirect taxes except few. It is a destinationbased tax imposed on goods and services used, and it is not imposed ... . C. GST does not have a component specific to UT. D. GST is imposed at the point of usage of goods and services.
answered
Feb 12
in
Verbal Ability

610
views
gate2020cs
1
answer
11
GATE2020CSGA5
commented
Feb 12
in
Verbal Ability

731
views
gate2020cs
3
answers
12
GATE2020CSGA4
The dawn of the 21st century witnessed the melting glaciers oscillating between giving too much and too little to billions of people who depend on them for fresh water. The UN climate report estimates that without deep cuts to manmade emissions, at ... people. C. Billions of people are responsible foe manmade emissions. D. Billions of people are affected by melting glaciers.
answered
Feb 12
in
Verbal Ability

906
views
gate2020cs
4
answers
13
GATE2020CSGA2
His knowledge of the subject was excellent but his classroom performance was_______. A. extremely poor B. good C. desirable D. praiseworthy
answered
Feb 12
in
Verbal Ability

847
views
gate2020cs
1
answer
14
ISRO202036
What is the complexity of the following code? sum=0; for(i=1;i<=n;i*=2) for(j=1;j<=n;j++) sum++; Which of the following is not a valid string ? $O(n^2)$ $O(n\log\ n)$ $O(n)$ $O(n\log\ n\log\ n)$
commented
Feb 10
in
Algorithms

339
views
isro2020
algorithms
timecomplexity
normal
1
answer
15
Time Complexity
What is the complexity of the following code? i = n while (i>=1){ for j = 1 to n x=x +1 i = i/2 } $\Theta(n)$ $\Theta( \log_2 n)$ $\Theta( n/\log_2 n)$ $\Theta( n \log_2 n)$
commented
Feb 10
in
Algorithms

545
views
timecomplexity
4
answers
16
GATE200617
An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an array solves it in linear time using a left to right pass of the array solves it in linear time using a right to left pass of the array solves it using divide and conquer in time $\Theta (n\log n)$ solves it in time $\Theta( n^2)$
commented
Feb 10
in
Algorithms

4.1k
views
gate2006
algorithms
normal
algorithmdesign
3
answers
17
DCFL not closed under
DCFLs are not closed under ________ a. Complement operation b. Inverse homomorphism operation c. Reversal operation d. Prefix operation
answer edited
Feb 4
in
Theory of Computation

2.4k
views
theoryofcomputation
dcfl
6
answers
18
GATE2016244
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$, $L_{2} = \left\{\left\langle M \right\rangle \mid M \text { takes at least 2016 steps on all inputs} \right\}$ ... $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive
commented
Feb 3
in
Theory of Computation

12.9k
views
gate20162
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
4
answers
19
GATE2017250
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$. The table of probabilities for each of the characters is shown below:$\begin{array}{cc}\hline \textbf{Character} & \textbf{Probability } \\\hline \text{$P ... If a message of $100$ characters over $X$ is encoded using Huffman coding, then the expected length of the encoded message in bits is ______.
commented
Feb 1
in
Algorithms

5.1k
views
gate20172
huffmancode
numericalanswers
algorithms
8
answers
20
GATE2017125
Consider a twolevel cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rate of $L1$ cache is $0.1$; the $L2$ cache experiences, on average, $7$ misses per $1000$ instructions. The miss rate of $L2$ expressed correct to two decimal places is ________.
commented
Feb 1
in
CO and Architecture

8.7k
views
gate20171
coandarchitecture
cachememory
numericalanswers
4
answers
21
GATE2015 CE2: GA9
Read the following table giving sales data of five types of batteries for years $2006$ to $2012$ ... Out of the following , which type of battery achieved highest growth between the years $2006$ and $2012$? Type V Type III Type II Type I
commented
Jan 31
in
Numerical Ability

1k
views
gate2015ce2
generalaptitude
numericalability
datainterpretation
tabulardata
4
answers
22
GATE201843
Let $G$ be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two adjacent numbers in the label ... $G$, and $z$ denote the number of connected components in $G$. Then, $y+10z$ = ____
commented
Jan 30
in
Algorithms

6.5k
views
gate2018
algorithms
graphalgorithms
graphconnectivity
numericalanswers
5
answers
23
GATE201815
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a trial ... probable and that all trials are independent. The probability (rounded to $3$ decimal places) that one of them wins on the third trial is ____
commented
Jan 30
in
Probability

3.7k
views
gate2018
probability
normal
numericalanswers
5
answers
24
GATE201848
Consider the weights and values of items listed below. Note that there is only one unit of each item. $\begin{array}{ccc}\hline \textbf{Item number} & \textbf{Weight (in Kgs) }& \textbf{Value (in rupees)} \\\hline \text{$1$} & \text{$10 ... list. The total value of items picked by the greedy algorithm is denoted by $V_{greedy}$. The value of $V_{opt}V_{greedy}$ is ____
commented
Jan 30
in
Algorithms

5.9k
views
gate2018
algorithms
greedyalgorithm
numericalanswers
1
answer
25
GATE201853
Consider a storage disk with $4$ platters (numbered as $0, 1, 2$ and $3$), $200$ cylinders (numbered as $0, 1, , 199$), and $256$ sectors per track (numbered as $0, 1, 255$). The following $6$ disk requests of ... is negligible. The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _____
comment edited
Jan 30
in
Operating System

5.3k
views
gate2018
operatingsystem
disks
numericalanswers
3
answers
26
GATE201836
Consider the following problems. $L(G)$ denotes the language generated by a grammar $G$. L(M) denotes the language accepted by a machine $M$. For an unrestricted grammar $G$ and a string $w$, whether $w \in L(G)$ Given a Turing machine $M$, ... statement is correct? Only I and II are undecidable Only II is undecidable Only II and IV are undecidable Only I, II and III are undecidable
commented
Jan 30
in
Theory of Computation

4.7k
views
gate2018
theoryofcomputation
decidability
easy
4
answers
27
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 24 (Page No. 256)
A machine has $48bit$ virtual addresses and $32bit$ physical addresses. Pages are $8\: KB.$ How many entries are needed for a singlelevel linear page table?
answered
Jan 29
in
Operating System

56
views
tanenbaum
operatingsystem
memorymanagement
paging
pagetable
descriptive
4
answers
28
GATE201918
Consider the following C program : #include<stdio.h> int jumble(int x, int y){ x = 2*x+y; return x; } int main(){ int x=2, y=5; y=jumble(y,x); x=jumble(y,x); printf("%d \n",x); return 0; } The value printed by the program is ______________.
commented
Jan 29
in
Programming

3k
views
gate2019
numericalanswers
programminginc
programming
1
answer
29
Test series
An organization is granted the block 172.89.0.0/16. The administrator wants to create 1024 subnets using 10 bits. The first and last addresses of any host in subnet 1024 respectively are
commented
Jan 28
in
Computer Networks

242
views
1
answer
30
Array 2D
Consider a lower triangular Matrix A[25....+25, 25....+25], base address (BA)=0, size of element = 100 Byte. Find the location of a [20][21] (Ordering: Row Major)?
commented
Jan 27
in
Programming

458
views
arrays
programminginc
datastructures
1
answer
31
Data Structure and programing
If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively and each element occupies 2 byte then the array has been stored in which order ? 1.row major 2.column major 3. matrix major Answer is row major explain how ?
commented
Jan 27
in
Programming

671
views
data
datastructures
programminginc
8
answers
32
GATE2015336
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of data are to ... elapsed between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
commented
Jan 27
in
Computer Networks

11.9k
views
gate20153
computernetworks
normal
numericalanswers
networkswitching
2
answers
33
MadeEasy Test Series: Compiler Design  Intermediate Code
a x b x c + d  a + e x f  g + h order of precedence : x>+> ; with x is left associative and +,  as right. Min number of variables required in TAC? Should'nt the expression be expressed as : ((a x b) x c) + d  a + (e x f)  g + h (((a x b) x c) + (d  (a + (e x f))  (g + h)))
commented
Jan 24
in
Compiler Design

170
views
madeeasytestseries
compilerdesign
intermediatecode
2
answers
34
Intermediate code generationMade easy test series
The minimum number of temporary variables created in 3 address code of the following expression are _____ a+b*c+dea+b*c Assume order of precedence from highest to lowest as: *,+ and  .Consider associativity for + and * are not important but  is left associative.
commented
Jan 24
in
Compiler Design

278
views
compilerdesign
intermediatecode
1
answer
35
3 address code
The minimum number of variables required in 3 address code of the given expression are:______ a * b * c + d  a + e * f  g + h Order of precedence: * > + >  ; with * as left associative and +, as right associative.
commented
Jan 24
in
Compiler Design

477
views
compilerdesign
3addresscode
3
answers
36
Algorithm: Selection Sort
Consider the following code which sort all elements of an array A' in descending order. Which of the following will represents correct value of X, Y, Z in above code for selection sort? a. i > 0, K > 0, a[K] > a[max] b. i ... the array in the descending order but by using option a it is aranging in ascending order. And option D is doing what question is saying.
commented
Jan 24
in
Algorithms

435
views
algorithms
sorting
selectionsort
2
answers
37
ISRO200754
BCNF is not used for cases where a relation has Two (or more) candidate keys Two candidate keys and composite The candidate key overlap Two mutually exclusive foreign keys
commented
Jan 24
in
Databases

3.2k
views
isro2007
databases
databasenormalization
1
answer
38
RISC processor window size
Assume that RISC processor contains 10 global registers, 10 local registers, 6 In register and 6 Out register. It contain 4 register windows what is the size of window and register file of the processor? a) 30 and 74 b) 32 and 74 c) 22 and 64 d) 22 and 70
commented
Jan 24
in
CO and Architecture

1.3k
views
1
answer
39
SELF_DOUBT(MST)
What important point we keep in mind while finding the #(number) of spanning tree ?? from the given graph
commented
Jan 24
in
Algorithms

83
views
algorithms
mst
graphconnectivity
0
answers
40
max weighted MST possible
Let G be a complete undirected graph on 5 vertices 10 edges, with weights being 1, 2, 3, 4, 5, 6, 7, 8, 9, 10. Let X be the value of the maximum possible weight a MST of G can have. Then the value of x will be_____ the answer to this question is given as 11 but there is no procedure given . Please ,can anyone help me out in understanding the procedure
commented
Jan 24
in
Graph Theory

129
views
mst
50,833
questions
57,699
answers
199,401
comments
107,483
users