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
Recent activity by lU$er
User lU$er
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User lU$er
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
UGCNETJune2015II49DBMS
Which of the following statements is false about weak entity set? Weak entities can be deleted automatically when their strong entity is deleted Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the ... in a weak entity set are not partitioned according to their relationship with tuples with a strong entity set
commented
Sep 18, 2018
in
Databases

1.6k
views
ugcnetjune2015ii
erdiagram
erdiagram
databases
1
answer
2
Subschema View Virtual table in DBMS
What is the difference between Subschema, View and Virtual table in DBMS? please explain!!
commented
Sep 18, 2018
in
Databases

131
views
databases
1
answer
3
tuple relational calculus
Given the following relational schemas Student (studId, name, age, sex, deptNo, advisor) Department (deptId, DName, hod, phoneNo) Which of the following will be the TRC query to obtain the department names that do not have any girl students? 1. {d.Dname  department(d) ∧ ~ ((∃(s)) ... 3. {d.Dname  department(d) ∧ ~ ((∃(s)) student(s) ∧ s.sex = F' ∧ s.deptNo = d.deptId)}
commented
Sep 18, 2018
in
Databases

543
views
databases
relationalcalculus
2
answers
4
MadeEasy Test Series: CO & Architecture  Pipelining
An instruction pipeline consists of following 5 stages: IF = Instruction Fetch, ID = Instruction Decode, EX = Execute, MA = Memory Access and WB = Register Write Back. Now consider the following code: 1. LOAD R8, 0(R5); ... instructions. How many cycles are required to execute the code, without operand forwarding over a bypass network? 9 10 11 14
commented
Sep 5, 2018
in
CO and Architecture

1.8k
views
pipelining
coandarchitecture
madeeasytestseries
4
answers
5
GATE2015244
Consider the sequence of machine instruction given below: ... uses operand forwarding from the PO stage to the OF stage. The number of clock cycles taken for the execution of the above sequence of instruction is _________.
commented
Sep 5, 2018
in
CO and Architecture

8.8k
views
gate20152
coandarchitecture
pipelining
normal
numericalanswers
1
answer
6
Computer Networks: Bit Stuffing
Flag: 01111110 Data: 1000111111100111110100011111111111000011111 bit stuff the given data?
commented
Sep 3, 2018
in
Computer Networks

2.8k
views
computernetworks
bitstuffing
errordetection
4
answers
7
GATE2015140
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decreasekey operations on a set of data items with keys ... use, if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min  heap Sorted array Sorted doubly linked list
commented
Aug 20, 2018
in
Algorithms

7k
views
gate20151
algorithms
datastructure
normal
timecomplexity
2
answers
8
full binary tree , complete and almost complete binary tree difference
what is the difference between all these types of trees 1)full binary tree 2) complete binary tree 3) almost complete binary tree 4)perfect binary tree 5)strictly binary tree is every full binary tree is of all types of binary trees
commented
Aug 2, 2017
in
Programming

1.9k
views
3
answers
9
functional dependency
Is the above relation is dependency preserved or not
commented
Jul 12, 2017
in
Databases

368
views
6
answers
10
TIFR2017B12
An undirected graph is complete if there is an edge between every pair of vertices. Given a complete undirected graph on $n$ vertices, in how many ways can you choose a direction for the edges so that there are no directed cycles? $n$ $\frac{n(n1)}{2}$ $n!$ $2^n$ $2^m, \: \text{ where } m=\frac{n(n1)}{2}$
commented
Jul 12, 2017
in
Graph Theory

1.7k
views
tifr2017
graphtheory
counting
1
answer
11
Source of reading about size Pointer in c
There are many questions related to size of pointer and it's also depend on machine so anyone tell me source of reading pointer. (for Gate)
answered
Apr 16, 2017
in
Programming

137
views
programminginc
0
answers
12
Consider a cellular system having 2023 Duplex channels
Consider a cellular system having 2023 Duplex channels to cover 1925 km2 for 7 cell reuse system. Compute System capacity.
commented
Apr 16, 2017
in
Computer Networks

156
views
computernetworks
0
answers
13
why CDMA is better than GSM ?
why CDMA is better than GSM ?
commented
Apr 15, 2017
in
Computer Networks

37
views
computernetworks
0
answers
14
If Bluetooth is a commercial success what the remaining reasons for use of infra red transmissions?
commented
Apr 15, 2017
in
Computer Networks

93
views
computernetworks
3
answers
15
With quick sort The results after first partioning of the given array
With quick sort The results after first partioning of the given array. A = (2,8,7,1,3,5,6,4,9). Analysis the time complexity of Quick sort in the best case.
commented
Apr 15, 2017
in
Algorithms

247
views
algorithms
quicksort
timecomplexity
sorting
0
answers
16
Timothy excercise
commented
Apr 15, 2017
in
Theory of Computation

130
views
1
answer
17
Binary Stream
We have a run of 0's followed by the run of 1's and we have to find the point where first 1 will be present. We only know the start of the sequence but we have no idea about the end. what should the best case complexity of this problem? Describe your approach.
commented
Apr 15, 2017
in
Algorithms

74
views
5
answers
18
Regular expression for given FA
answered
Apr 15, 2017
in
Theory of Computation

572
views
theoryofcomputation
regularexpressions
finiteautomata
2
answers
19
GATE199103viii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Consider the following Pascal function: Function X(M:integer):integer; Var i:integer; Begin i := 0; while i*i < M do i:= i+1 X := i end The function call $X(N)$ ... $\lfloor\sqrt N \rfloor +1$ $\lceil \sqrt N \rceil$ $\lceil \sqrt N \rceil +1$ None of the above
commented
Apr 15, 2017
in
Algorithms

894
views
gate1991
algorithms
easy
identifyfunction
2
answers
20
A list of elements are given A  <3,1,4,1,5,9,2,6,5,3,5,8,9 >
A list of elements are given A  <3,1,4,1,5,9,2,6,5,3,5,8,9 > Show Howw the "Pivot" and quick sort algorithm work. finally show the Best Case analysis for quick sort .
answered
Apr 15, 2017
in
Algorithms

442
views
algorithms
quicksort
4
answers
21
GATE200851
Match the following: $\small{\begin{array}{llll}\hline \text{E.} & \text{Checking that identifiers are declared before their use} & \text{P.} & \text{$ ... $\text{ER, FP, GS, HQ}$ $\text{ER, FP, GQ, HS}$ $\text{EP, FR, GS, HQ}$
commented
Dec 21, 2016
in
Theory of Computation

4.1k
views
gate2008
normal
theoryofcomputation
grammar
2
answers
22
GATE19984
Design a deterministic finite state automaton (using minimum number of states) that recognizes the following language: $L=\{w \in \{0, 1\}^* \mid w$ interpreted as binary number (ignoring the leading zeros) is divisible by five $\}.$
commented
Dec 21, 2016
in
Theory of Computation

2.1k
views
gate1998
theoryofcomputation
finiteautomata
normal
minimalstateautomata
1
answer
23
GATE2005IT6
The language $\{0^n 1^n 2^n \mid 1 \leq n \leq 10^6\}$ is regular contextfree but not regular contextfree but its complement is not contextfree not contextfree
commented
Dec 21, 2016
in
Theory of Computation

1.1k
views
gate2005it
theoryofcomputation
easy
identifyclasslanguage
7
answers
24
GATE200940
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.
commented
Dec 21, 2016
in
Theory of Computation

3.1k
views
gate2009
theoryofcomputation
easy
identifyclasslanguage
1
answer
25
MadeEasy Test Series: Theory Of Computation  Identify Class Language
commented
Dec 21, 2016
in
Theory of Computation

111
views
madeeasytestseries
theoryofcomputation
identifyclasslanguage
50,650
questions
56,236
answers
194,256
comments
95,861
users