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 samir757
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by samir757
15
answers
1
GATE CSE 2012 | Question: 33
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of values that turn up is at least $6$ ? $\dfrac{10}{21}$ $\dfrac{5}{12}$ $\dfrac{2}{3}$ $\dfrac{1}{6}$
commented
in
Probability
Jan 24
16.9k
views
gatecse-2012
probability
conditional-probability
normal
6
answers
2
TIFR CSE 2010 | Part B | Question: 36
In a directed graph, every vertex has exactly seven edges coming in. What can one always say about the number of edges going out of its vertices? Exactly seven edges leave every vertex. Exactly seven edges leave some vertex. Some vertex has at least seven edges leaving it. The number of edges coming out of vertex is odd. None of the above.
commented
in
Graph Theory
Jan 23
4.3k
views
tifr2010
graph-theory
degree-of-graph
8
answers
3
GATE CSE 1987 | Question: 10b
What is the generating function $G(z)$ for the sequence of Fibonacci numbers?
commented
in
Combinatory
Jan 22
6.9k
views
gate1987
combinatory
generating-functions
descriptive
13
answers
4
GATE CSE 2004 | Question: 82
Let $A[1,\ldots,n]$ be an array storing a bit ($1$ or $0$) at each location, and $f(m)$ is a function whose time complexity is $\Theta(m)$. Consider the following program fragment written in a C like language: counter = 0; for (i=1; i<=n; i++) { if ( ... The complexity of this program fragment is $\Omega(n^2)$ $\Omega (n\log n) \text{ and } O(n^2)$ $\Theta(n)$ $o(n)$
commented
in
Algorithms
Jan 21
15.6k
views
gatecse-2004
algorithms
time-complexity
normal
7
answers
5
GATE CSE 2016 Set 1 | Question: 14
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? $P$: Minimum spanning tree of $G$ does not change. $Q$: Shortest path between any pair of vertices does not change. $P$ only $Q$ only Neither $P$ nor $Q$ Both $P$ and $Q$
commented
in
Algorithms
Jan 21
15.9k
views
gatecse-2016-set1
algorithms
spanning-tree
normal
4
answers
6
GATE CSE 1997 | Question: 9
Consider a graph whose vertices are points in the plane with integer co-ordinates $(x,y)$ such that $1 \leq x \leq n$ and $1 \leq y \leq n$, where $n \geq 2$ is an integer. Two vertices $(x_1, y_1)$ ... only the answer without any explanations. What is the weight of a maximum weight-spanning tree in this graph? Write only the answer without any explanations.
commented
in
Algorithms
Jan 21
5.0k
views
gate1997
algorithms
spanning-tree
normal
descriptive
8
answers
7
GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
commented
in
Algorithms
Jan 21
22.7k
views
gatecse-2013
algorithms
sorting
normal
heap-sort
6
answers
8
GATE CSE 2004 | Question: 49
A unix-style I-nodes has $10$ direct pointers and one single, one double and one triple indirect pointers. Disk block size is $1$ Kbyte, disk block address is $32$ bits, and $48$-bit integers are used. What is the maximum possible file size? $2^{24}$ bytes $2^{32}$ bytes $2^{34}$ bytes $2^{48}$ bytes
commented
in
Operating System
Jan 11
21.9k
views
gatecse-2004
operating-system
disk
normal
15
answers
9
GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
commented
in
Operating System
Jan 11
17.3k
views
gateit-2007
operating-system
disk-scheduling
normal
5
answers
10
GATE CSE 2003 | Question: 74
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions. global int i=100, j=5; void P(x) { int i=10; print(x+10); i=200; j=20; print (x); } main() {P(i ... by name parameter passing mechanism, the values printed by the above program are $115, 220$ $25, 220$ $25, 15$ $115, 105$
commented
in
Compiler Design
Jan 10
8.0k
views
gatecse-2003
programming
compiler-design
parameter-passing
runtime-environment
normal
1
answer
11
GATE CSE 1989 | Question: 4-ii
Compute the postfix equivalent of the following infix arithmetic expression $a + b \ast c + d * e \uparrow f$ where $\uparrow$ represents exponentiation. Assume normal operator precedences.
commented
in
DS
Jan 10
1.3k
views
gate1989
descriptive
data-structures
stack
infix-prefix
3
answers
12
GATE CSE 2014 Set 1 | Question: 15
Which one of the following is TRUE? The language $L = \left\{a^nb^n \mid n \geq 0\right\}$ is regular. The language $L = \left\{a^n \mid n \text{ is prime }\right\}$ is regular. The language $L$ ... is regular. The language $L = \left\{ww \mid w \in \Sigma^* \text{ with } \Sigma = \left\{0,1\right\}\right\}$ is regular.
commented
in
Theory of Computation
Jan 8
7.2k
views
gatecse-2014-set1
theory-of-computation
regular-language
normal
3
answers
13
GATE CSE 2005 | Question: 45
Consider three decision problems $P_1$, $P_2$ and $P_3$. It is known that $P_1$ is decidable and $P_2$ is undecidable. Which one of the following is TRUE? $P_3$ is decidable if $P_1$ is reducible to $P_3$ $P_3$ is undecidable if $P_3$ is reducible to $P_2$ $P_3$ is undecidable if $P_2$ is reducible to $P_3$ $P_3$ is decidable if $P_3$ is reducible to $P_2$'s complement
commented
in
Theory of Computation
Jan 7
10.1k
views
gatecse-2005
theory-of-computation
decidability
normal
4
answers
14
GATE CSE 2007 | Question: 85
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. Suppose that the robot is not allowed to traverse the ... $^{20}\mathrm{C}_{10} - ^{8}\mathrm{C}_{4}\times ^{11}\mathrm{C}_{5}$
commented
in
Combinatory
Jan 2
6.4k
views
gatecse-2007
combinatory
normal
discrete-mathematics
6
answers
15
GATE CSE 2003 | Question: 39
Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows: $g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$. Let $p_i$ denote the i-th prime number $\left(p_1 = 2\right)$ ... numbers is the encoding, $h$, of a non-empty sequence of strings? $2^73^75^7$ $2^83^85^8$ $2^93^95^9$ $2^{10}3^{10}5^{10}$
commented
in
Set Theory & Algebra
Jan 2
5.6k
views
gatecse-2003
set-theory&algebra
functions
normal
7
answers
16
GATE CSE 2014 Set 2 | Question: 50
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider the ... $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
commented
in
Set Theory & Algebra
Dec 31, 2021
11.3k
views
gatecse-2014-set2
set-theory&algebra
normal
set-theory
1
answer
17
APPLIED ROOTS Multisubject test
Consider a 32-bit microprocessor that has an on-chip 16-KByte four-way set-associative cache. Assume that the cache has a line size of four 32-bit words.Where in the cache (Set number in decimal) is the word from memory location ABCDE888 mapped?
commented
in
CO and Architecture
Dec 26, 2021
239
views
computer-architecture
cache-memory
7
answers
18
GATE CSE 2014 Set 3 | Question: 12
Consider the following rooted tree with the vertex labeled $P$ as the root: The order in which the nodes are visited during an in-order traversal of the tree is $SQPTRWUV$ $SQPTUWRV$ $SQPTWUVR$ $SQPTRUWV$
commented
in
DS
Dec 25, 2021
12.3k
views
gatecse-2014-set3
data-structures
tree
easy
1
answer
19
Applied Test Series
Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___
commented
in
Operating System
Nov 6, 2021
257
views
test-series
operating-system
deadlock-prevention-avoidance-detection
0
answers
20
Gate Applied Course Practice test 4
External Merge Sort is necessary when you cannot store all the data into memory. The best you can do is break the data into sorted runs and merge the runs in subsequent passes. The length of a run is tied to your available buffer size. Assume that 5 buffer pages are available to sort a file of 105 pages. The cost of sorting using m-way merge sort is__ ?
asked
in
Algorithms
Nov 5, 2021
206
views
algorithms
merge-sort
3
answers
21
TIFR CSE 2014 | Part A | Question: 11
A large community practices birth control in the following peculiar fashion. Each set of parents continues having children until a son is born; then they stop. What is the ratio of boys to girls in the community if, in the absence of birth control, $51\%$ of the babies are born male? $51:49$ $1:1$ $49:51$ $51:98$ $98:51$
answered
in
Quantitative Aptitude
Jun 23, 2021
1.1k
views
tifr2014
quantitative-aptitude
fraction
tricky
2
answers
22
TIFR CSE 2013 | Part B | Question: 9
Suppose $n$ straight lines are drawn on a plane. When these lines are removed, the plane falls apart into several connected components called regions. $A$ region $R$ is said to be convex if it has the following property: whenever two points ... are produced, but they need not all be convex. All regions are convex but there may be exponentially many of them.
answered
in
Quantitative Aptitude
Jun 22, 2021
914
views
tifr2013
quantitative-aptitude
geometry
cartesian-coordinates
4
answers
23
GATE CSE 2003 | Question: 8, ISRO2009-53
Let $G$ be an arbitrary graph with $n$ nodes and $k$ components. If a vertex is removed from $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
Jun 17, 2021
11.8k
views
gatecse-2003
graph-theory
graph-connectivity
normal
isro2009
6
answers
24
GATE CSE 2013 | Question: 39
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decomposed into two concurrent processes $X$ and $Y$ such that $X$ computes the array $a$ and $Y$ computes the ... EntryY(R, S) { V(S); P(R); } ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }
commented
in
Operating System
Jun 12, 2021
22.0k
views
gatecse-2013
operating-system
process-synchronization
normal
3
answers
25
GATE CSE 1994 | Question: 27
Draw a precedence graph for the following sequential code. The statements are numbered from $S_1$ to $S_6$ $S_1$ read n $S_2$ i := 1 $S_3$ if i > n next $S_4$ a(i) := i+1 $S_5$ i := i+1 $S_6$ next : write a(i) Can this graph be converted to a concurrent program using parbegin-parend construct only?
commented
in
Operating System
Jun 12, 2021
4.5k
views
gate1994
operating-system
process-synchronization
normal
descriptive
2
answers
26
GATE CSE 1988 | Question: 10iib
Given below is solution for the critical section problem of two processes $P_0$ and $P_1$ ... until false Determine of the above solution is correct. If it is incorrect, demonstrate with an example how it violates the conditions.
commented
in
Operating System
Jun 12, 2021
2.4k
views
gate1988
descriptive
operating-system
process-synchronization
9
answers
27
GATE CSE 2004 | Question: 21, ISRO2007-44
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by the instruction set architecture page size number of processes in memory physical memory size
commented
in
Operating System
May 30, 2021
18.6k
views
gatecse-2004
operating-system
virtual-memory
page-replacement
normal
isro2007
2
answers
28
GATE CSE 1997 | Question: 3.5
Locality of reference implies that the page reference being made by a process will always be to the page used in the previous page reference is likely to be to one of the pages used in the last few page references will always be to one of the pages existing in memory will always lead to a page fault
commented
in
Operating System
May 30, 2021
7.1k
views
gate1997
operating-system
page-replacement
easy
3
answers
29
GATE CSE 1995 | Question: 2.7
The address sequence generated by tracing a particular program executing in a pure demand based paging system with $100$ records per page with $1$ free main memory frame is recorded as follows. What is the number of page faults? $0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370$ $13$ $8$ $7$ $10$
commented
in
Operating System
May 30, 2021
11.9k
views
gate1995
operating-system
page-replacement
normal
3
answers
30
GATE CSE 1995 | Question: 5
A computer installation has $1000k$ of main memory. The jobs arrive and finish in the following sequences. Job 1 requiring 200k arrives Job 2 requiring 350k arrives Job 3 requiring 300k arrives Job 1 finishes Job 4 requiring 120k ... arrives Draw the memory allocation table using Best Fit and First Fit algorithms. Which algorithm performs better for this sequence?
commented
in
Operating System
May 29, 2021
6.2k
views
gate1995
operating-system
memory-management
normal
descriptive
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....