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 vignesh
1
answer
1
computer organisation
If a system is Byte-addressable system , Can we always conclude that 1 word = 1 Byte ??? Please explain your answer ...
If a system is Byte-addressable system ,Can we always conclude that 1 word = 1 Byte ???Please explain your answer ...
421
views
asked
Jun 3, 2017
CO and Architecture
co-and-architecture
+
–
1
answer
2
computer organization
A 4-bit array multiplier is implemented using AND gates and Full Adders only to multiply two 4-bit numbers.If the propagation delay of an AND gate is 2 ns and if the propagation delay of a Full adder is 7 ns.Find the time taken by the multiplier to compute the result (in ns)._____ Is the answer, 72 ns correct ???
A 4-bit array multiplier is implemented using AND gates and Full Adders only to multiply two 4-bit numbers.If the propagation delay of an AND gate is 2 ns and if the prop...
335
views
asked
May 26, 2017
CO and Architecture
co-and-architecture
digital-logic
+
–
17
answers
3
GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both com...
32.9k
views
commented
May 25, 2017
Digital Logic
gatecse-2004
digital-logic
normal
adder
+
–
1
answer
4
computer architecture
Can we have overflow in unsigned numbers ??? We know that in unsigned numbers with n bits we can represent numbers from 0 to 2^n - 1.EX: with 4 bits from o to 15.Now if I add 14 + 15 = 29 which we cant represent using 4 bits...can we say ... I feel is In unsigned numbers whenever we get an end-around carry there will always be an overflow ..Please correct me if I am wrong....
Can we have overflow in unsigned numbers ??? We know that in unsigned numbers with n bits we can represent numbers from 0 to 2^n - 1.EX: with 4 bits from o to 15.Now if I...
323
views
asked
May 24, 2017
CO and Architecture
co-and-architecture
+
–
1
answer
5
databases
In the given B-Tree below , insert an index record with key 40 ? (order of b-tree is 4) ANSWER : PLEASE VERIFY ...
In the given B-Tree below , insert an index record with key 40 ? (order of b-tree is 4)ANSWER :PLEASE VERIFY ...
735
views
commented
May 8, 2017
Databases
databases
indexing
b-tree
+
–
1
answer
6
operating system
Above solution GUARANTEES : Progress DOESNOT GUARANTEE : Mutual Exclusion,Bounded waiting,starvation Is this correct ???
Above solution GUARANTEES : ProgressDOESNOT GUARANTEE : Mutual Exclusion,Bounded waiting,starvationIs this correct ???
300
views
asked
May 2, 2017
Operating System
operating-system
+
–
1
answer
7
operating system
Can somebody please show atleast one example where a synchromnisation mechanism " DOESNOT GUARANTEE BOUNDED WAITING BUT STILL IT GUARANTEES STARVATION FREEDOM " I am not able to find one .. MY LOGIC : If Bounded waiting is not guaranteed , ... SURELY SUFFER FROM STARVATION ??? Please correct me if I am wrong in understanding of definitions of Bounded waiting,starvation.
Can somebody please show atleast one example where a synchromnisation mechanism " DOESNOT GUARANTEE BOUNDED WAITING BUT STILL IT GUARANTEES STARVATION FREEDOM "I am not a...
348
views
asked
May 2, 2017
Operating System
operating-system
process-synchronization
deadlock-prevention-avoidance-detection
+
–
0
answers
8
operating system
The above solution is STARVATION-FREE right ??? Because both the processes will eventually get into the Critical-section and there is no indefinite waiting time for any process ....AM I CORRECT ? PLEASE CORRECT ME IF I AM WRONG ... EDIT IN QUESTION : in P1's code, 2nd while will have semi-colon...(i.e) while(turn!=1); not while(turn!=1)
The above solution is STARVATION-FREE right ??? Because both the processes will eventually get into the Critical-section and there is no indefinite waiting time for any p...
369
views
edited
May 2, 2017
Operating System
operating-system
+
–
1
answer
9
operating systems
A total of 1000 processes (with all having different burst time) are already in the ready queue and it is already known that no upcoming processes will ever enter the ready queue.If SJF scheduling algorithm is used to schedule the processes to execute.Then the system A) is starvation free B) suffers from starvation
A total of 1000 processes (with all having different burst time) are already in the ready queue and it is already known that no upcoming processes will ever enter the re...
271
views
asked
May 1, 2017
Operating System
operating-system
+
–
2
answers
10
operating system
Which of the following statements is TRUE ? S1) If Bounded waiting is guaranteed for a synchronization mechanism,then definitely that solution will be starvation-free. S2) If a synchronization mechanism is free from starvation,then it definitely guarantees ... whether Bounded waiting and starvation freedom are same ...?? If different please explain what is the difference ...
Which of the following statements is TRUE ?S1) If Bounded waiting is guaranteed for a synchronization mechanism,then definitely that solution will be starvation-free.S2) ...
378
views
asked
May 1, 2017
Operating System
operating-system
+
–
0
answers
11
operating system
Does this solution guarantee A) mutual exclusion, B) progress, C) bounded waiting, D) starvation-freedom, E) deadlock-freedom
Does this solution guarantee A) mutual exclusion, B) progress, C) bounded waiting, D) starvation-freedom, E) d...
685
views
commented
May 1, 2017
Operating System
operating-system
+
–
4
answers
12
GATE CSE 2008 | Question: 16, ISRO2016-60
A clustering index is defined on the fields which are of type non-key and ordering non-key and non-ordering key and ordering key and non-ordering
A clustering index is defined on the fields which are of typenon-key and orderingnon-key and non-orderingkey and orderingkey and non-ordering
14.0k
views
commented
Apr 27, 2017
Databases
gatecse-2008
easy
databases
indexing
isro2016
+
–
6
answers
13
Databases
A Clustered index A) is a dense index always. B) is a sparse index always. C) can be either dense index or a sparse index,but not both. D) can be both dense index and sparse index.
A Clustered indexA) is a dense index always.B) is a sparse index always.C) can be either dense index or a sparse index,but not both.D) can be both dense index and sparse ...
6.3k
views
asked
Apr 27, 2017
Databases
databases
indexing
+
–
3
answers
14
databases
Which of the following statements is TRUE ? A) Every primary index is also a clustered index. B) Every clustered index is also a primary index. C) Both primary index and clustered index are one and the same, D) An index can be either primary or clustered but not both.
Which of the following statements is TRUE ?A) Every primary index is also a clustered index.B) Every clustered index is also a primary index.C) Both primary index and clu...
1.9k
views
commented
Apr 27, 2017
Databases
databases
indexing
+
–
0
answers
15
databases
This index is a dense index ...right ...???
This index is a dense index ...right ...???
467
views
asked
Apr 26, 2017
Databases
databases
indexing
+
–
0
answers
16
databases
State TRUE or FALSE. "In Indexing,the number of ordering field (field based on which records in data file and its corresponding index file are sorted) should always be 1". Please support your answer with explanations ...
State TRUE or FALSE."In Indexing,the number of ordering field (field based on which records in data file and its corresponding index file are sorted) should always be 1"....
409
views
asked
Apr 26, 2017
Databases
databases
indexing
+
–
2
answers
17
databases
what is the difference between a "Block" and "Sector" in Hard disk ..??? Are they both same ???
what is the difference between a "Block" and "Sector" in Hard disk ..??? Are they both same ???
383
views
asked
Apr 23, 2017
Databases
databases
b-tree
co-and-architecture
operating-system
+
–
1
answer
18
theory of computation
Consider the following statements. S1 : union of any finite number of countable sets is countable. S2 : union of infinite number of countable sets is countable S3 : cross product of any finite number of countable sets is countable. S4 : cross product of infinite number of countable sets is ... A) Only S1 B) Only S1) and S3) C) Only S1),S2),S3) D) All of S1),S2),S3),S4)
Consider the following statements.S1 : union of any finite number of countable sets is countable.S2 : union of infinite number of countable sets is countable S3 : cross p...
508
views
asked
Apr 23, 2017
Theory of Computation
theory-of-computation
countable-uncountable-set
+
–
1
answer
19
theory of computation
L = { <M,w> / M is a TM,w is a string and M on simulating w,the Read/write head of M moves 100 steps away from the left most symbol of input }.Assume initially the Read/write head is in left-most symbol of input. MY ANSWER : This language is Recursively enumerable but not recursive ...right ???
L = { <M,w / M is a TM,w is a string and M on simulating w,the Read/write head of M moves 100 steps away from the left most symbol of input }.Assume initially the Read/wr...
416
views
commented
Apr 22, 2017
Theory of Computation
theory-of-computation
decidability
recursive-and-recursively-enumerable-languages
+
–
0
answers
20
theory of computation
L = { <M> / M is a Turing machine and M accepts a regular language }. This Language L is recursively enumerable but not recursive. ...right ??
L = { <M / M is a Turing machine and M accepts a regular language }.This Language L is recursively enumerable but not recursive. ...right ??
320
views
asked
Apr 21, 2017
Theory of Computation
theory-of-computation
decidability
recursive-and-recursively-enumerable-languages
+
–
1
answer
21
theory of computation
This language, L = { <M,w> / M is a TM,w is a string and M does not halt on string w } is not recursively enumerable ...right ???
This language,L = { <M,w / M is a TM,w is a string and M does not halt on string w }is not recursively enumerable ...right ???
364
views
asked
Apr 21, 2017
Theory of Computation
theory-of-computation
decidability
recursive-and-recursively-enumerable-languages
+
–
2
answers
22
theory of computation
Which of the following languages below are NOT recursively enumerable ? L1 = {<M> / M is a TM that accepts all even numbers }. L2 = {<M> / M does not accept all even numbers } L3 = {<M> / M rejects all even numbers } A) Only L1 B) Only L1 and L2 C) Only L1 and L3 D) All of L1,L2 and L3
Which of the following languages below are NOT recursively enumerable ?L1 = {<M / M is a TM that accepts all even numbers }.L2 = {<M / M does not accept all even numbers ...
1.1k
views
commented
Apr 21, 2017
Theory of Computation
theory-of-computation
decidability
recursive-and-recursively-enumerable-languages
+
–
0
answers
23
theory of computation
why the above language is not Recursively enumerable ??? please explain
why the above language is not Recursively enumerable ??? please explain
152
views
asked
Apr 21, 2017
Theory of Computation
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register