Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by srestha
0
votes
1
answer
41
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 informationWhich of the following statement is correct?What i...
1.9k
views
asked
May 15, 2019
Digital Logic
digital-logic
made-easy-test-series
flip-flop
+
–
3
votes
2
answers
42
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 $...
1.4k
views
asked
May 15, 2019
Digital Logic
digital-logic
made-easy-test-series
decoder
+
–
0
votes
1
answer
43
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 architectureit takes $3ms.$ to service page fault if either empty frame is available or replaced page is not to be modifiedtakes $10...
700
views
asked
May 15, 2019
Operating System
operating-system
made-easy-test-series
page-fault
+
–
1
votes
0
answers
44
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 conn...
712
views
asked
May 14, 2019
Computer Networks
computer-networks
made-easy-test-series
+
–
1
votes
2
answers
45
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 ...
680
views
asked
May 14, 2019
Operating System
operating-system
made-easy-test-series
+
–
1
votes
2
answers
46
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 ...
1.1k
views
asked
May 14, 2019
Databases
made-easy-test-series
databases
+
–
2
votes
1
answer
47
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...
1.8k
views
asked
May 13, 2019
Databases
databases
indexing
made-easy-test-series
+
–
2
votes
2
answers
48
Self Doubt-Programming
Can someone explain the output of this code? and what (char*) is doing actually? #include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", '*((char*)q+1)', '*((char*)q+2)'); return 0; }
Can someone explain the output of this code? and what (char*) is doing actually?#include<stdio.h struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0',...
975
views
asked
May 13, 2019
Programming in C
programming-in-c
output
self-doubt
+
–
3
votes
3
answers
49
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 ...
1.9k
views
asked
May 12, 2019
Algorithms
algorithms
made-easy-test-series
sorting
+
–
2
votes
2
answers
50
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 r...
1.1k
views
asked
May 12, 2019
Programming in C
made-easy-test-series
programming
programming-in-c
+
–
0
votes
1
answer
51
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, t...
849
views
asked
May 11, 2019
Quantitative Aptitude
general-aptitude
made-easy-test-series
quantitative-aptitude
+
–
1
votes
0
answers
52
Made Easy Test Series : Programming Test4
Consider the following C code: int getNextGap(int gap){ gap=(gap*10)/13; if(gap<1)return 1; return gap; } void mystery(int a[ ],int n){ int gap=n; bool red=true; while(gap!=1||red==true){ gap=getNextGap(gap); red ... elements, then what output will print at last? I mostly stuck how bool function working here. Plz help me out, how program executing:(
Consider the following C code:int getNextGap(int gap){ gap=(gap*10)/13; if(gap<1)return 1; return gap; } void mystery(int a[ ],int n){ int gap=n; bool red=true; while(gap...
978
views
asked
May 10, 2019
Programming in C
made-easy-test-series
programming
programming-in-c
+
–
0
votes
1
answer
53
Made Easy Test Series:Algorithm- Minimum Weight Path
Consider the following statement: $A)$ If all edge weight of a graph are positive then any subset of edges that connect all vertices and has minimum total weight is a tree. $B)$ ... minimum weight graph?? and what about B)?? Is it just saying each minimum path between $2$ vertices makes total shortest path??
Consider the following statement:$A)$ If all edge weight of a graph are positive then any subset of edges that connect all vertices and has minimum total weight is a tree...
469
views
asked
May 10, 2019
Algorithms
graph-algorithms
made-easy-test-series
shortest-path
+
–
0
votes
2
answers
54
Made Easy Test Series:Algorithm-Inversion
Consider an array $A=\left \{ 30,15,48,34,26,29 \right \}$ Let $X$ be the number of inversion of array $A,$ Now another array $B$ is constructed by making all the numbers in $A$ negative and keeping the order between each numbers same. Let the ... array so obtained be $Y.$ Then $X+2Y=$_______________ $\left ( 30,26 \right )$ number of inversion $4$ or $1??$
Consider an array $A=\left \{ 30,15,48,34,26,29 \right \}$Let $X$ be the number of inversion of array $A,$ Now another array $B$ is constructed by making all the numbers ...
379
views
asked
May 10, 2019
Algorithms
made-easy-test-series
algorithm-design
numerical-answers
+
–
1
votes
2
answers
55
Made Easy Test Series:Algorithm-Recurrence Relation
What is the solution of recurrence relation $T\left ( n \right )=T\left ( n-1 \right )+n$
What is the solution of recurrence relation$T\left ( n \right )=T\left ( n-1 \right )+n$
892
views
asked
May 10, 2019
Algorithms
algorithms
time-complexity
recurrence-relation
+
–
2
votes
1
answer
56
Made Easy Test Series:Database-Super-Keys
Consider the relation $R\left ( A,B,C,D,E \right )$ $A\rightarrow BC$ $C\rightarrow E$ $B\rightarrow D$ $E\rightarrow A$ Total number of superkeys present in relation will be ____________________
Consider the relation $R\left ( A,B,C,D,E \right )$$A\rightarrow BC$$C\rightarrow E$$B\rightarrow D$$E\rightarrow A$Total number of superkeys present in relation will be ...
1.9k
views
asked
May 9, 2019
Databases
databases
superkeys
made-easy-test-series
+
–
1
votes
3
answers
57
Made Easy Test Series:Relational Algebra
... this implication holds true?? Selection operation is commutative. But is two project operation can be merge in one project operation? Can project operation removes duplicates too??
$\pi _{A_{1}}\left ( \pi _{A_{2}}\left ( \sigma _{C_{1}}\left ( \sigma _{C_{2}} \left ( R_{1} \right )\right ) \right ) \right )\rightarrow \pi _{A_{1}}\left ( \sigma _{C...
1.2k
views
asked
May 9, 2019
Databases
databases
relational-algebra
made-easy-test-series
+
–
1
votes
0
answers
58
Made Easy Test Series:Programming Test4-Function Call
Consider the following function int fun(int a[ ],int l, int target){ int i=0,j=0,sum=0,count=0; while(j<l){ if(sum<target){ sum=sum+a[j]; j++; } else if(sum>target){ sum=sum-a[i]; i++; } else{ count++; sum= ... call $fun\left ( a,16,8 \right )=$_______________ Given ans $6,$ but I got $4.$ Which one correct?? Any shortcut to evaluate??
Consider the following function int fun(int a[ ],int l, int target){ int i=0,j=0,sum=0,count=0; while(j<l){ if(sum<target){ sum=sum+a[j]; j++; } else if(sum>target){ sum=...
908
views
asked
May 8, 2019
Programming in C
made-easy-test-series
programming
programming-in-c
+
–
0
votes
1
answer
59
Made Easy Test Series:Algorithm-Mathematical Solution
Consider a hash table with $n$ slots that uses chaining for collision resolution, table is initially empty. What is the probability that after $4$ keys are inserted then atleast a chain of size $3$ is created, when the value of $n=9$___________ They have done ... $3??$ Plz chk it
Consider a hash table with $n$ slots that uses chaining for collision resolution, table is initially empty. What is the probability that after $4$ keys are inserted then ...
406
views
asked
May 8, 2019
Algorithms
made-easy-test-series
algorithms
hashing
probability
+
–
1
votes
0
answers
60
Made Easy Test Series: Binary Tree
The number of node in each left subtree is within a factor of $2.$ of the number of nodes in the corresponding right subtree. Also a node allowed to have only one child if that child has no children. This tree has worst case height $O(logn)$. $N$ is the number of nodes in the binary tree. Is this statement TRUE about Binary Tree?
The number of node in each left subtree is within a factor of $2.$ of the number of nodes in the corresponding right subtree. Also a node allowed to have only one child i...
585
views
asked
May 7, 2019
Algorithms
binary-tree
made-easy-test-series
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
35
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register