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
Answers by Badayayash
0
votes
1
Madeeasy Test Series
Three peoples have 32,72,and 98, respectively. If they pool their money then redistribute it among themselves. What is the maximum possible value for the median amount of money?
Three peoples have 32,72,and 98, respectively. If they pool their money then redistribute it among themselves.What is the maximum possible value for the median amount of ...
534
views
answered
Apr 15, 2019
Quantitative Aptitude
quantitative-aptitude
+
–
0
votes
2
DBMS Korth Edition 6 Exercise 2 Question 13 (Page No. 55)
Consider the bank database. Give an expression in the relational algebra for each of the following queries: a. Find all loan numbers with a loan value greater than ... borrower (customer name, loan number) account (account number, branch name, balance) depositor (customer name, account number)
Consider the bank database. Give an expression in the relationalalgebra for each of the following queries:a. Find all loan numbers with a loan value greater than $10,000....
2.4k
views
answered
Apr 2, 2019
Databases
databases
korth-edition6
relational-model
relational-algebra
+
–
0
votes
3
GATE Overflow | Mock GATE | Test 1 | Question: 59
Assume the initial values of $K0$, $Q_0$ and $Q_1$ to be $1$. Which of the following state transition tables correctly correspond to the circuit given above? (Note: $Q_{kN}$ and $Q_{kN+1}$ ...
Assume the initial values of $K0$, $Q_0$ and $Q_1$ to be $1$.Which of the following state transition tables correctly correspond to the circuit given above? (Note: $Q_{kN...
1.0k
views
answered
Feb 2, 2019
Digital Logic
go-mockgate-1
digital-circuits
circuit-output
digital-logic
+
–
0
votes
4
made easy test series
453
views
answered
Jan 31, 2019
Databases
databases
sql
+
–
1
votes
5
MadeEasy Full Length Test 2019: CO & Architecture - Speedup
484
views
answered
Jan 28, 2019
CO and Architecture
co-and-architecture
speedup
made-easy-test-series
+
–
0
votes
6
ME_FULL LENGTH
let x be an integer which can take a value of either 0 or 1 .then the statement (x=0) ? x=1: x=0 x=x+1 x=1-x x=x-1 none of these according to me x=0 is always going to be true so that expression will evaluate to x=1 which is not matching with any of the option so answer should be D none of these but in answer they ‘ve given B as true please confirm it.
let x be an integer which can take a value of either 0 or 1 .then the statement (x=0) ? x=1: x=0x=x+1x=1-xx=x-1none of theseaccording to me x=0 is always going to be true...
292
views
answered
Jan 27, 2019
0
votes
7
MadeEasy Subject Test: CO & Architecture - Cache Memory
A cache memory is 30 times faster than main memory (MM) and 50% of the time cache is referred for the execution of instruction. The performance is gained by introducing this cache is ________. What I did EMAT = 0.5(M/30)+0.5(M/30+M) = 32M/60 speed up= (M)/32M/60) =60/32=1.875 answer given is 1.90-1.97 (using amdhal’s law)
A cache memory is 30 times faster than main memory (MM) and 50% of the time cache is referred for the execution of instruction. The performance is gained by introducing t...
890
views
answered
Jan 26, 2019
CO and Architecture
made-easy-test-series
co-and-architecture
cache-memory
amdhals-law
speedup
+
–
0
votes
8
BINARY TREE
A rooted tree with 8 nodes has its nodes [1.....8] in preorder.When the tree is traversed in postorder.....nodes visited are {3,5,4,2,7,8,6,1}. Draw a tree for it. How to solve .....someone please explain?
A rooted tree with 8 nodes has its nodes [1.....8] in preorder.When the tree is traversed in postorder.....nodes visited are{3,5,4,2,7,8,6,1}.Draw a tree for it.How to s...
666
views
answered
Jan 23, 2019
DS
binary-tree
data-structures
+
–
0
votes
9
Self doubt
What data this query will return please explain someone.. and how we approach this type of query
What data this query will return please explain someone.. and how we approach this type of query
509
views
answered
Jan 20, 2019
0
votes
10
GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
54.2k
views
answered
Jan 10, 2019
Algorithms
gatecse-2014-set1
algorithms
numerical-answers
normal
maximum-minimum
+
–
5
votes
11
GATE CSE 2007 | Question: 4
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has 9 edges and 5 vertices 9 edges and 6 vertices 10 edges and 5 vertices 10 edges and 6 vertices
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has9 edges and 5 vertices9 edges and 6 vertices10 edges and 5 vertices10 edges and 6 v...
10.2k
views
answered
Dec 30, 2018
Graph Theory
gatecse-2007
graph-theory
normal
out-of-syllabus-now
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register