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
Answers by Bikram
20
votes
81
Deadlock
A computer system has 6 tape drives with n processes competing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is a) 1 b) 2 c) 3 d)4 Ans given is 2....But for 4 processes ... process...so continuing in this way we can allocate resources to each process without any deadlock...... Plz explain why answer given is b)
A computer system has 6 tape drives with n processes competing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to...
37.6k
views
answered
Aug 17, 2017
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
13
votes
82
GATE CSE 2007 | Question: 58
Two processes, $P1$ and $P2$, need to access a critical section of code. Consider the following synchronization construct used by the processes: /* P1 */ while (true) { wants1 = true; while (wants2 == true); /* Critical ... waiting. It requires that processes enter the critical section in strict alteration. It does not prevent deadlocks, but ensures mutual exclusion.
Two processes, $P1$ and $P2$, need to access a critical section of code. Consider the following synchronization construct used by the processes:/* P1 */ while (true) { wa...
27.7k
views
answered
Aug 16, 2017
Operating System
gatecse-2007
operating-system
process-synchronization
normal
+
–
2
votes
83
Test by Bikram | Theory of Computation | Test 2 | Question: 21
A problem $X$ is reducible to problem $Y$ in polynomial time. All the problems in NP can also be reduced to problem $X$. Then, which of the following statements are true? S1 : $X$ is NP complete and $Y$ is in NP. S2 : $X$ is NP complete and ... hard. S4 : $X$ and $Y$ are NP hard. S4 only S1, S2 & S3 S3 & S4 S1, S2, S3 & S4
A problem $X$ is reducible to problem $Y$ in polynomial time. All the problems in NP can also be reduced to problem $X$. Then, which of the following statements are true?...
691
views
answered
Aug 16, 2017
Theory of Computation
tbb-toc-2
p-np-npc-nph
theory-of-computation
reduction
+
–
2
votes
84
Data structure
Which is good book for data structure for GATE?
Which is good book for data structure for GATE?
1.0k
views
answered
Aug 13, 2017
6
votes
85
Scheduling algorithm
Which of the following Algorithm favour CPU bound Bound process ? 1) RR 2) FCFS 3) Multilevel feedback queue option are : a) 1 only b) 2 only c) 1 and 2 only d) 1 and 3 only
Which of the following Algorithm favour CPU bound Bound process ?1) RR 2) FCFS 3) Multilevel feedback queueoption are : a) 1 onlyb) 2 onlyc) 1 and 2 onlyd) 1 and 3 ...
10.2k
views
answered
Aug 13, 2017
Operating System
process-scheduling
+
–
0
votes
86
Test by Bikram | Theory of Computation | Test 2 | Question: 25
Which of the following are regular? $\{aba^R \mid a,b \in \{0,1\}^+ \}$ $\{aba \mid a,b \in \{0,1\}^* \}$ $\{aba^R \mid b,a \in \{0,1\}^* \text{ and } \mid b \mid = 10 \}$ (i) and (iii) only (i) and (ii) only (i) only (ii) and (iii) only
Which of the following are regular?$\{aba^R \mid a,b \in \{0,1\}^+ \}$ $\{aba \mid a,b \in \{0,1\}^* \}$$\{aba^R \mid b,a \in \{0,1\}^* \text{ and } \mid b \mid = 10 \...
460
views
answered
Aug 12, 2017
Theory of Computation
tbb-toc-2
theory-of-computation
regular-language
+
–
3
votes
87
Test by Bikram | Theory of Computation | Test 2 | Question: 5
Given two regular expressions: $p = (0^* 1^* )^*$ and $q = 0^* + 1^* + 0^*1 + 10^*$ The length of the smallest string that is present in the language corresponding to regular expression ‘$p$’ and not present in the language corresponding to regular expression ‘$q$’ is ________.
Given two regular expressions:$p = (0^* 1^* )^*$ and $q = 0^* + 1^* + 0^*1 + 10^*$The length of the smallest string that is present in the language corresponding to reg...
674
views
answered
Aug 12, 2017
Theory of Computation
tbb-toc-2
numerical-answers
theory-of-computation
regular-expression
+
–
1
votes
88
Test by Bikram | Theory of Computation | Test 2 | Question: 4
Which of the following statements is FALSE? Recursive Enumerable Languages are not closed under set difference and complementation. Complement of context-free language must be recursive. If a problem $X$ is NP complete and $X \in P,$ then $NP = P$. Membership problem is not decidable for Recursive Languages.
Which of the following statements is FALSE?Recursive Enumerable Languages are not closed under set difference and complementation.Complement of context-free language must...
453
views
answered
Aug 12, 2017
Theory of Computation
tbb-toc-2
theory-of-computation
closure-property
p-np-npc-nph
+
–
5
votes
89
ternary relationship
Consider the following ER diagram: If A has 100 entities, B has 1000 entities, and C has 10 entities, what is the maximum number of triples of entities that could be in the relationship set for R?
Consider the following ER diagram:If A has 100 entities, B has 1000 entities, and C has 10 entities, what is the maximum number of triples of entities that could be in th...
6.9k
views
answered
Aug 11, 2017
Databases
ternary-relationship
+
–
3
votes
90
what should be the space complexity of this , did not find any proper explanation on internet for space complexity
int sum(int A[], int n) { int sum = 0, i; for(i = 0; i < n; i++) sum = sum + A[i]; return sum; }
3.6k
views
answered
Aug 10, 2017
0
votes
91
Number of bits
A computer system has a main memory consisting of 1 M 16 bit words. It also has a 4 way set associative cache of size 4 K words and 64 words per block. The number of tag bits are _______.
A computer system has a main memory consisting of 1 M 16 bit words. It also has a 4 way set associative cache of size 4 K words and 64 words per block. The number of tag ...
1.3k
views
answered
Aug 10, 2017
CO and Architecture
co-and-architecture
+
–
37
votes
92
GATE CSE 1994 | Question: 14a
Consider $B^+$ - tree of order $d$ shown in figure. (A $B^+$ - tree of order $d$ contains between $d$ and $2d$ keys in each node) Draw the resulting $B^+$ - tree after $100$ is inserted in the figure below.
Consider $B^+$ - tree of order $d$ shown in figure. (A $B^+$ - tree of order $d$ contains between $d$ and $2d$ keys in each node)Draw the resulting $B^+$ - tree after $10...
7.4k
views
answered
Aug 10, 2017
Databases
gate1994
databases
b-tree
normal
descriptive
+
–
1
votes
93
Grammar
316
views
answered
Aug 9, 2017
Theory of Computation
theory-of-computation
grammar
+
–
1
votes
94
TOC RE REC
A RE language can also be called as Turing Recognizable,Turing Acceptable or Turing Enumerable. And REC can be called as Turing Decidable. Now When we say that a language is Turing Computable, Strictly what we could say that it is RE or REC? (Ofcourse if it is REC then it is RE also) PS : It would be great if you could provide some reliable source for it.
A RE language can also be called as Turing Recognizable,Turing Acceptable or Turing Enumerable.And REC can be called as Turing Decidable.Now When we say that a language i...
2.4k
views
answered
Aug 9, 2017
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
2
votes
95
I want to be an ML researcher but don't have any guidance and don't have money for coaching?
826
views
answered
Aug 9, 2017
Others
preparation
machine-learning
general
+
–
4
votes
96
Nielit Scientific Assistant
I am preparing for Nielit Scientific Assistant. Please suggest me which book should I refer for its preparation. Also what type of question are generally asked in this exam.
I am preparing for Nielit Scientific Assistant. Please suggest me which book should I refer for its preparation. Also what type of question are generally asked in this ex...
4.1k
views
answered
Aug 9, 2017
0
votes
97
can gate overflow conduct quiz for gate exam?
179
views
answered
Aug 9, 2017
2
votes
98
gate 2018
can you please say which IIT'S conduct interviews for Mtech CSE admissions?
can you please say which IIT'S conduct interviews for Mtech CSE admissions?
932
views
answered
Aug 9, 2017
1
votes
99
Go back protocol
Consider a scenario of GO-BACK-4 protocol with 10 bits sequence numbers. Assume that s is the sequence number of subsequent packet at time t0, Then what can be the possible range of window size at sender. Note: medium does not change the order of packets. [s-9, s-1] [s-4, s-9] [s-4, s] [s, s+3]
Consider a scenario of GO-BACK-4 protocol with 10 bits sequence numbers. Assume that s is the sequence number of subsequent packet at time t0, Then what can be the possib...
1.1k
views
answered
Aug 8, 2017
Computer Networks
go-back-n
+
–
0
votes
100
GBN protocol
Consider the GBN protocol with a sender window size of 4 and a sequence number range of 1,024. Suppose that at time t, the next in-order packet that the receiver is expecting has a sequence number of k. Assume that the medium does not reorder messages. What are all possible values of ... messages currently propagating back to the sender at time t? k-5 → k-1 k-4 → k-1 k-5 → k k-4 → k
Consider the GBN protocol with a sender window size of 4 and a sequence number range of 1,024. Suppose that at time t, the next in-order packet that the receiver is expec...
6.5k
views
answered
Aug 8, 2017
Computer Networks
computer-networks
go-back-n
+
–
1
votes
101
Addressing Modes
Is Displacement mode and base register mode both are same?? in register direct mode we access operand from register directly in register indirect mode we access operand from visiting register + visiting inside register(here register is treated as effective ... register address mode and indirect address mode if I am wrong please let me correct with giving the proper explanation.
Is Displacement mode and base register mode both are same??in register direct mode we access operand from register directlyin register indirect mode we access operand fro...
1.0k
views
answered
Aug 7, 2017
3
votes
102
Practice Question_Addressing Modes
1.4k
views
answered
Aug 7, 2017
CO and Architecture
addressing-modes
co-and-architecture
practice-question
+
–
4
votes
103
Paging Operating Systems
3.5k
views
answered
Aug 7, 2017
CO and Architecture
paging
operating-system
+
–
0
votes
104
Co: What is right from below ? Plz Explain with example
a:- There are many instructions in a word b:- There are many word in a instruction
a:- There are many instructions in a wordb:- There are many word in a instruction
328
views
answered
Aug 7, 2017
CO and Architecture
co-and-architecture
+
–
42
votes
105
GATE CSE 2002 | Question: 1.9
A device employing INTR line for device interrupt puts the CALL instruction on the data bus while: $\overline{INTA}$ is active HOLD is active READY is inactive None of the above
A device employing INTR line for device interrupt puts the CALL instruction on the data bus while:$\overline{INTA}$ is activeHOLD is activeREADY is inactiveNone of the ab...
10.0k
views
answered
Aug 7, 2017
CO and Architecture
gatecse-2002
co-and-architecture
interrupts
normal
+
–
7
votes
106
computer network Subnet Mask
A class C network is assigned with a subnet mask of 255.255.255.248 . The total number of hosts possible in all the sub networks together in the above network is ....... Please help me to find the answer...
A class C network is assigned with a subnet mask of 255.255.255.248 . The total number of hosts possible in all the sub networks together in the above network is .......P...
6.5k
views
answered
Aug 6, 2017
Computer Networks
subnetting
computer-networks
+
–
2
votes
107
turing machine
http://www.radford.edu/~nokie/classes/420/Chap3-Langs.html
http://www.radford.edu/~nokie/classes/420/Chap3-Langs.html
278
views
answered
Aug 6, 2017
Theory of Computation
theory-of-computation
+
–
18
votes
108
GATE CSE 2013 | Question: 10
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates the process priorities every $T$ time units and decides the next process ... is equivalent to the shortest-job-first algorithm. This algorithm is equivalent to the shortest-remaining-time-first algorithm.
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates th...
28.8k
views
answered
Aug 4, 2017
Operating System
gatecse-2013
operating-system
process-scheduling
normal
+
–
3
votes
109
switching technique
1.3k
views
answered
Jul 31, 2017
Page:
« prev
1
2
3
4
5
6
7
8
...
20
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register