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
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. For hardcopy of previous year questions please see
here
Recent activity by Soumya29
User Soumya29
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Soumya29
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
TIFR2013B20
Suppose $n$ processors are connected in a linear array as shown below. Each processor has a number. The processors need to exchange numbers so that the numbers eventually appear in ascending order (the processor $\rm P1$ should have the minimum value and the the processor $\ ... the values? $n \log n$ steps $n^2$ steps $n$ steps $n^{1.5}$ steps The algorithm is not guaranteed to sort
commented
2 days
ago
in
Algorithms

689
views
tifr2013
algorithms
sorting
0
answers
2
Digital logic
I am getting 3 as answer
commented
5 days
ago
in
Digital Logic

33
views
digitallogic
0
answers
3
Test zeal
What should be less time consuming approach for such type of questions
commented
5 days
ago
in
Operating System

31
views
test
series
zeal
0
answers
4
Selfdoubt  Case of Deletion when Open Addressing is used for collision resolution
comment edited
Oct 7
in
Algorithms

72
views
hashing
algorithms
0
answers
5
Propositional Logic
Number of nonequivalent propositional functions ( different truth tables ) possible with 'n' atomic propositions is ? and explain also a) $2^n$ b) $n^2$ c) 2^2^n (means 2 raise to power 2 raise to power n) d) 2^n^2
comment moved
Oct 5
in
Mathematical Logic

44
views
1
answer
6
Combinatorics
There are n hats and k people (where k<n). $1)$ How many ways we can assign each person a hat? $2)$ How many ways we can assign each person atleast a hat?
commented
Oct 3
in
Combinatory

78
views
permutationsandcombinations
discretemathematics
0
answers
7
Identify the class of Languages(Regular, DCFL, CFL, Recursive, Recursive Enumerable)
commented
Oct 2
in
Theory of Computation

44
views
theoryofcomputation
0
answers
8
ACE mock test
what is the approach to solve these kind of questions???
commented
Oct 2
in
Combinatory

25
views
4
answers
9
GATE20001.3
The determinant of the matrix $$\begin{bmatrix}2 &0 &0 &0 \\ 8& 1& 7& 2\\ 2& 0&2 &0 \\ 9&0 & 6 & 1 \end{bmatrix}$$ $4$ $0$ $15$ $20$
commented
Oct 1
in
Linear Algebra

788
views
gate2000
linearalgebra
easy
determinant
5
answers
10
GATE2004IT55
Let $f(n)$, $g(n)$ and $h(n)$ be functions defined for positive integers such that $f(n) = O(g(n))$, $g(n) \neq O(f(n))$, $g(n) = O(h(n))$, and $h(n) = O(g(n))$. Which one of the following statements is FALSE? $f(n) + g(n) = O(h(n) + h(n))$ $f(n) = O(h(n))$ $h(n) \neq O(f(n))$ $f(n)h(n) \neq O(g(n)h(n))$
commented
Oct 1
in
Algorithms

1.6k
views
gate2004it
algorithms
asymptoticnotations
normal
1
answer
11
Decoder circuit
Please explain in detail
commented
Sep 30
in
Digital Logic

44
views
digitallogic
decoder
0
answers
12
Boolean expression KMAP
commented
Sep 30
in
Digital Logic

44
views
digitallogic
booleanexpressions
2
answers
13
CMI2013A06
A simple graph is one in which there are no selfloops and each pair of distinct vertices is connected by at most one edge.Let $G$ be a simple graph on $8$ vertices such that there is a vertex of degree $1$, a vertex of degree $2$, a vertex of degree $3$, ... a vertex of degree $6$ and a vertex of degree $7$. Which of the following can be the degree of the last vertex? $3$ $0$ $5$ $4$
commented
Sep 29
in
Graph Theory

364
views
cmi2013
graphtheory
normal
degreeofgraph
4
answers
14
GATE2008IT27
$G$ is a simple undirected graph. Some vertices of $G$ are of odd degree. Add a node $v$ to $G$ and make it adjacent to each odd degree vertex of $G$. The resultant graph is sure to be regular complete Hamiltonian Euler
commented
Sep 29
in
Graph Theory

1.7k
views
gate2008it
graphtheory
graphconnectivity
normal
3
answers
15
GATE199203,iii
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
commented
Sep 29
in
DS

849
views
gate1992
datastructure
graphs
easy
3
answers
16
CMI2011A07
Let $G=(V, E)$ be a graph. Define $\bar{G}$ to be $(V, \bar{E})$, where for all $u, \: v \: \in V \: , (u, v) \in \bar{E}$ if and only if $(u, v) \notin E$. Then which of the following is true? $\bar{G}$ is always connected. $\bar{G}$ is connected if $G$ is not connected. At least one of $G$ and $\bar{G}$ connected. $G$ is not connected or $\bar{G}$ is not connected
answer edited
Sep 29
in
Graph Theory

401
views
cmi2011
graphtheory
graphconnectivity
2
answers
17
Peter Linz 4th edition Ex1.2 Q10
Q Prove or Disprove the following claim $(L^R)^*=(L^*)^R$ for all languages.
commented
Sep 21
in
Theory of Computation

64
views
theoryofcomputation
0
answers
18
Permutation and Combination
How many ways are there to select 8 coins from a piggy bank with 100 pennies and 80 nickels ? Ans. C(2+81,8) Suppose the Question had been : How many ways are there to select 8 coins from a piggy bank with 6 pennies and 6 nickels? Now what would have been ... penny , 6 nickel 3 penny , 5 nickel and so on... But for a large number it would be a problem so how to do it ?
commented
Sep 18
in
Combinatory

18
views
permutationsandcombinations
3
answers
19
GATE200215
A university placement center maintains a relational database of companies that interview students on campus and make job offers to those successful in the interview. The schema of the database is given below: COMPANY(cname, clocation) STUDENT (srollno, sname, ... students were offered jobs, the name of the degree and the average offered salary of students in this degree program.
comment edited
Sep 11
in
Databases

941
views
gate2002
databases
normal
descriptive
relationalalgebra
sql
3
answers
20
GATE2007IT76
Consider the sequence $\langle x_n \rangle , \: n \geq 0$ defined by the recurrence relation $x_{n+1} = c . x^2_n 2$, where $c > 0$. Suppose there exists a nonempty, open interval $(a, b)$ such that for all $x_0$ satisfying $a < x_0 < b$, the sequence converges ... sequence converges to the value? $\frac{1+\sqrt{1+8c}}{2c}$ $\frac{1\sqrt{1+8c}}{2c}$ $2$ $\frac{2}{2c1}$
answer selected
Sep 10
in
Combinatory

953
views
gate2007it
permutationsandcombinations
normal
recurrence
1
answer
21
Logic
commented
Sep 6
in
Mathematical Logic

128
views
0
answers
22
Equi_Joins
https://gateoverflow.in/1670/gate1998133 What will be the attributes of resultant table : (A B) or (C D) ?
commented
Aug 31
in
Databases

69
views
1
answer
23
memory
In a twolevel cache system, the access times of L1 and L2 are 3, 10 clock cycles respectively. The miss penalty from the L2 cache to main memory is 20 clock cycles. The miss rate of L1 cache is thrice that of L2. The average memory access time(AMAT) of this cache system is 4 cycles. The miss rates of L1 and L2 respectively are:
commented
Aug 31
in
CO & Architecture

123
views
0
answers
24
Combinational circuits
commented
Aug 26
in
Digital Logic

79
views
how
ertorelational
solve
this
2
answers
25
addressing modes
How many memory cycles are required with following Addressing modes? 1. Indirect mode : 2 2. Absolute mode :1 3.Indexed Mode : Confusion here as offset is a constant so according to me it should be there in memory so 1 clock cyle to fetch ... machine cycle 5. Register indirect mode : 1 machine cycle Am i right ? and local variables mostly uses direct addressing mode right ?
commented
Aug 24
in
CO & Architecture

334
views
coandarchitecture
addressingmodes
1
answer
26
No. of minimal SOP expression
In Kmap it was found out that essential prime implicants are covering all terms except 2 minterms. Those 2 minterms are in turn covered by 3 nonessential prime implicants each. What is the number of minimal Sum of product expression?.
answer selected
Aug 23
in
Digital Logic

474
views
digitallogic
0
answers
27
Pointer Doubt
Suppose in P3 the free statement was not present then P3 will not be creating any problem right because when i return p3 it will return basically what its pointing to which is dynamically allocated memory from heap which will be there even though px doesn't exist ... returned value can be stored in another pointer now Right ?? Right now P3 is the case of Dangling Pointer isn't it ?
commented
Aug 22
in
DS

24
views
programminginc
pointers
2
answers
28
GATE201143
An $8KB$ directmapped writeback cache is organized as multiple blocks, each size of $32$$bytes$. The processor generates $32$$bit$ addresses. The cache controller contains the tag information for each cache block comprising of the following. $1$ valid bit $1$ ... at the cache controller to store metadata (tags) for the cache? $4864$ $bits$ $6144$ $bits$ $6656$ $bits$ $5376$ $bits$
comment edited
Aug 21
in
CO & Architecture

2.5k
views
gate2011
coandarchitecture
cachememory
normal
1
answer
29
GATE19951.6
The principle of locality justifies the use of: Interrupts DMA Polling Cache Memory
commented
Aug 20
in
CO & Architecture

1.7k
views
gate1995
coandarchitecture
cachememory
easy
0
answers
30
Two level of cache
Consider a two level cache system. For 100 memory references 20 misses in 1st level cache,10 misses in second level cache. Miss penalty from second level to memory is 40 cycles. if Total average = 7.6 cycles, then hit time of second level cache ? Assume hit time of second level cache is two times the first level cache? Ans. 4
commented
Aug 20
in
CO & Architecture

127
views
coandarchitecture
cachememory
5
answers
31
ISI 2004 MIII
In how many ways can three person, each throwing a single die once, make a score of $11$ $22$ $27$ $24$ $38$
commented
Aug 19
in
Combinatory

676
views
permutationsandcombinations
isi2004
1
answer
32
Combination with repetition allowed
Ans. 0
commented
Aug 19
in
Mathematical Logic

32
views
permutationsandcombinations
1
answer
33
Addressing mode
commented
Aug 19
in
CO & Architecture

106
views
addressingmodes
clockcycles
1
answer
34
PI and EPI in case of Don't care
Consider the below function $f=\sum m(0,1,2,5,8,15)+d(6,7,10)$ In this Prime Implicant count comes7 and Essential Prime Implicant Count comes 2. Please verify.
commented
Aug 18
in
Digital Logic

293
views
digitallogic
1
answer
35
Cache memory  Find Cache size ( given K, line size, tag memory, physical address space )
comment edited
Aug 16
in
CO & Architecture

246
views
coandarchitecture
cachememory
0
answers
36
Addressing modes
Instructions are stored in memory. When they are to be executed they are brought into instruction register. Now it is divided as Mode, opcode, operand (log (memory size) is divided in three parts) . In direct addressing, operand represent the effective ... required to address a memory then how such a big instruction is stored in memory whose operand itself has those many bits?
comment edited
Aug 16
in
CO & Architecture

53
views
addressingmodes
coandarchitecture
1
answer
37
Multilevel Cache Access time
Ans. A
comment edited
Aug 13
in
CO & Architecture

77
views
coandarchitecture
cachememory
memorymanagement
1
answer
38
Fork System Call
A process execute the code: main() { fork(); fork() && fork()  fork(); fork(); printf("Hi"); } The number of times "Hi" will be printed is
comment edited
Aug 13
in
Operating System

181
views
0
answers
39
interview IIsc
Given a deck of 10 cards numbered 1 to 10. Select 3 cards one by one. Find the probability that selected cards is in increasing order. Eg : {1, 5, 7} or {8, 9, 10} etc
comment moved
Aug 12
in
Probability

83
views
probability
permutationsandcombinations
1
answer
40
ACE_subject_test_digitalLogic2019
answer selected
Aug 12
in
Digital Logic

130
views
40,845
questions
47,507
answers
145,768
comments
62,262
users