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
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
4
answers
1
GATE200845
Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance to only vertex $a$ only vertices $a, e, f, g, h$ only vertices $a, b, c, d$ all the vertices
commented
6 days
ago
in
Algorithms

3.5k
views
gate2008
algorithms
graphalgorithms
normal
3
answers
2
GATE2006IT25
Consider the undirected graph $G$ defined as follows. The vertices of $G$ are bit strings of length $n$. We have an edge between vertex $u$ and vertex $v$ if and only if $u$ and $v$ differ in exactly one bit position (in other words, $v$ can be obtained from $u$ by ... }$ $\left(\frac{1}{n}\right)$ $\left(\frac{2}{n}\right)$ $\left(\frac{3}{n}\right)$
commented
Feb 13
in
Graph Theory

1.6k
views
gate2006it
graphtheory
graphcoloring
normal
2
answers
3
GATE19903xi
Choose the correct alternatives (More than one may be correct). A graph is planar if and only if, It does not contain subgraphs homeomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain subgraphs isomorphic to $k_{5}$ or $k_{3, 3}$. It does not ... isomorphic to $k_{5}$ or $k_{3, 3}$ It does not contain a subgraph homeomorphic to $k_{5}$ or $k_{3, 3}$.
commented
Feb 13
in
Graph Theory

534
views
gate1990
normal
graphtheory
graphplanarity
3
answers
4
ISRO20157
If half adders and full adders are implements using gates, then for the addition of two 17 bit numbers (using minimum gates) the number of half adders and full adders required will be 0,17 16,1 1,16 8,8
commented
Feb 11
in
Digital Logic

3.6k
views
isro2015
digitallogic
adder
halfadder
2
answers
5
GATE2011GGGA8
Three sisters (R, S, and T) received a total of 24 toys during Christmas. The toys were initially divided among them in a certain proportion. Subsequently, R gave some toys to S which doubled the share of S. Then S in turn gave some of her toys to T, ... were left with equal number of toys. How many toys did R have originally? (A) 8 (B) 9 (C) 11 (D) 12
commented
Jan 27
in
Numerical Ability

294
views
gate2011gg
logicalreasoning
numericalability
1
answer
6
test series
plz help me . how to solve that type of question
answered
Jan 27
in
Algorithms

52
views
algo
1
answer
7
GATE20022.2
Consider the following multiplexer where 10, 11, 12, 13 are four data input lines selected by two address line combinations A1A0=00,01,10,11 respectively and f is the output of the multiplexor. EN is the Enable input. The function f(x,y,z) implemented by the above circuit is xyz' xy + z x + y None of the above
commented
Jan 27
in
Digital Logic

1.9k
views
gate2002
digitallogic
circuitoutput
normal
1
answer
8
arun sharma
commented
Jan 26
in
Numerical Ability

88
views
numericalability
number
system
1
answer
9
ethernet
if an ethernet station collide 4 times to try to transmit a single frame .How long might it wait to be before the next attempt if time slot 51.2 micro sec ...................micro sec. a. 768 b. 819.2 c.409.6 d. none
commented
Jan 26
in
Computer Networks

74
views
ethernet
0
answers
10
time complexity
time complexity questions like : h(n)=O(n2); f(n)= O(logn); g(n)=omega(n2); what is the complexity of :::: 1. h(n)g(n)=?? 2. h(n)f(n)=??? elaborate plz
commented
Jan 22
in
Algorithms

34
views
timecomplexity
asymptoticnotations
3
answers
11
GATE2016Session1GA9
If $\large q^{a} = \dfrac{1}{r}$ and $\large r^{b} = \dfrac{1}{s}$ and $\large s^{c} = \dfrac{1}{q}$, the value of $abc$ is ________. $\left(rqs\right)^{1}$ $0$ $1$ $r+q+s$
comment moved
Jan 22
in
Numerical Ability

292
views
gate2016session1aptitude
numericalability
fractions
1
answer
12
gateforum test series
answer given is : 0.153
commented
Jan 21
in
Probability

119
views
gateforumtestseries
probability
0
answers
13
ACE Test Series
commented
Jan 21
in
Probability

82
views
0
answers
14
Nielt ques
commented
Jan 21
in
Probability

34
views
0
answers
15
Declarartion
Void fun(){ int i=0; Printf("%d", i); Static in j=12; // this is error to declare here right????? J=j+1; }
commented
Jan 18
in
Programming

77
views
programminginc
0
answers
16
Associative mapping
If the main memory is of 128 K byte and the cache memory is of 16 byte line . It uses associative mapping . Then the tag bits for cache blocks are......... 11 bit 21bits 16bits 20 bits
asked
Jan 18
in
CO & Architecture

61
views
coandarchitecture
0
answers
17
Test series
How to calculate number of stalls here I m confused
commented
Jan 18
in
CO & Architecture

56
views
0
answers
18
associative mapping
if the main memory is of 8Kbyte and the cache memory 2K word .it uses associative mapping .then each word of cache memory shall be ................................. ans::::: 16 bits how????????????????????
commented
Jan 18
in
CO & Architecture

117
views
coandarchitecture
2
answers
19
data structure
the number of inversions in (n,n1,.........3,2,1) is n(n1)/2 how??????????????????/
asked
Jan 14
in
Programming

35
views
datastructure
0
answers
20
database
what is the concept of nested loop join in database????????? link plz or give any example.
asked
Jan 12
in
Databases

23
views
rdbmstables
0
answers
21
networking
Consider the effect of using slow start on a line with 10 msec round trip time. The receiver window and the size of congestion window are set to 38 KB and 36 KB respectively. Sender side threshold is set to 18 KB. After 8 transmission a time ... first full window of 18 KB is____________ (in msec). Assume window size at the start of slow start phase is 2 KB.
asked
Jan 11
in
Computer Networks

22
views
computernetworks
0
answers
22
Graph theory
How many simple graph are possible on six vertices in which the number of edge is odd??
commented
Jan 10
in
Mathematical Logic

95
views
graphtheory
0
answers
23
Ptobability
In any given year the probability of an earthquake greater the magnitude 6 occurring in the Himalaya is 0.04 .the average time between successive occurrence of such earthquake is.........year.?
asked
Jan 1
in
Verbal Ability

84
views
0
answers
24
linear algebra
The number of linearly independent eigen vectors of a scalar matrix of order ‘ n ‘ is / are (A)1 (B)2 (C)n1 (D)n
commented
Dec 30, 2017
in
Mathematical Logic

21
views
engineeringmathematics
0
answers
25
Graphs
How many subgraph with atleast one vertices does k2 have?
commented
Dec 19, 2017
in
Mathematical Logic

38
views
0
answers
26
Computer network
523^21mod55687=? And how
asked
Dec 19, 2017
in
Computer Networks

18
views
computernetworks
1
answer
27
Online_Test
answered
Dec 11, 2017
in
Numerical Ability

96
views
acetestseries
numericalability
0
answers
28
turing machine
is recursive enumerable and recursive set both are infinitely countable set??????? explain if yes or why not.
asked
Dec 6, 2017
in
Theory of Computation

24
views
0
answers
29
Regular expression
Infinite intersection of regular set need not be regular. Example please?
asked
Dec 4, 2017
in
Theory of Computation

33
views
regularexpressions
0
answers
30
Data structure
Which of the following statement are true? 1. Computing the most frequently occurring elements in an array a(1....n) can be done in o(nlogn) time.
asked
Dec 2, 2017
in
Programming

43
views
datastructure
0
answers
31
data structtures
complexity of algorithm to interchange the nth and mth element (node) of singly link list is: a.m+n b.m if m>=n otherwise n c.m if m<=n otherwise n d.m+min(m,n) ans given c???????????how
commented
Dec 2, 2017
in
Programming

40
views
datastructure
1
answer
32
data structure
to find the maximum elements in a min heap represnted by an array can be computed in ____________ time a. theta n b.theta n2 c.theta nlogn d.theta 1
asked
Dec 2, 2017
in
Algorithms

44
views
datastructure
0
answers
33
data structure
you are given an array which contain bboth positive and negative integers in it and asked to design an algorithm to find maximum sum which doest contain twp consecutive numbers .what is the time complexiy of efficient algorithm ? nlogn n2 n n2logn
commented
Dec 2, 2017
in
Algorithms

52
views
datastructure
2
answers
34
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, 2017
in
Verbal Ability

58
views
numericalability
5
answers
35
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, 2017
in
Set Theory & Algebra

3k
views
gate20151
settheory&algebra
normal
lattice
4
answers
36
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, 2017
in
Set Theory & Algebra

3k
views
gate20151
settheory&algebra
sets
normal
1
answer
37
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, 2017
in
Databases

99
views
indexing
2
answers
38
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, 2017
in
Databases

58
views
indexing
1
answer
39
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, 2017
in
Databases

137
views
acetestseries
databases
functionaldependencies
0
answers
40
Given the following relational schemas
commented
Oct 16, 2017
in
Databases

176
views
databases
relationalalgebra
relationalcalculus
33,712
questions
40,255
answers
114,367
comments
38,882
users