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 Rishav_Bhatt
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Rishav_Bhatt
1
answer
1
GATE CSE 1989 | Question: 1-vi
Consider an excess -$50$ representation for floating point numbers with $4$ BCD digit mantissa and $2$ BCD digit exponent in normalised form. The minimum and maximum positive numbers that can be represented are __________ and _____________ respectively.
comment edited
in
Digital Logic
Sep 13, 2020
3.9k
views
descriptive
gate1989
digital-logic
number-representation
floating-point-representation
2
answers
2
proper non empty substrings
The maximum no of proper non empty sub-strings for the given 'n' length string is: A) n*(n+1)/2 - 1 B) n*(n+1)/2 C) n*(n+1)/2 + 1 D) none of the above I basically want a good explanation here for whatever option you choose???thanks in advance . <answer given as per coaching book is B>
commented
in
Theory of Computation
Jan 15, 2020
2.2k
views
theory-of-computation
1
answer
3
consider the following
Consider a single-level cache with an access time of 2.5 ns, a line size of 64 bytes, and a hit ratio of H 0.95. Main memory uses a block transfer capability that has a first word (4 bytes) access time of 50 ns and an access time of 5 ns ... a hit. b. Suppose that increasing the line size to 128 bytes increases the H to 0.97. Does this reduce the average memory access time?
commented
in
CO and Architecture
Jan 15, 2020
8.0k
views
cache-memory
12
answers
4
GATE CSE 2019 | Question: 29
Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this? X sends an ARP request packet to the local gateway' ... packet with broadcast MAC address in its local subnet X sends an ARP request packet with broadcast IP address in its local subnet
commented
in
Computer Networks
Jan 15, 2020
19.5k
views
gatecse-2019
computer-networks
network-protocols
2-marks
7
answers
5
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\}$
comment edited
in
Operating System
Dec 17, 2019
12.3k
views
gatecse-2019
operating-system
process-synchronization
2-marks
4
answers
6
GATE CSE 2019 | Question: 42
The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk block address is $32$-bits long. The maximum possible file size is (rounded off to $1$ decimal place) ____ GB
commented
in
Operating System
Dec 11, 2019
22.7k
views
gatecse-2019
numerical-answers
operating-system
file-system
2-marks
6
answers
7
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
Dec 4, 2019
28.4k
views
gatecse-2017-set2
cache-memory
co-and-architecture
normal
12
answers
8
GATE CSE 2005 | Question: 80
Consider the following data path of a $\text{CPU}.$ The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including incrementation of the $\text{PC}$ and the $\text{GPRs}$ are to be carried out in ... $2$ $3$ $4$ $5$
commented
in
CO and Architecture
Dec 4, 2019
24.2k
views
co-and-architecture
normal
gatecse-2005
data-path
machine-instruction
2
answers
9
MadeEasy Test Series: CO & Architecture - Instruction Format
How will this question be solved?
commented
in
CO and Architecture
Dec 2, 2019
966
views
co-and-architecture
instruction-format
made-easy-test-series
numerical-answers
10
answers
10
GATE CSE 2014 Set 2 | Question: 33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used
commented
in
Operating System
Nov 29, 2019
28.6k
views
gatecse-2014-set2
operating-system
page-replacement
ambiguous
2
answers
11
GATE CSE 2006 | Question: 66
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $x_i$ instances of a resource $R$, $ 1\leq i\leq n$ . Currently, all instances of $R$ are occupied. Further, for all $i$, process $i$ has placed a request for an additional $y_i$ instances while ... $ \max(x_{p},x_{q})>1$ $ \min(x_{p},x_{q})>1$
commented
in
Operating System
Nov 22, 2019
16.4k
views
gatecse-2006
operating-system
resource-allocation
normal
15
answers
12
GATE CSE 2003 | Question: 78
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns
commented
in
Operating System
Nov 20, 2019
46.0k
views
gatecse-2003
operating-system
normal
virtual-memory
3
answers
13
GATE CSE 2019 | Question: 19
Consider the grammar given below: $S \rightarrow Aa$ $A \rightarrow BD$ $B \rightarrow b \mid \epsilon $ $D \rightarrow d \mid \epsilon $ Let $a,b,d$ and $\$ be indexed as follows:$\begin{array}{|l|l|l|l|} \hline a & b & d & \$ \ ... $)$ , then the answer should be $3210$)
commented
in
Compiler Design
Oct 11, 2019
20.1k
views
gatecse-2019
numerical-answers
compiler-design
parsing
1-mark
4
answers
14
GATE CSE 2014 Set 3 | Question: 13
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.
commented
in
Algorithms
Sep 28, 2019
15.7k
views
gatecse-2014-set3
algorithms
graph-algorithms
numerical-answers
normal
graph-search
5
answers
15
GATE CSE 2012 | Question: 11
Let A be the $ 2 × 2 $ matrix with elements $a_{11} = a_{12} = a_{21} = +1 $ and $ a_{22} = −1 $ . Then the eigenvalues of the matrix $A^{19}$ are $1024$ and $−1024$ $1024\sqrt{2}$ and $−1024 \sqrt{2}$ $4 \sqrt{2}$ and $−4 \sqrt{2}$ $512 \sqrt{2}$ and $−512 \sqrt{2}$
commented
in
Linear Algebra
Sep 12, 2019
11.3k
views
gatecse-2012
linear-algebra
eigen-value
3
answers
16
GATE CSE 1998 | Question: 1.2
Consider the following set of equations $x+2y=5$ $4x+8y=12$ $3x+6y+3z=15$ This set has unique solution has no solution has finite number of solutions has infinite number of solutions
commented
in
Linear Algebra
Sep 11, 2019
7.1k
views
gate1998
linear-algebra
system-of-equations
easy
7
answers
17
GATE CSE 2016 Set 2 | Question: 04
Consider the systems, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a solution. ... $\text{II}$ and $\text{III}$ are true. Only $\text{III}$ is true. None of them is true.
commented
in
Linear Algebra
Sep 11, 2019
15.7k
views
gatecse-2016-set2
linear-algebra
system-of-equations
normal
2
answers
18
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.
answered
in
Graph Theory
Sep 3, 2019
757
views
graph-theory
graph-coloring
made-easy-test-series
madeeasy-testseries-2018
10
answers
19
GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
comment edited
in
Algorithms
Aug 24, 2019
21.7k
views
gatecse-2017-set1
algorithms
normal
numerical-answers
searching
15
answers
20
GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
commented
in
Algorithms
Aug 23, 2019
37.0k
views
gatecse-2007
algorithms
time-complexity
normal
isro2016
7
answers
21
GATE CSE 2014 Set 3 | Question: 41
Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibling$ representation. Each node of the tree is of type $treeNode$. typedef struct ... height of the tree. number of nodes without a right sibling in the tree. number of leaf nodes in the tree
commented
in
DS
Aug 19, 2019
19.8k
views
gatecse-2014-set3
data-structures
tree
normal
9
answers
22
GATE CSE 2011 | Question: 29
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$
commented
in
DS
Aug 19, 2019
31.6k
views
gatecse-2011
binary-tree
normal
9
answers
23
GATE CSE 2018 | Question: 2
Consider the following C program: #include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", *((char*)q+1), *((char*)q+2)); return 0; } The output of this program is: 0, c 0, a+2 '0', 'a+2' '0', 'c'
commented
in
Programming in C
Aug 13, 2019
20.3k
views
gatecse-2018
programming-in-c
programming
structure
normal
1-mark
1
answer
24
GATE CSE 1987 | Question: 7a
List the invariant assertions at points $A, B, C, D$ and $E$ in program given below: Program division (input, output) Const dividend = 81; divisor = 9; Var remainder, quotient:interger begin (*(dividend >= 0) AND (divisor > 0)*) remainder := dividend; ... = remainder - divisor; (*C*) end; (*D*) quotient := quotient - 1; remainder := remainder + divisor; (*E*) end
commented
in
Programming in C
Aug 13, 2019
2.5k
views
gate1987
programming
loop-invariants
descriptive
3
answers
25
program output
char *c[] = {"GeksQuiz", "MCQ", "TEST", "QUIZ"}; char **cp[] = {c+3, c+2, c+1, c}; char ***cpp = cp; int main() { printf("%s ", **++cpp); printf("%s ", *--*++cpp+3); printf("%s ", *cpp[-2]+3); printf("%s ", cpp[-1][-1]+1); return 0; }
commented
in
Programming in C
Aug 8, 2019
4.2k
views
programming-in-c
pointers
5
answers
26
GATE IT 2008 | Question: 42
The two numbers given below are multiplied using the Booth's algorithm. Multiplicand : $0101$ $1010$ $1110$ $1110$ Multiplier: $0111$ $0111$ $1011$ $1101$ How many additions/Subtractions are required for the multiplication of the above two numbers? $6$ $8$ $10$ $12$
commented
in
Digital Logic
Aug 4, 2019
21.6k
views
gateit-2008
digital-logic
booths-algorithm
normal
4
answers
27
GATE CSE 2008 | Question: 26
If $P, Q, R$ are Boolean variables, then $(P + \bar{Q}) (P.\bar{Q} + P.R) (\bar{P}.\bar{R} + \bar{Q})$ simplifies to $P.\bar{Q}$ $P.\bar{R}$ $P.\bar{Q} + R$ $P.\bar{R} + Q$
commented
in
Digital Logic
Jul 27, 2019
10.5k
views
gatecse-2008
easy
digital-logic
boolean-algebra
1
answer
28
Go-schedule information
As per Gate Overflow Schedule for 2020 for the first week we have to study " Logical Reasoning and Data Interpretation: Verbal reasoning deriving conclusion from passage, conclusions as in puzzles (can be in mathematical logic also) ". So which topics are covered under this and what questions to practice from GO PDF?
commented
in
Verbal Aptitude
Jun 12, 2019
486
views
go-classroom
verbal-aptitude
5
answers
29
GATE2014 AG: GA-1
Choose the most appropriate word from the options given below to complete the following sentence. A person suffering from Alzheimer’s disease ______ short-term memory loss. Experienced Has experienced Is experiencing Experiences
commented
in
Verbal Aptitude
Jun 12, 2019
2.8k
views
gate2014-ag
verbal-aptitude
most-appropriate-word
normal
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...