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 Apoorva Jain
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Apoorva Jain
3
answers
1
GATE CSE 2019 | Question: GA-7
In the given diagram, teachers are represented in the triangle, researchers in the circle and administrators in the rectangle. Out of the total number of the people, the percentage of administrators shall be in the range of _______ $0$ to $15$ $16$ to $30$ $31$ to $45$ $46$ to $60$
commented
in
Quantitative Aptitude
Feb 7, 2019
7.6k
views
gatecse-2019
general-aptitude
quantitative-aptitude
venn-diagrams
2-marks
11
answers
2
GATE CSE 2019 | Question: 12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$
answered
in
Graph Theory
Feb 7, 2019
16.6k
views
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
1-mark
7
answers
3
GATE CSE 2019 | Question: 39
Consider the following snapshot of a system running $n$ concurrent processes. Process $i$ is holding $X_i$ instances of a resource $R$, $1 \leq i \leq n$. Assume that all instances of $R$ are currently in use. Further, for all $i$, process $i$ ... $\text{Min}(X_p,X_q) \leq \text{Max} \{Y_k \mid 1 \leq k \leq n, k \neq p, k \neq q\}$
commented
in
Operating System
Feb 7, 2019
8.8k
views
gatecse-2019
operating-system
process-synchronization
2-marks
4
answers
4
GATE CSE 2019 | Question: 41
Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below: ... Time First scheduling algorithm. If the average waiting time of the processes is $1$ millisecond, then the value of $Z$ is _____
commented
in
Operating System
Feb 7, 2019
22.8k
views
gatecse-2019
numerical-answers
operating-system
process-scheduling
2-marks
7
answers
5
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
Jan 24, 2019
18.3k
views
gatecse-2010
algorithms
spanning-tree
normal
3
answers
6
TIFR CSE 2013 | Part B | Question: 5
Given a weighted directed graph with $n$ vertices where edge weights are integers (positive, zero, or negative), determining whether there are paths of arbitrarily large weight can be performed in time $O(n)$ $O(n . \log(n))$ but not $O (n)$ $O(n^{1.5})$ but not $O (n \log n)$ $O(n^{3})$ but not $O(n^{1.5})$ $O(2^{n})$ but not $O(n^{3})$
commented
in
Algorithms
Jan 24, 2019
3.5k
views
tifr2013
algorithms
graph-algorithms
time-complexity
4
answers
7
GATE Overflow | Mathematics | Test 1 | Question: 8
If the proposition $\neg P \to Q$ is true, then the truth value of the proposition $\neg P \vee ( P \to Q)$ is True Multi-valued False Can not be determined
commented
in
Probability
Jan 19, 2019
309
views
go-mathematics-1
probability
2
answers
8
GATE Overflow | Mathematics | Test 1 | Question: 25
A 6 digit number 123ABC is exactly divisible by $5,7$ and $9$. How many such possible numbers are there ? 2 3 4 5
commented
in
Combinatory
Jan 19, 2019
344
views
go-mathematics-1
combinatory
quantitative-aptitude
9
answers
9
GATE CSE 2014 Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.
answered
in
Graph Theory
Jan 17, 2019
20.9k
views
gatecse-2014-set1
graph-theory
numerical-answers
normal
graph-connectivity
4
answers
10
GATE CSE 2012 | Question: 9
Consider the function $f(x) = \sin(x)$ in the interval $x =\left[\frac{\pi}{4},\frac{7\pi}{4}\right]$. The number and location(s) of the local minima of this function are One, at $\dfrac{\pi}{2}$ One, at $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{2}$ and $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{4}$ and $\dfrac{3\pi}{2}$
commented
in
Calculus
Jan 16, 2019
10.6k
views
gatecse-2012
calculus
maxima-minima
normal
7
answers
11
GATE CSE 2015 Set 2 | Question: 26
Let $f(x)=x^{-\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the X-axis, when $x$ varies from $-1$ to $1$. Which of the following statements is/are TRUE? $f$ is continuous in $[-1, 1]$ $f$ is not bounded in $[-1, 1]$ $A$ is nonzero and finite II only III only II and III only I, II and III
commented
in
Calculus
Jan 16, 2019
13.5k
views
gatecse-2015-set2
continuity
functions
normal
2
answers
12
GATE CSE 2010 | Question: 27
What is the probability that divisor of $10^{99}$ is a multiple of $10^{96}$? $\left(\dfrac{1}{625}\right)$ $\left(\dfrac{4}{625}\right)$ $\left(\dfrac{12}{625}\right)$ $\left(\dfrac{16}{625}\right)$
commented
in
Probability
Jan 15, 2019
11.1k
views
gatecse-2010
probability
normal
9
answers
13
GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
commented
in
Linear Algebra
Jan 14, 2019
29.6k
views
gatecse-2014-set2
linear-algebra
eigen-value
normal
numerical-answers
4
answers
14
GATE CSE 2007 | Question: 68, ISRO2016-73
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$
commented
in
Computer Networks
Jan 11, 2019
29.3k
views
gatecse-2007
computer-networks
error-detection
crc-polynomial
normal
isro2016
2
answers
15
Few doubts in compiler design
1. If a grammar is LL(1), then it has to be LALR(1).Is it correct?? 2. Is there anything called as LL(0)?? 3. Do every DCFL has LL(1) grammar?? 4. Do every DCFL has LR(1) grammar?? 5. Can someone please specify, As we can say ... is LL(1), what can we say for CFL,CSL,Recursive and RE?? 6. What is the difference between parse tree, syntax tree and abstract syntax tree?
commented
in
Compiler Design
Jan 10, 2019
2.2k
views
compiler-design
parsing
6
answers
16
LL(1) Grammar
Every LL(1) grammer is LALR(1) TRUE OR FALSE Every LL(1) grammer is CLR(1) TRUE OR FALSE AS I think 2nd is True and 1st is False if I am wrong please let me correct.
commented
in
Compiler Design
Jan 10, 2019
9.3k
views
compiler-design
theory-of-computation
grammar
ll-parser
parsing
6
answers
17
GATE CSE 2000 | Question: 2.21, ISRO2015-24
Given the following expression grammar: $\begin{align} E &\to E * F \mid F + E \mid F \\[1em] F &\to F - F \mid id \end{align}$ Which of the following is true? $*$ has higher precedence than $+$ $-$ has higher precedence than $*$ $+$ and $-$ have same precedence $+$ has higher precedence than $*$
commented
in
Compiler Design
Jan 9, 2019
8.7k
views
gatecse-2000
operator-precedence
normal
compiler-design
isro2015
7
answers
18
GATE CSE 2004 | Question: 84
The recurrence equation $ T(1) = 1$ $T(n) = 2T(n-1) + n, n \geq 2$ evaluates to $2^{n+1} - n - 2$ $2^n - n$ $2^{n+1} - 2n - 2$ $2^n + n $
commented
in
Algorithms
Dec 19, 2018
13.5k
views
gatecse-2004
algorithms
recurrence-relation
normal
3
answers
19
Test by Bikram | Databases | Test 2 | Question: 26
Assume that a data file contains $2000$ records that are ordered by a key attribute $K$ , and a primary index on attribute $K$ is built. The size of key is $5B$ and block pointer is $5B$. Each block of the system is of ... storing meta data). The total number of disk accesses required to fetch the record using the index (in average case) is _____.
commented
in
Databases
Dec 16, 2018
474
views
tbb-dbms-2
numerical-answers
databases
file-organization
indexing
1
answer
20
NPTEL
Assume that a data file contains 1000 records that are ordered by a key attribute A, and a primary index on attribute A is built. Let the size of key be 5B and block pointer be 5B. Each block of the system is of 105B, out of which 100B can be used to store data and 5B ... data. How many disk accesses will be required to fetch the record using the index in average case? a. 6 b. 3 c. 4 d. 5
commented
in
Databases
Dec 16, 2018
693
views
nptel-quiz
databases
5
answers
21
GATE CSE 2014 Set 1 | Question: 50
Let ܵ$S$ denote the set of all functions $f:\{0,1\}^4 \to \{0,1\}$. Denote by $N$ the number of functions from S to the set $\{0,1\}$. The value of $ \log_2 \log_2N $ is _______.
commented
in
Set Theory & Algebra
Dec 15, 2018
10.3k
views
gatecse-2014-set1
set-theory&algebra
functions
combinatory
numerical-answers
2
answers
22
GATE IT 2005 | Question: 66
In a data flow diagram, the segment shown below is identified as having transaction flow characteristics, with $p_2$ identified as the transaction center A first level architectural design of this segment will result in a set of process modules with an associated invocation sequence ... $T_c$ invokes $p_2.$ $p_2$ invokes $p_1,$ and then invokes $p_3,$ or $p_4,$ or $p_5$
commented
in
IS&Software Engineering
Dec 5, 2018
3.3k
views
gateit-2005
data-flow-diagram
normal
non-gate
3
answers
23
GATE CSE 1999 | Question: 2.11
Which of the following is/are advantage(s) of virtual memory? Faster access to memory on an average. Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory. Program larger than the physical memory size can be run.
commented
in
Operating System
Sep 28, 2018
10.9k
views
gate1999
operating-system
virtual-memory
easy
6
answers
24
GATE CSE 2017 Set 1 | Question: 9
When two $8\text{-bit}$ numbers $A_{7}\cdots A_{0}$ and $B_{7}\cdots B_{0}$ in $2$'s complement representation (with $A_{0}$ and $B_{0}$ as the least significant bits) are added using a ripple-carry adder, the sum bits obtained are $S_{7}\cdots S_{0}$ and ... $1$
commented
in
Digital Logic
Sep 9, 2018
10.7k
views
gatecse-2017-set1
digital-logic
number-representation
6
answers
25
GATE CSE 2007 | Question: 32
Let $f(w, x, y, z) = \sum {\left(0,4,5,7,8,9,13,15\right)}$. Which of the following expressions are NOT equivalent to $f$? P: $x'y'z' + w'xy' + wy'z + xz$ Q: $w'y'z' + wx'y' + xz$ R: $w'y'z' + wx'y' + xyz+xy'z$ S: $x'y'z' + wx'y'+ w'y$ P only Q and S R and S S only
answered
in
Digital Logic
Sep 9, 2018
7.7k
views
gatecse-2007
digital-logic
normal
boolean-algebra
2
answers
26
GATE CSE 1998 | Question: 1.17
The octal representation of an integer is $(342)_8$. If this were to be treated as an eight-bit integer in an $8085$ based computer, its decimal equivalent is $226$ $-98$ $76$ $-30$
commented
in
Digital Logic
Sep 9, 2018
6.3k
views
gate1998
digital-logic
number-representation
normal
8085-microprocessor
8
answers
27
GATE CSE 2016 Set 1 | Question: 07
The $16\text{-bit}\;2's$ complement representation of an integer is $1111 \quad 1111 \quad 1111 \quad 0101;$ its decimal representation is ____________
answered
in
Digital Logic
Sep 8, 2018
9.8k
views
gatecse-2016-set1
digital-logic
number-representation
normal
numerical-answers
5
answers
28
GATE CSE 2006 | Question: 74
Consider two cache organizations. First one is $32 \; \textsf{KB}\;2\text{-way}$ set associative with $32 \; \text{byte}$ block size, the second is of same size but direct mapped. The size of an address is $32\; \text{bits}$ in both cases . A $2\text{-to-}1$ multiplexer has ... The value of $h_1$ is: $2.4 \text{ ns} $ $2.3 \text{ ns}$ $1.8 \text{ ns}$ $1.7 \text{ ns}$
commented
in
CO and Architecture
Sep 3, 2018
23.5k
views
gatecse-2006
co-and-architecture
cache-memory
normal
0
answers
29
Cache-tag-directory
What is the size of tag in cache directory for direct and set-associative memory? For set-associative memory do we multiply by no of sets or no of blocks? According to me Size of Tag in cache directory = Number of tag bits(+ any extra bits like valid, ... = Number of tag bits(+ any extra bits like valid, modified etc) * number of sets Tag is associated with each block or set?
commented
in
CO and Architecture
Sep 2, 2018
1.1k
views
cache-memory
co-and-architecture
direct-mapping
set-associative-mapping
4
answers
30
GATE CSE 2012 | Question: 55
A computer has a $256$-$\text{KByte}$, 4-way set associative, write back data cache with block size of $32$ $\text{Bytes}$. The processor sends $32$ $\text{bit}$ addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, ... tag directory is: $160$ $\text{Kbits}$ $136$ $\text{Kbits}$ $40$ $\text{Kbits}$ $32$ $\text{Kbits}$
commented
in
CO and Architecture
Sep 2, 2018
9.3k
views
normal
gatecse-2012
co-and-architecture
cache-memory
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
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
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
+1
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...