The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by commenter commenter
User commenter commenter
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User commenter commenter
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
ISRO202050
If every nonkey attribute functionally dependent on the primary key, then the relation will be in First normal form Second normal form Third normal form Fourth Normal form
answered
9 hours
ago
in
Databases

339
views
isro2020
databases
databasenormalization
easy
0
votes
2
TIFR2013A14
An unbiased die is thrown $n$ times. The probability that the product of numbers would be even is $\dfrac{1}{(2n)}$ $\dfrac{1}{[(6n)!]}$ $1  6^{n}$ $6^{n}$ None of the above.
answered
Nov 11, 2019
in
Probability

533
views
tifr2013
probability
+2
votes
3
GATE199013a
Consider the heightbalanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig.4. (i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}$ shown in Fig.5 using node D of tree $T_{1}$. (ii) What is the time complexity of ... $T_{1}$ and $T_{2}$ are of height $h_{1}$ and $h_{2}$ respectively, assuming that rotation schemes are given. Give reasons.
answered
Oct 25, 2019
in
DS

800
views
gate1990
descriptive
datastructures
trees
0
votes
4
TANCET 2017 DBMS
answered
Sep 20, 2019
in
Databases

37
views
tancet
+3
votes
5
GATE19982.18, UGCNETJune2012III48
If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every $k$ instruction is: $i + \dfrac{j}{k}$ $i +(j\times k)$ $\dfrac{i+j}{k}$ $({i+j})\times {k}$
answered
Aug 20, 2019
in
Operating System

4.2k
views
gate1998
operatingsystem
virtualmemory
easy
ugcnetjune2012iii
+1
vote
6
Doubt regarding countable and uncountable sets
Hello, I have read that Σ* is countably infinite and power set of Σ* (ie. 2^ Σ*) is uncountably infinite. So by Cantor’s theorem, power set of any countably infinite set is uncountably infinite. Then what can be said about 0^any countably infinite set or 3^any countably infinite set? Do these things have any significance? Thank you.
answered
Jun 12, 2019
in
Theory of Computation

88
views
theoryofcomputation
countableuncountable
0
votes
7
MadeEasy Test Series 2018: Operating System  VIrtual Memory
Consider the following statements: S1 : User level process cannot modify its own page table entries. S2 : Demand paging requires that the programmer to take specific action to force the operating system to load a particular virtual memory page. ... S1 and S2 D.) None of the above My answer is A but the answer given is D please explain
answered
Jun 9, 2019
in
Operating System

351
views
madeeasytestseries
operatingsystem
virtualmemory
madeeasytestseries2018
50,737
questions
57,275
answers
198,154
comments
104,823
users