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 pradeepchaudhary
User pradeepchaudhary
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User pradeepchaudhary
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
Made Easy Test Series:AlgorithmDijkstra
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??
answered
Jun 28
in
Algorithms

81
views
madeeasytestseries
algorithms
0
votes
2
Andrew S. Tanenbaum Edition 5 Exercise 4 Question 6 (Page No. 351)
What is the length of a contention slot in CSMA/CD for (a) a 2km twinlead cable (signal propagation speed is 82% of the signal propagation speed in vacuum)?, and (b) a 40km multimode fiber optic cable (signal propagation speed is 65% of the signal propagation speed in vacuum)?
answered
May 21
in
Computer Networks

112
views
computernetworks
lantechnologies
ethernet
csmacd
0
votes
3
Andrew S. Tanenbaum Edition 5th Exercise 4 Question 20 (Page No. 352)
How many frames per second can gigabit Ethernet handle? Think carefully and take into account all the relevant cases. Hint: the fact that it is gigabit Ethernet matters.
answered
May 21
in
Computer Networks

54
views
computernetworks
ethernet
tanenbaum
lantechnologies
+1
vote
4
dbms normalization  2nf/bcnf query
Consider the following relational schemes: R(A, B, C, D, E, F) and S(A, B, C) with in the following functional dependencies: I. AB > C II. C > ABDE III. ADE > F Assume {A,B} is the key for both schemes. Which of the ... C is the relation for the S table, which satisfies BCNF properties. (So S is in BCNF) Please let me know if it is correct or not.
answered
May 10
in
Databases

80
views
databasenormalization
databases
0
votes
5
Operation systems 2019
If the memory is 768 MB and the block’s size is 384 Bytes, what will be the size of the bitmap in Bytes? I think it should be 2^21 Bytes, but I’m not quite sure. Could you show me also your solution?
answered
Mar 10
in
Operating System

75
views
+1
vote
6
Programming Stack (ACE)
Runtime stack doesnot contain (A) Local variables (B) Static Variables (C) Parameter Passed (D) Return Address
answered
Mar 7
in
Programming

142
views
stack
+2
votes
7
cpu scheduling
In which of the following case CPU utilization will be higher? (a) If all the processes are I/O bound (b) Is all the processes are equally CPU bound and I/O bound (c) If all the processes are CPU bound (d) Both (B) and (C)
answered
Feb 14
in
Operating System

94
views
operatingsystem
cpuscheduling
0
votes
8
self doubt
Can we solve fractional knapsack using dynamic programming?
answered
Feb 14
in
Algorithms

58
views
+1
vote
9
#DBMS ER Model  Minimum Number of tables
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
answered
Jan 28
in
Databases

317
views
databases
erdiagram
ertorelational
relational
0
votes
10
GATE 2013 MA Calculus
answered
Jan 3
in
Calculus

29
views
0
votes
11
B + TREE DELETION
CAN SOMEONE PLZ EXPLAIN TO ME DELETION IN B+ TREES?? I AM NOT ABLE TO UNDERSTAND CLEARLY.
answered
Dec 22, 2018
in
Databases

226
views
btree
datastructure
databases
0
votes
12
Self doubt
Consider a B+ tree in which the maximum number of keys in a Internal node is 5 and maximum number of keys in a leaf node is 4. What is the minimum number of keys in any nonroot node?
answered
Dec 22, 2018
in
Databases

68
views
databases
btree
+2
votes
13
B+ tree doubt
Consider a B+ tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a nonroot node? What will be the same in a BTree Please also refer the source from where clearcut formulae are given
answered
Dec 22, 2018
in
Databases

88
views
btree
databases
0
votes
14
Depth First Search
answered
Dec 8, 2018
in
Algorithms

51
views
0
votes
15
MadeEasy Subject Test: Programming & DS  Programming in C
answered
Dec 7, 2018
in
Programming

168
views
madeeasytestseries
programminginc
programming
0
votes
16
Hashing
Suppose you insert three keys into a hash table with m slots. Assuming the simple uniform hashing assumption, and given that collisions are resolved by chaining, what is the probability that both slots 0 and 1 are empty? (A) (m−2) /(m−1) (B) (m−2) /m (C) ((m−2) /m )3 (D) None
answered
Dec 2, 2018
in
DS

190
views
hashing
datastructure
uniformhashing
+1
vote
17
GATE2007IT28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
answered
Dec 2, 2018
in
DS

6.2k
views
gate2007it
datastructure
hashing
probability
normal
0
votes
18
double hashing
can any one explain double hashing example
answered
Dec 2, 2018
in
Algorithms

127
views
0
votes
19
Double hashing
How many probes takes place to insert a sequence of numbers: 14, 17, 25, 37, 34, 16, 26, into a hash table of size 11, using Double hashing, where h(x) = x mod 11, h2(x) = x mod 7 + 1 ? I am getting collision even after using h2(x) for 16 Please somebody can explain it? Given solution :
answered
Dec 1, 2018
in
DS

452
views
hashing
datastructure
+1
vote
20
turing machine
is this halting problem thats why undecidable??
answered
Nov 29, 2018
in
Theory of Computation

26
views
0
votes
21
shortest path
Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t. T/F
answered
Nov 28, 2018
in
Algorithms

340
views
graphalgorithms
shortestpath
graphtheory
0
votes
22
Ace Test Series
answered
Nov 28, 2018
in
Algorithms

226
views
algorithms
shortestpath
acetestseries
0
votes
23
Bellman Ford Shortest path
Is the below statement correct: Bellman Ford finds all negative weight cycles in the graph. This is true or false?
answered
Nov 28, 2018
in
Algorithms

535
views
algorithms
shortestpath
bellmanford
negativecycles
0
votes
24
Shortest path  bellman ford and floyd warshall
Consider the following statements with respect to a directed graph G in which edges can have positive or negative edge length but that has no negative cycles: S1 : The BellmanFord algorithm correctly computes shortest path ... FloydWarshall algorithm correctly computes shortest path lengths between every pair of vertices. Which of them is correct?
answered
Nov 28, 2018
in
Algorithms

858
views
algorithms
shortestpath
bellmanford
negativecycles
0
votes
25
Shortest Path Algorithms
For a given undirected weighted graph G with V number of vertices, if you want to find all pair shortest paths then which one of the following is true ? a) run dijkstra's shortest path algorithm only once. b) run dijkstra's shortest path algorithm V times. What if the given graph is directed ?
answered
Nov 28, 2018
in
Algorithms

280
views
algorithms
graphalgorithms
shortestpath
0
votes
26
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?
answered
Nov 1, 2018
in
Algorithms

1.5k
views
sorting
algorithms
0
votes
27
Transaction Query
Consider the following schedules: S1: r1(A); r1(B); w1(C); w2(D); w1(A); w2(A); r1(D); S2: r1(A); r1(B); r1(C); r1(D); w1(A); w2(B); w3(C); w4(D) Which of the following option is correct? A) S1 has blind write S2 does ... blind write S1 does not C) Both schedules are conflict serializable D) None of the above Correct me if I am wrong but I think S1 and S2 both have blind writes?
answered
Nov 1, 2018
in
Databases

25
views
+2
votes
28
TOC SELF DOUBT
Which of the following is true:? 1) For a given grammar, there is one and only one language. 2) For a given language, there is one and only one grammar. Please explain with example.
answered
Oct 29, 2018
in
Theory of Computation

27
views
0
votes
29
switch case
int main() { int a =50; switch(a) { default: a=45; case 49: a++; case 50: a; case 51: a =a+1; } printf("%d",a); } my doubt is the default case is not executed here why??, what is a value of a the end??
answered
Sep 30, 2018
in
Programming

145
views
switch_case
programminginc
+1
vote
30
self doubt
is L a regular lang. or CFL ? L={XWWR w$\epsilon$(0+1)+ ,x$\epsilon$(0+1)+} explain how?
answered
Sep 30, 2018
in
Theory of Computation

55
views
0
votes
31
C programming
What is the output of this program? int main(void) { int a = 10, b = 20, c = 30; printf(" %d..%d..%d ", a+b+c, (b = b*2), (c = c*2)); return 0; } (A) 60..40..60 (B) 110..40..60 (C) 110..20..30 (D) 60..20..30 does sequence point comes into picture here?
answered
Sep 29, 2018
in
Programming

98
views
programminginc
programming
pointers
0
votes
32
minimal DFA
Let L be the set of all binary strings whose last two symbols are the same. The number states of the minimal DFA for L has a)2 b)5 c)8 d)3 explain!!
answered
Sep 29, 2018
in
Theory of Computation

47
views
theoryofcomputation
0
votes
33
please solve my doubt
1) C,C++,JAVA are finite language or not 2) Every finite language are regular .it is true 3) All regular language are Finite
answered
Sep 29, 2018
in
Theory of Computation

33
views
0
votes
34
MadeEasy Test Series: Theory Of Computation  Finite Automata
The difference between the number of states in minimal DFA and minimal NFA, which accepts all strings end with 3rd bit as b is _____. [ Assume $\sum$ = {a,b} ]
answered
Sep 29, 2018
in
Theory of Computation

135
views
madeeasytestseries
theoryofcomputation
finiteautomata
0
votes
35
Deterministic Finite Automata ( DFA)
Construct a DFA over Σ=(a,b) so that it accepts all strings where 1) 2nd symbol from the right is 'a' 2) 3rd symbol from the right is 'a'
answered
Sep 29, 2018
in
Theory of Computation

93
views
theoryofcomputation
finiteautomata
finiteautomata
0
votes
36
Aptitude Doubt
(11/3) (11/4) (11/5)...(11/n)=x then the value of x is : a)1/n b)2/n c)2(n1)/n d)2/n(n+1)
answered
Sep 29, 2018
in
Numerical Ability

87
views
numericalability
+3
votes
37
time complexity
If both of the algorithms A and B need O(nlogn) time then they both are equally efficient and finish in same amount of time. TRUE OR FALSE
answered
Sep 29, 2018
in
Algorithms

98
views
timecomplexity
algorithms
asymptoticnotations
0
votes
38
C output
void main() { char*s[]={"iceland","Greenland","Ireland","Switzerland"}; char **ptr[]={s+3,s+2,s+1,s}; char ***p=ptr; printf(\%s ",**++p); printf(\%s ",*(*++p+3); printf(\%s ",*p[2]+3); printf(\%s ",p[1][1]+1); }
answered
Sep 28, 2018
in
Programming

95
views
programminginc
output
#programminginc
#output
#explanation
+4
votes
39
MIT assignment
Find the complexity of the following code fragment: int i = 1; for(; i <= n logn; i + +) { for(i + +; i <= n; i + +) { print(1) } }
answered
Sep 28, 2018
in
Algorithms

135
views
timecomplexity
asymptoticnotations
algorithms
Page:
1
2
next »
50,647
questions
56,479
answers
195,422
comments
100,564
users