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 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?
2.5k
views
answered
Feb 3, 2019
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
9.9k
views
answered
Apr 22, 2018
Programming in C
isro2018
programming
output
+
–
0
votes
3
cutoff for DRDO 2018
What was the cutoff GATE score for "Advt No. - 130 : Direct Recruitment for Scientist 'B' in DRDO and Scientist/ Engineer 'B' in ADA" on the basis on GATE 2016/17/18 computer science . Link: https://rac.gov.in/cgibin/2018/advt_130_shortlisting_all/getlogin.php?a41a147988f80b2ce920a5596b485614=1#
What was the cutoff GATE score for "Advt No. - 130 : Direct Recruitment for Scientist 'B' in DRDO and Scientist/ Engineer 'B' in ADA" on the basis on GATE 2016/17/18 comp...
2.6k
views
answered
Apr 1, 2018
Job Queries
drdo
ada
+
–
0
votes
4
GATE 2018
Hi , My GATE 2018 score is 411 and my graduation score is 6.2 out of 10. For applying to various NITs, the minimum eligibility criteria is 60% or CGPA 6.5/10. By this criteria I'll not be able to apply for the Central Government Institutes. But ... getting 62% which makes me eligible to apply. So my doubt is whether I can convert CGPA into % or not while filling the application.
Hi , My GATE 2018 score is 411 and my graduation score is 6.2 out of 10. For applying to various NITs, the minimum eligibility criteria is 60% or CGPA 6.5/10. By this cri...
683
views
answered
Mar 17, 2018
GATE
ccmt
eligibility
gatecse-2018
nit
+
–
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 ....
2.1k
views
answered
Feb 4, 2018
3
votes
6
GATE 2018
Value of Global variable counter in C program is ----------.
Value of Global variable counter in C program is .
1.4k
views
answered
Feb 4, 2018
0
votes
7
computer organization
suppose that in 1000 memory reference there are 40 misses in the first level cache and 20 misses in the second level cache. Assume miss penalty from the L2 cache to memory is 100 cycles the hit time of the L2 cache is 10 clock cycles.the hit time of the L1 cache is 1 clock cycle. what is average memory access time?
suppose that in 1000 memory reference there are 40 misses in the first level cache and 20 misses in the second level cache. Assume miss penalty from the L2 cache to memor...
1.4k
views
answered
Jan 31, 2018
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-...
2.3k
views
answered
Dec 27, 2017
Mathematical Logic
group-theory
+
–
–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$
7.0k
views
answered
Dec 20, 2017
Digital Logic
isrodec2017
+
–
0
votes
10
MadeEasy Test Series: Operating System - Virtual Memory
A computer system implements a 36 bit virtual address. Page size of 4 KB and the size of physical memory is 30 bits. The approximate size of page table in the system is ________ MB. I got 36 but given answer is 48.Which is correct?
A computer system implements a 36 bit virtual address. Page size of 4 KB and the size of physical memory is 30 bits. The approximate size of page table in the system is _...
1.3k
views
answered
Dec 19, 2017
Operating System
made-easy-test-series
operating-system
virtual-memory
+
–
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
2.4k
views
answered
Nov 5, 2017
Programming in C
programming-in-c
pointers
+
–
0
votes
12
Masters theorem
902
views
answered
Nov 4, 2017
Algorithms
master-theorem
recurrence-relation
time-complexity
made-easy-test-series
+
–
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?
399
views
answered
Nov 2, 2017
1
votes
14
B+ tree maximum number of records.
What is the maximum number of records that can be indexed in B+ tree of level $4$ ,order $10$ where root is at level $1$ ? As the order of tree is $10$, nodes in the last level of b+ tree should contain $10$ record pointers (number of ... $10-1 = 9$ record pointers. Which one is correct?
What is the maximum number of records that can be indexed in B+ tree of level $4$ ,order $10$ where root is at level $1$ ?As the order of tree is $10$, nodes in the last ...
4.7k
views
answered
Oct 12, 2017
Databases
b-tree
databases
+
–
2
votes
15
Integration doubt
1 0 [3x] dx
1 0 [3x] dx
486
views
answered
Oct 9, 2017
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
839
views
answered
Oct 7, 2017
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)
380
views
answered
Sep 28, 2017
DS
time-complexity
ace-test-series
linked-list
+
–
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?
186
views
answered
Sep 28, 2017
2
votes
19
Bottom-Up Parsing
Consider the folllowing grammar $ S\rightarrow AaS \ |\ b$ $ A\rightarrow c \ |\ d \ |B$ $ B\rightarrow AgC \ |\ AhC \ | \ DgC | \ DhC$ $C\rightarrow c \ |\ d \ | \ D$ $ D\rightarrow eBf$ Which of the following are viable prefix ? $ \left ( 1 \right )Aab$ $ \left ( 2 \right )ca$ $ \left ( 3 \right )cab$ $\left ( 4 \right )AgCS$
Consider the folllowing grammar$ S\rightarrow AaS \ |\ b$$ A\rightarrow c \ |\ d \ |B$$ B\rightarrow AgC \ |\ AhC \ | \ DgC | \ DhC$$C\rightarrow c \ |\ d \ | \ D$$ D\rig...
2.8k
views
answered
Sep 20, 2017
Compiler Design
compiler-design
viable-prefix
parsing
+
–
1
votes
20
time complexity
638
views
answered
Sep 17, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
programming-in-c
test-series
+
–
2
votes
21
average memory access time for two level cache
Consider a two level cach system . For 100 memory references, 16 misses in the first level cach and 8 misss in the second level cache. Miss penalty from L2 cache to memory is 50 cycles. The hit time of L2 cach is 5 cycles and hit time of the L1 cache is 1 clock cycle. What is the average memory access time(in cycle)?
Consider a two level cach system . For 100 memory references, 16 misses in the first level cach and 8 misss in the second level cache. Miss penalty from L2 cache to memor...
2.9k
views
answered
Sep 9, 2017
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
207
views
answered
Sep 5, 2017
Computer Networks
computer-networks
self-doubt
+
–
3
votes
23
switching
Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has three links, of rates R1 = 500 kbps, R2 = 2 Mbps, and R3 = 1 Mbps. a. Assuming no other traffic in the network, what is the throughput for the file transfer? b. Suppose the file is 4 million bytes. Dividing the file size by the throughput, roughly how long will it take to transfer the file to Host B?
Suppose Host A wants to send a large file to Host B. The path from Host A toHost B has three links, of rates R1 = 500 kbps, R2 = 2 Mbps, and R3 = 1 Mbps.a. Assuming no ot...
677
views
answered
Sep 4, 2017
Computer Networks
network-switching
computer-networks
+
–
1
votes
24
made-easy
171
views
answered
Sep 2, 2017
1
votes
25
Test series ques
Johnny has bought two candles of equal length but different diameters. One of the candles will burn up completely in 10 hours, while the other candle requires 40% more time to burn up completely. If the candles are lit at the same time, approximately how long will they burn before one of the candles is twice the length of the other? 1)7.8 hours 2)6.4 hours 3)5.6 hours 4)6 hours
Johnny has bought two candles of equal length but different diameters. One of the candles will burn up completely in 10 hours, while the other candle requires 40% more ti...
613
views
answered
Aug 29, 2017
2
votes
26
NPTEL
Assume that a data file contains 1000 records that are ordered by a key attribute A, and a primary index on attribute A is built. Let the size of key be 5B and block pointer be 5B. Each block of the system is of 105B, out of which 100B can be used to store data and 5B ... data. How many disk accesses will be required to fetch the record using the index in average case? a. 6 b. 3 c. 4 d. 5
Assume that a data file contains 1000 records that are ordered by a key attribute A, and a primary index on attribute A is built. Let the size of key be 5B and block poin...
949
views
answered
Aug 26, 2017
Databases
nptel-quiz
databases
+
–
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.4k
views
answered
Aug 23, 2017
Operating System
disk-scheduling
+
–
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...
242
views
answered
Aug 19, 2017
Algorithms
time-complexity
sorting
+
–
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)
246
views
answered
Aug 19, 2017
Algorithms
algorithms
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register