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
31
UGC NET CSE | January 2017 | Part 3 | Question: 37
Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements? Abstraction allows us to focus on what something does without considering the ... I nor II is correct Both I and II are correct Only II is correct Only I is correct
Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two stat...
3.9k
views
answered
Jan 31, 2017
Object Oriented Programming
ugcnetcse-jan2017-paper3
object-oriented-programming
+
–
0
votes
32
UGC NET CSE | January 2017 | Part 3 | Question: 35
Dijkstra’s algorithm is based on Divide and conquer paradigm Dynamic programming Greedy approach Backtracking paradigm
Dijkstra’s algorithm is based onDivide and conquer paradigmDynamic programmingGreedy approachBacktracking paradigm
2.1k
views
answered
Jan 31, 2017
Algorithms
ugcnetcse-jan2017-paper3
algorithms
dijkstras-algorithm
+
–
0
votes
33
UGC NET CSE | January 2017 | Part 3 | Question: 32
Any decision tree that sorts n elements has height ____ $\Omega (\lg \: n)$ $\Omega (n)$ $\Omega (n \: \lg \: n)$ $\Omega (n^2)$
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
7.5k
views
answered
Jan 31, 2017
Algorithms
ugcnetcse-jan2017-paper3
algorithms
tree
+
–
2
votes
34
UGC NET CSE | January 2017 | Part 3 | Question: 8
Which one is correct w.r.t. RDBMS? primary key $\subseteq$ super key $\subseteq$ candidate key primary key $\subseteq$ candidate key $\subseteq$ super key super key $\subseteq$ candidate key $\subseteq$ primary key super key $\subseteq$ primary key $\subseteq$ candidate key
Which one is correct w.r.t. RDBMS?primary key $\subseteq$ super key $\subseteq$ candidate keyprimary key $\subseteq$ candidate key $\subseteq$ super key super key $\subse...
2.7k
views
answered
Jan 31, 2017
Databases
ugcnetcse-jan2017-paper3
database-normalization
candidate-key
+
–
1
votes
35
self doubt
We know Relational algebra(RA) and Relational calculas(RC) are equivalent in power...Can we say power of SQL and relational algebra are same?? I think no because we have some aggegate function, order by etch which is not done by relational algebra but all the RA operations can be done in SQL so can say SQL has highest power than RA/RC????
We know Relational algebra(RA) and Relational calculas(RC) are equivalent in power...Can we say power of SQL and relational algebra are same??I think no because we have s...
502
views
answered
Jan 31, 2017
0
votes
36
No of states in DFA
Which of the following represents the minimum number of states in DFA for following language L={ anb | n≥0 } U { bna | n≥1 } a. 5 states b. 6 states c. 7 states d. 8 states
Which of the following represents the minimum number of states in DFA for following languageL={ anb | n≥0 } U { bna | n≥1 }a. 5 statesb. 6 statesc. 7 statesd. 8 state...
594
views
answered
Jan 28, 2017
2
votes
37
CPI.......
Is CPI of non pipeline processor 6, means non pipeline processor has 6 stages? ----------------------------------------------------------------------------------------------------------------------- ... 4 GHz and an average CPI of 6. System is enhanced to a 8 stage pipelined processor. The clock rate is reduced to 2 GHz in the new processor. Speedup of a pipelined processor is _________.
Is CPI of non pipeline processor 6, means non pipeline processor has 6 stages? -Consider a non-pipeline system has a clock rate 4 GHz and an average CPI of...
805
views
answered
Jan 28, 2017
CO and Architecture
pipelining
co-and-architecture
+
–
0
votes
38
Gatebook
Consider languages L1 and L2 over {0,1) alphabet. L2= {w/w contains some x as a substring and x belongs to L1} Which of the following must be true? I. If L1 is regular, L2 is also regular II. If L1 is CFL, L2 is also CFL III. If L1 is recursive, L2 is also recursive (A). I and II only (B). I, II, III only (C). I and III only (D). II and III only
Consider languages L1 and L2 over {0,1) alphabet.L2= {w/w contains some x as a substring and x belongs to L1}Which of the following must be true?I. If L1 is regular, L2 i...
1.8k
views
answered
Jan 25, 2017
Theory of Computation
gatebook-toc
theory-of-computation
regular-language
+
–
2
votes
39
betweenB trees and B+ trees,which one is suited for random and which one is suited for sequential access??
between B trees and B+ trees,which one is suited for random and which one is suited for sequential access??please explain
1.1k
views
answered
Jan 11, 2017
Databases
databases
binary-tree
+
–
3
votes
40
TestBook Test Series
Assume a sequence of memory accesses is made that have a high degree of temporal locality, which one of these cache would be likely to have the best performance? A 4-way set associative cache with 2-byte blocks A 2-way set associative cache with 4-byte blocks A direct mapped cache with 4-byte blocks A direct mapped cache with 8-byte blocks
Assume a sequence of memory accesses is made that have a high degree of temporal locality, which one of these cache would be likely to have the best performance?A 4-way s...
283
views
answered
Jan 10, 2017
CO and Architecture
co-and-architecture
+
–
0
votes
41
made easy
206
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...
911
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?
993
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...
485
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...
809
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 ...
511
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?...
343
views
answered
Jan 7, 2017
CO and Architecture
co-and-architecture
+
–
2
votes
51
Theory of Computation
359
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.
447
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
300
views
answered
Jan 7, 2017
0
votes
57
DBMS-5
274
views
answered
Jan 7, 2017
1
votes
58
DBMS-6
459
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 ?
349
views
answered
Jan 6, 2017
0
votes
60
number of comparison in A>B , A<B , A=B using digital logic .
334
views
answered
Jan 6, 2017
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register