The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged madeeasytestseries
+3
votes
2
answers
1
MadeEasy Test Series: Theory Of Computation  Regular Languages
Consider the following statements: $S_1:\{(a^n)^mn\leq m\geq0\}$ $S_2:\{a^nb^nn\geq 1\} \cup \{a^nb^mn \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
asked
May 26, 2019
in
Theory of Computation
by
Hirak

443
views
madeeasytestseries
theoryofcomputation
regularlanguages
0
votes
1
answer
2
Self Doubt about ME Test Series
Are comparison charts of Made easy genuine? And say now if my rank is 3 in a test and after sometime if someone scores more than me will my rank get shifted to 4?
asked
May 26, 2019
in
GATE
by
Hirak

183
views
madeeasytestseries
selfdoubt
general
+1
vote
1
answer
3
Made easy Test Series:Graph Theory+Automata
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n1}$, where each $a_{i}$ is $0$ or $1$ ... and $y$ denote the degree of a vertex $G$ and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________
asked
May 23, 2019
in
Graph Theory
by
srestha

233
views
madeeasytestseries
graphtheory
theoryofcomputation
+1
vote
4
answers
4
Made Easy Test Series:Binary Trees
Consider the following function height, to which pointer to the root node of a binary tree shown below is passed Note that max(a,b) defined by #define max(a,b) (a>b)?a:b. int height(Node *root) The output of the above code will be _________________
asked
May 22, 2019
in
DS
by
srestha

408
views
madeeasytestseries
binarytree
+1
vote
0
answers
5
Made Easy Test Series:DatabasesTables
Number of tables required in above ER diagram will be _____________ Is $R_{1}$ create separate table or not?? and $R_{2}$ look like if we remove loop from it?? Answer given for table $E_{1}R_{1}$ Key will be $AC$ , with ... Entities. So, it will add one extra table. I already read https://gateoverflow.in/229580/madeeasytestseriesnumberoftablesrequired
asked
May 22, 2019
in
Databases
by
srestha

143
views
madeeasytestseries
databases
0
votes
1
answer
6
Made Easy Test Series:Aptitude
Chandan and Falguni work on alternet days. Chandan working on 1st day, Falguni on 2nd , then Chandan again by 3rd , followed by Falguni on 4th and so on. They can finish the work in $25$ days. The work done by chandan varies everyday. On a ... by Chandan on 1st day to done by Falguni on 2nd day$=1:4.$ The time require Falguni alone finish the work ____________ days
asked
May 22, 2019
in
Numerical Ability
by
srestha

115
views
madeeasytestseries
generalaptitude
numericalability
0
votes
0
answers
7
Made Easy Test Series: Stack Address
A stack based CPU executes the instruction. Memory location $500$ contain $0X 88$ and memory location $700$ contain $0X37$. The stack pointer is at $0X003F$ The instruction are as follows: $I_{1}:PUSH$ $500$ $I_{2}:PUSH$. $700$ ... execution of instruction. $C)$ Memory location $600$ contain $0XBF$ after execution of instruction. $D)$ Both $a)$ and $c)$
asked
May 22, 2019
in
DS
by
srestha

198
views
madeeasytestseries
datastructures
stack
0
votes
1
answer
8
Made Easy Test Series:General AptitudeCircle
In a right angle triangle $ABC$ with vertex $B$ being the right angle, the mutually perpendicular sides $AB$ and $BC$ are $p$ cm. and $q$ cm. long respectively. If the length of hypotenuse is $\left ( p+q6 \right )$ cm., then the radius of the largest possible circle that can be inscribe in the triangle is ____________
asked
May 21, 2019
in
Numerical Ability
by
srestha

120
views
generalaptitude
madeeasytestseries
numericalability
+2
votes
1
answer
9
Made Easy Test Series:Microprogramming
A hypothetical cpu supports $300$ instructions.each instruction takes $5$ cycle to accomplish the execution. the control unit is designed using vertical programming which has $130$ control signals $,64$ flags and $12$ branch conditions .$X$ and ... register$(CDR)$ respectively.value of $X+Y$ is ______? How to work with branch condition in micro programming :(
asked
May 21, 2019
in
CO and Architecture
by
srestha

268
views
madeeasytestseries
microprogramming
coandarchitecture
+1
vote
1
answer
10
Made Easy Test Series:Lattice
The number of totally ordered set compatible to the given POSET are __________
asked
May 21, 2019
in
Set Theory & Algebra
by
srestha

198
views
madeeasytestseries
lattice
+3
votes
3
answers
11
Made Easy Test Series:Programming(FLT4)
#include<stdio.h> #include<iostream> int bar(int m, int n){ if(m==0)return n; if(n==0)return m; return bar(n%m,m); } int foo(int m,int n){ return(m*n/bar(m,n)); } int main(){ int x=foo(1000,1500); printf("%d",x); return 0; } Output of the program is ___________
asked
May 20, 2019
in
Programming
by
srestha

314
views
madeeasytestseries
programming
programminginc
0
votes
2
answers
12
Made Easy Test Series: Synchronization
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes. Process Pi While(true){ j=false; i=true; while(j==true); CRITICAL SECTION i=false; } ... true); CRITICAL SECTION j=false; } I got it is not satisfying M.E., but will it satisfying deadlock too?? Plz explain
asked
May 20, 2019
in
Operating System
by
srestha

321
views
madeeasytestseries
operatingsystem
processsynchronization
+1
vote
1
answer
13
Made Easy Test Series:Programming in C
Consider the following $C$ implementation which when given $3$ numbers a,b,c as input, find the maximum of $3$ numbers $a,b,c.$ int kickstart(int a,int b,int c) { if(B1) return a; if(a>=b) return B2; return kickstart(c,a,b); } How the boxes filled up ... $a\geq c, B2:kickstart\left ( b,c,a \right );$ Is it $I) and II)$ or $I) and IV)$
asked
May 20, 2019
in
Programming
by
srestha

325
views
madeeasytestseries
programming
programminginc
+1
vote
2
answers
14
Made Easy Test Series: DatabaseNormalization
Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies $F=${ $A\rightarrow B$ $BC\rightarrow E$ $ED\rightarrow A$ } Number of additional relation required to convert it into lossless , dependency preserving $3NF$ decomposition is _____________ What is meaning of additional relation (Here no table mentioned previously)??
asked
May 19, 2019
in
Databases
by
srestha

310
views
databases
madeeasytestseries
databasenormalization
0
votes
1
answer
15
Made Easy Test Series:AlgorithmDijkstra
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??
asked
May 18, 2019
in
Algorithms
by
srestha

161
views
madeeasytestseries
algorithms
0
votes
2
answers
16
Made Easy Test Series:Discrete MathematicsPoset
Consider the following Posets: $I)\left ( \left \{ 1,2,5,7,10,14,35,70 \right \},\leq \right )$ $II)\left ( \left \{ 1,2,3,6,14,21,42 \right \},/ \right )$ $III)\left ( \left \{ 1,2,3,6,11,22,33,66 \right \},/ \right )$ Which of the above poset are isomorphic to $\left ( P\left ( S \right ),\subseteq \right )$ where $S=\left \{ a,b,c \right \}?$
asked
May 18, 2019
in
Set Theory & Algebra
by
srestha

159
views
poset
madeeasytestseries
discretemathematics
+3
votes
0
answers
17
Made Easy Test Series:AlgorithmTime Complexity
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any other pair of element of that array. Which of the following represent ... Here we need to sort first and then need to compare adjacent element right?? Then what will be complexity??
asked
May 18, 2019
in
Algorithms
by
srestha

432
views
algorithms
madeeasytestseries
timecomplexity
+1
vote
1
answer
18
Made Easy Test Series:DatabaseIndexing
The minimum number of nodes (both leaf and nonleaf) of $B^{+}$ tree index required for storing $5500$ keys and order of $B^{+}$ tree is $8$________________(order is max pointers a node can have) See here first level should be divide by $7$ ... pointer of 1st level has $8$ pointer in 2nd level. Am I missing something?? But in ans they divided by only $8$ :(
asked
May 18, 2019
in
Databases
by
srestha

266
views
databases
madeeasytestseries
indexing
+1
vote
1
answer
19
Made Easy Test Series:FlipFlop
A Finite State Machine(FSM) is implemented using the DFFs A and B with logic gates as shown below. The four possible states of FSM are $Q_{A}Q_{B}=00,01,10,11$. Assume that $X_{in}$ is held at constant logic level throughout the operation of FSM. ... states if $X_{in}=0$ How do we check $X_{in}$ here? Can we check it arbitrarily, or checked with prev states??
asked
May 16, 2019
in
Digital Logic
by
srestha

228
views
digitallogic
flipflop
madeeasytestseries
+1
vote
0
answers
20
Made Easy Test Series:Compiler DesignCLR parser
$S\rightarrow aAbAcdc$ $A\rightarrow d$ Number of states in $CLR\left ( 1 \right )$ parser construction _______________ Is $S\rightarrow d.c$ $A\rightarrow d.,a$ will be in $1$ state or in $2$ different states??
asked
May 16, 2019
in
Compiler Design
by
srestha

328
views
compilerdesign
madeeasytestseries
0
votes
1
answer
21
Made Easy Test Series: Digital Logic Master Slave FF
$1)$ MasterSlave FF is designed to avoid race around condition $2)$ MasterSlave FF is used to store $2$ bit information Which of the following statement is correct? What is meaning of $2bit $ information??
asked
May 16, 2019
in
Digital Logic
by
srestha

247
views
digitallogic
madeeasytestseries
flipflop
+1
vote
2
answers
22
Made Easy Test Series: Digital Logic
A $3\times 8$ decoder with $2$ enable inputs is used to address $8$ block of memory. What will be the size of each memory block when addressed from a $16$ bit bus with $2$ MSB’s used to enable the decoder?
asked
May 16, 2019
in
Digital Logic
by
srestha

384
views
digitallogic
madeeasytestseries
decoder
0
votes
1
answer
23
Made Easy Test Series:Operating SystemPage Fault
Consider a system using demand paging architecture it takes $3ms.$ to service page fault if either empty frame is available or replaced page is not to be modified takes $10ms.$ if replaced page is modified. Main Memory access time ... time. The maximum acceptable page fault rate to get effective memory access time not more than $4ms.$ is_________(%)
asked
May 16, 2019
in
Operating System
by
srestha

148
views
operatingsystem
madeeasytestseries
pagefault
+1
vote
0
answers
24
Made Easy Test Series: Computer NetworkDijkstra Algo
Consider Dijkstra's algorithm in linked state routing protocol at node $u.$ Professor Ram first sets the route for each directly connected node $v.$ to be the link connecting $u$ to $v.$ Ram then implements the rest of the algorithm ... costs where all routing table entry will be correct. $D)$ Both $A)$ and $B)$ How Dijkstra working here?
asked
May 14, 2019
in
Computer Networks
by
srestha

141
views
computernetworks
madeeasytestseries
+1
vote
2
answers
25
Made Easy Test Series: Operating SystemMemory Mapped I/O
Which of the following best characterize by Memory Mapped I/O? $A)$ Additional hardware for bus is required to control the IO bus and memory bus. $B)$ Some of the address space is separated from memory space and assigned them to I/ ... is used $D)$ None of these I havenot got this answer to Galvin. Someone plz. give the concept used here .
asked
May 14, 2019
in
Operating System
by
srestha

94
views
operatingsystem
madeeasytestseries
+1
vote
2
answers
26
Made Easy Test Series:DatabaseSQL
Find the name of Sailors with a higher rating than all sailors with age $<22?$ $Query1: $ Select S.name from sailor S where not exists (Select * from sailor $S_{2} $where $S_{2}.age<22$ and $S.rating<=S_{2}.rating$ ... above query?? I think Query2 and Query3 itself differentiate with ANY and ALL keyword. But what about Query1? Will it return ALL tuples?
asked
May 14, 2019
in
Databases
by
srestha

168
views
madeeasytestseries
databases
+1
vote
0
answers
27
Made Easy Test Series:DatabasesIndexing
Consider the following statement below: $A)$ A clustered index may be either sparse or dense. $B)$ Every $B^{+}$ tree index is dense. Which of the above statement is true? Is clustering Index can be dense. Dense means nonordering field, but clustering field should be ordering field right??
asked
May 14, 2019
in
Databases
by
srestha

187
views
databases
indexing
madeeasytestseries
0
votes
1
answer
28
Made Easy Test Series: AlgorithmSorting
An array $A$ of size n is known to be sorted except for the first $k$ elements and the last $k$ elements, where $k$ is a constant. Which of the following algorithms will be the best choice for sorting the array $A?$ $a)$ ... sorts part by part using pivot. So, why not will it be answer?? How do we know it is asking for almost sorted array??
asked
May 12, 2019
in
Algorithms
by
srestha

388
views
algorithms
madeeasytestseries
sorting
+1
vote
2
answers
29
Made Easy Test Series:Programming Test
Consider the following function $foo()$ void foo(int n){ if(n<=0) printf("Bye"); else{ printf("Hi"); foo(n3); printf("Hi"); foo(n1); } } Let $P(n)$ represent recurrence relation, indicating number of ... $1$ or $2?$
asked
May 12, 2019
in
Programming
by
srestha

232
views
madeeasytestseries
programming
programminginc
0
votes
1
answer
30
Made Easy Test Series:General Aptitude
A rod is cut into $3$ equal parts. The resulting portion are then cut into $18,27,48$ equal parts, respectively. If each of the resulting portions have integral length, then minimum length of the rod is ____________
asked
May 11, 2019
in
Numerical Ability
by
srestha

156
views
generalaptitude
madeeasytestseries
numericalability
Page:
1
2
3
4
5
6
...
45
next »
Quick search syntax
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
Recent Posts
IISc CDS Interview Experience, 2020
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
PGEE 2020 (CSE) Experience
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged madeeasytestseries
Recent Blog Comments
Thank brother !! Bookmarked it :)
Check out goxul.github.io, it has all the...
congratulation brother ! Can you please tell me...
I got selected for this, in case someone lands up...
After the written exam and at the time of...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,375
questions
60,615
answers
202,053
comments
95,435
users