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 Abhineet Singh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Abhineet Singh
7
answers
1
GATE CSE 2010 | Question: 50
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 spanning tree $T$ in this graph such that vertex $0$ is a leaf node in the tree $T$? $7$ $8$ $9$ $10$
commented
in
Algorithms
Feb 9, 2021
18.3k
views
gatecse-2010
algorithms
spanning-tree
normal
1
answer
2
GATE CSE 2011 | Question: 44
An application loads $100$ libraries at startup. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as $10$ ms. Rotational speed of disk is $6000$ rpm. If all $100$ libraries are loaded from random locations on the disk, how ... start of the block may be neglected.) $0.50 \ s$ $1.50 \ s$ $1.25 \ s$ $1.00 \ s$
commented
in
Operating System
Jan 12, 2021
10.7k
views
gatecse-2011
operating-system
disk
normal
7
answers
3
GATE CSE 2014 Set 3 | Question: 43
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback (WB) with stage latencies $1$ ns, $2.2 $ ns, $2$ ... program on the old and the new design are $P$ and $Q$ nanoseconds, respectively. The value of $P/Q$ is __________.
commented
in
CO and Architecture
Jan 12, 2021
17.7k
views
gatecse-2014-set3
co-and-architecture
pipelining
numerical-answers
normal
4
answers
4
GATE CSE 2014 Set 2 | Question: 43
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block size ... size implies a larger cache tag and hence lower cache hit time A smaller block size incurs a lower cache miss penalty
commented
in
CO and Architecture
Jan 12, 2021
16.6k
views
gatecse-2014-set2
co-and-architecture
cache-memory
normal
6
answers
5
GATE CSE 2017 Set 2 | Question: 29
In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory is $18$ clock cycles. The miss rate of $L_1$ cache is twice that of $L_2$. The average ... respectively are $0.111$ and $0.056$ $0.056$ and $0.111$ $0.0892$ and $0.1784$ $0.1784$ and $0.0892$
commented
in
CO and Architecture
Jan 12, 2021
23.1k
views
gatecse-2017-set2
cache-memory
co-and-architecture
normal
3
answers
6
GATE CSE 2005 | Question: 62
Consider the following circuit involving a positive edge triggered D FF. Consider the following timing diagram. Let $A_{i}$ represents the logic level on the line $A$ in the $i$-th clock period. Let $A'$ represent the complement of $A$. The correct output sequence on $Y$ ... $A_{1} A_{2} A_{2}' A_{3} A_{4}$ $A_{1} A_{2}' A_{3} A_{4} A_{5}'$
commented
in
Digital Logic
Jan 10, 2021
14.2k
views
gatecse-2005
digital-logic
circuit-output
normal
7
answers
7
GATE IT 2004 | Question: 84
Consider a parity check code with three data bits and four parity check bits. Three of the Code Words are $0101011, 1001101$ and $1110001.$ Which of the following are also code words? $0010111$ $0110110$ $1011010$ $0111010$ I and III I, II and III II and IV I, II, III and IV
commented
in
Computer Networks
Jan 10, 2021
15.0k
views
gateit-2004
computer-networks
network-security
normal
out-of-gate-syllabus
1
answer
8
GATE CSE 1998 | Question: 1.3
Which of the following statements applies to the bisection method used for finding roots of functions: converges within a few iterations guaranteed to work for all continuous functions is faster than the Newton-Raphson method requires that there be no error in determining the sign of the function
commented
in
Numerical Methods
Jan 5, 2021
18.4k
views
gate1998
numerical-methods
bisection-method
easy
out-of-gate-syllabus
4
answers
9
GATE CSE 1996 | Question: 1.7
Let $Ax = b$ be a system of linear equations where $A$ is an $m \times n$ matrix and $b$ is a $m \times 1$ column vector and $X$ is an $n \times1$ column vector of unknowns. Which of the following is false? The system has a solution if and ... a unique solution. The system will have only a trivial solution when $m=n$, $b$ is the zero vector and $\text{rank}(A) =n$.
commented
in
Linear Algebra
Jan 5, 2021
18.0k
views
gate1996
linear-algebra
system-of-equations
normal
0
answers
10
made easy adv mock
the number of ways in which we can place 3 white pawns and 3 black pawns on a 3*3 chessboard my answer was 12. approach :- we cant have any 2 black pawns or 2 white pawns in the same row or column {3*2*1} * {2*1 * 1} am i correct??
commented
in
Combinatory
Jan 5, 2021
437
views
3
answers
11
GATE CSE 1995 | Question: 2.19
If the proposition $\lnot p \to q$ is true, then the truth value of the proposition $\lnot p \lor \left ( p \to q \right )$, where $\lnot$ is negation, $\lor$ is inclusive OR and $\to$ is implication, is True Multiple Values False Cannot be determined
commented
in
Mathematical Logic
Jan 5, 2021
6.8k
views
gate1995
mathematical-logic
normal
propositional-logic
2
answers
12
GATE CSE 1994 | Question: 1.2
Let $A$ and $B$ be real symmetric matrices of size $n \times n$. Then which one of the following is true? $AA'=I$ $A=A^{-1}$ $AB=BA$ $(AB)'=BA$
commented
in
Linear Algebra
Jan 5, 2021
6.3k
views
gate1994
linear-algebra
normal
matrix
12
answers
13
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
commented
in
Graph Theory
Jan 5, 2021
28.3k
views
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
0
answers
14
ME ADVANCE TEST
The number of ways in which we can place 3 white pawns and 3 black pawns on a 3 × 3 Chessboard is equal to
commented
in
Combinatory
Jan 4, 2021
403
views
1
answer
15
GATE CSE 1993 | Question: 01.7
The function $f\left(x,y\right) = x^2y - 3xy + 2y +x$ has no local extremum one local minimum but no local maximum one local maximum but no local minimum one local minimum and one local maximum
commented
in
Calculus
Jan 2, 2021
2.3k
views
gate1993
calculus
maxima-minima
normal
out-of-gate-syllabus
multiple-selects
4
answers
16
GATE CSE 1989 | Question: 3-vi
Which of the following graphs is/are planner?
commented
in
Graph Theory
Jan 1, 2021
6.2k
views
gate1989
normal
graph-theory
graph-planarity
descriptive
3
answers
17
GATE CSE 2020 | Question: 32
Consider the following languages. $\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \end{array}$ ... context- free but not regular and $L_2$ is context-free. Neither $L_1$ nor $L_2$ is context- free. $L_1$ context- free but $L_2$ is not context-free.
answered
in
Theory of Computation
Dec 15, 2020
12.9k
views
gatecse-2020
theory-of-computation
identify-class-language
2-marks
5
answers
18
GATE CSE 1996 | Question: 2.23
Consider the following state table for a sequential machine. The number of states in the minimized machine will be ... $4$ $3$ $2$ $1$
commented
in
Digital Logic
Dec 14, 2020
10.1k
views
gate1996
normal
finite-automata
7
answers
19
GATE CSE 1992 | Question: 02,xvii
Which of the following regular expression identities is/are TRUE? $r^{(^\ast)} =r^\ast$ $(r^\ast s^\ast)=(r+s)^\ast$ $(r+s)^\ast = r^\ast + s^\ast$ $r^\ast s^\ast = r^\ast+s^\ast$
commented
in
Theory of Computation
Dec 14, 2020
10.8k
views
gate1992
theory-of-computation
regular-expression
easy
multiple-selects
9
answers
20
GATE IT 2004 | Question: 40
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where $K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and $Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsilon), (s, a)), (( s, a, a), (f, \epsilon)), ((f, a, a), (f, \epsilon)), ((f, b, a), (f, \epsilon))\}$. Which one of the following strings is not a member of $L(M)$? $aaa$ $aabab$ $baaba$ $bab$
commented
in
Theory of Computation
Dec 13, 2020
16.2k
views
gateit-2004
theory-of-computation
pushdown-automata
normal
8
answers
21
GATE CSE 2006 | Question: 29
If $s$ is a string over $(0+1)^*$ then let $n_0(s)$ denote the number of $0$'s in $s$ and $n_1(s)$ the number of $1$'s in $s$. Which one of the following languages is not regular? $L=\left \{ s\in (0+1)^* \mid n_{0}(s) \text{ is a 3-digit prime } \right \}$ ... $L=\left \{ s\in (0+1)^*\mid n_{0}(s) \mod 7=n_{1}(s) \mod 5=0 \right \}$
commented
in
Theory of Computation
Dec 13, 2020
15.1k
views
gatecse-2006
theory-of-computation
normal
regular-language
3
answers
22
GATE IT 2007 | Question: 49
Consider the following grammars. Names representing terminals have been specified in capital letters. ... $G_1$ and $G_2$ are regular Both $G_1$ and $G_2$ are context-free but neither of them is regular
commented
in
Theory of Computation
Dec 13, 2020
9.9k
views
gateit-2007
theory-of-computation
context-free-language
normal
2
answers
23
GATE IT 2007 | Question: 48
Consider the grammar given below: $S \rightarrow x \ B \mid y \ A$ $A \rightarrow x \mid x \ S \mid y \ A \ A$ $B \rightarrow y \mid y \ S \mid x \ B \ B$ Consider the following strings. $xxyyx$ $xxyyxy$ $xyxy$ $yxxy$ $yxx$ $xyx$ Which of the above strings are generated by the grammar ? i, ii and iii ii, v and vi ii, iii and iv i, iii and iv
commented
in
Theory of Computation
Dec 13, 2020
6.0k
views
gateit-2007
theory-of-computation
context-free-language
normal
5
answers
24
GATE IT 2008 | Question: 36
Consider the following two finite automata. $M_1$ accepts $L_1$ and $M_2$ accepts $L_2$. $M_1$ $M_2$ Which one of the following is TRUE? $L_1 = L_2$ $L_1 \subset L_2$ $L_1 \cap L_{2}^{C} = \varnothing $ $L_1 \cup L_2 \neq L_1$
commented
in
Theory of Computation
Dec 12, 2020
9.3k
views
gateit-2008
theory-of-computation
finite-automata
normal
10
answers
25
GATE CSE 2010 | Question: 39
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$
commented
in
Theory of Computation
Dec 12, 2020
18.0k
views
gatecse-2010
theory-of-computation
regular-expression
normal
2
answers
26
GATE CSE 2010 | Question: 17
Let $L_1$ be the recursive language. Let $L_2$ and $L_3$ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true? $L_2 - L_1 \:\text{is recursively enumerable.}$ ... $L_2 \cap L_3 \:\text{is recursively enumerable.}$ $L_2 \cup L_3 \:\text{is recursively enumerable.}$
commented
in
Theory of Computation
Dec 12, 2020
13.1k
views
gatecse-2010
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
normal
11
answers
27
GATE CSE 2015 Set 2 | Question: 35
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding non-terminals of a regular grammar. $X_0, X_1, \text{ and } X_2$ are related as follows. $X_0 = 1 X_1$ $X_1 = 0 X_1 + 1 X_2$ ... $10(0^*+(10)^*)1$ $10(0^*+(10)^*)^*1$ $1(0+10)^*1$ $10(0+10)^*1 +110(0+10)^*1$
commented
in
Theory of Computation
Dec 11, 2020
14.9k
views
gatecse-2015-set2
theory-of-computation
regular-grammar
normal
8
answers
28
GATE CSE 2017 Set 1 | Question: 37
Consider the context-free grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are non-terminals. $G_{1}:S\rightarrow aSb \mid T, T \rightarrow cT \mid \epsilon$ ... is Finite Not finite but regular Context-Free but not regular Recursive but not context-free
commented
in
Theory of Computation
Dec 10, 2020
9.9k
views
gatecse-2017-set1
theory-of-computation
context-free-language
identify-class-language
normal
8
answers
29
GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
commented
in
Theory of Computation
Dec 10, 2020
17.5k
views
gatecse-2017-set1
theory-of-computation
context-free-language
normal
6
answers
30
GATE CSE 2020 | Question: 10
Consider the language $L = \{a^{n}\mid n \geq 0\} \cup \{a^{n}b^{n}\mid n \geq 0\}$ and the following statements. $L$ is deterministic context-free. $L$ is context-free but not deterministic context-free. $L$ is not $LL(k)$ for any $k$. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Ⅰ and Ⅲ only Ⅲ only
commented
in
Theory of Computation
Dec 10, 2020
15.5k
views
gatecse-2020
theory-of-computation
identify-class-language
1-mark
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
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
https://byjus.com/maths/diagonalization/
@amit166 can you share the reference of the...
Twist at every point Man
Diagonalization of a MatrixIf there is an...
"i applied to amazon for 6 times,flipkart 2...