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 bad_engineer
0
votes
1
fork system call
Consider the following code snippet: if(fork()&& fork()) { fork(); } if(fork()||fork()) { fork(); fork(); } printf("GATE 2017"); How many times GATE $2017$ printed? How to solve this using tree diagram?
Consider the following code snippet: if(fork()&& fork()) { fork(); } if(fork()||fork()) { fork(); fork(); } printf("GATE 2017");How many times GATE $2017$ printed?How to ...
9.5k
views
answered
Jul 8, 2017
Operating System
operating-system
fork-system-call
+
–
1
votes
2
Union of R.E and non R.E
What is the class of the language resulting from Union of R.E and non R.E ? (R.E => recursively enumerable)
What is the class of the language resulting from Union of R.E and non R.E ?(R.E = recursively enumerable)
1.2k
views
answered
Jun 18, 2017
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
3
Super key
Consider the relation R(A,B,C,D,E) with the following depencies ABC - DE and D-AB The number of super key of R is
Consider the relation R(A,B,C,D,E) with the following depencies ABC - DE and D-AB The number of super key of R is
380
views
answered
Jun 12, 2017
0
votes
4
FCFS priority scheduling numerical
2.9k
views
answered
Jun 2, 2017
1
votes
5
Permutation
How many strings with 5 or more characters can be formed from the letter SEERESS ? Verify the answer ...
How many strings with 5 or more characters can be formed from the letter SEERESS ? Verify the answer ...
2.7k
views
answered
Jun 2, 2017
Combinatory
combinatory
+
–
0
votes
6
CIL17
505
views
answered
Apr 9, 2017
15
votes
7
GATE CSE 2017 Set 2 | Question: 48
If a random variable $X$ has a Poisson distribution with mean $5$, then the expectation $E\left [ \left ( x+2 \right )^{2} \right ]$ equals ___.
If a random variable $X$ has a Poisson distribution with mean $5$, then the expectation $E\left [ \left ( x+2 \right )^{2} \right ]$ equals ___.
16.4k
views
answered
Feb 14, 2017
Probability
gatecse-2017-set2
expectation
poisson-distribution
numerical-answers
probability
+
–
0
votes
8
[TOC] Check given set is countable
Given that S1 :Set of all regular languages over Σ S2 : Set of all languages over Σ accepted by Turing machines then S1 and S2 respectively are: a) countable, countable b) uncountable, countable c) countable, uncountable d) uncountable, uncountable
Given thatS1 :Set of all regular languages over ΣS2 : Set of all languages over Σ accepted by Turing machinesthen S1 and S2 respectively are:a) countable, countableb) u...
728
views
answered
Feb 10, 2017
Theory of Computation
theory-of-computation
+
–
2
votes
9
Throughput of memory system---urgent
How to calulate the Throughput of memory system when average access time is given
How to calulate the Throughput of memory system when average access time is given
378
views
answered
Feb 10, 2017
CO and Architecture
memory-management
computer-networks
+
–
1
votes
10
GATE CSE 1987 | Question: 1-V
The most relevant addressing mode to write position-independent codes is: Direct mode Indirect mode Relative mode Indexed mode
The most relevant addressing mode to write position-independent codes is:Direct modeIndirect modeRelative modeIndexed mode
15.1k
views
answered
Feb 7, 2017
CO and Architecture
gate1987
co-and-architecture
addressing-modes
easy
+
–
3
votes
11
Subnet mask-NID
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the decimal value of last octet of last host of sixth subnet is ? shouldn't it be 190 but the answer given is 222? anyone help
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the decimal value of last octet of last host of sixth subnet is ?sho...
5.4k
views
answered
Feb 6, 2017
Computer Networks
computer-networks
network-addressing
subnetting
+
–
0
votes
12
Indexing
Which of the following is true? (A) Second level index in multilevel indexing will be always a primary index. (B) All indexed files will be always physically ordered files.
Which of the following is true?(A) Second level index in multilevel indexing will be always a primary index.(B) All indexed files will be always physically ordered files....
233
views
answered
Jan 31, 2017
0
votes
13
MadeEasy Subject Test: Computer Networks - IP Addressing
510
views
answered
Jan 31, 2017
Computer Networks
made-easy-test-series
ip-addressing
computer-networks
+
–
5
votes
14
GATE CSE 2004 | Question: 26
The number of different $n \times n $ symmetric matrices with each element being either 0 or 1 is: (Note: $\text{power} \left(2, X\right)$ is same as $2^X$) $\text{power} \left(2, n\right)$ $\text{power} \left(2, n^2\right)$ $\text{power} \left(2,\frac{ \left(n^2+ n \right) }{2}\right)$ $\text{power} \left(2, \frac{\left(n^2 - n\right)}{2}\right)$
The number of different $n \times n $ symmetric matrices with each element being either 0 or 1 is: (Note: $\text{power} \left(2, X\right)$ is same as $2^X$)$\text{power} ...
12.6k
views
answered
Jan 30, 2017
Linear Algebra
gatecse-2004
linear-algebra
normal
matrix
+
–
0
votes
15
Ace Test Series: Databases - Transactions
Whether the given schedule is conflict serializable or view serializable or none.
Whether the given schedule is conflict serializable or view serializable or none.
912
views
answered
Jan 29, 2017
Databases
databases
transaction-and-concurrency
ace-test-series
+
–
0
votes
16
Transactions TESTBOOK Question
A) View serializable but not conflict b) both c) neither d) Conflict but not view
A) View serializable but not conflictb) bothc) neitherd) Conflict but not view
747
views
answered
Jan 25, 2017
0
votes
17
Made Easy (CO)
240
views
answered
Jan 25, 2017
0
votes
18
MadeEasy Subject Test: Algorithms - Time Complexity
Which of the following represents the running time for run (n) function? O(log n) O(log (log (n)) O(log ∗ (n)) O(n) sombody please provide explanation
Which of the following represents the running time for run (n) function?O(log n)O(log (log (n))O(log ∗ (n))O(n)sombody please provide explanation
629
views
answered
Jan 25, 2017
Algorithms
made-easy-test-series
algorithms
time-complexity
+
–
2
votes
19
Minimum Spanning Tree ( TestBook Test Series 2)
663
views
answered
Jan 23, 2017
DS
minimum-spanning-tree
graph-algorithms
+
–
2
votes
20
Which of the following can be considered as "UNIVERSAL GATE"?
Which of the following can be considered as "UNIVERSAL GATE"? a. NAND b. AND, NOT c. AND, OR d. OR, NOT I. a only II. b and d only III. a, b and d only IV. All of these
Which of the following can be considered as "UNIVERSAL GATE"?a. NANDb. AND, NOTc. AND, ORd. OR, NOTI. a onlyII. b and d onlyIII. a, b and d onlyIV. All of these
803
views
answered
Jan 23, 2017
Digital Logic
digital-logic
+
–
1
votes
21
MadeEasy CBT 2017: Databases - B Tree
Consider the following Node definitions of B Tree and B+ Tree Order P for root node between 1 to 2P keys for other nodes between P to 2P keys If disk block size is of 2048B and key is 20B . Block pointer is 30B . Record Pointer is 25B . Difference between order of B tree with B+ Tree is _______
Consider the following Node definitions of B Tree and B+ TreeOrder P for root node between 1 to 2P keys for other nodes between P to 2P keys If disk block size is of 2048...
2.2k
views
answered
Jan 23, 2017
Databases
made-easy-test-series
cbt-2017
b-tree
databases
+
–
0
votes
22
Test by Bikram | General Aptitude | Test 2 | Question: 24
A dishonest shopkeeper marks up the price of his goods by $20 \%$ and gives a discount of $10 \%$ to the customer. Besides, he also cheats both his supplier and his buyer by $100$ grams while buying and selling $1$ kilogram. Find the percentage profit earned by the shopkeeper. $31 \%$ $32 \%$ $35 \%$ $29 \%$
A dishonest shopkeeper marks up the price of his goods by $20 \%$ and gives a discount of $10 \%$ to the customer. Besides, he also cheats both his supplier and his buyer...
444
views
answered
Jan 19, 2017
Quantitative Aptitude
tbb-aptitude-2
profit-loss
+
–
0
votes
23
mean no of transmission?? 13 or 200
Consider a wireless link where the probability of packet error is 0.6 . To transfer data across the links,Stop and Wait protocol is used.The channel condition is assumed to be independent from transmission to transmission.The average number of transmissin attempts required to transfer X packet is 500. The value of X is?
Consider a wireless link where the probability of packet error is 0.6 . To transfer data across the links,Stop and Wait protocol is used.The channel condition is assumed ...
660
views
answered
Jan 18, 2017
Computer Networks
computer-networks
+
–
2
votes
24
MadeEasy Subject Test: Operating System - Virtual Memory
473
views
answered
Jan 13, 2017
Operating System
made-easy-test-series
operating-system
virtual-memory
+
–
0
votes
25
What is the minimum number of days that they will take to finish the work?
When working alone A, B and C can complete a piece of work in 10, 15 and 20 days respectively. At the most only two people can work on each day and nobody works more than two consecutive days. What is the minimum number of days that they will take to finish the work? 6 days 6(2/3) days 6(4/5)days
When working alone A, B and C can complete a piece of work in 10, 15 and 20 days respectively. At the most only two people can work on each day and nobody works more than...
1.7k
views
answered
Dec 27, 2016
Quantitative Aptitude
general
quantitative-aptitude
+
–
1
votes
26
MADE EASY TEST SERIES
What is the maximum number of nodes if a B+ tree has order 4 and number of levels as 6?
What is the maximum number of nodes if a B+ tree has order 4 and number of levels as 6?
267
views
answered
Dec 27, 2016
Databases
databases
bplustrees
+
–
0
votes
27
dbms b tree
Suppose the search key of a B tree is V=8 byte long, the disk block size is B=512 bytes, a record(data) pointer is P=6 bytes and a block pointer is l=5 bytes. Calculate the order of the B tree and also is each node of B tree is 69 percent full. Find the average number of keys per node of the above B tree. 1. 29,17 2. 27,17 3. 28,18 4. 27,18 my answer is d) option is it plzz check
Suppose the search key of a B tree is V=8 byte long, the disk block size is B=512 bytes, a record(data) pointer is P=6 bytes and a block pointer is l=5 bytes. Calculate t...
2.0k
views
answered
Dec 26, 2016
Databases
databases
b-tree
+
–
2
votes
28
ME-FST6:Transaction,Recoverability and 2PL
3.1k
views
answered
Dec 21, 2016
Databases
transaction-and-concurrency
databases
concurrency
conflict-serializable
+
–
0
votes
29
ACE-COMPILER TEST
338
views
answered
Dec 21, 2016
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register