menu
search
Log In
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

Subjects

Recent questions tagged made-easy-test-series

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged made-easy-test-series

4 votes
2 answers
1
MadeEasy Test Series: Theory Of Computation - Regular Languages
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \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 Hirak 592 views
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?
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 25, 2019 in GATE Hirak 231 views
1 vote
2 answers
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_{n-1}$, 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_____________
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_{n-1}$, where each $a_{i}$ is $0$ or $1$ ... $x$ 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 srestha 288 views
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 _________________
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 srestha 694 views
1 vote
0 answers
5
Made Easy Test Series:Databases-Tables
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/madeeasy-test-series-number-of-tables-required
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 $C$ foreign key. And for ... $2$ Entities. So, it will add one extra table. I already read https://gateoverflow.in/229580/madeeasy-test-series-number-of-tables-required
asked May 22, 2019 in Databases srestha 208 views
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
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 perticular day $d$ ... work done 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 srestha 132 views
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)$
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$ $I_{3}:ADD$ $I_{4}:POP$ ... $0X88$ after execution of instruction. $C)$ Memory location $600$ contain $0XBF$ after execution of instruction. $D)$ Both $a)$ and $c)$
asked May 22, 2019 in DS srestha 247 views
0 votes
1 answer
8
Made Easy Test Series:General Aptitude-Circle
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+q-6 \right )$ cm., then the radius of the largest possible circle that can be inscribe in the triangle is ____________
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+q-6 \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 srestha 164 views
3 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 :(
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 $Y$ represent the number ... control data register$(CDR)$ respectively.value of $X+Y$ is ______? How to work with branch condition in micro programming :(
asked May 20, 2019 in CO and Architecture srestha 367 views
1 vote
1 answer
10
Made Easy Test Series:Lattice
The number of totally ordered set compatible to the given POSET are __________
The number of totally ordered set compatible to the given POSET are __________
asked May 20, 2019 in Set Theory & Algebra srestha 300 views
4 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 ___________
#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 srestha 369 views
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-
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; } Process Pj While(true){ i= ... while(i==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 srestha 441 views
2 votes
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)$
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 correctly? $I)B1:a\geq b$ ... $IV)B1:a\geq b$ && $a\geq c, B2:kickstart\left ( b,c,a \right );$ Is it $I) and II)$ or $I) and IV)$
asked May 19, 2019 in Programming srestha 387 views
1 vote
2 answers
14
Made Easy Test Series: Database-Normalization
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)??
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 srestha 410 views
0 votes
1 answer
15
Made Easy Test Series:Algorithm-Dijkstra
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??
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 srestha 199 views
0 votes
2 answers
16
Made Easy Test Series:Discrete Mathematics-Poset
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 \}?$
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 srestha 229 views
2 votes
1 answer
18
Made Easy Test Series:Database-Indexing
The minimum number of nodes (both leaf and non-leaf) 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$ :(
The minimum number of nodes (both leaf and non-leaf) 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$ $2nd$ levelshould divide by ... each $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 17, 2019 in Databases srestha 398 views
1 vote
1 answer
19
Made Easy Test Series:Flip-Flop
A Finite State Machine(FSM) is implemented using the D-FFs 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??
A Finite State Machine(FSM) is implemented using the D-FFs 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. Where the FSM is ... the four possible 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 srestha 311 views
1 vote
0 answers
20
Made Easy Test Series:Compiler Design-CLR parser
$S\rightarrow aA|bAc|dc$ $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??
$S\rightarrow aA|bAc|dc$ $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 15, 2019 in Compiler Design srestha 497 views
0 votes
1 answer
21
Made Easy Test Series: Digital Logic- Master Slave FF
$1)$ Master-Slave FF is designed to avoid race around condition $2)$ Master-Slave FF is used to store $2$ bit information Which of the following statement is correct? What is meaning of $2-bit $ information??
$1)$ Master-Slave FF is designed to avoid race around condition $2)$ Master-Slave FF is used to store $2$ bit information Which of the following statement is correct? What is meaning of $2-bit $ information??
asked May 15, 2019 in Digital Logic srestha 337 views
2 votes
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?
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 15, 2019 in Digital Logic srestha 507 views
0 votes
1 answer
23
Made Easy Test Series:Operating System-Page 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_________(%)
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 is $1ms.$ and page to be replaced ... $60$% of time. The maximum acceptable page fault rate to get effective memory access time not more than $4ms.$ is_________(%)
asked May 15, 2019 in Operating System srestha 183 views
1 vote
0 answers
24
Made Easy Test Series: Computer Network-Dijkstra 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?
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 correctly, aiming to produce minimum cost ... and link 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 srestha 193 views
1 vote
2 answers
25
Made Easy Test Series: Operating System-Memory 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 .
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/O ports. $C)$ Common bus is ... /O different control signal 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 srestha 123 views
1 vote
2 answers
26
Made Easy Test Series:Database-SQL
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?
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$) $Query2:$ Select S.name ... is correct sql for 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 srestha 231 views
2 votes
1 answer
27
Made Easy Test Series:Databases-Indexing
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 non-ordering field, but clustering field should be ordering field right??
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 non-ordering field, but clustering field should be ordering field right??
asked May 13, 2019 in Databases srestha 275 views
1 vote
1 answer
28
Made Easy Test Series: Algorithm-Sorting
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??
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)$Insertion Sort $b)$Bubble sort $c)$Quicksort ... ? Quick Sort 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 srestha 625 views
2 votes
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(n-3); printf("Hi"); foo(n-1); } } Let $P(n)$ represent recurrence relation, indicating number of ... $1$ or $2?$
Consider the following function $foo()$ void foo(int n){ if(n<=0) printf("Bye"); else{ printf("Hi"); foo(n-3); printf("Hi"); foo(n-1); } } Let $P(n)$ represent recurrence relation, indicating number of time print statement executed. What will best recurrence for ... $n=0$ The options are confusing to me. Can someone explain the options well. Moreover , what will be constant added $1$ or $2?$
asked May 12, 2019 in Programming srestha 295 views
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 ____________
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 srestha 217 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...