Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Kaushik.P.E
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Kaushik.P.E
0
votes
41
made easy
205
views
answered
Jan 10, 2017
1
votes
42
then time required to read 500KB of data in milliseconds is _______.
A hard disk needs 50ms for placing the head on the right track. One track rotational speed is 5ms. There are 63 sectors on each track, each sector storing 512 bytes and data is supposed to be distributed in the best possible way. If transfer time is 0.5 ms/sector then time required to read 500KB of data in milliseconds is _______.
A hard disk needs 50ms for placing the head on the right track. One track rotational speed is 5ms. There are 63 sectors on each track, each sector storing 512 bytes and d...
908
views
answered
Jan 9, 2017
CO and Architecture
co-and-architecture
+
–
2
votes
43
Cache memory
Is it compulsory that the block sizes of the main memory and the cache memory are always equal?
Is it compulsory that the block sizes of the main memory and the cache memory are always equal?
989
views
answered
Jan 9, 2017
CO and Architecture
cache-memory
co-and-architecture
memory-interfacing
+
–
0
votes
44
doubt
Let L be a Context Free Language. Even(L) is the set of all strings w in L such that |w| is even. What can you say about Even(L)? (a) It will be regular (b) It will be context-free (c) It is not decidable (d) None of the above
Let L be a Context Free Language. Even(L) is the set of all strings w in L such that |w| is even.What can you say about Even(L)?(a) It will be regular (b) It will b...
482
views
answered
Jan 8, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
45
Programming : previous year question programming
Consider the function f defined below. struct item { int data; struct item * next; }; int f(struct item *p) { return ((p == NULL) || (p->next == NULL)|| ((p->data <= p ->next -> data) && f(p- ... not all elements in the list have the same data value I m not getting it ,there is no return 1 statment so how thiz will right ?
Consider the function f defined below.struct item { int data; struct item * next; }; int f(struct item *p) { return ((p == NULL) || (p->next == NULL)|| ((p->data <= p ->n...
806
views
answered
Jan 8, 2017
2
votes
46
Data Structure stack-max
How it is 24? I'm not getting it.
How it is 24? I'm not getting it.
3.0k
views
answered
Jan 8, 2017
DS
made-easy-test-series
data-structures
stack
bad-question
+
–
1
votes
47
A condition that is caused by run time error
A condition that is caused by run time error in a computer program is known as a)Fault b)Exception c)Syntax error d)Semantic error
A condition that is caused by run time error in a computer program is known as a)Fault b)Exceptionc)Syntax errord)Semantic error
3.8k
views
answered
Jan 8, 2017
0
votes
48
strategy
I think most of us have realised how strategy becomes important while answering questions.How time is so important in this exam.How are you people dividing 3 hrs of GATE exam in different sections(practice sets which each one of you have taken)?..How ... and read the question paper for 10 mins before starting? Do you keep separate time off for revising/re-checking numerical questions?
I think most of us have realised how strategy becomes important while answering questions.How time is so important in this exam.How are you people dividing 3 hrs of GATE ...
506
views
answered
Jan 8, 2017
GATE
exam-stress
+
–
2
votes
49
DS :True / False
In hash function using linear probing to reduce collision, the number of probes required to insert an item is identical with number of probes needed to retrieve it. is it True/ False?
In hash function using linear probing to reduce collision, the number of probes required to insert an item is identical with number of probes needed to retrieve it.is it ...
1.2k
views
answered
Jan 8, 2017
Programming in C
data-structures
hashing
+
–
1
votes
50
which can be done in parallel
I1: MAR <- (PC) I2: MBR <- memory I3 : PC <- PC + 1 I4: IR <- MBR Which one of the following instructions can be done in same time unit? can we perform I2 and I3 in same time??i guees yes because I2 is transferring data from memroy to buffer register while I3 is inc PC I3 and I4 can also be run parallely. pls confirm this
I1: MAR <- (PC)I2: MBR <- memoryI3 : PC <- PC + 1I4: IR <- MBRWhich one of the following instructions can be done in same time unit?can we perform I2 and I3 in same time?...
342
views
answered
Jan 7, 2017
CO and Architecture
co-and-architecture
+
–
2
votes
51
Theory of Computation
357
views
answered
Jan 7, 2017
1
votes
52
maximum tuples in natural join
Consider 2 relations R and S having 3 tuples in R and 2 tuples in S . What is the max no of tuples that could appear in the natural join of R and S a) 6 b) 2 C) 3 d)5 ans should be 6( cross join ) or 2(as equi join ) as both these forms related to natural join in way or other
Consider 2 relations R and S having 3 tuples in R and 2 tuples in S . What is the max no of tuples that could appear in the natural join of R and S a) 6 b) 2 C) 3 d)5a...
6.6k
views
answered
Jan 7, 2017
3
votes
53
natural join
The natural join of 2 tables a) Cartesian product always b)Combination of Union and filtered Cartesian product c)Combination of Selection and filtered Cartesian product d)Combination of Projection and filtered Cartesian product
The natural join of 2 tablesa) Cartesian product alwaysb)Combination of Union and filtered Cartesian productc)Combination of Selection and filtered Cartesian productd)Com...
6.5k
views
answered
Jan 7, 2017
1
votes
54
DOUBT
Pls Explain how to do this.
Pls Explain how to do this.
445
views
answered
Jan 7, 2017
Algorithms
algorithms
time-complexity
made-easy-test-series
+
–
1
votes
55
DBMS-1
326
views
answered
Jan 7, 2017
0
votes
56
DBMS-4
299
views
answered
Jan 7, 2017
0
votes
57
DBMS-5
273
views
answered
Jan 7, 2017
1
votes
58
DBMS-6
458
views
answered
Jan 7, 2017
0
votes
59
OS Doubt on Topic Semaphore
For n=0 : P1 : signal(n); wait(n); CS; signal(n); P2 : wait(n) CS signal(n); For n=1; P1 : wait(n); CS; signal(n); P2: wait(n); CS; signal(n); Where i am wrong ?
For n=0 : P1 :signal(n);wait(n);CS;signal(n);P2 : wait(n)CSsignal(n);For n=1;P1 :wait(n);CS;signal(n);P2:wait(n);CS;signal(n);Where i am wrong ?
348
views
answered
Jan 6, 2017
0
votes
60
number of comparison in A>B , A<B , A=B using digital logic .
332
views
answered
Jan 6, 2017
0
votes
61
SemaPhore
927
views
answered
Jan 6, 2017
Operating System
operating-system
process-synchronization
semaphore
+
–
1
votes
62
TOC- Recurive language
R = RE ∩ Co-RE where R is the set of recursive language,RE is the set of languages of which membership can be proved in finite time and Co-RE is the set of language of which membership can be disproved in finite amount of time -True/False?
R = RE ∩ Co-RE where R is the set of recursive language,RE is the set of languages of which membership can be proved in finite time and Co-RE is the set of language of ...
222
views
answered
Jan 6, 2017
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
63
[Compiler Design] Find number of reductions
1.0k
views
answered
Jan 5, 2017
Compiler Design
compiler-design
context-free-grammar
parsing
numerical-answers
test-series
+
–
0
votes
64
doubt
260
views
answered
Jan 5, 2017
Digital Logic
digital-logic
digital-counter
+
–
1
votes
65
doubt
504
views
answered
Jan 5, 2017
Digital Logic
digital-logic
+
–
0
votes
66
Compiler
Consider the following grammar 1)Left Recursive 2)Ambiguos 3)Left factored 4)None of these
Consider the following grammar1)Left Recursive2)Ambiguos3)Left factored4)None of these
649
views
answered
Jan 5, 2017
Compiler Design
compiler-design
context-free-grammar
left-recursion
ambiguous-grammar
ace-test-series
+
–
0
votes
67
Machine instructions
Q15 I am having confusion regarding indirect bit(mode bit) .Are mode bit used in deciding number of operations possible?
Q15 I am having confusion regarding indirect bit(mode bit) .Are mode bit used in deciding number of operations possible?
593
views
answered
Jan 5, 2017
CO and Architecture
co-and-architecture
+
–
0
votes
68
Dbms Joins
Joins and Cross products are associative or commutative?
Joins and Cross products are associative or commutative?
3.4k
views
answered
Jan 5, 2017
Databases
databases
+
–
0
votes
69
parsing
consider the following grammar production S->XX X->0X|1 In the canonical LR method if [X->0•X,0] is an item then which of the following is the viable prefix of the item? a)000 b)111 c) 011 d)110
consider the following grammar productionS->XXX->0X|1In the canonical LR method if [X->0•X,0] is an item then which of the following is the viable prefix of the item?a)...
1.0k
views
answered
Jan 4, 2017
Compiler Design
compiler-design
viable-prefix
+
–
2
votes
70
DIGITAL_LOGIC
Which of the following statement is Incorrect for the range of n bits binary numbers? a. Range of unsigned numbers is 0 to 2n – 1. b. Range of signed numbers is –2n – 1 + 1 to 2n – 1 – 1 c. Range of signed 1’s complement numbers is –2n – 1 + 1 to 2n – 1 d. Range of signed 2’s complement numbers is –2n – 1 to 2n – 1 – 1 i think b and c both are wrong
Which of the following statement is Incorrect for the range of n bits binarynumbers?a. Range of unsigned numbers is 0 to 2n – 1.b. Range of signed numbers is –2n – ...
1.8k
views
answered
Jan 4, 2017
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register