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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent activity by akankshadewangan24
User akankshadewangan24
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User akankshadewangan24
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
aptitude
a principal become rupee 900 after 3 years and 1200 after 6 years on simple intrest then find the principal and rate of intrest?
answer selected
Oct 31
in
Verbal Ability

55
views
numericalability
4
answers
2
GATE20151_34
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram: For any $x, y ∈ L$, not necessarily distinct , $x ∨ y$ and $x ∧ y$ are join and meet of $x, y$, respectively. Let $L^3 = \left\{\ ... or; z)$. Then $p_r = 0$ $p_r = 1$ $0 < p_r ≤ \frac{1}{5}$ $\frac{1}{5} < p_r < 1$
commented
Oct 21
in
Set Theory & Algebra

2.1k
views
gate20151
settheory&algebra
normal
lattice
4
answers
3
GATE20151_16
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE? $\phi ∈ 2^{A}$ $\phi ⊆ 2^{A}$ $\left\{5,\left\{6\right\} ... \{5,\left\{6\right\}\right\} ⊆ 2^{A}$ I and III only II and III only I, II and III only I, II and IV only
commented
Oct 21
in
Set Theory & Algebra

2k
views
gate20151
settheory&algebra
sets
normal
1
answer
4
Indexing
Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long,and a record pointer is P R =7 bytes long. A file has r=30,000 EMPLOYEE records of fixedlength. Each record size is fixed 50 bytes. Find out the no. Of block b requires .assuming an unspanned organization.
commented
Oct 21
in
Databases

76
views
indexing
1
answer
5
Indexing
consider a display block size is equal to 1024 bytes A block pointer 6 byte and record pointer 8 byte the file has 10000 employees record every record is fixed length of 100 bytes it is he is SSN which is a 2 byite the file is not ... field SSN and want to construct a secondary index on SSN and find out the number of blocks required in the first level index.
edited
Oct 18
in
Databases

38
views
indexing
1
answer
6
ACE Class Test
Find what FD is violated by the Relation R = { } i.e. empty relation a. All FD b. Does not violate FD's c. Cannot say d. None of the Above
commented
Oct 17
in
Databases

120
views
acetestseries
databases
functionaldependencies
0
answers
7
Given the following relational schemas
commented
Oct 16
in
Databases

161
views
databases
relationalalgebra
relationalcalculus
1
answer
8
Tuple relational calculus
An undirected simple graph is represented as G(a,b) and a tuple (x,y)€ G if x and y are adjacent vertices. which of the following can not be computed by a TRC query ? (A) Set of vertices who belongs to four length cycle ... Set of vertices which belongs to some cycle (D) Set of vertices which have degree n1 where (n=total number of vertices)
commented
Oct 16
in
Databases

120
views
database
tuplerelationalcalculus
relationalcalculus
0
answers
9
self doubt
in the question below in relational algebra if we use projection the relation is considered as a set and hence duplicates are not allowed will even trc and drc follow the same rule ?? rest all i understood only this point is doubtful https://gateoverflow.in/1546/gate2013_35 please clarify
commented
Oct 16
in
Databases

59
views
databases
tuplerelationalcalculus
domain
relationalcalculus
3
answers
10
GATE19937.9, UGCNETDec2012III41
commented
Oct 8
in
Operating System

3.3k
views
gate1993
operatingsystem
resourceallocation
normal
ugcnetdec2012iii
1
answer
11
Ethernet
if an ethernet station collide 4 time in trying to transmit a single frame how long might it be before the next attempt? a)768 microsec b)819.2 microsec c)409.6 microsec d)none
commented
Sep 20
in
Computer Networks

276
views
ethernet
2
answers
12
GATE200643
Consider a new instruction named branchonbitset (mnemonic bbs). The instruction bbs reg, pos, label jumps to label if bit in position pos of register operand reg is one. A register is 32 bits wide and the bits are numbered 0 to 31, ... } << pos$ $ mask\leftarrow \text{0xffffffff} << pos$ $ mask\leftarrow pos $ $ mask\leftarrow \text{0xf}$
commented
Sep 8
in
CO & Architecture

1.2k
views
gate2006
coandarchitecture
normal
instructionexecution
2
answers
13
GATE2007IT65
Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with 1000 tuples. Assume that the attribute values for A among the tuples are uniformly distributed in the interval [0, 500]. Which one of the following options is the best estimate of the number of tuples returned by the given selection query ? 50 100 150 200
commented
Aug 29
in
Databases

1.3k
views
gate2007it
databases
relationalcalculus
probability
uniformdistribution
normal
0
answers
14
DIGITAL GATE
EXPLAIN PLZ
asked
Jul 30
in
Digital Logic

81
views
digitallogic
1
answer
15
constraints
whats is difference between key constraints and entity integrity constraints? i assume that entity integrity constraints is that in which primary key should not be null and unique but in key constraints pkis also there is entity integrity onstraint is the part of primary key constraints???????????????
asked
Jul 20
in
Databases

77
views
databases
0
answers
16
dbms query
how min() and max() work with non numeric value?
asked
Jul 17
in
Databases

77
views
databases
sql
1
answer
17
Comparisons in merge sort
Can pls someome. Tell.number of comparisons in. Merge sort in best case as well as worst case. Acc to. Me, at. Each level we need O(n) comaprisons and number of levels are log n in merge sort(whether it. Is a best case or worst case).hence mumber o comparisons should be nlogn in worst case as well as best case. Pls guide me.
commented
Jul 13
in
Algorithms

244
views
algorithms
mergesort
1
answer
18
aptitude
a person sell branded shirts each at rs 1134 after giving discount pof 19% on the market price price .had he not given the discount he would have earned a profit of 40% on the cost price .what is his profit % after the discount is given a.15 % b.13.40%
asked
Jul 13
in
Verbal Ability

54
views
numericalability
3
answers
19
GATE200367
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows. $$w(e) = \begin{cases} 0 \text{ if } e \in E_1 \\1 \text{ otherwise} \end{cases}$$ A single ... The number of edges in the shortest paths from $v_1$ to all vertices of $G$ $G_1$ is connected $V_1$ forms a clique in $G$ $G_1$ is a tree
comment edited
Jul 10
in
Algorithms

1.8k
views
gate2003
algorithms
graphalgorithms
normal
2
answers
20
traversal
how to make binary search tree from the given post order traversal 1,2,3,4................n if no inorder or preorder is mentioned?????????//
commented
Jul 10
in
Algorithms

40
views
binarysearchtree
5
answers
21
GATE200436
A circularly linked list is used to represent a Queue. A single variable $p$ is used to access the Queue. To which node should $p$ point such that both the operations $\text{enQueue}$ and $\text{deQueue}$ can be performed in constant time? rear node front node not possible with a single pointer node next to front
commented
Jul 9
in
DS

2.6k
views
gate2004
datastructure
linkedlists
normal
5
answers
22
GATE20045
The best data structure to check whether an arithmetic expression has balanced parentheses is a queue stack tree list
commented
Jul 9
in
DS

1.5k
views
gate2004
datastructure
easy
stack
0
answers
23
graph theory
can we say a null graph is eulerian circuit and hamiltonian circuit?
asked
Jul 8
in
Mathematical Logic

66
views
graphtheory
graphconnectivity
1
answer
24
GATE20055
A program P reads in 500 integers in the range [0, 100] representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies? An array of 50 numbers An array of 100 numbers An array of 500 numbers A dynamically allocated array of 550 numbers
commented
Jul 6
in
DS

1.5k
views
gate2005
datastructure
arrays
easy
1
answer
25
GATE2004IT53
An array of integers of size n can be converted into a heap by adjusting the heaps rooted at each internal node of the complete binary tree starting at the node ⌊(n  1) /2⌋, and doing this adjustment up to the root node (root node is at index 0) in the ... . The time required to construct a heap in this manner is O(log n) O(n) O (n log log n) O(n log n)
commented
Jul 6
in
DS

1k
views
gate2004it
datastructure
heap
normal
2
answers
26
GATE1994_1.11
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, nonzero elements, (i.e elements of lower triangle) of each row are stored one after another, starting from the first row, ... is: $i+j$ $i+j1$ $(j1)+\frac{i(i1)}{2}$ $i+\frac{j(j1)}{2}$
commented
Jul 6
in
DS

2k
views
gate1994
datastructure
arrays
normal
1
answer
27
NPDA and DPDA
Can we make NPDA? L= {anbn n>=0,a,b are input variables} if yes then make it .
commented
Jul 6
in
Theory of Computation

62
views
pushdownautomata
npda
1
answer
28
graph
a tree with n vertices can have at most 1 perfect matching how? perfect matching means no vertices will be left with 0 dergree right so how a tree can have a perfect matching explain with the help of trees plz
commented
Jul 5
in
Mathematical Logic

30
views
graphtheory
1
answer
29
aptitude
a company is considering proposal of purchasing a machine either by making full payment of Rs 4000 otr by leasing it for 4 years at an annnual rent of rs 1250 .which course of action is preferable ,if company can borrow maney at 14% per annum ? a.leasing preferable b.leasing not preferable
asked
Jul 4
in
Verbal Ability

33
views
numericalability
1
answer
30
T(n)=2T(floor(sqrt(n))+log n
the solution of recurrence relation T(n)=2T(floor(sqrt(n))+log n
commented
Jul 4
in
Algorithms

1.8k
views
2
answers
31
time complexity
what the time complexity for T(n)=5T(n/2)+n^2 a. n b.n^2
edited
Jul 4
in
Algorithms

98
views
timecomplexity
1
answer
32
Finite automata
Which of the following statement(s) are true about NFA & DFA? (i) NFA is more powerful than DFA but DFA is more efficient than NFA. (ii) NFA will respond for only valid inputs and no need to respond for invalid inputs. ... of dead states and complement in NFA. (iv) NFA is a parallel computing system where we can run multiple threads concurrently.
commented
Jul 4
in
Theory of Computation

194
views
theoryofcomputation
finiteautomata
dfa
nfa
2
answers
33
huffman coding
how to find the comparision complexities in huffman coding algorithm?
answer selected
Jul 3
in
Algorithms

117
views
huffmancode
3
answers
34
GATE19992.20
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is: $165$ $90$ $75$ $65$
commented
Jul 3
in
Algorithms

1.2k
views
gate1999
algorithms
normal
greedyalgorithm
4
answers
35
profit loss
The selling price of table is 4/5 times its cost price .the gain % is?????
asked
Jul 2
in
Verbal Ability

66
views
profitloss
1
answer
36
GATE19991.14, ISRO201542
If one uses straight twoway merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$ then the order of these elements after second pass of the algorithm is: $8, \ 9, \ 15, \ 20, \ 47, \ 4 ... , \ 12, \ 30, \ 40, \ 17$ $4, \ 8, \ 9, \ 15, \ 20, \ 47, \ 12, \ 17, \ 30, \ 40$
commented
Jul 2
in
Algorithms

2.5k
views
gate1999
algorithms
sorting
normal
isro2015
2
answers
37
GATE199207b
Consider the function $F(n)$ for which the pseudocode is given below : Function F(n) begin F1 ← 1 if(n=1) then F ← 3 else For i = 1 to n do begin C ← 0 For j = 1 to n – 1 do begin C ← C + 1 end F1 = F1 * C end F = F1 end [$n$ is a positive integer greater than zero] Solve the recurrence relation for a closed form solution of $F(n)$.
commented
Jun 30
in
Algorithms

293
views
gate1992
algorithms
recurrence
descriptive
0
answers
38
programming
int x = 0, i; for (i = 0; i < 10, i++) if (i%2 && x++) x += 2; value of x after execution ?
commented
Jun 30
in
Programming

54
views
1
answer
39
grammer in compiler design
Which of the following grammars are not phasestructured? (a) regular (b) contextfree (c) contextsensitive (d) none of the above
commented
Jun 30
in
Compiler Design

244
views
0
answers
40
query
what is a diifference between list and self refrential list?
asked
Jun 30
in
Others

33
views
general
29,167
questions
36,992
answers
92,225
comments
34,837
users