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 kumar_sanjay
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by kumar_sanjay
4
answers
1
GATE CSE 2017 Set 2 | Question: 48
If a random variable $X$ has a Poisson distribution with mean $5$, then the expectation $E\left [ \left ( x+2 \right )^{2} \right ]$ equals ___.
commented
in
Probability
Mar 3, 2017
13.8k
views
gatecse-2017-set2
expectation
poisson-distribution
numerical-answers
probability
12
answers
2
GATE CSE 2017 Set 2 | Question: 55
Consider the following C program. #include<stdio.h> #include<string.h> int main() { char* c="GATECSIT2017"; char* p=c; printf("%d", (int)strlen(c+2[p]-6[p]-1)); return 0; } The output of the program is _______
commented
in
Programming
Mar 3, 2017
21.3k
views
gatecse-2017-set2
programming-in-c
numerical-answers
array
pointers
1
answer
3
Test by Bikram | Mock GATE | Test 1 | Question: 55
Consider a disk with a sector size of $512$ bytes, $50$ sectors per track, $2000$ tracks per surface and five double-sided platters (i.e. $10$ surfaces). The disk platters rotate at $5400$ ... on this disk, and no record is allowed to span two blocks. Then, the rotational latency of the disk is ________ seconds.
commented
in
GATE
Feb 8, 2017
835
views
tbb-mockgate-1
numerical-answers
disk
operating-system
5
answers
4
GATE CSE 2015 Set 1 | Question: 40
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-key operations on a set of data ... if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min - heap Sorted array Sorted doubly linked list
commented
in
Algorithms
Feb 7, 2017
18.4k
views
gatecse-2015-set1
algorithms
data-structures
normal
time-complexity
3
answers
5
GATE IT 2005 | Question: 5
Which of the following statements is TRUE about the regular expression $01^*0$? It represents a finite set of finite strings. It represents an infinite set of finite strings. It represents a finite set of infinite strings. It represents an infinite set of infinite strings.
commented
in
Theory of Computation
Jan 31, 2017
7.8k
views
gateit-2005
theory-of-computation
regular-expression
easy
2
answers
6
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 23
A hard disk is connected to a $2$ GHz processor through a DMA controller which works in burst mode. The initial set up of a DMA transfer takes $1000$ ... is $16$ KB. Then, the fraction of CPU time free if the disk is transferring data is _______%.
commented
in
CO and Architecture
Jan 30, 2017
522
views
tbb-coa-1
co-and-architecture
numerical-answers
io-handling
dma
3
answers
7
GATE CSE 2003 | Question: 41
Consider the following system of linear equations ... linearly dependent. For how many values of $\alpha$, does this system of equations have infinitely many solutions? \(0\) \(1\) \(2\) \(3\)
commented
in
Linear Algebra
Jan 28, 2017
9.4k
views
gatecse-2003
linear-algebra
system-of-equations
normal
8
answers
8
GATE IT 2006 | Question: 25
Consider the undirected graph $G$ defined as follows. The vertices of $G$ are bit strings of length $n$. We have an edge between vertex $u$ and vertex $v$ if and only if $u$ and $v$ differ in exactly one bit position (in other words, $v$ can be obtained from $u$ by ... $\left(\frac{1}{n}\right)$ $\left(\frac{2}{n}\right)$ $\left(\frac{3}{n}\right)$
commented
in
Graph Theory
Jan 27, 2017
10.3k
views
gateit-2006
graph-theory
graph-coloring
normal
3
answers
9
GATE IT 2006 | Question: 2
For the set $N$ of natural numbers and a binary operation $f : N \times N \to N,$ an element $z \in N$ is called an identity for $f,$ if $f (a, z) = a = f(z, a),$ for all $a \in N.$ Which of the following binary operations have an identity? $f (x, y) = x + y - 3$ $f (x, y) = \max(x, y)$ $f (x, y) = x^y$ I and II only II and III only I and III only None of these
commented
in
Set Theory & Algebra
Jan 26, 2017
6.7k
views
gateit-2006
set-theory&algebra
easy
binary-operation
2
answers
10
Test by Bikram | Mock GATE | Test 1 | Question: 51
The access time of cache memory is $10$ $ns$ and main memory is $100$ $ns$. It is estimated that $80 \%$ of memory requests are for read and remaining are for write. The hit ratio for read access only is $0.9$. A write through procedure is used. Pages are always available in cache for write operation. Then, the average access time is ______ $ns$.
commented
in
GATE
Jan 18, 2017
923
views
tbb-mockgate-1
numerical-answers
cache-memory
co-and-architecture
2
answers
11
Test by Bikram | Mock GATE | Test 1 | Question: 25
Which of the following is true? Blind writes appear in any view serializable schedule that is not conflict serializable. Blind writes appear in some view serializable schedule that is also conflict serializable. Blind writes appear in all view ... in conflict serializable schedule that is not view serializable. II and III II and IV I only I and II
commented
in
GATE
Jan 18, 2017
605
views
tbb-mockgate-1
conflict-serializable
transaction-and-concurrency
serializability
databases
1
answer
12
Test by Bikram | Mock GATE | Test 1 | Question: 4
Which of the following statements is $TRUE$ about $CSMA/CD$: $IEEE$ $802.11$ wireless $LAN$ runs $CSMA/CD$ protocol Ethernet is not based on $CSMA/CD$ protocol $CSMA/CD$ is not suitable for a high propagation There is no contention in a $CSMA/CD$ network
answered
in
GATE
Jan 18, 2017
387
views
tbb-mockgate-1
wifi
computer-networks
3
answers
13
GATE CSE 2004 | Question: 70
The following propositional statement is $\left(P \implies \left(Q \vee R\right)\right) \implies \left(\left(P \wedge Q \right)\implies R\right)$ satisfiable but not valid valid a contradiction None of the above
commented
in
Mathematical Logic
Jan 18, 2017
5.8k
views
gatecse-2004
mathematical-logic
normal
propositional-logic
4
answers
14
GATE CSE 2012 | Question: 18
Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWAYS TRUE? $A(n) = \Omega (W(n))$ $A(n) = \Theta (W(n))$ $A(n) = \text{O} (W(n))$ $A(n) = \text{o} (W(n))$
commented
in
Algorithms
Dec 26, 2016
11.6k
views
gatecse-2012
algorithms
easy
asymptotic-notations
13
answers
15
GATE CSE 2016 Set 2 | Question: 50
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.
commented
in
CO and Architecture
Dec 25, 2016
11.3k
views
gatecse-2016-set2
co-and-architecture
cache-memory
normal
numerical-answers
5
answers
16
GATE CSE 2007 | Question: 71
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... word addressable. The number of memory references for accessing the data in executing the program completely is $10$ $11$ $20$ $21$
commented
in
CO and Architecture
Dec 19, 2016
17.8k
views
gatecse-2007
co-and-architecture
machine-instructions
interrupts
normal
7
answers
17
GATE CSE 2008 | Question: 24
Let $P =\sum \limits_ {i\;\text{odd}}^{1\le i \le 2k} i$ and $Q = \sum\limits_{i\;\text{even}}^{1 \le i \le 2k} i$, where $k$ is a positive integer. Then $P = Q - k$ $P = Q + k$ $P = Q$ $P = Q + 2k$
commented
in
Combinatory
Dec 10, 2016
3.1k
views
gatecse-2008
combinatory
easy
summation
4
answers
18
GATE CSE 2003 | Question: 8, ISRO2009-53
Let $\text{G}$ be an arbitrary graph with $n$ nodes and $k$ components. If a vertex is removed from $\text{G}$, the number of components in the resultant graph must necessarily lie down between $k$ and $n$ $k-1$ and $k+1$ $k-1$ and $n-1$ $k+1$ and $n-k$
commented
in
Graph Theory
Oct 24, 2016
12.2k
views
gatecse-2003
graph-theory
graph-connectivity
normal
isro2009
6
answers
19
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
Oct 24, 2016
12.8k
views
gatecse-2003
operating-system
virtual-memory
normal
7
answers
20
GATE CSE 2003 | Question: 28
Which of the following functionality must be implemented by a transport protocol over and above the network protocol? Recovery from packet losses Detection of duplicate packets Packet delivery in the correct order End to end connectivity
commented
in
Computer Networks
Oct 24, 2016
10.8k
views
gatecse-2003
computer-networks
network-layering
easy
5
answers
21
GATE CSE 1995 | Question: 1.19
Let $R$ be a symmetric and transitive relation on a set $A$. Then $R$ is reflexive and hence an equivalence relation $R$ is reflexive and hence a partial order $R$ is reflexive and hence not an equivalence relation None of the above
commented
in
Set Theory & Algebra
Oct 15, 2016
12.6k
views
gate1995
set-theory&algebra
relations
normal
2
answers
22
GATE CSE 1995 | Question: 2.22
Which of the following statements is true? As the number of entries in a hash table increases, the number of collisions increases. Recursive programs are efficient The worst case complexity for Quicksort is $O(n^2)$ Binary search using a linear linked list is efficient I and II II and III I and IV I and III
commented
in
DS
Oct 15, 2016
9.4k
views
gate1995
data-structures
linked-list
hashing
1
answer
23
GATE Overflow | General Aptitude | Test 1 | Question: 14
Raquet : Tennis :: springboard:diver glove:boxing club:golf gun:hunting
commented
in
Verbal Aptitude
Oct 12, 2016
159
views
go-general-aptitude-1
verbal-aptitude
1
answer
24
GATE Overflow | General Aptitude | Test 1 | Question: 10
Dormitories range from two to six storeys in height. If a dormitory room is above the second floor, it has a fire escape. If the statements above are true, which of the following must also be true? 2nd floor ... fire escapes only dormitory rooms above the 2nd floor have fire escapes some 2-storey dormitories do not have fire escapes.
commented
in
Analytical Aptitude
Oct 12, 2016
109
views
go-general-aptitude-1
logical-reasoning
3
answers
25
GATE IT 2008 | Question: 54
An operating system implements a policy that requires a process to release all resources before making a request for another resource. Select the TRUE statement from the following: Both starvation and deadlock can occur Starvation can occur but deadlock cannot occur Starvation cannot occur but deadlock can occur Neither starvation nor deadlock can occur
commented
in
Operating System
Oct 1, 2016
12.5k
views
gateit-2008
operating-system
resource-allocation
normal
5
answers
26
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
Oct 1, 2016
9.4k
views
gateit-2008
theory-of-computation
finite-automata
normal
7
answers
27
GATE CSE 2015 Set 3 | Question: 7
Consider the following C program segment. # include <stdio.h> int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '0'; printf("%s", s1); } What will be printed by the program? $12$ $120400$ $1204$ $1034$
commented
in
Programming
Sep 28, 2016
10.9k
views
gatecse-2015-set3
programming
programming-in-c
normal
array
4
answers
28
GATE CSE 2015 Set 3 | Question: GA-10
The exports and imports (in crores of $Rs$.) of a country from the year $2000$ to $2007$ are given in the following bar chart. In which year is the combined percentage increase in imports and exports the highest?
commented
in
Quantitative Aptitude
Sep 28, 2016
4.3k
views
gatecse-2015-set3
quantitative-aptitude
data-interpretation
normal
numerical-answers
2
answers
29
GATE Overflow | Operating Systems | Test 1 | Question: 18
System calls are usually invoked by using a software interrupt polling an indirect jump a privileged instruction
commented
in
Operating System
Sep 15, 2016
231
views
go-os-1
operating-system
2
answers
30
GATE Overflow | Operating Systems | Test 1 | Question: 6
Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B and C, which have peak time demands of 3, 4 and 6. The minimum value of 'm' that ensures that deadlock will never occur given that the combined maximum resource requirement of processes B and C at any time is 8 will be ______.
answered
in
Operating System
Sep 15, 2016
830
views
go-os-1
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
numerical-answers
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...