GATE CSE
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.
Answers by srestha
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
probability
5 cards are drawn successively with replacement from well shuffled deck of 52 cards. What is the probability that i) all the five cards are spades ii) only 3 cards are spades iii) none is a spade.
answered
4 days
ago
in
Probability

37
views
0
votes
2
GATE19903iv
Choose the correct alternatives (More than one may be correct). The total external path length, EPL, of a binary tree with $n$ external nodes is, $EPL= \sum_{w} Iw$, where $I_{w}$ is the path length of external node $w$), $\leq n^{2}$ always. $\geq n \log_{2} n$ always. Equal to $n^{2}$ always. $O(n)$ for some special trees.
answered
4 days
ago
in
DS

108
views
gate1990
normal
datastructure
binarytree
0
votes
3
GATE199011b
The following program computes values of a mathematical function $f(x)$. Determine the form of $f(x)$. main () { int m, n; float x, y, t; scanf ("%f%d", &x, &n); t = 1; y = 0; m = 1; do { t *= (x/m); y += t; } while (m++ < n); printf ("The value of y is %f", y); }
answered
4 days
ago
in
Algorithms

88
views
gate1990
descriptive
algorithms
identifyfunction
0
votes
4
GATE199013a
Consider the heightbalanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig.4. (i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}$ shown in Fig.5 using node D of tree $T_{1}$. (ii) What is ... $T_{1}$ and $T_{2}$ are of height $h_{1}$ and $h_{2}$ respectively, assuming that rotation schemes are given. Give reasons.
answered
4 days
ago
in
DS

115
views
gate1990
descriptive
datastructure
trees
0
votes
5
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.
answered
5 days
ago
in
Databases

47
views
indexing
+2
votes
6
Context Free Languages
Which of the following is CFL? 1. $L=\{a^{m}b^{n}c^{p}d^{q}m+q=n+p\}$ 2.$L=\{a^{m}b^{n}c^{p}d^{q}m+p=n+q\}$ Please also describe the logic of PDA.
answered
Oct 14
in
Theory of Computation

86
views
contextfreelanguages
0
votes
7
DirectionSenseTest
Dhruv facing North walks 3Km at 45° to his right to reach C. Then walks 16Km South, then turns right and walks 7Km, then turns left and walks 8Km to point B. What is the distance between C and B?
answered
Oct 13
in
Numerical Ability

31
views
numericalability
+1
vote
8
MadeEasy TestSeries
Consider the following language, $L= \big\{ xy \mid x, \ y \in \big\{0,1\big\}^{*} \ where \ x \neq y \ but \ x = y \big\}$ The language is ___________. Regular CFL but not regular CSL but not CFL Recursive but not CSL
answered
Oct 12
in
Theory of Computation

147
views
madeeasytestseries
testseries
theoryofcomputation
identifyclasslanguage
0
votes
9
Made Easy
I am getting answer as 88.6 time unit. using Total page service time = 250 x 0.94 + 0.06 x 450 = 262 time units Access time = p( page service time + m) + (1p)(m) = p * page service time + m ( p is page fault rate) Substituting the values i got access time = 88.6 time unit. but the answer is 85.6 time unit. Please point where i am going wrong.
answered
Oct 12
in
Operating System

35
views
+1
vote
10
K. Rosen: Countings
Question How many different strings of length 2 can be made from the letters in 'ORONO'? I am getting 7 strings as follows: OO, ON, OR, NO, RO, RN, NR but given answer is 6.
answered
Oct 12
in
Combinatory

38
views
kennethrosen
discretemathematics
counting
permutationsandcombinations
0
votes
11
#DBMS #FileOragnization
answered
Oct 11
in
Databases

31
views
databases
+1
vote
12
#DBMS #Indexing
answered
Oct 11
in
Databases

34
views
databases
+2
votes
13
#Indexing #DBMS
answered
Oct 11
in
Databases

37
views
databases
0
votes
14
P and C doubt
How many number must be chosen from site {1 2 3 4 5 6 7 8 }such that at least two of them must have sum equal to 9? A.28 B.9 C.5 D.10
answered
Oct 11
in
Combinatory

59
views
0
votes
15
Made easy test series
How L2 is NOT regular and L3 is regular??? please explain
answered
Oct 10
in
Theory of Computation

137
views
0
votes
16
co_williams
A system is based on an 8bit microprocessor and has two I/O devices. The I/O controllers for this system use separate control and status registers. Both devices handle data on a 1byteatatime basis.The first device has two ... given that the first device is an outputonly device? c. How many distinct addresses are needed to control the two devices?
answered
Oct 10
in
CO & Architecture

26
views
+1
vote
17
#Page Faults
The address sequence generated by tracing a particular program executing in a pure demand paging system with 200 records per page with 1 free main memory frame is recorded as follows: 0100, 0139, 0209, 0430, 0237, 0578, 0500, 0730, 0799, 0600 The number of page faults are ________.
answered
Oct 9
in
Operating System

32
views
operatingsystem
pagereplacement
demandpaging
+1
vote
18
output type question
Ans given is D.I want to know the logic behind
answered
Oct 9
in
Programming

64
views
programminginc
output
0
votes
19
reversal
Let L = { 0n 1n  n>=1 } U {0n 1 2n  n>=1} Then reverse of L is A) regular B)DCFL C)CFL but not DCFL D)none
answered
Oct 8
in
Theory of Computation

78
views
0
votes
20
Please explain this q
Q. In a twolevel cache system, the access times of L1 and L2 1 and 8 clock cycles, respectively. The miss penalty from the L2cache to main memory is 18 clock cycles. The miss rate of L1 cache is twice that of L2. The average memory access time(AMAT) ... respectively are: A 0.111 and 0.056 B 0.056 and 0.111 C 0.0892 and 0.1784 D 0.1784 and 0.0892
answered
Oct 7
in
CO & Architecture

32
views
0
votes
21
addressing modes
Indirect addressing modes through registers can be used to access global variables true or false with explanation
answered
Oct 5
in
CO & Architecture

43
views
+1
vote
22
Made Easy Book
answered
Oct 5
in
CO & Architecture

50
views
+4
votes
23
Functionally complete sets
Which of the following set is not functionally complete? a) {XOR,1,NOT} b) {XOR,1,OR} c) {OR, NOT} d) {XOR,1, AND}
answered
Oct 4
in
Digital Logic

71
views
digitallogic
functionalcompleteness
0
votes
24
Programming
The following program #include<stdio.h> main ( ) { int abc ( ); abc ( ); (*abc) ( ); } int abc ( ) { printf (“come”);} (a) results in a compilation error (b) prints come come (c) results in a runtime error (d) prints come
answered
Oct 3
in
Programming

75
views
programminginc
0
votes
25
Self doubt
What are the reasons behind 'Belady's Anomaly' ? I think FIFO causes belady's anomaly because it's don't replace pages mindfully , while LRU,OPTIMAL do . They replace the pages mindfully by taking care of locality. so is Locality of reference reason behind Belady's anomaly ?
answered
Oct 3
in
Operating System

28
views
+1
vote
26
Turing Machine Epsilon
Can Turing Machine accept Epsilon? If yes Why? If no Why no? please elobrate reason in detail.
answered
Sep 20
in
Theory of Computation

56
views
theoryofcomputation
epsilon
+3
votes
27
Logarithms
Evaluate $\frac{1}{n^{\log_{2}n}}$
answered
Sep 13
in
Numerical Ability

89
views
logarithms
0
votes
28
Data Structure Linked List
1) What is the algorithm for reversing the singly linked list? 2) How palindrome could be made with the help of this algo ?
answered
Sep 12
in
Algorithms

102
views
linkedlists
datastructure
0
votes
29
GATE20162GA10
$f(x) = 1  x  1$ $f(x) =1 + x  1$ $f(x) = 2  x  1$ $f(x) = 2 + x  1$
answered
Sep 8
in
Numerical Ability

856
views
gate20162
numericalability
datainterpretation
normal
0
votes
30
OS: UNIX I node
Consider the organization of a UNIX file as represented by the inode Assume that there are 12 direct block pointers, and a singly, doubly, and triply indirect pointer in each inode. Further, assume that the system block size and the disk ... is already in main mem ory, how many disk accesses are required to access the byte in position 13,423,956?
answered
Aug 26
in
Operating System

75
views
operatingsystem
unix
inode
filesystem
+1
vote
31
GATE19887iii
Consider the tree given in the below figure, insert 13 and show the new balance factors that would arise if the tree is not rebalanced. Finally, carry out the required rebalancing of the tree and show the new tree with the balance factors on each mode.
answered
Aug 4
in
DS

61
views
gate1988
normal
descriptive
datastructure
+1
vote
32
GATEbook
answered
Jul 9
in
Combinatory

42
views
0
votes
33
Probability of dice
If 4 dice tossed together , what is the probability of sum of these dice will be exactly 20? (want to see some shortcut procedure)
answered
Jul 1
in
Probability

239
views
probability
+1
vote
34
Switch case
Output of the following program? #include <stdio.h> char input[ ] = "SSSWILTECH1\1\11W\1WALLMP1"; main() { int i,c; for( i=2 ; ( c=input[i] ) ! = '\0' ; i++) { switch(c) { case 'a' : putchar( 'i' );continue; case '1' : break; case ... S' ); case 'E' : case 'L' : continue; default : putchar (c); continue; } putchar( ' ' ); } putchar( '\n' ); }
answered
Jun 29
in
Programming

82
views
switch_case
programminginc
0
votes
35
programming
Observe the unlabelled binary tree given below. The number of ways of inserting the values 1 ,2,3,4,5,6 in a Binary Search Tree such that the resultant BST takes the structure of the Binary tree given above ?
answered
Jun 24
in
DS

46
views
+1
vote
36
GATE20171GA1
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur. (A) was wishing (B) is wishing (C) wished (D) had wished
answered
Jun 14
in
Verbal Ability

1.9k
views
gate20171
verbalability
tenses
englishgrammar
normal
0
votes
37
Counting
How many ways are there to put six temporary employees into four labeled offices so that there is at least one temporary employee in each of these four offices?
answered
Jun 14
in
Mathematical Logic

92
views
permutationsandcombinations
counting
+1
vote
38
IISc PhD
A bag contains Red Balls and Black Balls. Two balls are drawn without replacement. The probability that both the balls drawn are red is 1/2. What is the minimum number of Red and Black Balls for which this probability is satisfied?
answered
Jun 11
in
Probability

112
views
iisc
probability
0
votes
39
CarlHamacher
A computer system has a main memory consisting 1M 16 bitwords.It also has a 4Kword cache organized in the blocksetassociative manner,with 4 blocks per set and 64 words per block. a)assume that the cache is initially empty. ... improvement factor resulting from the use of the cache.Assume that LRU algorithm is used for block replacement. ans is: 2.15
answered
Jun 9
in
CO & Architecture

187
views
co&architecture
carlhamacher
cachememory
0
votes
40
Cominatroics
There are 12 copies of Mathematics, 7 copies of Engineering, 3 different books on Medicine and 2 different books on Economics. Find the number of ways in which one or more than one book can be selected? A. 3421 B. 3111 C. 3327 D. 3201
answered
May 31
in
Combinatory

67
views
Page:
1
2
3
4
5
6
...
21
next »
27,421
questions
35,271
answers
84,571
comments
33,506
users