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 once_2019
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by once_2019
8
answers
1
GATE CSE 2008 | Question: 63
The $P$ and $V$ operations on counting semaphores, where s is a counting semaphore, are defined as follows: $P(s):$ $s=s-1;$ If $s < 0$ then wait; $V(s):$ $s=s+1;$ If $s \leq0$ then wake up process waiting on s; Assume that $P_b$ and $V_b$ the wait ... $x_b$ and $y_b$ are respectively $0$ and $0$ $0$ and $1$ $1$ and $0$ $1$ and $1$
answered
in
Operating System
Jun 4, 2020
18.8k
views
gatecse-2008
operating-system
normal
semaphore
4
answers
2
GATE CSE 2012 | Question: 36
Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted. Program main; Var ... Procedure A1; Var ... Call A2; End A1 Procedure A2; Var ... Procedure A21; Var ... Call ... The correct set of activation records along with their access links is given by:
commented
in
Compiler Design
Jan 30, 2020
10.2k
views
gatecse-2012
compiler-design
runtime-environment
normal
7
answers
3
GATE CSE 2009 | Question: 47
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low order $32$ bits of the counter of the ToD clock is to be used for the initial sequence numbers ... sequence numbers used for packets of a connection can increase? $0.015$/s $0.064$/s $0.135$/s $0.327$/s
commented
in
Computer Networks
Jan 29, 2020
20.0k
views
gatecse-2009
computer-networks
tcp
difficult
ambiguous
3
answers
4
ISRO2007-29
The set of all Equivalence Classes of a set A of Cardinality C is of cardinality $2^c$ have the same cardinality as A forms a partition of A is of cardinality $C^2$
commented
in
Set Theory & Algebra
Dec 5, 2019
13.3k
views
isro2007
set-theory&algebra
equivalence-class
2
answers
5
ISRO2007-03
The circuit shown in the given figure is a full adder full subtracter shift register decade counter
commented
in
Digital Logic
Dec 5, 2019
5.1k
views
isro2007
digital-logic
digital-circuits
adder
3
answers
6
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
Nov 20, 2019
7.4k
views
gatecse-2014-set1
theory-of-computation
regular-language
normal
13
answers
7
GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$
commented
in
Compiler Design
Dec 2, 2018
19.2k
views
gatecse-2013
compiler-design
parsing
normal
0
answers
8
exam query-UPPCL
There is no option for choice of exam city in uppcl form.On what basis they will allocate centers.Any idea ?
edited
in
Job Queries
Nov 28, 2018
229
views
2
answers
9
GATE CSE 1987 | Question: 1-xix
Study the following program written in a block-structured language: Var x, y:interger; procedure P(n:interger); begin x:=(n+2)/(n-3); end; procedure Q Var x, y:interger; begin x:=3; y:=4; P(y); Write(x) __(1) end; begin x:=7; y:=8; Q; Write(x); ... marked $(1)$ and $(2)$ in the program if the variables are statically scoped? $3, 6$ $6, 7$ $3, 7$ None of the above.
commented
in
Compiler Design
Nov 21, 2018
5.5k
views
gate1987
compiler-design
variable-scope
runtime-environment
13
answers
10
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
Nov 1, 2018
16.1k
views
gatecse-2004
algorithms
time-complexity
normal
4
answers
11
GATE CSE 2015 Set 3 | Question: 22
Consider the following statements. TCP connections are full duplex TCP has no option for selective acknowledgement TCP connections are message streams Only I is correct Only I and III are correct Only II and III are correct All of I, II and III are correct
commented
in
Computer Networks
Oct 13, 2018
9.9k
views
gatecse-2015-set3
computer-networks
tcp
normal
0
answers
12
how long does it take for a bit to travel from the beginning to the end of the network?
Suppose the length of a 10Base5 cable is 2500 m. If the speed of propagation in a thick coaxial cable is 200,000,000 m/s, how long does it take for a bit to travel from the beginning to the end of the network? ... 500 meters? A. 26.5 micro seconds B. 52.5 microseconds C. 47.5 micro seconds D. 37.5 micro seconds
commented
in
Computer Networks
Oct 7, 2018
3.4k
views
computer-networks
1
answer
13
data link layer
An upper-layer packet is split into 5 frames, each of which has an 90% chance of arriving undamaged. If no error control is done by the data link protocol, how many times must the message be sent on average to get the entire thing through? A. 2.1 B. 1.9 C. 1.7 D. 2.4
commented
in
Computer Networks
Oct 7, 2018
524
views
computer-networks
data-link-layer
3
answers
14
GATE CSE 2005 | Question: 62
Consider the following circuit involving a positive edge triggered D FF. Consider the following timing diagram. Let $A_{i}$ represents the logic level on the line $A$ in the $i$-th clock period. Let $A'$ represent the complement of $A$. The correct output sequence on $Y$ ... $A_{1} A_{2} A_{2}' A_{3} A_{4}$ $A_{1} A_{2}' A_{3} A_{4} A_{5}'$
commented
in
Digital Logic
Sep 30, 2018
14.3k
views
gatecse-2005
digital-logic
circuit-output
normal
1
answer
15
GATE CSE 1991 | Question: 03,ix
A link editor is a program that: matches the parameters of the macro-definition with locations of the parameters of the macro call matches external names of one program with their location in other programs matches the parameters of subroutine definition ... call. acts as a link between text editor and the user acts as a link between compiler and the user program
commented
in
Compiler Design
Sep 29, 2018
5.2k
views
gate1991
compiler-design
normal
linker
multiple-selects
5
answers
16
GATE IT 2004 | Question: 21
Which level of locking provides the highest degree of concurrency in a relational database ? Page Table Row Page, table and row level locking allow the same degree of concurrency
commented
in
Databases
Sep 22, 2018
13.3k
views
gateit-2004
databases
normal
transaction-and-concurrency
3
answers
17
GATE CSE 2015 Set 2 | Question: 47
A computer system implements $8\;\text{kilobyte}$ pages and a $32\text{-bit}$ physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is $24\;\text{megabytes}$, the length of the virtual address supported by the system is _______ bits.
commented
in
Operating System
Sep 12, 2018
14.7k
views
gatecse-2015-set2
operating-system
virtual-memory
normal
numerical-answers
4
answers
18
GATE CSE 1989 | Question: 2-iv
Match the pairs in the following: ...
commented
in
Operating System
Sep 2, 2018
11.1k
views
match-the-following
gate1989
operating-system
virtual-memory
4
answers
19
GATE CSE 2003 | Question: 4
Let $A$ be a sequence of $8$ distinct integers sorted in ascending order. How many distinct pairs of sequences, $B$ and $C$ are there such that each is sorted in ascending order, $B$ has $5$ and $C$ has $3$ elements, and the result of merging $B$ and $C$ gives $A$ $2$ $30$ $56$ $256$
commented
in
Combinatory
Aug 28, 2018
10.7k
views
gatecse-2003
combinatory
normal
1
answer
20
data structure
asked
in
Programming
Aug 4, 2018
128
views
data-structures
6
answers
21
GATE CSE 2016 Set 1 | Question: 43
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ ... on every input $L =\{a^n\mid n \geq0 \} \cup \{a^nb^n \mid n \geq 0\}$ and is deterministic context-free
commented
in
Theory of Computation
Jul 15, 2018
13.4k
views
gatecse-2016-set1
theory-of-computation
pushdown-automata
normal
2
answers
22
GATE CSE 1999 | Question: 2.4
If $L1$ is context free language and $L2$ is a regular language which of the following is/are false? $L1-L2$ is not context free $L1 \cap L2$ is context free $\sim L1$ is context free $\sim L2$ is regular
commented
in
Theory of Computation
Jul 15, 2018
9.9k
views
gate1999
theory-of-computation
identify-class-language
normal
multiple-selects
4
answers
23
GATE CSE 2016 Set 1 | Question: 18
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$
commented
in
Theory of Computation
Jul 14, 2018
16.5k
views
gatecse-2016-set1
theory-of-computation
regular-expression
normal
4
answers
24
GATE CSE 2014 Set 1 | Question: 36
Which of the regular expressions given below represent the following DFA? $0^*1(1+00^*1)^* $ $0^*1^*1+11^*0^*1 $ $(0+1)^*1$ I and II only I and III only II and III only I, II and III
commented
in
Theory of Computation
Jul 14, 2018
14.8k
views
gatecse-2014-set1
theory-of-computation
regular-expression
finite-automata
easy
3
answers
25
GATE CSE 1998 | Question: 2.5
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$ is $2$ $5$ $8$ $3$
commented
in
Theory of Computation
Jul 14, 2018
14.5k
views
gate1998
theory-of-computation
finite-automata
normal
minimal-state-automata
3
answers
26
GATE CSE 1998 | Question: 1.10
Which of the following set can be recognized by a Deterministic Finite state Automaton? The numbers $1, 2, 4, 8, \dots 2^n, \dots$ written in binary The numbers $1, 2, 4, 8,\dots 2^n, \dots$ written in unary The set of binary string in which the number of zeros is the same as the number of ones. The set $\{1, 101, 11011, 1110111, \dots\}$
commented
in
Theory of Computation
Jul 14, 2018
12.8k
views
gate1998
theory-of-computation
finite-automata
normal
4
answers
27
GATE CSE 1994 | Question: 2.10
The regular expression for the language recognized by the finite state automaton of figure is ________
commented
in
Theory of Computation
Jul 14, 2018
6.6k
views
gate1994
theory-of-computation
finite-automata
regular-expression
easy
fill-in-the-blanks
1
answer
28
logic and predicate
commented
in
Mathematical Logic
Jul 14, 2018
239
views
1
answer
29
regular expressions
commented
in
Theory of Computation
Jul 8, 2018
283
views
theory-of-computation
regular-expression
12
answers
30
GATE IT 2007 | Question: 29
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$
commented
in
DS
Jul 8, 2018
32.1k
views
gateit-2007
data-structures
binary-search-tree
normal
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
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
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...
@Aakash_Bhardwaj all the best bro . For your...