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 goxul
User goxul
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User goxul
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
GATE20195
Let $U = \{1, 2, \dots , n\}$ Let $A=\{(x, X) \mid x \in X, X \subseteq U \}$. Consider the following two statements on $\mid A \mid$. $\mid A \mid = n2^{n1}$ $\mid A \mid = \Sigma_{k=1}^{n} k \begin{pmatrix} n \\ k \end{pmatrix}$ Which of the above statements is/are TRUE? Only I Only II Both I and II Neither I nor II
commented
6 days
ago
in
Combinatory

2.8k
views
gate2019
engineeringmathematics
discretemathematics
permutationandcombination
10
answers
2
GATE200361
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of \(1. . . n\)? \(\frac{n(n1)}{2}\) \(\frac{n(n1)}{4}\) \(\frac{n(n+1)}{4}\) \(2n[\log_2n]\)
commented
6 days
ago
in
Algorithms

5k
views
gate2003
algorithms
sorting
normal
10
answers
3
GATE201950
What is the minimum number of $2$input NOR gates required to implement a $4$ variable function expressed in sumofminterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ Assume that all the inputs and their complements are available. Answer: _______
commented
Nov 22
in
Digital Logic

6k
views
gate2019
numericalanswers
digitallogic
canonicalnormalform
1
answer
4
GATE199515b
What is the equivalent minimal Boolean expression (in sum of products form) for the Karnaugh map given below?
commented
Nov 22
in
Digital Logic

357
views
gate1995
digitallogic
kmap
normal
1
answer
5
GATE19894x
Provide short answers to the following questions: A switching function is said to be neutral if the number of input combinations for which its value is 1 is equal to the number of input combinations for which its value is 0. Compute the number of neutral switching functions of $n$ variables (for a given n).
answer edited
Nov 21
in
Digital Logic

217
views
gate1989
descriptive
digitallogic
booleanalgebra
1
answer
6
GATE200419
If $73_x$ (in basex number system) is equal to $54_y$ (in base $y$number system), the possible values of $x$ and $y$ are $8, 16$ $10, 12$ $9, 13$ $8, 11$
commented
Nov 21
in
Digital Logic

1.5k
views
gate2004
digitallogic
numberrepresentation
easy
0
answers
7
Cormen Edition 3 Exercise 12.1 Question 5 (Page No. 289)
Argue that since sorting $n$ elements takes $\Omega (n\ lgn)$ time in the worst case in the comparison model, any comparisonbased algorithm for constructing a $BST$ from an arbitrary list of n elements takes $\Omega (n\ lgn)$ time in the worst case.
commented
Nov 21
in
Algorithms

97
views
cormen
algorithms
descriptive
binarysearchtree
binarytree
trees
2
answers
8
GATE201141
Consider an instruction pipeline with four stages $\text{(S1, S2, S3 and S4)}$ each with combinational circuit only. The pipeline registers are required between each stage and at the end of the last stage. Delays for the stages and for the pipeline registers are as ... state under ideal conditions when compared to the corresponding nonpipeline implementation? $4.0$ $2.5$ $1.1$ $3.0$
commented
Nov 15
in
CO and Architecture

4.1k
views
gate2011
coandarchitecture
pipelining
normal
2
answers
9
GATE2015242
Consider a processor with byteaddressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack in the main memory is implemented from memory location $(0100)_{16}$ and it grows upward. The stack pointer (SP) points ... the value of the stack pointer is: $(016A)_{16}$ $(016C)_{16}$ $(0170)_{16}$ $(0172)_{16}$
commented
Nov 15
in
CO and Architecture

4.8k
views
gate20152
coandarchitecture
machineinstructions
easy
3
answers
10
GATE2014349
Consider the set of all functions $f:\{0,1, \dots,2014\} \to \{0,1,\dots, 2014\}$ such that $ f\left(f\left(i\right)\right)=i$, for all $0 \leq i \leq 2014$. Consider the following statements: $P$ ... the following is CORRECT? $P, Q$ and $R$ are true Only $Q$ and $R$ are true Only $P$ and $Q$ are true Only $R$ is true
commented
Nov 11
in
Set Theory & Algebra

4.6k
views
gate20143
settheory&algebra
functions
normal
4
answers
11
GATE2006IT47
Consider the depthfirstsearch of an undirected graph with $3$ vertices $P$, $Q$, and $R$. Let discovery time $d(u)$ represent the time instant when the vertex $u$ is first visited, and finish time $f(u)$ represent the time instant when the vertex ... There are two connected components, and $Q$ and $R$ are connected There are two connected components, and $P$ and $Q$ are connected
commented
Nov 8
in
Algorithms

2.5k
views
gate2006it
algorithms
graphalgorithms
normal
6
answers
12
GATE201936
Consider the following grammar and the semantic actions to support that inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders for the nonterminals $D, T, L$ or $L_1$ ... $X_1=L, \: X_2=L, \: X_3=L_1, \: X_4 = T$ $X_1=T, \: X_2=L, \: X_3=T, \: X_4 = L_1$
commented
Oct 20
in
Compiler Design

2.4k
views
gate2019
compilerdesign
syntaxdirectedtranslation
2
answers
13
theory of computation
Construct minimal DFA for L = {an: n is either a multiple of three or a multiple of 5 }
commented
Oct 15
in
Theory of Computation

425
views
theoryofcomputation
finiteautomata
2
answers
14
what is valid PC after execution of these instruction
Consider the following program segment: Instruction Meaning Size (words) I1 LOAD r0, 500 2 I2 MOV r1, r0 1 I3 ADD ro, r1 1 I4 INC r0 1 I5 INC r1 1 I6 ADD r0, r1 1 I7 Store r1, 2 I8 Halt Stop 1 Assume that memory ... 32 bits. Program is loaded into memory location (3000)10 onwards. The value of PC at the end of execution of above program is _____
commented
Sep 30
in
CO and Architecture

524
views
1
answer
15
Branch Target Address
In a normal 5stage pipeline, when is the branch target address available? There are some sources which say that the address is available after the MEM stage, but go on to say that it can be found out after the ID stage if we put in an extra ... in which they assumed that the address is available after the 4th stage. Is that the approach to be followed for all the questions?
answer selected
Sep 21
in
CO and Architecture

65
views
coandarchitecture
pipelining
6
answers
16
GATE201925
Consider a sequence of $14$ elements: $A=[5, 10, 6, 3, 1, 2, 13, 4, 9, 1, 4, 12, 3, 0]$. The sequence sum $S(i,j) = \Sigma_{k=i}^j A[k]$. Determine the maximum of $S(i,j)$, where $0 \leq i \leq j <14$. (Divide and conquer approach may be used.) Answer: ___________
answered
Jul 4
in
Algorithms

3.3k
views
gate2019
numericalanswers
algorithms
algorithmdesign
2
answers
17
made easy test series:algorithms,sorting
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a swap?
commented
Apr 16
in
Algorithms

133
views
madeeasytestseries
algorithms
sorting
1
answer
18
Cormen Edition 3 Exercise 6.1 Question 5 (Page No. 154)
Is an array that is in sorted order a minheap ?
answered
Apr 14
in
Algorithms

33
views
cormen
algorithms
heap
1
answer
19
Michael Sipser Edition 3 Exercise 0 Question 5 (Page No. 26)
If C is a set with c elements, how many elements are in the power set of C? Explain your answer.
answered
Apr 14
in
Theory of Computation

32
views
michaelsipser
theoryofcomputation
sets
easy
1
answer
20
Michael Sipser Edition 3 Exercise 0 Question 13 (Page No. 27)
Show that every graph with two or more nodes contains two nodes that have equal degrees.
answered
Apr 14
in
Theory of Computation

25
views
michaelsipser
theoryofcomputation
graph
proof
2
answers
21
self doubt
What advantage does top down approch have over bottom up approach in case of dynamic programming??
commented
Mar 27
in
Algorithms

180
views
dynamicprogramming
0
answers
22
#SelfDoubt #AsymptoticNotation
Is it true? $an^{2} = O(n^{2})$ for a>0 Also, what is the difference between Smalloh and Bigoh? Also, why we consider theta, omega as Bigoh sometimes, in the above problem, the answer is Bigtheta but it is equal to bigoh. Why is it so?
commented
Mar 22
in
Algorithms

25
views
asymptoticnotations
1
answer
23
MOCK TEST
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 answer given is a)
answered
Mar 22
in
Algorithms

22
views
4
answers
24
GATE2018 ME2: GA9
A house has a number which need to be identified. The following three statements are given that can help in identifying the house number? If the house number is a multiple of $3$, then it is a number from $50$ to $59$. If the house number is NOT a multiple of $4$, then it ... a multiple of $6$, then it is a number from $70$ to $79$. What is the house number? $54$ $65$ $66$ $76$
answer selected
Dec 20, 2018
in
Numerical Ability

186
views
gate2018me2
generalaptitude
numericalability
numericalcomputation
0
answers
25
MadeEasy Subject Test 2019: Operating System  Translation Lookaside Buffer
A TLB is a hardware device used for speeding up the conversation from virtual address to physical address. Consider a memory management unit where a memory reference takes 500 nanoseconds; TLB (Translation Look aside Buffer) reference ... EMAT using TLB ==> 640ns EMAT wthout TLB ==> 1000ns how to calculate speed Up.?
commented
Dec 13, 2018
in
Operating System

78
views
madeeasytestseries
operatingsystem
tlb
1
answer
26
Self Doubt
If L is CFL then $\bar{L}$ is Recursive. ( True/False) If L is CFL then $\bar{L}$ is RE. (True/Flase).
commented
Dec 13, 2018
in
Theory of Computation

42
views
theoryofcomputation
decidability
0
answers
27
Operating System ME Test Series
Is solution given correct Can please someone verify and explain?
commented
Dec 12, 2018
in
Operating System

39
views
0
answers
28
conceptual doubt
in case of hierarchical memory organization when there is a miss in cache , we need to bring the entire block from main memory to cache so in the formula AMAT= H1*T1+(1H1(T1+T2)) T1 cache access time/word T2= memory access time/word T2 ... in some cases we just take word access time of main memory. also please tell me what should be T2 in case of simultaneous organization?
commented
Dec 12, 2018
in
CO and Architecture

55
views
computerarchitecture
cachememory
effectivememoryaccess
multilevelcache
coandarchitecture
2
answers
29
#discrete matmatics
recurrence relation 2a$_{n}=a_{n1}+2^{n}$ intial condtion a$_{0}$=1 value of a$_{100}$
edited
Dec 12, 2018
in
Combinatory

64
views
recurrence
0
answers
30
Cache indexing
What is the meaning of cache indexing?
commented
Dec 12, 2018
in
CO and Architecture

34
views
0
answers
31
MadeeasyTestseries
consider a RISC processor with an ideal CPI ,where 25% of total instructions are Load and Store instruction.Time to accessing main memory is 100 clock cycles and accessing of the cache memory required 2 clock cycles .if cache miss rate is 2% , then the effective CPI for the system with the cache is __.{upto 2 decimal}.
commented
Dec 12, 2018
in
CO and Architecture

228
views
0
answers
32
Decidability
Match the following 1.P 2.NP 3.NPComplete 4. NPHard 1.Decidable 2.Undecidable
commented
Dec 12, 2018
in
Theory of Computation

60
views
theoryofcomputation
0
answers
33
Self Doubt
Plese explain me this series
commented
Dec 11, 2018
in
Calculus

48
views
1
answer
34
Doubt : ACE OTS 1
Prove S1 without using venn diagram ( using boolean algebra )
answer selected
Dec 11, 2018
in
Set Theory & Algebra

42
views
0
answers
35
RISC processor doubt
is the CPI of RISC processor always 1?
commented
Dec 10, 2018
in
CO and Architecture

192
views
coandarchitecture
machineinstructions
microprogramming
0
answers
36
Quantifiers
Translate into the predicate logic One has to drink water in order to survive D(x) = x drinks water S(x) = x survives
commented
Dec 9, 2018
in
Mathematical Logic

79
views
mathematicallogic
discretemathematics
propositionallogic
2
answers
37
TIFR2019A13
Consider the integral $\int^{1}_{0} \frac{x^{300}}{1+x^2+x^3} dx$ What is the value of this integral correct up to two decimal places? $0.00$ $0.02$ $0.10$ $0.33$ $1.00$
commented
Dec 9, 2018
in
Calculus

326
views
tifr2019
engineeringmathematics
calculus
integration
0
answers
38
Testbook Test Series: General Aptitude: Numerical Aptitude
On a grid of 6*5 ,how many ways exist to get from TopLeft corner to the BottomRight corner if You can only move one unit Right or One unit Down at a time.
commented
Dec 8, 2018
in
Numerical Ability

52
views
testbooktestseries
generalaptitude
numericalability
3
answers
39
Gateforum Test Series: Algorithms  Asymptotic Notations
Which of the following is not true in the function $f(n)=2^{n4}$? $f(n)$=Θ($2^{n+3}$) $f(n)$=Ω($n^{1000}$) $f(n)$=Ο($2^{n10}$) $f(n)$=$None$
answered
Dec 7, 2018
in
Algorithms

129
views
gateforumtestseries
algorithms
asymptoticnotations
0
answers
40
Decidability
Consider the following two decision problems A. Whether a Turing machine takes more than 481 steps on input $\epsilon$ ? B. Whether a Turing machine accepts the null string $\epsilon$? Which of the following statements is true? (A) Problem A is decidable but B is not (B) Problem A is undecidable but B is decidable (C) Both A and B are decidable (D) Both A and B are undecidable
commented
Dec 7, 2018
in
Theory of Computation

38
views
50,644
questions
56,539
answers
195,659
comments
101,440
users