Dark Mode

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?

answered in Quantitative Aptitude Apr 16, 2019

261 views

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)

answered in Databases Apr 2, 2019

1.4k views

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}$ ...

answered in Digital Logic Feb 2, 2019

551 views

0 votes

4

made easy test series

answered in Databases Jan 31, 2019

295 views

1 vote

5

MadeEasy Full Length Test 2019: CO & Architecture - Speedup

answered in CO and Architecture Jan 28, 2019

312 views

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.

answered in Programming Jan 27, 2019

208 views

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)

answered in CO and Architecture Jan 26, 2019

410 views

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?

answered in DS Jan 24, 2019

409 views

0 votes

9

Self doubt
What data this query will return please explain someone.. and how we approach this type of query

answered in Databases Jan 20, 2019

318 views

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 ________

answered in Algorithms Jan 10, 2019

45.4k views

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

answered in Graph Theory Dec 31, 2018

8.3k views