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 Tendua
0
votes
181
What is counting method for free space management ?
How to solve the above ques ?
How to solve the above ques ?
1.6k
views
answered
Oct 17, 2015
2
votes
182
Efficiency of token ring under delayed token release/ early token release/ intermediate token release
Compute utilization of token ring LAN where all stations are queued to send. Given the following parameters:ring length=5000 metressignal propagation=5 ns/mno. of station...
1.3k
views
answered
Oct 16, 2015
3
votes
183
Memory management
On a system using fixed partition with sizes 2^8, 2^16, 2^24, 2^32 and 2 ^ 64. How many bits must the limit register have ? a) 16 bits b)24 bits c)32 bits d) 64 bits
On a system using fixed partition with sizes 2^8, 2^16, 2^24, 2^32 and 2 ^ 64. How many bits must the limit register have ?a) 16 bitsb)24 bitsc)32 bitsd) 64 bits
4.3k
views
answered
Oct 14, 2015
Operating System
memory-management
+
–
0
votes
184
why is the below state although being unsafe not leading to deadlock ?
I got the state to be unsafe since Available is (1,1) which can't satisfy the need of any process so why is not deadlock ?
I got the state to be unsafe since Available is (1,1) which can't satisfy the need of any process so why is not deadlock ?
881
views
answered
Oct 14, 2015
Operating System
resource-allocation
+
–
1
votes
185
FIFO belady anamoly
Is it always true that FIFO will suffer from Belady Anamoly when i increase the frame number allocate from k to k + 1 .or it depends upon the reference string also ?
Is it always true that FIFO will suffer from Belady Anamoly when i increase the frame number allocate from k to k + 1 .or it depends upon the reference string also ?
546
views
answered
Oct 14, 2015
Operating System
memory-management
+
–
1
votes
186
what is the logic in calculating the minimum no of resources to remove deadlock ?If
If I have 10 processes and each process wants 3 resources so now usually we first calculate the maximum no of resources so that there is deadlock by assigning one resource less than the maximum need of the resource and then ... then add 1 to it =12 ,this would remove deadlock , what is the mistake in this logic ?
If I have 10 processes and each process wants 3 resources so now usually we first calculate the maximum no of resources so that there is deadlock by assigning one resourc...
6.6k
views
answered
Oct 12, 2015
Operating System
deadlock-prevention-avoidance-detection
+
–
20
votes
187
ISRO2015-18
Given a block can hold either $3$ records or $10$ key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index $13n/30$ $n/3$ $n/10$ $n/30$
Given a block can hold either $3$ records or $10$ key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index$1...
7.6k
views
answered
Oct 12, 2015
Databases
isro2015
databases
indexing
+
–
0
votes
188
which of the following statements about a group are true?
1.If a group has an odd number of elements then there exists no element which is inverse of itself. 2.If a group contains even no of elements then there exists only one element which is inverse of itself. I am confused that if I ... so then in the case where the group has even no of elements then can't we argue in the similar fashion .
1.If a group has an odd number of elements then there exists no element which is inverse of itself. 2.If a group contains even no of elements then there exists only one e...
2.6k
views
answered
Oct 12, 2015
0
votes
189
which address is this physical or logical?
613
views
answered
Oct 9, 2015
0
votes
190
How many number of possible relations in a antisymmetric set?
I just want to know how the value in the answers come like 2^n2 and 2^n^2-1 etc. Please make it clear.
I just want to know how the value in the answers come like 2^n2 and 2^n^2-1 etc. Please make it clear.
5.4k
views
answered
Oct 9, 2015
Set Theory & Algebra
set-theory
set-theory&algebra
relations
+
–
0
votes
191
What is the output of the following C code?
int main (){ int a=5,b=3; printf("%d", a+++++b); // 5 +'s } Please Explain.
int main (){ int a=5,b=3; printf("%d", a+++++b); // 5 +'s }Please Explain.
1.2k
views
answered
Oct 7, 2015
Programming in C
programming-in-c
+
–
19
votes
192
TIFR CSE 2010 | Part B | Question: 22
Let $L$ consist of all binary strings beginning with a $1$ such that its value when converted to decimal is divisible by $5$. Which of the following is true? $L$ ... deterministic push-down automaton but not by a deterministic push-down automaton. $L$ cannot be recognized by any push-down automaton.
Let $L$ consist of all binary strings beginning with a $1$ such that its value when converted to decimal is divisible by $5$. Which of the following is true?$L$ can be re...
2.1k
views
answered
Oct 5, 2015
Theory of Computation
tifr2010
theory-of-computation
identify-class-language
+
–
3
votes
193
TIFR CSE 2010 | Part B | Question: 23
Suppose you are given $n$ numbers and you sort them in descending order as follows: First find the maximum. Remove this element from the list and find the maximum of the remaining elements, remove this element, and so on, until all elements are exhausted. How many comparisons ... $O\left ( n^{1.5} \right )$ but not better.
Suppose you are given $n$ numbers and you sort them in descending order as follows:First find the maximum. Remove this element from the list and find the maximum of the r...
5.0k
views
answered
Oct 5, 2015
Algorithms
tifr2010
algorithms
time-complexity
sorting
+
–
1
votes
194
ISRO2008-7
Consider the grammar $S \rightarrow ABCc \mid bc$ $BA \rightarrow AB$ $Bb \rightarrow bb$ $Ab \rightarrow ab$ $Aa \rightarrow aa$ Which of the following sentences can be derived by this grammar? abc aab abcc abbc
Consider the grammar$S \rightarrow ABCc \mid bc$$BA \rightarrow AB$$Bb \rightarrow bb$$Ab \rightarrow ab$$Aa \rightarrow aa$Which of the following sentences can be derive...
10.1k
views
answered
Oct 4, 2015
Theory of Computation
isro2008
theory-of-computation
context-free-language
grammar
+
–
5
votes
195
Difference between relocatable machine code and absolute machine code!!!1
Difference between relocatable machine code and absolute machine code!!!1
Difference between relocatable machine code and absolute machine code!!!1
11.2k
views
answered
Oct 4, 2015
Compiler Design
compiler-design
intermediate-code
+
–
2
votes
196
Find out the min and max no. of page faults.
A process having access to f frames(initially all empty) makes m memory accesses to p distinct pages.What are the max and min. no. of page faults that will occur?
A process having access to f frames(initially all empty) makes m memory accesses to p distinct pages.What are the max and min. no. of page faults that will occur?
2.1k
views
answered
Oct 4, 2015
4
votes
197
Why is there a need for Tree-based indexing mechanisms ?
In DBMS, why is there a need for the use of tree based indexing algorithms, when we have multilevel indexes available for use ?
In DBMS, why is there a need for the use of tree based indexing algorithms, when we have multilevel indexes available for use ?
721
views
answered
Oct 4, 2015
Databases
databases
b-tree
+
–
0
votes
198
the minimum number of two input NAND gate required to realize one AND gate is (complemented inputs is not available).
options are 1234
1.8k
views
answered
Oct 4, 2015
Digital Logic
digital-logic
min-no-gates
+
–
0
votes
199
Combination of 4 Letter in MATHEMATICS?
The given word is MATHEMATICS which can be arranged in different ways by taking some or all the letters used in the word. the number of words that can be formed by taking 4 letters at a time out of the letters of the given word.
The given word is MATHEMATICS which can be arranged in different ways by taking some or all the letters used in the word.the number of words that can be formed by taking ...
2.5k
views
answered
Oct 3, 2015
Combinatory
combinatory
+
–
0
votes
200
functions -which of following is false
Let A={x|x∈R and x!=2} and B={x|x∈R and x!=1} define f:A->B and g:B->A by f(x)=x/(x-2) and g(x)=2x/(x-1) then which of following is false? 1)f∘g=g∘f 2)f∘g=Ib Ib is identity function on set B 3)f=g-1 4) f∘g is bijection
Let A={x|x∈R and x!=2} and B={x|x∈R and x!=1} define f:A->B and g:B->A by f(x)=x/(x-2) and g(x)=2x/(x-1) thenwhich of following is false?1)f∘g=g∘f 2)f∘g=I...
1.6k
views
answered
Oct 3, 2015
32
votes
201
GATE CSE 2001 | Question: 10
Is the $3\text{-variable}$ function $f= \Sigma(0,1,2,4)$ its self-dual? Justify your answer. Give a minimal product-of-sum form of the $b$ output of the following $\text{excess-3}$ to $\text{BCD}$ converter.
Is the $3\text{-variable}$ function $f= \Sigma(0,1,2,4)$ its self-dual? Justify your answer.Give a minimal product-of-sum form of the $b$ output of the following $\text{e...
4.1k
views
answered
Oct 2, 2015
Digital Logic
gatecse-2001
digital-logic
normal
descriptive
min-sum-of-products-form
+
–
0
votes
202
What is the level number of an element present in an array of n integers interpreted as a complete binary tree?
If I am given an array $X$ of $n$ distinct integers which is interpreted as a complete binary tree, so if the parent is at index $i$, then it's left child would be at ind...
1.7k
views
answered
Oct 1, 2015
DS
binary-tree
data-structures
+
–
1
votes
203
Galvin Eighth Edition
Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing and that each I/O operation takes 10 milliseconds to complete. Also ... . Describe the CPU utilization for a round-robin scheduler when: The time quantum is 1 millisecond The time quantum is 10 milliseconds
Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing a...
8.9k
views
answered
Oct 1, 2015
Operating System
process-scheduling
+
–
0
votes
204
Which statement is true?
Consider dfa , nfa & ∈-nfa accepting the same language, choose the correct statement? a) All three models always have the same number of states. b) The minimal dfa for all three machines is unique. c) The nfa model always has more number of states than the dfa. d) The ∈-nfa always has the maximum number of states.
Consider dfa , nfa & ∈-nfa accepting the same language,choose the correct statement?a) All three models always have the same number of states. b) The minimal dfa for a...
2.9k
views
answered
Oct 1, 2015
Theory of Computation
finite-automata
theory-of-computation
+
–
1
votes
205
Regular Language
Is $\{xww \mid w,x \in (a+b)^{+}\}$ regular because there is no restriction on the max length of $x$ ? As mush as I know, if there is no restriction on the maximum value of $x$, then it can expand as much as to cover $ww$, making the language regular. Please correct me if I am wrong.
Is $\{xww \mid w,x \in (a+b)^{+}\}$ regular because there is no restriction on the max length of $x$ ?As mush as I know, if there is no restriction on the maximum value o...
1.3k
views
answered
Sep 29, 2015
Theory of Computation
theory-of-computation
regular-language
regular-expression
+
–
0
votes
206
Why does a B tree contain only unique values , whereas a B+ tree can contain repeated values ?
I was reading the chapter on multilevel indexes , given in the Elmasi Navathe book. The following points have been given for key values in b and b+ trees- B trees- and for B+ trees, Why are values repeated ... not in a B tree ? How is thing possible ? Can someone please explain this by giving an example.
I was reading the chapter on multilevel indexes , given in the Elmasi Navathe book. The following points have been given for key values in b and b+ trees-B trees-and for ...
685
views
answered
Sep 26, 2015
Databases
databases
b-tree
+
–
1
votes
207
Suppose for insertion in a b+ tree of order 3, the values are inserted in order 73,108,100.
Suppose for insertion in a b+ tree of order 3, the values are inserted in order 73,108,100. What will be the structure of the resulting tree? I have watched few lectures on b+ trees and in one of the ... that will result in- Which of the above methods should I use. I am confused as to me both seem right
Suppose for insertion in a b+ tree of order 3, the values are inserted in order 73,108,100. What will be the structure of the resulting tree? I have watched few lecture...
848
views
answered
Sep 26, 2015
Databases
b-tree
databases
+
–
0
votes
208
How is the below expression in a linked list evaluated ?
say I have a single linked list of 6 elements and I do some operation like temp->link->link->link->link=p , Now assume that p is a pointer holding the address of third node whose data part is 3 and link part is ... to the address held by the pointer variable p ,i.e. how come this link points to 3rd variable ,plz clarify this .
say I have a single linked list of 6 elements and I do some operation liketemp->link->link->link->link=p , Now assume that p is a pointer holding the address of third nod...
753
views
answered
Sep 25, 2015
Programming in C
programming-in-c
+
–
0
votes
209
What will be the total page faults in the following ques ?
The given ans is 9. I don't get it .
The given ans is 9. I don't get it .
295
views
answered
Sep 24, 2015
0
votes
210
A host with IP address 10.100.100.100 wants to use loopback testing,WHAT are the source and destination addresses?
1. 10.100.100.100 & 10.100.100.1002. 10.100.100.100 & 255.255.255.2553. 10.100.100.100 & 127.1.100.14. 127.100.100.100 & 10.100.100.100
5.2k
views
answered
Sep 24, 2015
Computer Networks
network-addressing
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register