Register
Filter

Recent activity by Deepthi_ts

1 answer
2
Higher Engg. Mathematics by B.S. Grewal probability & statistics
Out of 50 rare books, 3 of which are especially valuable, 5 are stolen at random by a thief.? What is the probability that a) none of the 3 is included b) 2 of the 3 are included?
Out of 50 rare books, 3 of which are especially valuable, 5 are stolen at random by a thief.?What is the probability that a) none of the 3 is included b) 2 of the 3 are i...
1 answer
5
co_williams
What would be the bias value for a. A base-2 exponent in a 6-bit field? b. A base-8 exponent in a 7-bit field?
What would be the bias value fora. A base-2 exponent in a 6-bit field?b. A base-8 exponent in a 7-bit field?
1 answer
6
output
main() { int a=2; if(a==2) { a=~a+2<<1; printf("%d",a); } else { break; } a)-3 b)-2 c)1 d)compile error
main(){int a=2;if(a==2){a=~a+2<<1;printf("%d",a);}else{break;}a)-3b)-2c)1d)compile error
2 answers
7
Time complexity
Given a 2D array X[m][n] which has m rows and n columns. The array X is row wise and column wise sorted (i.e) each individula row and column is sorted. What is the complexity to search an element in this array a)O(m*n) b)O(m2) or O(n2) c)O(log2(m*n)) d)O(m+n)
Given a 2D array X[m][n] which has m rows and n columns. The array X is row wise and column wise sorted (i.e) each individula row and column is sorted. What is the comple...
1 answer
8
Associative
A fully associative cache memory unit with a capacity of 64KB is built using a block size of 32 words.The size of the physical address is 30 bits. The size of the tag comparator (in bits) is ____________
A fully associative cache memory unit with a capacity of 64KB is built using a block size of 32 words.The size of the physical address is 30 bits. The size of the tag com...
1 answer
9
upload snaps
Someone please help me in guiding how to upload snap of questions by phone.
Someone please help me in guiding how to upload snap of questions by phone.
7 answers
11
UGC NET CSE | January 2017 | Part 3 | Question: 32
Any decision tree that sorts n elements has height ____ $\Omega (\lg \: n)$ $\Omega (n)$ $\Omega (n \: \lg \: n)$ $\Omega (n^2)$
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
4 answers
12
UGC NET CSE | January 2017 | Part 3 | Question: 33
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case. $O(1)$ $O( \lg n)$ $O(n)$ $O(n \lg n)$
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case.$O(1...
5 answers
13
UGC NET CSE | January 2017 | Part 3 | Question: 34
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is $630$ $580$ $480$ $405$
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5 $ is...
1 answer
15
helpless mind
What is the difference between Base addressing and Index addressing? And finally how does based indexed addressing works?
What is the difference between Base addressing and Index addressing?And finally how does based indexed addressing works?
1 answer
18
# gate cse 1998 2 marks
Plz explain the answer of ques no. 4 a) 2NF b) 3NF
Plz explain the answer of ques no. 4a) 2NFb) 3NF
2 answers
19
# DBMS #Normalization
IF a relation R(A,B,C,D,E) where AB is the key and ADE->C so is this in 2NF or not? Do Partial dependency exist??? because C is derived from ADE (A is part of key AB)
IF a relation R(A,B,C,D,E) whereAB is the key andADE->Cso is this in 2NF or not?Do Partial dependency exist??? because C is derived from ADE (A is part of key AB)
5 answers
20
ISRO2016-22
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, what is the effective access time for the memory? 21.4 ns 29.9 ns 23.5 ns 35.1 ns
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, w...
3 answers
21
ISRO2016-70
Which network protocol allows hosts to dynamically get a unique IP number on each bootup DHCP BOOTP RARP ARP
Which network protocol allows hosts to dynamically get a unique IP number on each bootupDHCPBOOTPRARPARP
5 answers
22
ISRO2016-46
With single resource, deadlock occurs if there are more than two processes competing for that resources if there are only two processes competing for that resources if there is a single process competing for that resources none of these
With single resource, deadlock occursif there are more than two processes competing for that resourcesif there are only two processes competing for that resourcesif there...
0 answers
23
#isro 2007 Q32 # Logic
2 answers
24
ISRO2007-07
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is $1$ $k$ $k-1$ $k/2$
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is$1$$k$$k-1$$k/2$
3 answers
25
ISRO2007-27
Virtual memory is Part of Main Memory only used for swapping A technique to allow a program, of size more than the size of main memory, to run Part of secondary storage used in program execution None of these
Virtual memory isPart of Main Memory only used for swappingA technique to allow a program, of size more than the size of main memory, to runPart of secondary storage used...
2 answers
26
ISRO2007-21
An Ethernet hub functions as a repeater connects to a digital PBX connects to a token-ring network functions as a gateway
An Ethernet hubfunctions as a repeaterconnects to a digital PBXconnects to a token-ring networkfunctions as a gateway
2 answers
27
ISRO2007-25
What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them? Partitioning Multi-tasking Windowing Paging
What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them?Partitioning...
2 answers
28
ISRO2007-41
A task in a blocked state is executable is running must still be placed in the run queues is waiting for some temporarily unavailable resources
A task in a blocked stateis executableis runningmust still be placed in the run queuesis waiting for some temporarily unavailable resources
4 answers
29
ISRO2007-57
Which of the following programming language(s) provides garbage collection automatically Lisp C++ Fortan C
Which of the following programming language(s) provides garbage collection automaticallyLispC++FortanC
3 answers
30
ISRO2007-59
The time taken by binary search algorithm to search a key in a sorted array of $n$ elements is $O\: (\log_2 \: n)$ $O \: (n)$ $O \: (n \: \log_2 \: n)$ $O \: (n^2)$
The time taken by binary search algorithm to search a key in a sorted array of $n$ elements is$O\: (\log_2 \: n)$$O \: (n)$$O \: (n \: \log_2 \: n)$$O \: (n^2)$