Register
Filter

Answers by sachin!

0 votes
1
gate 2019
From a complete binary tree T of 8 leaf nodes, two leaf nodes a and b are selected randomly and uniformly. What is the expected distance between a and b in T?
From a complete binary tree T of 8 leaf nodes, two leaf nodes a and b are selected randomly and uniformly. What is the expected distance between a and b in T?
1 votes
2
ISRO2018-60
What is the output of tho following program? main(){ int x=2, y=5; if(x<y) return (x=x+y); else printf("z1"); printf("z2"); } $z2$ $z1z2$ Compilation error None of these
What is the output of tho following program?main(){ int x=2, y=5; if(x<y) return (x=x+y); else printf("z1"); printf("z2"); }$z2$$z1z2$Compilation errorNone of these
2 votes
5
Gate 2018
Number System Question...What are all the options that can't be exactly represented...Question is like b7 b6 ....
Number System Question...What are all the options that can't be exactly represented...Question is like b7 b6 ....
3 votes
6
GATE 2018
Value of Global variable counter in C program is ----------.
Value of Global variable counter in C program is .
0 votes
8
Group theory doubt
1)Suppose that G is cyclic group of order 10 with generator a €G .Order of a^8 is... 2)(G,*) is an abelian group which of the following must hold A)for all g€G. g-1 = g B)for all g€G. g^2 =e C)for all a,b €G ( a*b)^2 =a^2* b^2
1)Suppose that G is cyclic group of order 10 with generator a €G .Order of a^8 is...2)(G,*) is an abelian group which of the following must hold A)for all g€G. g-...
–1 votes
9
ISRO-DEC2017-71
A $32$-$bit$ adder is formed by cascading $4$-$bit$ CLA adder.The gate delays (latency) for getting the sum bits is $16$ $18$ $17$ $19$
A $32$-$bit$ adder is formed by cascading $4$-$bit$ CLA adder.The gate delays (latency)for getting the sum bits is$16$$18$$17$$19$
0 votes
11
NET nov-17 paper-2 Q11
ptrdata is a pointer to a data type . The expression *ptrdata++ is evaluated as ( in C++) a) *(ptrdata++) b) (*ptrdata)++ c) *(ptrdata)++ d) depends on compiler
ptrdata is a pointer to a data type . The expression *ptrdata++ is evaluated as ( in C++) a) *(ptrdata++) b) (*ptrdata)++c) *(ptrdata)++ d) depends on compiler
1 votes
13
index
primary index , secondary index and clustered index are sparse indexes or dense?
primary index , secondary index and clustered index are sparse indexes or dense?
2 votes
15
Integration doubt
1 0 [3x] dx
1 0 [3x] dx
1 votes
16
finite automata
If all state of DFA is final then it accpets $\sum$ (i.e) regular true or false
If all state of DFA is final then it accpets $\sum$ (i.e) regulartrue or false
0 votes
17
ace test
What is best time complexity to search element in sorted doubly linkedlist?? O(n) O(nlogn) O(log n) O(n2)
What is best time complexity to search element in sorted doubly linkedlist??O(n) O(nlogn) O(log n) O(n2)
1 votes
18
self doubt on networks
What is the maximum size of data that the transport layer can pass to the Network layer below?
What is the maximum size of data that the transport layer can pass to the Network layer below?
1 votes
22
Clasless addressing self doubt
The first address of a block should be exactly divisible by no. Of address of a block Explain with example
The first address of a block should be exactly divisible by no. Of address of a block Explain with example
1 votes
24
made-easy
2 votes
27
Disk scheduling problem
disk requests come to disk driver for cylinder 10,22,20,2,40,6,X in that order at a time when the disk drive is reading from cylinder 20 the seek time is 6ms per cylinder if the total seek time 876ms under fcfs scheduling algorithum then what is the value of x??
disk requests come to disk driver for cylinder 10,22,20,2,40,6,X in that order at a time when the disk drive is reading from cylinder 20 the seek time is 6ms per cylinder...
1 votes
28
Please solve this Q
What could be the best algorithm from the following when the time complexity is measured based bon the number of swaps performed by the sorting algorithm? 1. Selection sort 2. Insertion sort 3. Bubble sort 4. None of these
What could be the best algorithm from the following when the time complexity is measured based bon the number of swaps performed by the sorting algorithm?1. Selection sor...
0 votes
29
Please solve this Q
What is the time complexity to construct a binary tree when inorder and preorder traversal of the tree is given? 1. O(n) 2.O(n log n) 3. O(n2) 4.O(n2 log n)
What is the time complexity to construct a binary tree when inorder and preorder traversal of the tree is given?1. O(n)2.O(n log n)3. O(n2)4.O(n2 log n)
Page: