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 pradeepdeepu
1
answer
1
operating system
Suppose $10$ processes $P_1$ to $P_{10}$ share $7$ identical resource units which can be reserved and release $1$ at a time the maximum resource requirement of a processs $P_i$ is $S_P$ where $S_P$ is greater then $0$. The maximum value of $S_i\left(\displaystyle{\sum_{i=1}^{10}S_P}\right)$ that ensures deadlock does not occurs is ________ .
Suppose $10$ processes $P_1$ to $P_{10}$ share $7$ identical resource units which can be reserved and release $1$ at a time the maximum resource requirement of a process...
350
views
commented
Feb 2, 2018
Operating System
operating-system
+
–
0
answers
2
OS pagetable
206
views
commented
Jan 30, 2018
2
answers
3
Concatenation: REG / REC / DCFL / CFL?
Let A is the language where no of 'a' is greater than no of 'b' and B is the language where no of 'b' is greater than no of ‘a’ the language A.B is ______________ a. Regular b. DCFL but not Regular c. CFL but not DCFL d. REC but not DCFL
Let A is the language where no of 'a' is greater than no of 'b' and B is the language where no of 'b' is greater than no of ‘a’ the language A.B is ______________a. R...
1.2k
views
answered
Jan 29, 2018
Theory of Computation
theory-of-computation
regular-expression
dcfl
context-free-language
+
–
0
answers
4
minimum spanning trees
395
views
commented
Jan 29, 2018
0
answers
5
Stack
Consider a stack and we wish to perform an operation StackDelete() in which we wish to delete all the elements of the stack .What is the worst case time complexity of doing this if stack is implemented: 1) Using an array 2)Using a Linked list
Consider a stack and we wish to perform an operation StackDelete() in which we wish to delete all the elements of the stack .What is the worst case time complexity of doi...
761
views
commented
Dec 26, 2017
Programming in C
data-structures
stack
+
–
1
answer
6
TOC Chomsky Classification
Consider the grammar below: G: S → AaBC BC → ε aB →aaB A → ε Which of the following is TRUE?( Marks: -0.33 ) G is Type 2 G is Type 3 G is Type 1 G is Type 0
Consider the grammar below:G: S → AaBCBC → εaB →aaBA → εWhich of the following is TRUE?( Marks: -0.33 ) G is Type 2 G is Type 3 G is Type 1 G is Type 0
807
views
answered
Dec 23, 2017
1
answer
7
computer networks
517
views
answered
Dec 23, 2017
0
answers
8
DBMS SQL
290
views
commented
Dec 23, 2017
2
answers
9
# made easy demo test #Q 60
327
views
answered
Dec 23, 2017
0
answers
10
Graph coloring
I think answer is option A. But given option B.
I think answer is option A. But given option B.
389
views
asked
Dec 22, 2017
0
answers
11
#regular language
If L=Σ* then is this regular language finite or infinite??
If L=Σ* then is this regular language finite or infinite??
349
views
commented
Nov 20, 2017
2
answers
12
2NF decomposition
How is it option D??
How is it option D??
3.6k
views
commented
Nov 20, 2017
Databases
database-normalization
2nf
databases
decomposition
+
–
1
answer
13
cache
A cache has hit ration 0.95, 64 byte lines , having cache hit latency of 5ns. The main memory takes 90ns to return the first word(16 bits) of a line and 10ns to return each subsequent word . The time needed when cache miss happens is _____(nsec) (Assume ... time to write line into cache once it has been fetched from main memory and to detect cache miss time needed same as cache hit time)
A cache has hit ration 0.95, 64 byte lines , having cache hit latency of 5ns. The main memory takes 90ns to return the first word(16 bits) of a line and 10ns to return ea...
988
views
answer edited
Nov 18, 2017
1
answer
14
Transaction Management
Which of the following protocols does not ensure conflict serializability and safety from deadlocks? Graph based protocols Two-phase locking protocol Time-stamp ordering protocol Both a & b
Which of the following protocols does not ensure conflict serializability and safety from deadlocks?Graph based protocolsTwo-phase locking protocolTime-stamp ordering pro...
1.6k
views
comment edited
Nov 18, 2017
Databases
transaction-and-concurrency
databases
+
–
1
answer
15
Compiler
First {a} =? First{a, b} =? First{a, b, c} =? First {a, $} =? Where a, b, c are terminals.
First {a} =?First{a, b} =?First{a, b, c} =?First {a, $} =?Where a, b, c are terminals.
353
views
answered
Nov 18, 2017
Compiler Design
compiler-design
parsing
first-and-follow
descriptive
+
–
1
answer
16
Inherited Language confusion
How is it opt C and not opt A ?
How is it opt C and not opt A ?
597
views
answered
Nov 18, 2017
Compiler Design
compiler-design
inherently-ambiguous
ace-test-series
+
–
2
answers
17
DFS , how to slove it?
1.5k
views
answered
Nov 18, 2017
DS
depth-first-search
algorithms
graph-algorithms
+
–
1
answer
18
Application layer Protocol
Which of the following is/are stateful application layer protocol? (i) HTTP (ii) FTP (iii) TCP (iv) POP3
Which of the following is/are stateful application layer protocol?(i) HTTP(ii) FTP(iii) TCP(iv) POP3
1.1k
views
commented
Nov 18, 2017
Computer Networks
computer-networks
+
–
4
answers
19
Made Easy Test series, GATE2018
1.3k
views
answer edited
Nov 18, 2017
Databases
databases
er-diagram
database-normalization
+
–
1
answer
20
Backtracking
Here , Number of backtracks are 3 or 4 ? I am getting 3 but given answer is 4. Please explain.
Here , Number of backtracks are 3 or 4 ? I am getting 3 but given answer is 4. Please explain.
404
views
commented
Nov 18, 2017
Compiler Design
compiler-design
parsing
numerical-answers
test-series
+
–
1
answer
21
MadeEasy Subject Test: Theory of Computation - Regular Languages
a)every regular languahe on alphabet{0} has the form C^mx+b where m and b are positive integer constants and 0<=X<=infinite b) A language on alphabet {0} defined by L={0^n ,n is a multiple of 3 } is regular c) the language {0^m 1^n ; n= 100-m } is regular. which is false answr is c ??? i think c also regular
a)every regular languahe on alphabet{0} has the form C^mx+b where m and b are positive integer constants and 0<=X<=infiniteb) A language on alphabet {0} defined by L={0^n...
257
views
answered
Nov 18, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
+
–
1
answer
22
Order Of Evaluation
What is the output generated by this code? main(){ int i=0; printf("%d %d %d %d %d %d %d", i++, ++i, i, i++, i, ++i, i++); } 4 4 3 2 2 2 0 4 5 5 2 5 5 0 0 2 2 2 2 4 4 Compiler Dependent
What is the output generated by this code?main(){ int i=0; printf("%d %d %d %d %d %d %d", i++, ++i, i, i++, i, ++i, i++); }4 4 3 2 2 2 04 5 5 2 5 5 00 2 2 2 2 4 4Compiler...
1.1k
views
answered
Nov 18, 2017
Programming in C
programming-in-c
+
–
6
answers
23
GATE CSE 2002 | Question: 2.19
To evaluate an expression without any embedded function calls One stack is enough Two stacks are needed As many stacks as the height of the expression tree are needed A Turing machine is needed in the general case
To evaluate an expression without any embedded function callsOne stack is enoughTwo stacks are neededAs many stacks as the height of the expression tree are neededA Turin...
10.1k
views
answer edited
Nov 17, 2017
Compiler Design
gatecse-2002
compiler-design
expression-evaluation
easy
+
–
1
answer
24
Gate academy
Suppose that we have a hash table with n slots with collisions resolved by chaining. Suppose that n keys are inserted into the table What is the probability of k keys being mapped to a single slot. Each key is equally likely to be hashed to each slot. Find the probability P(k) that exactly k keys hash into ... 1- 1/n)^(n-k) * nCk (C) (1/k)^k * (1-1/k)^(n-k) * nCk (D) None of the above
Suppose that we have a hash table with n slots with collisions resolved by chaining. Suppose that n keys are inserted into the table What is the probability of k keys bei...
1.1k
views
answer edited
Nov 17, 2017
Programming in C
hashing
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register