Questions by Ram Swaroop

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 in Programming Mar 17, 2019

290 views

2 votes

2 answers

2

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 in Databases Jan 30, 2019

1.0k views

1 vote

1 answer

3

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 in Algorithms Jan 30, 2019

1.3k views

4 votes

1 answer

4

MadeEasy Test Series 2019: CO & Architecture- Cache Memory
Consider a n-way 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 in CO and Architecture Jan 30, 2019

1.3k views

0 votes

0 answers

5

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 in Programming Jan 29, 2019

437 views

5 votes

1 answer

6

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 in CO and Architecture Jan 29, 2019

956 views

2 votes

1 answer

7

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 in Programming Jan 29, 2019

1.2k views

0 votes

0 answers

8

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 in Theory of Computation Jan 28, 2019

682 views

1 vote

1 answer

9

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 in DS Jan 28, 2019

1.1k views

0 votes

1 answer

10

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 in DS Jan 27, 2019

985 views

0 votes

1 answer

11

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 in Probability Jan 24, 2019

474 views

0 votes

0 answers

12

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 non-pipeline CPU when speed up achieved by to pipeline is 4? A. 1.33 B. 1.76 C. 1.14 D. 1.66

asked in CO and Architecture Jan 23, 2019

716 views

2 votes

1 answer

13

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 in Computer Networks Jan 22, 2019

1.2k views

0 votes

0 answers

14

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 in Verbal Aptitude Jan 4, 2019

299 views

0 votes

0 answers

15

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 in Quantitative Aptitude Jan 3, 2019

558 views

0 votes

1 answer

16

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 in Theory of Computation Dec 28, 2018

2.0k views

1 vote

3 answers

17

Subject Topic- Programming & DS
Which operator has higher priority between *and / in any expression how to evaluate them

asked in Programming Dec 18, 2018

325 views

0 votes

0 answers

18

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 in Operating System May 6, 2018

414 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Questions by Ram Swaroop

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Subjects

Questions by Ram Swaroop

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments