Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Pascua
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Pascua
5
answers
1
GATE CSE 2021 Set 1 | Question: 24
Consider the following representation of a number in $\text{IEEE 754}$ single-precision floating point format with a bias of $127$.$S: 1\quad\quad E:\; 10000001\quad\quad F:\;11110000000000000000000$ Here $S, \;E$ and ... the floating point representation. The decimal value corresponding to the above representation (rounded to $2$ decimal places) is ____________.
answer edited
in
Digital Logic
Jun 23, 2021
4.6k
views
gatecse-2021-set1
digital-logic
number-representation
ieee-representation
numerical-answers
1-mark
10
answers
2
GATE CSE 2006 | Question: 48
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$ ... exist a cycle in $G$ containing $u$ and $ν$ There must exist a cycle in $G$ containing $u$ and all its neighbours in $G$
commented
in
Algorithms
May 9, 2021
16.4k
views
gatecse-2006
algorithms
graph-algorithms
normal
4
answers
3
GATE CSE 2001 | Question: 2.4
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day? $\dfrac{1}{7^7}\\$ $\dfrac{1}{7^6}\\$ $\dfrac{1}{2^7}\\$ $\dfrac{7}{2^7}\\$
comment edited
in
Probability
Apr 29, 2021
11.0k
views
gatecse-2001
probability
normal
4
answers
4
GATE CSE 2017 Set 2 | Question: 26
$P$ and $Q$ are considering to apply for a job. The probability that $P$ applies for the job is $\dfrac{1}{4},$ the probability that $P$ applies for the job given that $Q$ applies for the job is $\dfrac{1}{2},$ and the probability that $Q$ applies for the ... $\left(\dfrac{5}{6}\right)$ $\left(\dfrac{7}{8}\right)$ $\left(\dfrac{11}{12}\right)$
commented
in
Probability
Apr 29, 2021
9.1k
views
gatecse-2017-set2
probability
conditional-probability
4
answers
5
GATE CSE 2007 | Question: 25
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $I$ is the $4 \times 4$ identity matrix? $-5$ $-7$ $2$ $1$
commented
in
Linear Algebra
Apr 24, 2021
11.9k
views
gatecse-2007
eigen-value
linear-algebra
difficult
4
answers
6
GATE CSE 1991 | Question: 02-iv
Match the pairs in the following questions by writing the corresponding letters only. ...
commented
in
Combinatory
Apr 21, 2021
3.6k
views
gate1991
combinatory
normal
match-the-following
7
answers
7
GATE IT 2007 | Question: 80
Let $P_{1},P_{2},\ldots,P_{n}$ be $n$ points in the $xy-$plane such that no three of them are collinear. For every pair of points $P_{i}$ and $P_{j}$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ be the line ... or the smallest $y$-coordinate among all the points The difference between $x$-coordinates $P_{a}$ and $P_{b}$ is minimum None of the above
commented
in
Linear Algebra
Mar 13, 2021
3.4k
views
gateit-2007
cartesian-coordinates
2
answers
8
TIFR CSE 2019 | Part B | Question: 15
Consider directed graphs on $n$ labelled vertices $\{1,2, \dots ,n\}$, where each vertex has exactly one edge coming in and exactly one edge going out. We allow self-loops. How many graphs have exactly two cycles ? $\displaystyle \sum_{k=1}^{n-1} k!(n-k)!$ ... $n!\bigg[\displaystyle \sum_{k=1}^{n-1} \frac{1}{k}\bigg]$ $\frac{n!(n-1)}{2}$ None of the above
commented
in
Graph Theory
Mar 11, 2021
1.5k
views
tifr2019
graph-connectivity
graph-theory
3
answers
9
GATE IT 2008 | Question: 5
Which of the following regular expressions describes the language over$\{0, 1\}$ consisting of strings that contain exactly two $1$'s? $(0 + 1)^ * \ 11(0 + 1) ^*$ $0 ^* \ 110 ^*$ $0 ^* 10 ^* 10 ^*$ $(0 + 1) ^* 1(0 + 1) ^* 1 (0 + 1) ^*$
commented
in
Theory of Computation
Feb 15, 2021
6.8k
views
gateit-2008
theory-of-computation
regular-expression
easy
3
answers
10
GATE CSE 1999 | Question: 1.5
Context-free languages are closed under: Union, intersection Union, Kleene closure Intersection, complement Complement, Kleene closure
commented
in
Theory of Computation
Feb 4, 2021
6.1k
views
gate1999
theory-of-computation
context-free-language
easy
4
answers
11
GATE CSE 1992 | Question: 02,xviii
If $G$ is a context free grammar and $w$ is a string of length $l$ in $L(G)$, how long is a derivation of $w$ in $G$, if $G$ is in Chomsky normal form? $2l$ $2l +1$ $2l -1$ $l$
commented
in
Theory of Computation
Feb 4, 2021
12.2k
views
gate1992
theory-of-computation
context-free-language
easy
multiple-selects
4
answers
12
GATE CSE 2004 | Question: 40
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ will be the slowest? $\text{union}$ only $\text{intersection, membership}$ $\text{membership, cardinality}$ $\text{union, intersection}$
comment edited
in
DS
Jan 26, 2021
15.0k
views
gatecse-2004
data-structures
linked-list
normal
6
answers
13
GATE CSE 2017 Set 2 | Question: 31
For any discrete random variable $X$, with probability mass function $P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomial function $g_x(z) = \Sigma_{j=0}^N \: p_j \: z^j$. For a certain ... . The expectation of $Y$ is $N \beta(1-\beta)$ $N \beta$ $N (1-\beta)$ Not expressible in terms of $N$ and $\beta$ alone
commented
in
Probability
Jan 23, 2021
12.3k
views
gatecse-2017-set2
probability
random-variable
difficult
6
answers
14
TIFR CSE 2012 | Part A | Question: 17
A spider is at the bottom of a cliff, and is $n$ inches from the top. Every step it takes brings it one inch closer to the top with probability $1/3$, and one inch away from the top with probability $2/3$, unless it is at the bottom in which ... $n$? It will never reach the top. Linear in $n$. Polynomial in $n$. Exponential in $n$. Double exponential in $n$.
commented
in
Probability
Jan 22, 2021
1.7k
views
tifr2012
probability
binomial-distribution
5
answers
15
GATE CSE 1995 | Question: 1.16
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$
commented
in
Algorithms
Jan 5, 2021
40.7k
views
gate1995
algorithms
sorting
normal
2
answers
16
GATE CSE 1990 | Question: 12b
Consider the following problem. Given $n$ positive integers $a_{1}, a_{2}\dots a_n,$ it is required to partition them in to two parts $A$ and $B$ ... that part whose sum in smaller at that step. Give an example with $n=5$ for which the solution produced by the greedy algorithm is not optimal.
commented
in
Algorithms
Dec 27, 2020
1.7k
views
gate1990
descriptive
algorithms
algorithm-design-techniques
8
answers
17
GATE CSE 2006 | Question: 49
An implementation of a queue $Q$, using two stacks $S1$ and $S2$, is given below: void insert (Q, x) { push (S1, x); } void delete (Q) { if (stack-empty(S2)) then if (stack-empty(S1)) then { print( Q is empty ); return; } else while (!(stack-empty(S1))){ x=pop ... and $2m\leq y\leq 2n $ $ 2m\leq x<2n $ and $2m\leq y\leq n+m $ $ 2m\leq x<2n $ and $2m\leq y\leq 2n $
commented
in
DS
Dec 22, 2020
26.4k
views
gatecse-2006
data-structures
queue
stack
normal
2
answers
18
GATE CSE 2001 | Question: 1.15
Consider any array representation of an $n$ element binary heap where the elements are stored from index $1$ to index $n$ of the array. For the element stored at index $i$ of the array $(i \leq n)$, the index of the parent is $i-1$ $\lfloor \frac{i}{2} \rfloor$ $\lceil \frac{i}{2} \rceil$ $\frac{(i+1)}{2}$
commented
in
DS
Dec 21, 2020
3.8k
views
gatecse-2001
data-structures
heap
easy
3
answers
19
GATE CSE 1991 | Question: 14,a
Consider the binary tree in the figure below: What structure is represented by the binary tree?
commented
in
DS
Dec 20, 2020
3.1k
views
gate1991
data-structures
binary-tree
time-complexity
normal
descriptive
6
answers
20
GATE CSE 2008 | Question: 42
$G$ is a graph on $n$ vertices and $2n-2$ edges. The edges of $G$ can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for $G$? For every subset of $k$ vertices, the induced subgraph has at ... least $2$ edge-disjoint paths between every pair of vertices. There are at least $2$ vertex-disjoint paths between every pair of vertices.
comment edited
in
Graph Theory
Dec 19, 2020
18.5k
views
gatecse-2008
graph-connectivity
normal
4
answers
21
GATE IT 2004 | Question: 8
What is the minimum number of $\text{NAND}$ gates required to implement a $2\text{-input EXCLUSIVE-OR}$ function without using any other logic gate? $2$ $4$ $5$ $6$
commented
in
Digital Logic
Dec 7, 2020
9.6k
views
gateit-2004
digital-logic
min-no-gates
normal
5
answers
22
GATE CSE 2011 | Question: 21
Consider a hypothetical processor with an instruction of type $\text{LW R1, 20(R2)}$, which during execution reads a $32\text{-bit}$ word from memory and stores it in a $32\text{-bit}$ ... mode implemented by this instruction for the operand in memory? Immediate addressing Register addressing Register Indirect Scaled Addressing Base Indexed Addressing
commented
in
CO and Architecture
Nov 12, 2020
14.0k
views
gatecse-2011
co-and-architecture
addressing-modes
easy
1
answer
23
GATE CSE 1999 | Question: 4
Let $G$ be a finite group and $H$ be a subgroup of $G$. For $a \in G$, define $aH=\left\{ah \mid h \in H\right\}$. Show that $|aH| = |bH|.$ Show that for every pair of elements $a, b \in G$, either $aH = bH$ or $aH$ and $bH$ are disjoint. Use the above to argue that the order of $H$ must divide the order of $G.$
commented
in
Set Theory & Algebra
Oct 5, 2020
2.1k
views
gate1999
set-theory&algebra
group-theory
descriptive
proof
4
answers
24
GATE CSE 1993 | Question: 17
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
commented
in
Set Theory & Algebra
Sep 29, 2020
5.7k
views
gate1993
set-theory&algebra
easy
set-theory
descriptive
2
answers
25
GATE CSE 2003 | Question: 7
Consider the set $\Sigma^*$ of all strings over the alphabet $\Sigma = \{0, 1\}$. $\Sigma^*$ with the concatenation operator for strings does not form a group forms a non-commutative group does not have a right identity element forms a group if the empty string is removed from $\Sigma^*$
commented
in
Set Theory & Algebra
Sep 26, 2020
6.5k
views
gatecse-2003
set-theory&algebra
group-theory
normal
2
answers
26
GATE2017 ME-1: GA-9
Two very famous sportsmen Mark and Steve happened to be brothers and played for country $K$. Mark teased James, an opponent from country $E$, "There is no way you are good enough to play for your country." James replied, "Maybe not, ... better than James. Steve was known to play better than Mark. James and Steve were good friends. James played better than Steve.
commented
in
Verbal Aptitude
Sep 12, 2020
824
views
gate2017-me-1
general-aptitude
verbal-aptitude
verbal-reasoning
6
answers
27
GATE2016 CE-2: GA-10
Ananth takes $6$ hours and Bharath takes $4$ hours to read a book. Both started reading copies of the book at the same time. After how many hours is the number of pages to be read by Ananth, twice that to be read by Bharath? Assume Ananth and Bharath read all the pages with constant pace. $1$ $2$ $3$ $4$
answered
in
Quantitative Aptitude
Sep 9, 2020
7.3k
views
gate2016-ce-2
work-time
quantitative-aptitude
5
answers
28
TIFR CSE 2019 | Part A | Question: 11
Suppose there are $n$ guests at a party (and no hosts). As the night progresses, the guests meet each other and shake hands. The same pair of guests might shake hands multiple times. for some parties stretch late into the night , and it is hard to keep track.Still, ... $2 \mid \text{Odd} \mid - \mid \text{Even} \mid$
answered
in
Analytical Aptitude
Sep 3, 2020
1.2k
views
tifr2019
general-aptitude
analytical-aptitude
logical-reasoning
7
answers
29
GATE CSE 2005 | Question: 61
Consider line number $3$ of the following C-program. int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ } Identify the compiler’s response about this line while creating the object-module: No compilation error Only a lexical error Only syntactic errors Both lexical and syntactic errors
commented
in
Compiler Design
Aug 13, 2020
16.1k
views
gatecse-2005
compiler-design
compilation-phases
normal
5
answers
30
GATE CSE 1998 | Question: 3b
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s ($k$ is a fixed integer)
commented
in
Theory of Computation
May 3, 2020
6.5k
views
gate1998
theory-of-computation
regular-expression
easy
descriptive
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....