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 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
1
answer
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
1
answer
2
ISRO201373
What are the final states of the DFA generated from the following NFA? $q_{0}, q_{1}, q_{2}$ $[q_{0}, q_{1}], [q_{0}, q_{2}], [ ]$ $q_{0}, [q_{1}, q_{2}]$ $[q_{0}, q_{1}], q_{2}$
commented
Jun 28
in
Theory of Computation

2.2k
views
isro2013
theoryofcomputation
finiteautomata
2
answers
3
ISRO201826
The $FSM$ (Finite State Machine) machine pictured in the figure above Complements a given bit pattern Finds $2's$ complement of a given bit pattern Increments a given bit pattern by $1$ Changes the sign bit
commented
Jun 28
in
Theory of Computation

1.3k
views
isro2018
finiteautomata
theoryofcomputation
mooremealymachine
1
answer
4
networks TCP
Calculate the effective throughput for transferring a 1000 KB file assuming TCP using slow start congestion control technique. Given the round trip time 100 ms, and maximum segment size is 1460 bytes. Assume there are no losses and both the bandwidth and the receiver window size is infinite. (A) 5MBPS (B) 10Mbps (C) 1MBPS (D) 1Mbps
asked
May 22
in
Computer Networks

111
views
2
answers
5
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

116
views
computernetworks
lantechnologies
ethernet
csmacd
1
answer
6
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

55
views
computernetworks
ethernet
tanenbaum
lantechnologies
1
answer
7
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
1
answer
8
analysis of algorithm
commented
May 10
in
Algorithms

60
views
0
answers
9
Networking : Flow Control Methods
What is the effect on line utilization if we increase the number of frames for a constant message size? Lower line efficiency Higher line efficiency No change in line efficiency No relation between line efficiency and frame size
commented
Mar 25
in
Computer Networks

37
views
1
answer
10
Ace Test Series: Operating System  Fork()
commented
Mar 10
in
Operating System

333
views
operatingsystem
fork
acetestseries
2
answers
11
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
answer
12
Banker Algo(ACE)
Banker algorithm is used by OS to avoid the deadlock. Following table shows the current allocation and maximum demand by process $P_{1}$,$P_{2}$,$P_{3}$ and $P_{4}$ for the instances $A,B,C$ Process Max Demand (A,B,C) Current Allocation(A,B,C) $P_{1}$ ... of $A,B,C$ respectively Req2: $P_{4}$ requests $1,0,1$ of $A,B,C$ respectively Which of these two requests will be granted?
commented
Mar 8
in
Operating System

136
views
operatingsystem
bankersalgorithm
1
answer
13
MadeEasy WorkBook: Programming & DS  Programming in C
for(i=10;i<10;++i) printf("%d" i&1) prints (a) 0101010101 (b) 0111111111 (c) 0000000000 (d) 1111111111
commented
Mar 8
in
Programming

96
views
madeeasybooklet
programming
programminginc
0
answers
14
MadeEasy Subject Test 2019: Programming & DS  programming in C
void foo(int n) { for(i1=1;i1<=n;i1++) { for(i2=1;i2<=i1;i2++) { ....... { for(i6=1;i6<=i5;i6++) { count++; } } } } } Count initially 0.What is value returned by foo(8)?
commented
Mar 8
in
Programming

170
views
programminginc
programming
madeeasytestseries2019
madeeasytestseries
1
answer
15
Programming doubt(ACE)
void print(int i){ static int x=4; if(i!=0){ print(x); } printf("%d",x); } What will be output printed for print(10)? Will it print value as call by value or call by reference?
commented
Mar 7
in
Programming

100
views
programminginc
output
programming
2
answers
16
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
0
answers
17
ACE Test Series:Programming in C
#include <stdio.h> int main(void) { char s1[15]="SREE"; char s2[10]="ALL THE BEST"; strcpy(s2,s1); printf("\n%s",s2); return 0; } 1)How s2 will contain a string of size 12, while it only contain ... copying , I mean SREETHE BEST Will it work like pointer that s2 pointing to same as s1? Anything link good to read about strcpy
commented
Mar 7
in
Programming

89
views
programminginc
0
answers
18
ACE test Series: Programming and DSProgramming
void find(int x){ static int i=10,y=0; y=y+i; for(i;i>0;i=i10){ if(x!=0) find(x1); else{ printf("%d",y); } } } What will be output printed for find(4)?
commented
Mar 7
in
Programming

136
views
programminginc
acetestseries
programming
1
answer
19
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

95
views
operatingsystem
cpuscheduling
1
answer
20
self doubt
Can we solve fractional knapsack using dynamic programming?
answered
Feb 14
in
Algorithms

58
views
1
answer
21
Propositional logic self doubt
q = you can access the library r = you have a valid ID s = you have paid subscription fee of that day Consider the following English sentence “You cannot access the library if you don’t have a valid ID unless you have paid subscription fee of that day” which of the following is the correct logical expression? $q \rightarrow (r \vee s )$ $(q \rightarrow r) \vee s$
commented
Feb 2
in
Mathematical Logic

74
views
propositionallogic
discretemathematics
firstorderlogic
mathematicallogic
1
answer
22
First Order Logic
Please explain the Question number 33 and 34. What is significance of word "only" ?
commented
Feb 2
in
Mathematical Logic

40
views
2
answers
23
ER Diagrams  Minimum Number of Tables required
How many minimum number of tables needed for this Quaternary Relationship?
commented
Jan 28
in
Databases

378
views
databases
erdiagram
ertorelational
relational
5
answers
24
#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

319
views
databases
erdiagram
ertorelational
relational
0
answers
25
#DBMS
What are the parameters or procedure to follow to find out minimum no. of tables for given ER Diagram type of questions?
commented
Jan 28
in
Databases

81
views
databases
sql
erdiagram
erdiagram
0
answers
26
Programming in c
commented
Jan 17
in
Programming

45
views
1
answer
27
calculus question
Question Number 4?
asked
Jan 4
in
Calculus

48
views
calculus
1
answer
28
Integration
Value of an Integral : I = $\frac{1}{\sqrt{2\Pi }} \int_{0}^{\infty } e^{\frac{x^{2}}{8}}dx$ Answer given is 1.
commented
Jan 3
in
Calculus

254
views
engineeringmathematics
calculus
integration
1
answer
29
CalculusIntegration
$\int x^7.e^{x^4}dx$ How to do this?
commented
Jan 3
in
Calculus

118
views
calculus
integration
1
answer
30
GATE 2013 MA Calculus
answered
Jan 3
in
Calculus

29
views
0
answers
31
MaximaMinima: EC GATE 2014
$The\ maximum\ value\ of\\f(x)\ =\ 2x^39x^2+12x3\ in\ the\ interval\ 0<=x<=3\ is\ $ _____________________
commented
Jan 3
in
Calculus

378
views
engineeringmathematics
calculus
maximaminima
1
answer
32
Closure Properties
What is difference between Σ* and L* ? Which is true ? S1 : Σ* – {ϵ} = Σ+ S2 : L* – {ϵ} = L+ .
commented
Dec 26, 2018
in
Theory of Computation

223
views
theoryofcomputation
closureproperty
regularlanguages
1
answer
33
MadeEasyAlgo
Maximum profit using 0/1 Knapsack with W=200 is there any other than brute force method to solve this??? or we have to do only with tabular method?please solve and mention the way that is efficient w.r.t time if any.
commented
Dec 24, 2018
in
Algorithms

57
views
2
answers
34
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

227
views
btree
datastructure
databases
2
answers
35
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
0
answers
36
B+ Tree Doubt
Why internal node split isn't counted in this question? Only leaf node split is counted. https://gateoverflow.in/1330/gate200944
commented
Dec 22, 2018
in
Databases

40
views
btree
databases
2
answers
37
B+ Tree Self Doubt
what is the minimum and maximum number of keys for nonleaf nodes and leaf nodes for B+ Tree of order p?
commented
Dec 22, 2018
in
Databases

189
views
btree
databases
indexing
multilevel
1
answer
38
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
1
answer
39
Depth First Search
answered
Dec 8, 2018
in
Algorithms

51
views
1
answer
40
Depth First Search: Finding if The graph is connected
Better Explanation??
asked
Dec 8, 2018
in
DS

50
views
datastructure
dfs
graphalgorithms
50,647
questions
56,493
answers
195,478
comments
100,785
users