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 JashanArora
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by JashanArora
3
answers
1
GATE CSE 2014 Set 1 | Question: 8
The base (or radix) of the number system such that the following equation holds is____________. $\frac{312}{20} = 13.1$
comment reshown
in
Digital Logic
Nov 20, 2020
12.2k
views
gatecse-2014-set1
digital-logic
number-representation
numerical-answers
normal
2
answers
2
UGC NET CSE | Junet 2015 | Part 2 | Question: 13
Given that $x=7.5, j=-1.0, n=1.0, m=2.0$ the value of $--x+j==x>n>=m$ is: $0$ $1$ $2$ $3$
commented
in
Programming in C
Nov 19, 2020
2.9k
views
ugcnetcse-june2015-paper2
programming-in-c
4
answers
3
ISRO-2013-52
Suppose we have variable logical records of lengths of $5$ bytes, $10$ bytes and $25$ bytes while the physical block size in disk is $15$ bytes. What is the maximum and minimum fragmentation seen in bytes? $25$ and $5$ $15$ and $5$ $15$ and $0$ $10$ and $5$
commented
in
Operating System
Nov 18, 2020
7.7k
views
isro2013
operating-system
io-handling
disk
2
answers
4
ISRO-2013-39
Ethernet layer- $2$ switch is a network element type which gives. Different collision domain and same broadcast domain. Different collision domain and different broadcast domain. Same collision domain and same broadcast domain. Same collision domain and different broadcast domain.
commented
in
Computer Networks
Nov 18, 2020
3.9k
views
isro2013
computer-networks
ethernet
3
answers
5
ISRO2020-20
The minimum height of an AVL tree with $n$ nodes is $\text{Ceil } (\log_2(n+1))$ $1.44\ \log_2n$ $\text{Floor } (\log_2(n+1))$ $1.64\ \log_2n$
comment edited
in
DS
Nov 15, 2020
5.7k
views
isro-2020
data-structures
avl-tree
normal
3
answers
6
ISRO2018-49
in a file which contains $1$ million records and the order of the tree is $100$, then what is the maximum number of nodes to be accessed if $B$+ tree index is used? $5$ $4$ $3$ $10$
commented
in
Databases
Nov 15, 2020
10.1k
views
isro2018
databases
b-tree
5
answers
7
ISRO2016-46
With single resource, deadlock occurs if there are more than two processes competing for that resources if there are only two processes competing for that resources if there is a single process competing for that resources none of these
answer edited
in
Operating System
Nov 13, 2020
9.1k
views
operating-system
resource-allocation
isro2016
6
answers
8
GATE CSE 2018 | Question: 27
Let $N$ be the set of natural numbers. Consider the following sets, $P:$ Set of Rational numbers (positive and negative) $Q:$ Set of functions from $\{0,1\}$ to $N$ $R:$ Set of functions from $N$ to $\{0, 1\}$ $S:$ Set of finite subsets of $N$ Which of the above sets are countable? $Q$ and $S$ only $P$ and $S$ only $P$ and $R$ only $P, Q$ and $S$ only
commented
in
Set Theory & Algebra
Oct 23, 2020
21.8k
views
gatecse-2018
set-theory&algebra
countable-uncountable-set
normal
2-marks
6
answers
9
GATE CSE 2015 Set 1 | Question: 34
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram: For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \wedge y$ are join and meet of $x, y$ ... $p_r = 0$ $p_r = 1$ $0 < p_r ≤ \frac{1}{5}$ $\frac{1}{5} < p_r < 1$
commented
in
Set Theory & Algebra
Oct 22, 2020
17.2k
views
gatecse-2015-set1
set-theory&algebra
normal
lattice
3
answers
10
NIELIT 2016 MAR Scientist B - Section C: 11
What is the correct way to round off $x$, $a$ $\text{float}$ to an $\text{int}$ value? $y=(\text{int})(x+0.5)$ $y=\text{int} (x+0.5)$ $y=(\text{int}) x+0.5$ $y=(\text{int})(\text{int})x+0.5)$
commented
in
Programming in C
Oct 12, 2020
1.8k
views
nielit2016mar-scientistb
programming-in-c
1
answer
11
NIELIT 2016 MAR Scientist C - Section C: 57
If initialization is a part of declaration of a structure, then storage class can be automatic register static anything
commented
in
Programming in C
Oct 7, 2020
1.9k
views
nielit2016mar-scientistc
programming-in-c
2
answers
12
UGC NET CSE | June 2014 | Part 2 | Question: 06
A grammar $G$ is $LL(1)$ if and only if the following conditions hold for two distinct productions $A \rightarrow \alpha \mid \beta$ I. First $(\alpha) \cap$ First $(\beta) \neq \left\{a\right\}$ where $a$ is some terminal symbol of the grammar. II. ... Follow $(A) = \phi$ if $\lambda \in$ First $(\beta)$ I and II I and III II and III I, II and III
answer edited
in
Compiler Design
Sep 30, 2020
4.2k
views
ugcnetcse-june2014-paper2
compiler-design
grammar
parsing
3
answers
13
GATE CSE 1994 | Question: 21
Consider the following recursive function: function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end; The above function is run on a computer with a stack of $64$ bytes. Assuming ... an address takes $2$ bytes each, estimate the maximum value of $n$ for which the stack will not overflow. Give reasons for your answer.
commented
in
Programming in C
Aug 24, 2020
25.4k
views
gate1994
programming
recursion
normal
descriptive
5
answers
14
GATE CSE 2017 Set 1 | Question: 55
The output of executing the following C program is _______________ . #include<stdio.h> int total(int v) { static int count = 0; while(v) { count += v&1; v >>= 1; } return count; } void main() { static int x=0; int i=5; for(; i>0; i--) { x = x + total(i); } printf("%d\n", x); }
commented
in
Programming in C
Aug 24, 2020
22.3k
views
gatecse-2017-set1
programming
programming-in-c
normal
numerical-answers
1
answer
15
NIELIT 2018-76
Identify the correct nodes and edges in the given intermediate code $i=1$ $t1=5*i$ $t2=4*t1$ $t3=t2$ $a[t3]=0$ $i=i+1$ if $i<15$ goto(2) $33$ $44$ $43$ $34$
commented
in
Compiler Design
Mar 13, 2020
4.4k
views
nielit-2018
compiler-design
intermediate-code
4
answers
16
ISRO2020-54
Checksum field in TCP header is ones complement of sum of header and data in bytes ones complement of sum of header, data and pseudo header in $16$ bit words dropped from $\textsf{IPv6}$ header format better than $\textsf{md5}$ or $\textsf{sh1}$ methods
commented
in
Computer Networks
Mar 12, 2020
3.5k
views
isro-2020
computer-networks
tcp
normal
3
answers
17
ISRO2007-10
The term ‘aging’ refers to booting up the priority of the process in multi-level of queue without feedback. gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking keeping track of the ... letting job reside in memory for a certain amount of time so that the number of pages required can be estimated accurately.
commented
in
Operating System
Mar 12, 2020
5.5k
views
isro2007
operating-system
memory-management
page-replacement
7
answers
18
GATE CSE 2015 Set 2 | Question: 21
Consider the following statements. The complement of every Turing decidable language is Turing decidable There exists some language which is in NP but is not Turing decidable If L is a language in NP, L is Turing decidable Which of the above statements is/are true? Only II Only III Only I and II Only I and III
commented
in
Theory of Computation
Mar 12, 2020
15.3k
views
gatecse-2015-set2
theory-of-computation
decidability
easy
10
answers
19
GATE CSE 2014 Set 3 | Question: 42
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order. int ProcessArray(int *listA, int x, int n) { int i, j, k; i = 0; j = n-1; do { k = (i+j)/2; if ... implementation of binary search. It will always find the maximum element in $listA$. It will return −$1$ even when $x$ is present in $listA$.
commented
in
DS
Mar 11, 2020
13.4k
views
gatecse-2014-set3
data-structures
array
easy
3
answers
20
GATE CSE 2010 | Question: 8
$P$ is a $16$-bit signed integer. The $2$'s complement representation of $P$ is $(F87B)_{16}$. The $2$'s complement representation of $8\times P$ is $(C3D8)_{16}$ $(187B)_{16}$ $(F878)_{16}$ $(987B)_{16}$
commented
in
Digital Logic
Mar 8, 2020
16.3k
views
gatecse-2010
digital-logic
number-representation
normal
1
answer
21
TIFR CSE 2016 | Part B | Question: 8
Consider the following language $\mathsf{PRIMES} = \Biggl\{ \underbrace{111 \dots 11}_{p \: \text{ times} } : \: p \: \text{ is prime } \Biggl\}$ Then, which of the following is TRUE? $\mathsf{PRIMES}$ ... is decidable in polynomial time $\mathsf{PRIMES}$ is context free but not regular $\mathsf{PRIMES}$ is NP-complete and P $\neq$ NP
answered
in
Theory of Computation
Mar 8, 2020
657
views
tifr2016
theory-of-computation
decidability
p-np-npc-nph
4
answers
22
TIFR CSE 2016 | Part B | Question: 13
An undirected graph $G = (V, E)$ is said to be $k$-colourable if there exists a mapping $c: V \rightarrow \{1, 2, \dots k \}$ such that for every edge $\{u, v\} \in E$ we have $c(u) \neq c(v)$. Which of the following ... degree in $G$ There is a polynomial time algorithm to check if $G$ is $2$-colourable If $G$ has no triangle then it is $3$-colourable
answered
in
Graph Theory
Mar 7, 2020
1.2k
views
tifr2016
graph-theory
graph-coloring
6
answers
23
GATE CSE 2003 | Question: 26
In a system with $\text{32 bit}$ virtual addresses and $\text{1 KB}$ page size, use of one-level page tables for virtual to physical address translation is not practical because of the large amount of internal ... large amount of external fragmentation the large memory overhead in maintaining page tables the large computation overhead in the translation process
commented
in
Operating System
Mar 6, 2020
15.2k
views
gatecse-2003
operating-system
virtual-memory
normal
7
answers
24
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
commented
in
Algorithms
Mar 5, 2020
36.4k
views
gatecse-2008
normal
algorithms
time-complexity
7
answers
25
GATE CSE 2008 | Question: 38
In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is: before effective address calculation has started during effective address calculation after effective address calculation has completed after data cache lookup has completed
commented
in
CO and Architecture
Mar 5, 2020
19.2k
views
gatecse-2008
co-and-architecture
virtual-memory
normal
3
answers
26
GATE CSE 2008 | Question: 35
For inclusion to hold between two cache levels $L_1$ and $L_2$ in a multi-level cache hierarchy, which of the following are necessary? $L_1$ must be write-through cache $L_2$ must be a write-through cache The associativity of $L_2$ must be greater than that of $L_1$ The ... be at least as large as the $L_1$ cache IV only I and IV only I, II and IV only I, II, III and IV
commented
in
CO and Architecture
Mar 5, 2020
24.4k
views
gatecse-2008
co-and-architecture
cache-memory
normal
3
answers
27
GATE CSE 2008 | Question: 34
Which of the following must be true for the RFE (Return From Exception) instruction on a general purpose processor? It must be a trap instruction It must be a privileged instruction An exception cannot be allowed to occur during execution of an RFE instruction I only II only I and II only I, II and III only
commented
in
CO and Architecture
Mar 5, 2020
11.8k
views
gatecse-2008
co-and-architecture
machine-instruction
normal
3
answers
28
GATE CSE 2008 | Question: 11
Which of the following describes a handle (as applicable to LR-parsing) appropriately? It is the position in a sentential form where the next shift or reduce operation will occur It is non-terminal whose production will be used for reduction in the ... in the next step along with a position in the sentential form where the right hand side of the production may be found
commented
in
Compiler Design
Mar 5, 2020
13.3k
views
gatecse-2008
compiler-design
parsing
normal
7
answers
29
GATE IT 2008 | Question: 18
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame? $10,000$ bytes $12,000$ bytes $15,000$ bytes $27,000$ bytes
commented
in
Computer Networks
Mar 5, 2020
15.9k
views
gateit-2008
computer-networks
communication
serial-communication
normal
out-of-gate-syllabus
5
answers
30
GATE IT 2007 | Question: 13
Consider the following statements about the timeout value used in TCP. The timeout value is set to the RTT (Round Trip Time) measured during TCP connection establishment for the entire duration of the connection. Appropriate RTT estimation algorithm is used to set the timeout value of a TCP ... $(ii)$ are false, but $(iii)$ is true $(i), (ii)$ and $(iii)$ are false
commented
in
Computer Networks
Mar 4, 2020
11.4k
views
gateit-2007
computer-networks
tcp
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:...