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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent activity by Shubham Sharma 2
User Shubham Sharma 2
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Shubham Sharma 2
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
permutation & combination
if no 3 diagonal of a convex decagon meet at the same point inside the decagon ,into how many line segments are the diagonal divided by their intersection?
answered
Nov 8
in
Combinatory

24
views
permutationsandcombinations
1
answer
2
PTCUL02
In which of the following usually a front end processor is used ? A. Virtual storage B. Timesharing C. Multiprogamming D. Multithreading
answered
Nov 8
in
CO & Architecture

13
views
ptcul2017
coandarchitecture
1
answer
3
PTCUL04
Program threats are A. Trojan Horse B. Trap Door C. Both D. None of them
answered
Nov 8
in
Computer Networks

27
views
ptcul2017
computernetworks
1
answer
4
ISRO 2017ECE Digital Logic
Which of the following statement is true for Programmable Logic array (PLA)? (a) Fixed AND array and Fused programmable OR array (b) Fused programmable AND array and Fixed OR array (c) Fused programmable AND array and Fused programmable OR array (d) None of the above
answered
Nov 8
in
Digital Logic

20
views
isro2017ece
1
answer
5
CO  Addressing
answered
Nov 8
in
CO & Architecture

28
views
coandarchitecture
addressingmodes
instructionformat
madeeasytestseries
1
answer
6
gate academy test series
Which of the following are the criteria for CPU scheduling algorithm evaluation. A. Maximum CPU utilization under the constraint that maximum response time is one second. B. Maximum throughput such that turnaround time is (on an average) linearly proportional to total execution time. C. Both D. None
answered
Nov 8
in
Operating System

30
views
testseries
operatingsystem
1
answer
7
parser
consider the following statements: S1:SLR parsing table have more number of state then LALR parsing table S2:it is economical to construct SLR and LALR table than CLR parsing table . Which one is true?
answered
Nov 3
in
Compiler Design

37
views
compilerdesign
parsing
1
answer
8
GATE  GATE MOCK 2017
Consider an array consisting of –ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign altogether i.e all +ve on one side and then all ve on the other ? (A) N1 (B) N (C) N+1 (D) (N*(N1))/2
answered
Oct 4
in
DS

39
views
1
answer
9
NIELIT July 2017_75
Choose the most appropriate definition of plane graph A) A simple graph which is isomorphic to Hamiltonian graph B) A graph drawn in a plane such away that if the vertex set of graph can be partitioned into two non  empty disjoint subset X and ... in a plane in such a way that any pair of edges meet only at their end vertices D) None of the option
answered
Oct 3
in
Graph Theory

64
views
1
answer
10
NIELIT July 2017_100
Kadene algorithm is used to find A) Maximum sum subsequence in an array B) Maximum sum subarray in an array C) Maximum product subsequence in an array D) Maximum product subarray in an array
answered
Oct 3
in
Algorithms

41
views
2
answers
11
peter linz chapter 5 ex 5.1 q#19
answer edited
Sep 29
in
Theory of Computation

90
views
2
answers
12
Data Hazards [GateBook]
answer edited
Sep 28
in
CO & Architecture

167
views
pipelining
datahazards
coandarchitecture
2
answers
13
UGCNETjune2009ii34
A compiler that runs on one machine and produces code for a different machine is called: (A) Cross compilation (B) One pass compilation (C) Two pass compilation (D) None of the above
commented
Sep 26
in
CO & Architecture

62
views
ugcnetjune2009ii
3
answers
14
Aptitude: Profit and Loss: Arun Sharma
answer edited
Sep 25
in
Numerical Ability

115
views
numericalability
profitloss
3
answers
15
UGCNETjune2009ii18
(i) DML includes a query language based on both relation algebra and tuple calculus (ii) DML includes a query language based on tuple calculus (iii) DML includes a query language based on relational algebra (iv) DML includes a query language based on none of the ... Which one is correct? (A) (i) only (B) (ii) only (C) (iii) only (D) (iv) only
answered
Sep 23
in
Databases

63
views
ugcnetjune2009ii
3
answers
16
UGCNETjune2009ii21
Which construct in SQL is used to test whether a subquery has any tuples in its result? (A) UNIQUE (B) EXISTS (C) GROUP BY (D) EXCEPT
answered
Sep 23
in
Databases

53
views
ugcnetjune2009ii
1
answer
17
generating function
Let p be an odd prime number. Find the number of subsets A of the set {1, 2, …, 2p} such that (i) A has exactly p elements, and (ii) the sum of all the elements in A is divisible by p.
answered
Sep 23
in
Combinatory

32
views
1
answer
18
#Combinatorics
At any time, the total number of persons on earth who have shaken hands an odd number of times has to be The answer provided is even number but cannot understand how
answer edited
Sep 23
in
Mathematical Logic

39
views
permutationsandcombinations
1
answer
19
Mod 16 Down counter
The initial state of Mod 16 down counter is 0110. After 37 clock pulses the state of the counter will be __________
commented
Sep 21
in
Digital Logic

101
views
2
answers
20
NPTEL
Consider two relations R and S of size 600 and 500 bytes respectively.The size of a tuple in both relations is 20B. The block size of the system is 200B. How would many extra block transfers be required, in the worst case, if nested loop join is used instead of block nested loop join technique to compute R⋈S? 1. 78 2. 93 3. 66 4. 105
answer edited
Sep 21
in
Databases

334
views
databases
nptelquiz
4
answers
21
UGCNETdec2009ii17
Specialization is __________ process. (A) topdown (B) bottom up (C) both (A) and (B) (D) none of these
commented
Sep 19
in
Databases

50
views
ugcnetdec2009ii
1
answer
22
probability
commented
Aug 9
in
Mathematical Logic

54
views
probability
engineeringmathematics
1
answer
23
Trees
What is the meaning of indexed binary search tree???
answered
Aug 9
in
DS

43
views
1
answer
24
ISRO 2009ECE RISC vs CISC
The theoretical dividing line between Reduced Instruction Set computing (RISC) microprocessor and Complex Instructions Set Computing (CISC) microprocessor is a) Instruction execution rate to be one instruction per clock cycle b) Number of address and data lines c) Number of pins in the chip d) None of the above
answered
Aug 9
in
Digital Logic

88
views
isro
isroece
coandarchitecture
1
answer
25
status Register & I/o
What is the work of status register in I/O operation ?
answered
Aug 9
in
CO & Architecture

42
views
coandarchitecture
i
o
statusregister
1
answer
26
DMA & IO
DMA interface unit eliminates the need to use CPU registers to transfers data from (a) MAR to MBR (b) MBR to MAR (c) I/O units to memory (d) Memory to I/O units
answered
Aug 9
in
CO & Architecture

117
views
coandarchitecture
dma
1
answer
27
Time, Speed and Distance
Dalbir and Asim are approaching from opposite ends of a linear race track of 100m. After passing each other they reach end points of the track and turn back. They now meet at 35m from where Dalbir started after 45 seconds. Find the speed of Asim? (a) 3 m/s (b) 3.5 m/s (C) 4.5 m/s (d) 5 m/s
comment edited
Jul 23
in
Numerical Ability

63
views
1
answer
28
Dependency preserving decomposition
asked
May 14
in
Databases

56
views
2
answers
29
Demand Paging
Assume we have a demandpaged memory. The page table is held in registers. It takes 8 ms to service a page fault if an empty page is available or the replaced page is not modified , and 20 ms if the replaced page is modified. Memory access time is 100 ns . Assume that the page to ... a) 6.1 * 10 ^  6 b) 7.3 * 10 ^  6 c) 3.4 * 10 ^  4 d) None of these
asked
May 1
in
Operating System

174
views
2
answers
30
ISRO200721
An Ethernet hub functions as a repeater connects to a digital PBX connects to a tokenring network functions as a gateway
commented
Apr 30
in
Computer Networks

841
views
isro2007
computernetworks
ethernet
1
answer
31
ISRO200712
Consider a job scheduling problem with 4 jobs $J_1, J_2, J_3$ and $J_4$ with corresponding deadlines: $(d_1, d_2, d_3, d_4) = (4, 2, 4, 2)$. Which of the following is not a feasible schedule without violating any job schedule? $J_2, J_4, J_1, J_3$ $J_4, J_1, J_2, J_3$ $J_4, J_2, J_1, J_3$ $J_4, J_2, J_3, J_1$
commented
Apr 30
in
Operating System

1.2k
views
isro2007
operatingsystem
processschedule
2
answers
32
ISRO200709
Eigen vectors of $\begin{bmatrix} 1 && \cos \theta \\ \cos \theta && 1 \end{bmatrix}$ are $\begin{bmatrix} a^n && 1 \\ 0 && a^n \end{bmatrix}$ $\begin{bmatrix} a^n && n \\ 0 && a^n \end{bmatrix}$ $ ... \ 0 && a^n \end{bmatrix}$ $\begin{bmatrix} a^n && na^{n1} \\ n && a^n \end{bmatrix}$
answer edited
Apr 30
in
Linear Algebra

884
views
isro2007
linearalgebra
matrices
eigenvalue
1
answer
33
segmentation and paging
answer edited
Apr 17
in
Operating System

133
views
1
answer
34
set theory
answered
Apr 13
in
Set Theory & Algebra

90
views
settheory&algebra
discretemathematics
engineeringmathematics
sets
1
answer
35
set theory
A) lattice B) not a lattice since b and c have f,g,h as upper bounds but none of the three is least (i.e) one is not lesser than other 2. so b and c dont have a least upper bound. C) lattice
answered
Apr 13
in
Set Theory & Algebra

39
views
settheory&algebra
discretemathematics
engineeringmathematics
sets
1
answer
36
rosen(sets relation function)
Find a formula for $\sum_{k=0}^{m}G.I.F(\sqrt{k})$, when m is a positive integer (where G.I.F is greatest integer function or floor function).
answered
Apr 13
in
Set Theory & Algebra

73
views
generatingfunctions
1
answer
37
Rosen(relation)
Let R1 and R2 be the “congruent modulo 3” and the “congruent modulo 4” relations, respectively, on the set of integers. That is, R1 = {(a, b)  a ≡ b (mod 3)} and R2 = {(a, b)  a ≡ b (mod 4)}. Find a) R1 ∪ R2. b) R1 ∩ R2. c) R1 − R2. d) R2 − R1. e) R1 ⊕ R2.
answer edited
Apr 13
in
Set Theory & Algebra

121
views
0
answers
38
Rosen(relations)
Given the directed graphs representing two relations, how can the directed graph of the union, intersection, symmetric difference, difference, and composition of these relations be found?
commented
Apr 13
in
Set Theory & Algebra

52
views
1
answer
39
Rosen Exercise problem
1. What is good for corporations is good for the United States. 2. What is good for the United States is good for you. 3. What is good for the corporations is for you to buy lots of stuffs What are the valid conclusions? Please explain the solution
answered
Apr 13
in
Mathematical Logic

72
views
kennethrosen
discretemathematics
mathematicallogic
1
answer
40
Rosen , Relations
If Relation S is Transitive then what can we say about Transitivity of Sn ?
answered
Apr 13
in
Set Theory & Algebra

56
views
28,834
questions
36,686
answers
90,617
comments
34,640
users