Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by jenny101
7
answers
1
GATE CSE 2017 Set 1 | Question: 18
Threads of a process share global variables but not heap heap but not global variables neither global variables nor heap both heap and global variables
Threads of a process shareglobal variables but not heapheap but not global variablesneither global variables nor heapboth heap and global variables
17.2k
views
answered
Feb 12, 2017
Operating System
gatecse-2017-set1
operating-system
threads
+
–
15
answers
2
GATE CSE 2017 Set 1 | Question: 22
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet $\{a,b\}$. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting $L$ is ___________ .
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet $\{a,b\}$. The smallest number of states needed in a deterministic finite-...
29.3k
views
commented
Feb 12, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
finite-automata
numerical-answers
minimal-state-automata
+
–
3
answers
3
gate 2017 cs just doubt
does Random page replacement algorithm suffers from belady's anomaly?
does Random page replacement algorithm suffers from belady's anomaly?
3.2k
views
answered
Feb 11, 2017
1
answer
4
sorting
571
views
answer selected
Dec 13, 2016
Algorithms
sorting
algorithms
test-series
+
–
1
answer
5
trees
623
views
answer selected
Dec 10, 2016
DS
binary-tree
+
–
1
answer
6
number of distinct binary search trees
The answer is given as 14.I calculated using Catalan number but the answer did not come as 14.
The answer is given as 14.I calculated using Catalan number but the answer did not come as 14.
692
views
asked
Dec 9, 2016
Programming and DS
binary-tree
+
–
1
answer
7
nfa theory of computation
The answer to this question is given as 6.
The answer to this question is given as 6.
486
views
commented
Dec 6, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
2
answers
8
regular language or not
858
views
commented
Dec 6, 2016
Theory of Computation
theory-of-computation
regular-language
+
–
1
answer
9
theory of compuation prefixes
411
views
commented
Dec 6, 2016
Theory of Computation
theory-of-computation
+
–
1
answer
10
type of languages
Select the regular languages from a list of given languages: 1)Strings over alphabet {0,1,2,3...9} where final digit has not appeared before. 2)strings that contain substring of the form wcw where w belongs to {0,1}+ and c belongs to {0,1}*
Select the regular languages from a list of given languages:1)Strings over alphabet {0,1,2,3...9} where final digit has not appeared before.2)strings that contain substr...
1.8k
views
asked
Dec 6, 2016
Theory of Computation
theory-of-computation
regular-language
+
–
2
answers
11
Heaps
1.1k
views
answer selected
Oct 26, 2016
DS
data-structures
binary-heap
+
–
1
answer
12
Shortest path length
582
views
answer selected
Oct 26, 2016
Algorithms
graph-algorithms
shortest-path
test-series
+
–
1
answer
13
matrix multiplication
1.1k
views
answer selected
Oct 26, 2016
Algorithms
matrix
algorithms
matrix-chain-ordering
+
–
1
answer
14
time complexity
The recurrence equation $T(1) = 1$ $T(n) = 2T(n-1) + n, n \geq 2$ evaluates to $a.2^{n+1} - bn - c$, what is the value of $100a+ 10b+c$?
The recurrence equation$T(1) = 1$$T(n) = 2T(n-1) + n, n \geq 2$evaluates to $a.2^{n+1} - bn - c$, what is the value of $100a+ 10b+c$?
506
views
asked
Oct 26, 2016
Algorithms
time-complexity
algorithms
recurrence-relation
+
–
2
answers
15
shortest path
1.2k
views
asked
Oct 26, 2016
Algorithms
shortest-path
graph-algorithms
algorithms
test-series
+
–
1
answer
16
Huffman Encoding
2.5k
views
asked
Oct 26, 2016
Algorithms
huffman-code
algorithms
test-series
+
–
2
answers
17
GATE Overflow | Operating Systems | Test 1 | Question: 12
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is - $e^-{15}$ $e^{-5}$ $1 - e^{-5}$ $1-e^{-10}$
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is -$e^-...
761
views
commented
Oct 22, 2016
Operating System
go-os-1
operating-system
resource-allocation
+
–
10
answers
18
GATE CSE 2005 | Question: 82a
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all those edges that ... of $G$ the weighted shortest path from $s$ to $t$ each path from $s$ to $t$ the weighted longest path from $s$ to $t$
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$...
12.8k
views
commented
Oct 16, 2016
Algorithms
gatecse-2005
algorithms
graph-algorithms
normal
+
–
3
answers
19
GATE Overflow | Operating Systems | Test 1 | Question: 13
In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is 100 ns 68.0 ns 68.5 ns 78.5 ns
In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is 100 ns. The time required to access a page in primary memory is 1...
855
views
commented
Oct 12, 2016
Operating System
go-os-1
virtual-memory
paging
+
–
1
answer
20
os multilevel paging
I am not able to understand the concept of multilevel paging.plz can someone tell what is stored in 1st level and 2nd level page table and how do we access it??
I am not able to understand the concept of multilevel paging.plz can someone tell what is stored in 1st level and 2nd level page table and how do we access it??
853
views
asked
Jul 25, 2016
Operating System
multilevel
paging
+
–
1
answer
21
What are the wrong answers in ISRO 2016 official key?
ISRO official key is released on 06 July 2016 What are the wrong answers in ISRO 2016 official key? Just comment here. According to ISRO "CANDIDATES MAY RAISE OBJECTIONS TO THE ANSWER KEYS, IF ANY, WITH ... ARE RAISED.OBJECTIONS RECEIVED WITHOUT VALID JUSTIFICATIONS AND OBJECTIONS RECEIVED AFTER 14.07.2016 WILL NOT BE CONSIDERED."
ISRO official key is released on 06 July 2016What are the wrong answers in ISRO 2016 official key?Just comment here.According to ISRO"CANDIDATES MAY RAISE OBJECTIONS TO T...
2.5k
views
commented
Jul 8, 2016
Unknown Category
isro2016
+
–
7
answers
22
ISRO2011-55
There are three processes in the ready queue. When the currently running process requests for I/O how many process switches take place? 1 2 3 4
There are three processes in the ready queue. When the currently running process requests for I/O how many process switches take place?1234
7.2k
views
commented
Jun 29, 2016
Operating System
isro2011
operating-system
process
+
–
2
answers
23
ISRO2007-54
BCNF is not used for cases where a relation has Two (or more) candidate keys Two candidate keys and composite The candidate key overlap Two mutually exclusive foreign keys
BCNF is not used for cases where a relation hasTwo (or more) candidate keysTwo candidate keys and compositeThe candidate key overlapTwo mutually exclusive foreign keys
8.0k
views
commented
Jun 25, 2016
Databases
isro2007
databases
database-normalization
+
–
4
answers
24
ISRO2014-47
The following three 'C' language statements is equivalent to which single statement? y=y+1; z=x+y; x=x+1 z = x + y + 2; z = (x++) + (++y); z = (x++) + (y++); z = (x++) + (++y) + 1;
The following three 'C' language statements is equivalent to which single statement?y=y+1; z=x+y; x=x+1z = x + y + 2;z = (x++) + (++y);z = (x++) + (y++);z = (x++) + (++y)...
5.0k
views
asked
Jun 25, 2016
Programming in C
isro2014
programming-in-c
+
–
2
answers
25
ISRO2007-03
The circuit shown in the given figure is a full adder full subtracter shift register decade counter
The circuit shown in the given figure is afull adderfull subtractershift registerdecade counter
6.0k
views
commented
Jun 24, 2016
Digital Logic
isro2007
digital-logic
digital-circuits
adder
+
–
4
answers
26
ISRO2014-27
How many different $\text{BCD}$ numbers can be stored in $12$ switches ? (Assume two position or on-off switches). $2^{12}$ $2^{12}-1$ $10^{12}$ $10^3$
How many different $\text{BCD}$ numbers can be stored in $12$ switches ? (Assume two position or on-off switches).$2^{12}$$2^{12}-1$$10^{12}$$10^3$
6.4k
views
answer selected
Jun 24, 2016
Digital Logic
isro2014
digital-logic
number-representation
+
–
9
answers
27
GATE CSE 2005 | Question: 61
Consider line number $3$ of the following C-program. int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ } Identify the compiler’s response about this line while creating the object-module: No compilation error Only a lexical error Only syntactic errors Both lexical and syntactic errors
Consider line number $3$ of the following C-program.int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ }Identify the compiler’s response ab...
21.7k
views
commented
Jun 24, 2016
Compiler Design
gatecse-2005
compiler-design
compilation-phases
normal
+
–
1
answer
28
which of the following is correct with respect to two phase commit protocol
2.0k
views
answered
Jun 23, 2016
3
answers
29
ISRO2009-32
The expression $1 * 2 \wedge 3 * 4 \wedge 5 * 6$ will be evaluated as $32^{30}$ $162^{30}$ 49152 173458 In original quetion 5 is not given.
The expression $1 * 2 \wedge 3 * 4 \wedge 5 * 6$ will be evaluated as$32^{30}$$162^{30}$49152173458In original quetion 5 is not given.
3.0k
views
answer selected
Jun 21, 2016
Compiler Design
isro2009
compiler-design
expression-evaluation
+
–
1
answer
30
ISRO2011-4
The following table shows the processes in the ready queue and time required for each process for completing its job. Process Time $P_1$ 10 $P_2$ 5 $P_3$ 20 $P_4$ 8 $P_5$ 15 If round-robin scheduling with 5 ms is used what is the average waiting time of the processes in the queue? 27 ms 26.2 ms 27.5 ms 27.2 ms
The following table shows the processes in the ready queue and time required for each process for completing its job.ProcessTime$P_1$10$P_2$5$P_3$20$P_4$8$P_5$15If round-...
4.8k
views
answer selected
Jun 20, 2016
Operating System
isro2011
operating-system
process-scheduling
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register