Register
Filter

Questions by Ram Swaroop

434
views
1 answers
0 votes
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 thi...
1.4k
views
2 answers
3 votes
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_
1.6k
views
1 answers
1 votes
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...
1.6k
views
1 answers
4 votes
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 re...
621
views
0 answers
0 votes
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...
1.3k
views
1 answers
5 votes
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 o...
1.5k
views
1 answers
2 votes
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 v...
1.0k
views
0 answers
0 votes
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 ...
1.4k
views
1 answers
1 votes
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...
1.4k
views
1 answers
0 votes
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...
648
views
1 answers
0 votes
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
799
views
0 answers
0 votes
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 ...
1.8k
views
1 answers
2 votes
Made easy test series computer network gbn Sr sliding window protocol
Consider two computers A and B areconnected through a network of 30 Mbps. Assume the distance between them is 3000km and the signal propagation speed is same as the speed...
391
views
0 answers
0 votes
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...
673
views
0 answers
0 votes
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|
2.3k
views
1 answers
0 votes
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. (...
446
views
3 answers
1 votes
Subject Topic- Programming & DS
Which operator has higher priority between *and / in any expression how to evaluate them
471
views
0 answers
0 votes
gate 2018 cse demand paging memory management
Consider a process executing on an operating system that uses demand paging. The averagetime for a memory access in the system is M units if the corresponding memory page...