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
Questions by Ram Swaroop
User Ram Swaroop
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Ram Swaroop
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
answer
1
self doubt variable scope
#include <stdio.h> /* global variable declaration */ int g = 20; int main () { /* local variable declaration */ int g ; printf ("value of g = %d\n", g); return 0; } why this printing value of g is 0 instead of garbage because g is declared which is local variable in main function. are variables inside main function by default global?
asked
Mar 17
in
Programming

89
views
programminginc
+1
vote
3
answers
2
GATE 2019 23
Q.23 Two numbers are chosen independently and uniformly at random from the set (1, 2,..., 13]. The probability (rounded off to 3 decimal places) that their 4bit (unsigned) binary representations have the same most significant bit is
asked
Feb 7
in
Probability

800
views
usergate2019
usermod
probability
numericalanswers
normal
+1
vote
0
answers
3
Made easy mock test 1 DBMS super keys
Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_
asked
Jan 30
in
Databases

167
views
databases
superkeys
candidatekeys
0
votes
1
answer
4
MadeEasy Test Series 2019: Algorithms  Spanning Tree
Consider a simple undirected weighted graph G(V, E) with 10 vertices and 45 edge, assume (u, v) are two vertices weight of a edge is =4lu vl then the minimum cost of the spanning tree of G_ 36
asked
Jan 30
in
Algorithms

213
views
algorithms
spanningtree
madeeasytestseries2019
madeeasytestseries
+2
votes
1
answer
5
MadeEasy Test Series 2019: CO & Architecture Cache Memory
Consider a nway cache with 'x blocks of 64 words each. The main memory of the system is having 8 million words. Size of the tag field is 16 bits and additional memory required for tags is 1024 bytes. What will be the values of n and x respectively? Answer 256 512
asked
Jan 30
in
CO and Architecture

222
views
coandarchitecture
cachememory
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
6
MadeEasy Full Length Test 2019: Programming & DS  Programming
Consider the following C code: #include <stdio.h> struct MadeEasy { char p,q,r; }; int main (void) { struct MadeEasy a={ d'  2019,'e',5+'a'}; struct MadeEasy *b=&a; printf("%c, %c", *((char*)b+1) 1, *((char*)b+ 2) 1); return 0; } The output of the following code will be
asked
Jan 29
in
Programming

153
views
programminginc
programming
madeeasytestseries2019
madeeasytestseries
0
votes
1
answer
7
MadeEasy Test Series 2019: CO & Architecture  Cache Memory
A CPU cache is organized into 2 level cache L1 and L2 The penalty for L1 cache miss and L2 cache miss are 60 and 30 respectively for 1200 memory references The hit time of L1 and L2 are 5 and 10 clock cycles and penalty for L2 cache miss to main memory is 70 clock cycles. The average memory access time will be
asked
Jan 29
in
CO and Architecture

205
views
coandarchitecture
cachememory
madeeasytestseries2019
madeeasytestseries
+2
votes
1
answer
8
MadeEasy Test Series: Programming & DS  Programming in C
Consider the following C code: include <stdio.h> int fun() { static int num=25; return num; } int main() { for(fun( ); fun();fun()) printf("%d", fun( )); return O; } The sum of the values printed by the above program will be
asked
Jan 29
in
Programming

156
views
programming
programminginc
madeeasytestseries
0
votes
0
answers
9
MadeEasy Test Series : Regular Expression
Consider the following regular expressions: I. 0(0+1)* II. 0* 10*1(0 +1)* III (0+10)*(1+€) IV.[(0*10* 10*)* +0*]10* A language L whose regular expression is r is said to be reverse isomorphic if L(r)= L(r^R). How many of the above regular expressions are reverse isomorphic?
asked
Jan 28
in
Theory of Computation

69
views
madeeasytestseries
theoryofcomputation
0
votes
1
answer
10
Made easy tree height
The height of a binary tree is defined as the number of nodes in the longest path from root to the leaf node. Let X be the height of a complete binary tree with 256 nodes. Then the value of X will be Answer 9
asked
Jan 28
in
DS

124
views
datastructure
binarytree
0
votes
0
answers
11
MadeEasy Test Series 2019: Programming & DS  Hashing
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is_ Answer 1.647
asked
Jan 27
in
DS

217
views
programminginc
datastructure
hashing
madeeasytestseries2019
madeeasytestseries
0
votes
1
answer
12
MadeEasy Test Series : Probability  Probability
A dice is tossed thrice. A success is getting ‘1 or 6' on a toss. Find the variance of number of successes _. Answer 0.66
asked
Jan 24
in
Probability

133
views
engineeringmathematics
probability
madeeasytestseries
0
votes
0
answers
13
Made easy test series pipelining
Consider a 5 stage pipeline with Instruction Fetch (IF), Instruction Decode (ID), Execute (EX), Write Back (WB) and Memory Access (MA) having latencies (in ns) 3,8, 5, 6 and 4 respectively. What is average CPl of nonpipeline CPU when speed up achieved by to pipeline is 4? A. 1.33 B. 1.76 C. 1.14 D. 1.66
asked
Jan 23
in
CO and Architecture

231
views
madeeasytestseries
coandarchitecture
pipelining
0
votes
1
answer
14
Made easy test series computer network gbn Sr sliding window protocol
Consider two computers A and B are connected through a network of 30 Mbps. Assume the distance between them is 3000km and the signal propagation speed is same as the speed of light and the packet size is 12 KB. What is the minimum number of bits ... N and selective repeat protocol? A . 5 and 6 B. 6 and 7 C. 6 and 6 D. 7 and 8
asked
Jan 22
in
Computer Networks

178
views
slidingwindow
computernetworks
selectiverepeat
gobackn
0
votes
2
answers
15
Gate 2018 ce set 2 10
Each of the letters in the figure below represents a unique integer from 1 to 9. The letters are positioned in the figure such that each of (A+B+C), (C+D+E), (E+F+G) and (G+H+K) is equal to 13. Which integer does E represent? (A) 1 (B) 4 (C) 6 (D) 7
asked
Jan 4
in
Verbal Ability

198
views
verbalability
usergate2018
usermod
0
votes
0
answers
16
Gate 2018 ce set 1 10
Each of the letters arranged as below represents a unique integer from 1 to 9. The letters are positioned in the figure such that (A × B × C), (B × G × E) and (D × E × F) are equal. Which integer among the following choices cannot be represented by the letters A, B, C, D, E, F or G? (A) 4 (B) 5 (C) 6 (D) 9
asked
Jan 4
in
Verbal Ability

84
views
usergate2018
usermod
verbalability
0
votes
1
answer
17
Gate 2018 ME set 26
Forty students watched films A, B and C over a week. Each student watched either only one film or all three. Thirteen students watched film A, sixteen students watched film B and nineteen students watched film C. How many students watched all three films? (A) 0 (B) 2 (C) 4 (D) 8
asked
Jan 3
in
Numerical Ability

197
views
normal
numericalability
0
votes
0
answers
18
Gate 2018 ME set 1 question 9
Which of the following functions describe the graph shown in the below figure? (A) y=x+1−2 (B) y=x−1−1 (C) y=x+1−1 (D) y=x−1−1
asked
Jan 3
in
Numerical Ability

118
views
usergate2018
usermod
numericalability
normal
0
votes
1
answer
19
made easy theory of computation regular expression
which one of the following regular expression describe the language over {a,b} consist of no pair of consecutive a’s? a. (b*abb*) (a+€) b. (b+ab)* (a+€) c. (b*abb*)*(a+€)+b* d. (b*ab*)*(a+€)+b*(a+€)
asked
Dec 28, 2018
in
Theory of Computation

107
views
regularexpressions
theoryofcomputation
finiteautomata
+1
vote
3
answers
20
Subject Topic Programming & DS
Which operator has higher priority between *and / in any expression how to evaluate them
asked
Dec 18, 2018
in
Programming

59
views
operatorprecedence
programminginc
0
votes
0
answers
21
gate 2018 cse demand paging memory management
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is M units if the corresponding memory page is available in memory, and D units if the memory access causes a page fault. It has been experimentally measured that the ... / (D  M) (C) (D  X) / (D  M) (D) (X  M) / (D  X)
asked
May 6, 2018
in
Operating System

162
views
50,647
questions
56,473
answers
195,393
comments
100,370
users