Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by yogi_p
6
votes
0
answers
1
IIT Gandhinagar & IIT Ropar
I want to know about these 2 budding institutes IIT Gandhinagar & IIT Ropar. How's their M.Tech Programme for Computer Science ? What about Placements? How worth is it to join these institutes ? What about their ranking among ... is not much vivid discussion about these institutes anywhere . Any information / review about these institutes would be great Thanks
I want to know about these 2 budding institutes IIT Gandhinagar & IIT Ropar.How's their M.Tech Programme for Computer Science ? What about Placements?How worth is it to j...
1.9k
views
asked
Mar 11, 2018
IISc/IITs
iit
mtech
admission
+
–
2
votes
0
answers
2
Programming Question
Find the output printed by this program. Pls. Explain the Execution of this program in detail. Thanks
Find the output printed by this program.Pls. Explain the Execution of this program in detail.Thanks
1.1k
views
asked
Jan 22, 2018
Programming in C
programming-in-c
programming
output
+
–
2
votes
2
answers
3
Undecidability Confusion
I was Studying About Undecidability on GateCSE. I am facing a doubt that : L = {<M> | M accepts "1"} L is set of String & each String is an Encoding of TM & TM accepts 1 L = {<M> | L(M) = {1}} Given a Input Program ... really is difference between both of them ? Can you definition of 2 in words like " L is set of String ............"
I was Studying About Undecidability on GateCSE. I am facing a doubt that :L = {<M | M accepts "1"} L is set of String & each String is an Encoding of TM & TM accepts 1L =...
887
views
asked
Jan 13, 2018
Theory of Computation
theory-of-computation
decidability
rice-theorem
+
–
1
votes
2
answers
4
Probablity
Given a coin which gives HEADS with probability 1/4 and TAILS with 3/4. The coin is tossed k times. What is the probability that we get at least k/2 HEADS is less than or equal to? (A) (1/2) k/5 (B) (1/2) k/2 (C) (1/3) k/2 (D) (1/5) k/2 (Explain how to solve the summation of binomial equation that comes up )
Given a coin which gives HEADS with probability 1/4 and TAILS with 3/4. The coin is tossed k times. What is the probability that we get at least k/2 HEADS is less than or...
16.8k
views
asked
Dec 30, 2017
Probability
engineering-mathematics
probability
+
–
1
votes
0
answers
5
Programming
void main( ){ int array[2][3]={5,10,15,20,25,30}; int (*ptr) [2][3]=&array; printf("%d",***ptr); printf("%d",***(ptr+1)); printf("%d",**(*ptr+1)); printf("%d",*(*(*ptr+1)+2)); } A) 5 Garbage 20 30 B) Compiler Error C)10 15 30 20 D) 5 15 20 30 E) 5 0 20 0
void main( ){ int array [3]={5,10,15,20,25,30}; int (*ptr) [3]=&array; printf("%d", *ptr); printf("%d", *(ptr+1)); printf("%d", (*ptr+1)); printf("%d",*(*(*ptr+1)+...
2.1k
views
asked
Dec 28, 2017
Programming in C
programming-in-c
+
–
0
votes
0
answers
6
Switching
What should be the increasing order of channel Utilization among Circuit Switching , Packet Switching & message Switching (Explain.)
What should be the increasing order of channel Utilization among Circuit Switching , Packet Switching & message Switching (Explain.)
179
views
asked
Dec 24, 2017
Computer Networks
computer-networks
+
–
0
votes
1
answer
7
Random Test Series
which protocol has flow control but not error control? Stop-and-Wait Simplest Go-Back-N ARQ Selective-Repeat ARQ Explain ?
which protocol has flow control but not error control?Stop-and-WaitSimplestGo-Back-N ARQSelective-Repeat ARQ Explain ?
364
views
asked
Dec 22, 2017
Computer Networks
computer-networks
+
–
0
votes
0
answers
8
Trail
The edge set of every closed trail can be partitioned into edge sets of cycles True / False (Explain)
The edge set of every closed trail can be partitioned into edge sets of cyclesTrue / False (Explain)
820
views
asked
Dec 21, 2017
Graph Theory
graph-theory
+
–
1
votes
0
answers
9
Random Test Series
A) Yes B) No C) Cannot Say D) None
A) YesB) NoC) Cannot SayD) None
474
views
asked
Dec 8, 2017
Computer Networks
computer-networks
rip
+
–
0
votes
0
answers
10
Find Number of Interfaces
Suppose there are three routers between a source and destination. Ignore fragmentation. An IP datagram sent from the source to the destination will travel over how many interfaces? How many forwarding tables will be indexed to move the datagram from the source to destination? A. ... . 6,4 The Answer is given as C) How We have 8 interfaces ? I am only able to figure out 4.
Suppose there are three routers between a source and destination. Ignore fragmentation. An IP datagram sent from the source to the destination will travel over how many i...
2.5k
views
asked
Dec 8, 2017
Computer Networks
computer-networks
+
–
0
votes
0
answers
11
UGC CS-2013, Ques 46
46. A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case delay in responses to a request? (Note that the speed of light in air is 3,00,000 km/second). (A) 133.33 m sec (B) 266.67 m sec (C) 400.00 m sec (D) 533.33 m sec Why Ans is D not B ?
46. A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case delay in responses to a request? (Note that the s...
354
views
asked
Dec 6, 2017
Computer Networks
computer-networks
+
–
0
votes
0
answers
12
TCP for virtual circuits
TCP can be implemented in virtual circuits. (TRUE /FALSE ) Explain.
TCP can be implemented in virtual circuits. (TRUE /FALSE )Explain.
648
views
asked
Dec 3, 2017
Computer Networks
tcp
+
–
0
votes
0
answers
13
TCP Congestion window
Consider Communication channel using the TCP over the channel. In this channel the congestion window varies from (W*MSS)/2 to W*MSS. If only one packet is lost over each period of time. Then what is the lost rate: A) 1/ (3/8 * W*W + 3W/4) B).1/ (3/4 * W + 3W/4) C) 1 / (3/8 * W*W + 3W/8) D) 1 / (3/4 * W*W + 3W/4)
Consider Communication channel using the TCP over the channel. In this channel the congestion window varies from (W*MSS)/2 to W*MSS. If only one packet is lost over each ...
354
views
asked
Dec 3, 2017
Computer Networks
computer-networks
tcp
+
–
3
votes
2
answers
14
Normalisation
A prime attribute can be intransitively dependent on a key in a 3NF relation. True / False Pls. Do Explain what does intransitivity actually mean here.
A prime attribute can be intransitively dependent on a key in a 3NF relation.True / False Pls. Do Explain what does intransitivity actually mean here.
600
views
asked
Nov 19, 2017
Databases
database-normalization
+
–
2
votes
1
answer
15
Transaction Management
Which of the following protocols does not ensure conflict serializability and safety from deadlocks? Graph based protocols Two-phase locking protocol Time-stamp ordering protocol Both a & b
Which of the following protocols does not ensure conflict serializability and safety from deadlocks?Graph based protocolsTwo-phase locking protocolTime-stamp ordering pro...
1.6k
views
asked
Nov 18, 2017
Databases
transaction-and-concurrency
databases
+
–
3
votes
0
answers
16
Scheduling
Using the shortest remaining time first, find the completion time of process p2, if the context switching overhead is 1 unit. A) 50 B) 32 C) 34 D) 33 (The Doubt I am facing is, if a Process finishes its I/O would the other process would necessarily be preempted even if its remaining time is less than the process who has finished its I/O ? )
Using the shortest remaining time first, find the completion time of process p2, if the context switching overhead is 1 unit.A) 50B) 32C) 34D) 33(The Doubt I am facing is...
653
views
asked
Nov 14, 2017
Operating System
process-scheduling
operating-system
+
–
2
votes
3
answers
17
Scheduling
Consider the processes P1, P2, P3, P4 whose arrival times are 0, 1, 2, 3 and Burst times are 5, 2, 13, 7. If the Context Switching time is 1 unit (ms), what is the average waiting time if Shortest Job Next scheduling algorithm is used? (a) 7.5 (b) 6.25 (c) 6.5 (d) None (The Doubt i am facing here is , would we be covering the context switching time in the starting ?)
Consider the processes P1, P2, P3, P4 whose arrival times are 0, 1, 2, 3 and Burst times are 5, 2, 13, 7. If the Context Switching time is 1 unit (ms), what is the averag...
5.9k
views
asked
Nov 14, 2017
Operating System
process-scheduling
+
–
0
votes
0
answers
18
Bootstrapping in Compilers
Pls. Explain Bootstrapping in Compilers (in detail) & what are the advantages of it ?
Pls. Explain Bootstrapping in Compilers (in detail) & what are the advantages of it ?
446
views
asked
Sep 17, 2017
Compiler Design
compiler-design
+
–
1
votes
0
answers
19
Turing Machine Question
What is the Answer ? What Do it mean by Computable & Turing Enumerable? What is the difference between Turing Recognizable and Turing Enumerable ?
What is the Answer ?What Do it mean by Computable & Turing Enumerable?What is the difference between Turing Recognizable and Turing Enumerable ?
519
views
asked
Aug 17, 2017
Theory of Computation
theory-of-computation
turing-machine
+
–
1
votes
1
answer
20
TOC Question
Whats The Answer & How to solve such kind of Questions ?
Whats The Answer & How to solve such kind of Questions ?
2.1k
views
asked
Aug 11, 2017
Theory of Computation
theory-of-computation
context-free-language
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register