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 prateekdwv
User prateekdwv
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User prateekdwv
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
5
answers
1
GATE201831
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the product of $n$ matrices $G_1G_2G_3 \dots G_n$ can be done by parenthesizing in different ... , the explicitly computed pairs is/are $F_1F_2$ and $F_3F_4$ only $F_2F_3$ only $F_3F_4$ only $F_1F_2$ and $F_4F_5$ only
commented
Feb 14, 2018
in
Algorithms

5.3k
views
gate2018
algorithms
dynamicprogramming
7
answers
2
GATE20184
Let $\oplus$ and $\odot$ denote the Exclusive OR and Exclusive NOR operations, respectively. Which one of the following is NOT CORRECT? $\overline{P \oplus Q} = P \odot Q$ $\overline{P} \oplus Q = P \odot Q$ $\overline{P} \oplus \overline{Q} = P \oplus Q$ $P \oplus \overline{P} \oplus Q = ( P \odot \overline{P} \odot \overline{Q})$
answered
Feb 14, 2018
in
Digital Logic

2.3k
views
gate2018
digitallogic
normal
booleanalgebra
1
answer
3
solve by generating function along with approach thanks advance
In how many ways 2 alike apple, 3 alike orange and 4 alike mango can be given to 3 children if each child can have 1 or more than 1 fruits.
commented
Jan 22, 2018
in
Mathematical Logic

178
views
discretemathematics
generatingfunctions
0
answers
4
4.2Qn 3c
In any boolean algebra show that (a+b')(b+c')(c+a')=(a'+b)(b'+c)(c'+a)
commented
Jan 22, 2018
in
Mathematical Logic

38
views
numericalanswers
0
answers
5
Minimum Spanning tree
Kindly justify with an example
commented
Jan 15, 2018
in
Algorithms

80
views
mst
5
answers
6
GATE20116, UGCNETJune2013III62
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$
commented
Jan 2, 2018
in
Operating System

7.8k
views
gate2011
operatingsystem
contextswitch
easy
ugcnetjune2013iii
4
answers
7
GATE201051
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... possible weight of a path $P$ from vertex $1$ to vertex $2$ in this graph such that $P$ contains at most $3$ edges? $7$ $8$ $9$ $10$
edited
Jan 2, 2018
in
Algorithms

4k
views
gate2010
normal
algorithms
spanningtree
5
answers
8
GATE201050
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... is the minimum possible weight of a spanning tree $T$ in this graph such that vertex 0 is a leaf node in the tree $T$? $7$ $8$ $9$ $10$
edited
Jan 2, 2018
in
Algorithms

5.6k
views
gate2010
algorithms
spanningtree
normal
2
answers
9
GATE201062
Hari(H), Gita(G), Irfan(I) and Saira(S) are siblings (i.e., brothers and sisters). All were born on 1st January. The age difference between any two successive siblings (that is born one after another) is less than three years. Given the following facts: Hari's age ... Saira is not the youngest. There are no twins. In what order they were born (oldest first)? $HSIG$ $SGHI$ $IGSH$ $IHSG$
answer selected
Jan 1, 2018
in
Numerical Ability

3.7k
views
gate2010
numericalability
logicalreasoning
normal
0
answers
10
waiting time
Frames of 1000 bits are sent over a 106 duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let I be the minimum number of bits (I) that will be ... packets again(full duplex)...so fully transit the link by 51 packets right ? why asssuming only for one way propogation as 25 frames
commented
Dec 16, 2017
in
Computer Networks

95
views
0
answers
11
Find the element that appears once in a sorted array.
In a sorted array, every element is repeated more than once except one. what will be the time complexity to find that element in the worst case?
commented
Dec 13, 2017
in
Algorithms

236
views
algorithms
sorting
8
answers
12
TIFR2018B1
What is the remainder when $4444^{4444}$ is divided by $9?$ $1$ $2$ $5$ $7$ $8$
answer edited
Dec 11, 2017
in
Combinatory

575
views
tifr2018
modulararithmetic
permutationandcombination
3
answers
13
TIFR2018A11
We are given a (possibly empty) set of objects. Each object in the set is colored either black or white, is shaped either circular or rectangular, and has a profile that is either fat or thin, Those properties obey the following principles: Each white object is also circular ... $(i) \text{ and } (iii)$ only None of the statements must be TRUE All of the statements must be TRUE
edited
Dec 11, 2017
in
Numerical Ability

341
views
tifr2018
numericalability
logicalreasoning
4
answers
14
TIFR2017A15
Let $T(a, b)$ be the function with two arguments (both nonnegative integral powers of 2) defined by the following reccurence: $ T(a, b) = T \biggl( \frac{a}{2}, b \biggl) +T\biggl( a, \frac{b}{2} \biggl) \quad \quad \text{ if } a, b \geq 2$ ... $\begin{pmatrix} r+s \\ r \end{pmatrix}$ $2^{rs}$ if $r \geq s$, otherwise $2^{sr}$
answered
Dec 9, 2017
in
Algorithms

554
views
tifr2017
algorithms
recurrence
3
answers
15
TIFR2017B11
Given that $B(x)$ means "$x$ is a bat", $F(x)$ means "$x$ is a fly", and $E(x, y)$ means "x eats $y$", what is the best English translation of $ \forall x(F(x) \rightarrow \forall y (E(y, x) \rightarrow B(y)))?$ all flies eat bats every fly is eaten by some bat bats eat only flies every bat eats flies only bats eat flies
commented
Dec 7, 2017
in
Mathematical Logic

994
views
tifr2017
firstorderlogic
2
answers
16
TIFR2010B24
Consider the following program operating on four variables $u, v, x, y$, and two constants $X$ and $Y$. x, y, u, v:= X, Y, Y, X; While (x ≠ y) do if (x > y) then x, v := x  y, v + u; else if (y > x) then y, u:= y  x, u + v; od; ... $\frac1 2 \times \text{gcd}(X, Y)$ followed by $\frac1 2 \times \text{lcm}(X, Y)$. The program does none of the above.
answered
Dec 6, 2017
in
Algorithms

520
views
tifr2010
algorithms
identifyfunction
0
answers
17
Timothy Williams  Programming Output
static char hello[]='hello'; printf("%s",hello); The output will be same as puts("hello"); puts(hello); printf("%s", "hello"); puts("hello\n"); Answer is 1,2 and 3. Can anyone tell what's the problem with 4 option? It is also printing hello.
commented
Dec 4, 2017
in
Programming

95
views
programminginc
output
5
answers
18
GATE2008IT75
Student (schoolid, schrollno, sname, saddress) School (schoolid, schname, schaddress, schphone) Enrolment(schoolid schrollno, erollno, examname) ExamResult(erollno, examname, marks) Consider the following tuple relational calculus query. { ... other schools with a pass percentage above 35% over all exams taken together schools with a pass percentage above 35% over each exam
commented
Dec 2, 2017
in
Databases

4.5k
views
gate2008it
databases
relationalcalculus
normal
2
answers
19
Log formula related doubt.
Confusion regarding these log representations. 1.(logn)2 2.log2n 3.log(logn) 4.log(n)2 which of these are equal . Also explain meaning of each one.(Pls provide any source if possible).
answered
Dec 1, 2017
in
Algorithms

106
views
algorithms
timecomplexity
0
answers
20
Regular
Is this regular L={w  w $\varepsilon$ (0,1)* w is of the form (0i1)n for i=1,2,3...n ,n>=0} ?
commented
Dec 1, 2017
in
Theory of Computation

81
views
theoryofcomputation
regularlanguages
1
answer
21
Non deterministic finite
answered
Nov 29, 2017
in
Theory of Computation

56
views
3
answers
22
Self doubt in decidability in TOC
Suppose in question we are given the language is Turing Decidable , can I consider it a CFL or Regular?
commented
Nov 29, 2017
in
Theory of Computation

138
views
theoryofcomputation
regularlanguages
decidability
turingmachine
0
answers
23
Context Free Language
Which of the following is not context free? $I) L_{1}=\left \{ a^{i}b^{j}c^{k} i,j,k\geq 0,i<j<k \right \}$ $I) L_{2}=\left \{ a^{i}b^{j}c^{k} i,j,k\geq 0, j=max\left ( i,k \right )\right \}$
commented
Nov 28, 2017
in
Theory of Computation

74
views
contextfreelanguages
theoryofcomputation
1
answer
24
cache
A cache has hit ration 0.95, 64 byte lines , having cache hit latency of 5ns. The main memory takes 90ns to return the first word(16 bits) of a line and 10ns to return each subsequent word . The time needed when cache miss happens is _____(nsec) (Assume ... time to write line into cache once it has been fetched from main memory and to detect cache miss time needed same as cache hit time)
commented
Nov 28, 2017
in
CO and Architecture

200
views
0
answers
25
DBMS SELF DOUBT
Let R and S be two relations with the following schema R(P−−,Q−−,R1,R2,R3) S(P−−,Q−−,S1,S2) where {P,Q} is the key for both schemas? R:{⟨"1","abc","p1","p2","p3"⟩, ⟨"2","xyz", ... ;,"q3"⟩ ⟨"2","def","q1","q2","q3"⟩ WHat is R *S? WHERE * IS NATURAL JOIN.
commented
Nov 28, 2017
in
Databases

127
views
joins
databases
naturaljoin
3
answers
26
GATE200868
Let R and S be two relations with the following schema $R(\underline{P,Q}, R1, R2, R3)$ $S(\underline{P,Q}, S1, S2)$ where $\left\{P, Q\right\}$ is the key for both schemas. Which of the following queries are equivalent? $\Pi_P \left(R \bowtie S\right)$ ... Only I and II Only I and III Only I, II and III Only I, III and IV
commented
Nov 27, 2017
in
Databases

5.2k
views
gate2008
databases
relationalalgebra
normal
2
answers
27
ISRO200839
Consider the following Assembly language program MVIA 30 H ACI 30 H XRA A POP H After the execution of the above program, the contents of the accumulator will be 30 H 60 H 00 H contents of stack
commented
Nov 26, 2017
in
CO and Architecture

2k
views
isro2008
8085
nongate
3
answers
28
TIFR2011B39
The first $n$ cells of an array $L$ contain positive integers sorted in decreasing order, and the remaining $m  n$ cells all contain 0. Then, given an integer $x$, in how many comparisons can one find the position of $x$ in $L$? At least $n$ comparisons are necessary ... $O (\log (m  n))$ comparisons suffice. $O (\log n)$ comparisons suffice. $O (\log (m / n))$ comparisons suffice.
commented
Nov 25, 2017
in
Algorithms

866
views
tifr2011
algorithms
sorting
2
answers
29
ISRO200812
In the given network of AND and OR gates $f$ can be written as $X_0X_1X_2 \dots X_n + X_1X_2 \dots X_n + X_2X_3 \dots X_n + \dots + X_n$ $X_0X_1 + X_2X_3+ \dots X_{n1}X_n$ $X_0+X_1 + X_2+ \dots +X_n $ $X_0X_1 + X_3 \dots X_{n1}+ X_2X_3 + X_5 \dots X_{n1} + \dots +X_{n2} X_{n1} +X_n$
answer edited
Nov 25, 2017
in
Digital Logic

2.2k
views
isro2008
digitallogic
circuitoutput
2
answers
30
ISRO200811
The Boolean theorem $AB+\bar{A}C +BC = AB + \bar{A}C$ corresponds to $(A+B) \bullet (\bar{A} +C) \bullet (B+C) = (A+B) \bullet (\bar{A} +C)$ $AB+\bar{A}C +BC =AB+BC$ $AB+\bar{A}C +BC =(A+B) \bullet (\bar{A} +C) \bullet (B+C)$ $(A+B) \bullet (\bar{A} +C) \bullet (B+C) = AB + \bar{A}C$
answer edited
Nov 25, 2017
in
Digital Logic

2.5k
views
isro2008
digitallogic
booleanalgebra
1
answer
31
Token bucket
commented
Nov 21, 2017
in
Computer Networks

212
views
tokenbucket
computernetworks
2
answers
32
Output problem
answer edited
Nov 20, 2017
in
Programming

56
views
2
answers
33
quick sort
comment edited
Nov 7, 2017
in
Algorithms

104
views
1
answer
34
#programming
#include<stdio.h> main() { int i=511; char *ptr=(char *)&i; printf("%d",*ptr); } explain...how output came 1????
commented
Sep 25, 2017
in
Programming

84
views
1
answer
35
LAnguage
L = { a^m b^n b^k d^l (n+k)=odd only if m=l; m, n, k , l>0}. Which is true? a)CFL but not DCFL b)regular but not CFL c)DCFL but not regular d)none
commented
Sep 19, 2017
in
Theory of Computation

71
views
0
answers
36
asymptotic notation
T(n) = 2T( n / root(2)) + n T(1) = O(1) when i solve this i get theta ( n ^ log 2 base root(2)) using masters theorem after this how do i slove
commented
Sep 18, 2017
in
Algorithms

78
views
2
answers
37
PROGRAMMING
answered
Sep 18, 2017
in
Programming

109
views
programminginc
output
0
answers
38
Propositional and First Order Logic GATECS2006
In the question whether this statement is a tautology ((A ∨ B) → C)) ≡ ((A → C) ∨ (B → C)) , If I take first part ((A ∨ B) → C)) as P and second part ((A → C) ∨ (B → C)) as Q , do I need to prove P>Q is true? or both P>Q and Q>P as true? I am confused about the ≡ symbol.
commented
Sep 18, 2017
in
Mathematical Logic

537
views
discretemathematics
firstorderlogic
mathematicallogic
propositionallogic
0
answers
39
equality of two language
Equality problem for language L1 and L2, L1 =L2 or L1 ≠ L2 For which of the following class language equality problem is decidable a. Regular b. CFL c. CSL d. REC e. RE
commented
Sep 16, 2017
in
Theory of Computation

226
views
theoryofcomputation
0
answers
40
does it matters
Consider the following languages L1={<M>∣M is a single tape TM that on any input x does not change the input portion of the tape} L2={<M>∣M is a single tape TM that on any input x does not change any portion of the tape} Which of the following ... is undecidable B.) L1 is undecidable but L2 is decidable C.) Both L1 and L2 are decidable D.) Both L1 and L2 are undecidable
commented
Sep 13, 2017
in
Theory of Computation

188
views
50,737
questions
57,324
answers
198,415
comments
105,178
users