Dark Mode

Answers by Habibkhan

7 votes

1

BST(Test Series)
Consider a Binary Search Tree is created using element 1 to n in following order: 3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, ....., n – 3, n – 4, n – 5, n – 2, n – 1, n What is the worst time complexity of searching a number in the Binary Search Tree?

answered in DS Jan 3, 2018

822 views

5 votes

2

NIELIT 2017 DEC Scientific Assistant A - Section B: 44
If $X, Y$ and $Z$ are three exhaustive and mutually exclusive events related with any experiment and the $P\left(X \right)=0.5P\left(Y \right)$ and $P\left(Z \right)$ = $0.3P\left(Y \right)$. Then $P\left(Y \right)$ = ___________ . $0.54$ $0.66$ $0.33$ $0.44$

answered in Probability Jan 3, 2018

2.0k views

4 votes

3

A First Course in Probability- Sheldon Ross 8th Edition Random Variables Example 1b
Three balls are to be randomly selected without replacement from an urn containing 20 balls numbered 1 through 20. If we bet that at least one of the balls that are drawn has a number as large as or larger than 17, what is the probability that we win the bet?

answered in Probability Nov 10, 2017

897 views

5 votes

4

max file size
Consider a file system in which the index table in the directory holds 32 pointers(DBA's) if the file size is within 32 blocks then these 32 addresses act as direct DBA's . Otherwise if file size is more than 32 blocks then these addresses act as ... to blocks that hold addresses of data blocks. if DBS is 4KB and DBA is 32 bits then max file size in MB is ___________

answered in Operating System Nov 10, 2017

1.2k views

3 votes

5

answered in Programming in C Nov 10, 2017

274 views

2 votes

6

Self-Doubt
Is the Poset (Q,Less than or equal to) a well ordered set? Where Q denotes set of all rational numbers and relation R is less than or equal to.

answered in Set Theory & Algebra Nov 9, 2017

759 views

4 votes

7

Maths: maxima and minima
In this maxima - minima question, teacher says that critical point -2 doesn't belong to the interval [-3, 3], isn't this wrong or i am missing something?

answered in Calculus Nov 9, 2017

1.8k views

1 vote

8

[Discrete Maths] : Functions

answered in Set Theory & Algebra Nov 9, 2017

822 views

3 votes

9

3D array
main() { int arr[2][3][2] ={{{1,2}{3,4}{5,6}} , {7,8}{9,10},{11,12}}}; printf("%d%d",a[1]-a[0],a[1][0]-a[0][0]}; return 0; } assume int is of 2 bytes

answered in Programming in C Nov 9, 2017

598 views

1 vote

10

FINd p and Q
P = (1+1/2)(1+1/3)(1+1/4)..........(1+1/98)(1+1/99) Q=(1-1/2)(1-1/3)...............................(1-1/99)(1-1/100) P/Q = ?

answered in Quantitative Aptitude Nov 9, 2017

578 views

1 vote

11

Inequality
If 0$<$x$<$1 then (a) $\sqrt{\frac{1-x}{1+x}} < \frac{log(1+x)}{sin^{-1}x} < 1$ (b) $\sqrt{\frac{1-x}{1+x}} > \frac{log(1+x)}{sin^{-1}x} > 1$ (c) $\sqrt{\frac{1-x}{1+x}} > \frac{log(1+x)}{sin^{-1}x} < 1$ (d) $\sqrt{\frac{1-x}{1+x}} < \frac{log(1+x)}{sin^{-1}x} > 1$

answered in Calculus Nov 8, 2017

578 views

3 votes

12

Lattice
In Bounded lattice, the greatest and least element are always complement of each other? True/False?

answered in Set Theory & Algebra Nov 8, 2017

764 views

4 votes

13

Ace Test Series: Operating System - Semaphore
It says as follows: Pseudocode Integer X = 0 , Y = 23 ; Semaphore mx = 1 , my = Null ; Codebegin Begin P(mx); x= x+1; V(my); End Begin P(my); x= y+1; V(mx); End Question: Possible final values of X?? I tried to find the values and i concluded that 1 and 24 could be the final values but solution says only 24 :( Any idea??

answered in Operating System Nov 8, 2017

956 views

3 votes

14

answered in DS Nov 7, 2017

398 views

2 votes

15

hamming
In hamming method to transmit a message of size 12B data . How many minimum number of padding bits are considered to correct single bit error

answered in Computer Networks Nov 7, 2017

570 views

2 votes

16

CO:- Memory Access time

answered in CO and Architecture Nov 7, 2017

1.5k views

17 votes

17

MadeEasy Subject Test: CO & Architecture - Pipelining
Which of the following statements are true? 1. WAW and WAR can be reduced but cannot be completely removed from the pipeline. 2.In direct mapped cache,may produce more misses of program refers to a memory word that occupies same tag value 3.By register renaming,all the stalls created by anti data dependency are eliminated

answered in CO and Architecture Nov 7, 2017

2.9k views

2 votes

18

answered in Databases Nov 7, 2017

349 views

5 votes

19

branch instructions
Consider a 6 staged pipelined processor , where all stages are perfectly balanced. While executing a branch instruction CPU computes the target address after completing the operation in 5th stage only.One clock cycle time is required for executing one non branch ... 1GHz and it takes 1.6sec time for 109 instructions, then number of branch instructions in the above program is ?

answered in CO and Architecture Nov 7, 2017

1.6k views

2 votes

20

aptitudee
Three typists A,B and C working together 8 hours per day can type 900 pages in 20 days. In a day B types as many pages more than A as C types as many pages more than B. The number of pages typed by A in 4 hours equal to the number of pages typed by C isn 1 hour. How many pages C types in each hour?

answered in Quantitative Aptitude Nov 6, 2017

3.1k views

1 vote

21

self doubt
we use the formula V(n,k) = C(n-1+k,k) when do we actually go for this formula? QUESTION there are 6 symbols and we have to insert 12 blanks between these symbols with atleast 2 blanks between each...number of ways to arrange the blanks Solution remaining blanks =2 after ... (5,2) = C(5-1+2,2) =15 why use this approach in simple words i want to know when do we go for this approach

answered in Mathematical Logic Nov 6, 2017

278 views

4 votes

22

MadeEasy Subject Test: CO & Architecture - Cache Memory

answered in CO and Architecture Nov 5, 2017

768 views

10 votes

23

addressing mode reduces no of bits?
computer uses addressing modes to reduce the number of bits in the addressing field of the instruction Can someone please explain how this statement is true? PLEASE Examples will be helpful

answered in CO and Architecture Nov 5, 2017

1.7k views

3 votes

24

test series
To merge two lists of size m and n, how many comparisons we need to perform in the worst case and best case respectively ? a) m+n-1 and m+n-1 b)m+n+1 and max(m,n) c)max(m,n) and min(m,n) d)m+n-1 and min(m,n) can someone give the worst case and best case with examples ?

answered in Algorithms Nov 4, 2017

3.1k views

3 votes

25

what will the value printed by code

answered in Programming in C Nov 4, 2017

358 views

3 votes

26

WAR amd WAW dependency
R4 <- R1 + R4 R4 <- R2 + R4 R4 <- R3 + R5 Number of WAR and WAW dependencies?

answered in CO and Architecture Nov 4, 2017

836 views

1 vote

27

time stamp ordering protocol
what is the meaning of TS(Ti) < WTS(Q) and TS(Ti) > WTS(Q) Ti issuing read on data item Q. please someone clear my doubt i am very confuse in these terms.

answered in Databases Nov 3, 2017

898 views

2 votes

28

programming
a) 4 b)20 c)both d) either of them ... for me its 20 but given ans is either of them

answered in Programming in C Nov 2, 2017

715 views

Page:

1
2
3
4
5
6
...
30
next »