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. For hardcopy of previous year questions please see
here
Questions 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
0
votes
0
answers
1
https://www.geeksforgeeks.org/wpcontent/uploads/gq/2016/02/GATECS201612.png
asked
3 days
ago
in
Discrete Mathematics

5
views
functions
0
votes
1
answer
2
Ace test
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true? S(n)=O(t(n)) correct How???
asked
5 days
ago
in
Algorithms

36
views
acetestseries
+3
votes
1
answer
3
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
asked
Jan 22
in
Algorithms

103
views
timecomplexity
asymptoticnotations
+2
votes
0
answers
4
Declarartion
Void fun(){ int i=0; Printf("%d", i); Static in j=12; // this is error to declare here right????? J=j+1; }
asked
Jan 18
in
Programming

92
views
programminginc
+1
vote
0
answers
5
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

114
views
coandarchitecture
+1
vote
0
answers
6
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????????????????????
asked
Jan 17
in
CO & Architecture

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

49
views
datastructure
+2
votes
0
answers
8
database
what is the concept of nested loop join in database????????? link plz or give any example.
asked
Jan 12
in
Databases

26
views
rdbmstables
+2
votes
0
answers
9
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 timeout occurs, after ... to send 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

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

112
views
graphtheory
+1
vote
0
answers
11
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

95
views
0
votes
0
answers
12
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
asked
Dec 30, 2017
in
Mathematical Logic

27
views
engineeringmathematics
0
votes
0
answers
13
Graphs
How many subgraph with atleast one vertices does k2 have?
asked
Dec 19, 2017
in
Mathematical Logic

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

24
views
computernetworks
0
votes
0
answers
15
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

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

46
views
regularexpressions
0
votes
0
answers
17
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

48
views
datastructure
0
votes
1
answer
18
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

54
views
datastructure
0
votes
0
answers
19
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
asked
Dec 2, 2017
in
Programming

51
views
datastructure
0
votes
1
answer
20
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
asked
Dec 2, 2017
in
Algorithms

63
views
datastructure
+1
vote
1
answer
21
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.
asked
Oct 17, 2017
in
Databases

124
views
indexing
0
votes
2
answers
22
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 ordered by the key field SSN and want to construct a secondary index on SSN and find out the number of blocks required in the first level index.
asked
Oct 17, 2017
in
Databases

73
views
indexing
+1
vote
0
answers
23
DIGITAL GATE
EXPLAIN PLZ
asked
Jul 30, 2017
in
Digital Logic

88
views
digitallogic
+1
vote
1
answer
24
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, 2017
in
Databases

136
views
databases
+2
votes
0
answers
25
dbms query
how min() and max() work with non numeric value?
asked
Jul 17, 2017
in
Databases

89
views
databases
sql
+1
vote
1
answer
26
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, 2017
in
Verbal Ability

70
views
numericalability
+1
vote
2
answers
27
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?????????//
asked
Jul 10, 2017
in
Algorithms

60
views
binarysearchtree
+1
vote
0
answers
28
graph theory
can we say a null graph is eulerian circuit and hamiltonian circuit?
asked
Jul 8, 2017
in
Mathematical Logic

101
views
graphtheory
graphconnectivity
0
votes
1
answer
29
NPDA and DPDA
Can we make NPDA? L= {anbn n>=0,a,b are input variables} if yes then make it .
asked
Jul 6, 2017
in
Theory of Computation

236
views
pushdownautomata
npda
+1
vote
1
answer
30
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
asked
Jul 5, 2017
in
Mathematical Logic

45
views
graphtheory
Page:
1
2
3
4
next »
39,825
questions
46,802
answers
140,978
comments
58,918
users