Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
mohitbawankar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by mohitbawankar
1
votes
0
answers
1
resource allocation IMP doubt
Consider a scenario where 3 processes P1, P2 and P3 are sharing resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they ... diff diff q same concept they just reduce 1 from combined at last : :) 13 is 100% right for deadlock never arise ?????
Consider a scenario where 3 processes P1, P2 and P3 are sharing resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the...
351
views
asked
Jan 23, 2018
2
votes
0
answers
2
PROGRAMMING
What is the output of following program? #include<stdio.h> void main() { int i=5; printf("%d %d %d %d %d \n", i, i++, i--, ++i, --i); }
What is the output of following program?#include<stdio.h>void main(){ int i=5; printf("%d %d %d %d %d \n", i, i++, i , ++i, i);}
227
views
asked
Jan 22, 2018
1
votes
0
answers
3
CN DOUBT
An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an IP packet of size 4404 bytes with an IP header of length 20 bytes. The values of the relevant fields in the header of the third IP fragment generated by the router for this ... this mistake which i used ? ceil(data size without header/MTU with header ) this is right way of finding number of fragment? right?
An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an IP packet of size 4404 bytes with an IP header of length 20 bytes. The values of the rel...
283
views
asked
Jan 22, 2018
1
votes
0
answers
4
doubt regarding BARC Registarion
if i select both ,and if i want to go trough only GATE score ..then its mandatory online test conduct by BARC?
if i select both ,and if i want to go trough only GATE score ..then its mandatory online test conduct by BARC?
309
views
asked
Jan 21, 2018
2
votes
0
answers
5
file system IMP doubt
1.) A file system with 512 GB disk uses a file descriptor with 16 direct block addresses, 1 indirect block address, 1 doubly indirectly block address and 1 triple indirect block addresses. Size of each disk block is 256 bytes and the size of each disk block ... block addresses. The maximum size of a file on such a system is ___________ KB. // why ans is 2096KB ,not 80 KB
1.) A file system with 512 GB disk uses a file descriptor with 16 direct block addresses, 1 indirect block address, 1 doubly indirectly block address and 1 triple indirec...
329
views
asked
Jan 20, 2018
1
votes
1
answer
6
duobt
please explain me this calculation part bold part In implicit form largest digit will be = 1.111...11∗21024=(2−211)∗21024 Second largest will be = 1.111...10∗21024=(2−210)∗21024 Hence sum will be (2−211)∗21024 + (2−210)∗21024 21025−21013+21025−21014=21026−21013(1+2)=21026−3∗21013
please explain me this calculation part bold partIn implicit form largest digit will be = 1.111...11∗21024=(2−211)∗21024Second largest will be = 1.111...10∗21024...
241
views
asked
Jan 19, 2018
3
votes
0
answers
7
programming Q MOCK TEST
Consider the following program along with push and pop operations on stack which can contain atmost The decimal value equivalent to the binary number printed by above code is _______
Consider the following program along with push and pop operations on stack which can contain atmost The decimal value equivalent to the binary number printed by above cod...
532
views
asked
Jan 17, 2018
6
votes
3
answers
8
multidimensional aaray
39 ) Suppose a multidimensional array is declared as m(2:8,-4:1,6:10). If the base address is 200 and there are 4 words per memory location, then the address of A[5,-1,8] by using row order is ______.
39 ) Suppose a multidimensional array is declared as m(2:8,-4:1,6:10). If the base address is 200 and there are 4 words per memory location, then the address of A[5,-1,8]...
15.2k
views
asked
Jan 15, 2018
3
votes
1
answer
9
Slop of Curve
please share your solution The maximum slope of the curve -x3+6x2+66x+666
please share your solution The maximum slope of the curve-x3+6x2+66x+666
436
views
asked
Jan 15, 2018
3
votes
1
answer
10
mock test programming
What will be the output of the following program, for k=8? #include<stdio.h> void main() { int i= 2, j=3, k; scanf("%d",&k); switch(k%2) { case 5<4:printf("k is even"); break; case 10>9: printf("k is odd") ... printf("end"); } } Doubt: 8%2=0 then which case it will print .? or directly it will print k is even bcs of mod=0
What will be the output of the following program, for k=8?#include<stdio.h void main() { int i= 2, j=3, k; scanf("%d",&k); switch(k%2) { case 5<4:printf("k is even"); bre...
525
views
asked
Jan 15, 2018
Programming in C
programming-in-c
+
–
3
votes
1
answer
11
MOCK TEST DATA STRUCTURE
Consider a two-dimensional array with elements stored in the form of lower triangular matrix. The elements must be crossed to read A[4, 2] from the array A[–6, ..., + 8, –6,..., + 8] whose base address 1000 is ________. (Assume elements are stored in row major order)
Consider a two-dimensional array with elements stored in the form of lower triangular matrix. The elements must be crossed to read A[4, 2] from the array A[–6, ..., + 8...
734
views
asked
Jan 14, 2018
5
votes
2
answers
12
mock gate COA
A nonpipelined processor operating at 1 MHz is converted into a synchronous pipelined processor with five stages requiring 3.5 μsec, 2.5 μsec, 3 μsec, 2.5 μsec and 3.5 μsec, respectively. The delay of the latches is 1 μsec. The speedup of the pipeline processor for a large number of ... ans is 3.33 speedup =(3.5+2.5+3+2.5+3.5)/4.5 =3.33 why my ans is wrong ? please explain
A nonpipelined processor operating at 1 MHz is converted into a synchronous pipelined processor with five stages requiring 3.5 μsec, 2.5 μsec, 3 μsec, 2.5 μsec and 3....
506
views
asked
Jan 14, 2018
3
votes
1
answer
13
Mock DFS Q
Consider DFS over undirected graph with 4 vertices <A;B;C;D>. The discovery and finishing times of them in the order A to D are given. Select the option from following showing more than one connected components: 1) <(1,6), (2,5), (3,4), (8,10)> 2) <(6,7), (2,5), (3,4), (8,9)> 3) <(4,5), (2,8), (1,7), (3,6)> 4) <(7,8), (1,2), (5,6), (3,4)>
Consider DFS over undirected graph with 4 vertices <A;B;C;D>. The discovery and finishing times of them in the order A to D are given. Select the option from following sh...
493
views
asked
Jan 10, 2018
3
votes
0
answers
14
MOCK TEST
Choose correct statements about Hasse diagram: (I) Maximal elements of this Hasse diagram are i, j. (II) Minimum element of this Hasse diagram are a, b, d. (III) Maximal elements of this Hasse diagram are b, d, i, j. (IV) Minimal element of this Hasse diagram is a. (V) Minimum element of this diagram is a.
Choose correct statements about Hasse diagram:(I) Maximal elements of this Hasse diagram are i, j.(II) Minimum element of this Hasse diagram are a, b, d.(III) Maximal ele...
453
views
asked
Jan 10, 2018
4
votes
1
answer
15
MOCK TEST compiler design
Consider the given below grammar S→ cAd A→ bA | aA | b If a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
Consider the given below grammarS→ cAdA→ bA | aA | bIf a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
1.6k
views
asked
Jan 10, 2018
Compiler Design
compiler-design
grammar
parsing
numerical-answers
test-series
+
–
1
votes
0
answers
16
mock test
#include<stdio.h> main ( ) { int new ( ); new ( ); (*new) ( ); } int new ( ) { printf (“Welcome”); } } prints Welcome Welcome prints Welcome results in a run-time error results in a compilation error
#include<stdio.h>main ( ){ int new ( ); new ( ); (*new) ( );}int new ( ){ printf (“Welcome”);}} prints Welcome Welcome prints Welcome results in a run-...
635
views
asked
Jan 9, 2018
1
votes
0
answers
17
Mock test
The number of ways possible to form injective function from set A to set B, where set ‘A’ has 3 elements, set ‘B’ has 5 elements such that i^th element of set A should not be matched with i^th element of set B
The number of ways possible to form injective function from set A to set B, where set ‘A’ has 3 elements, set ‘B’ has 5 elements such that i^th element of set A s...
575
views
asked
Jan 9, 2018
2
votes
0
answers
18
MOCK TEST
Consider an L1 cache, L2 cache, and main memory. The hit rates and hit times for each are: 70% hit rate, 5 ns hit time for L1. 90% hit rate, 14 ns hit time for L2. 100% hit rate, 150 ns hit time for main memory If there a total of 300 memory accesses, how many of these accesses are serviced from main memory?
Consider an L1 cache, L2 cache, and main memory. The hit rates and hit times for each are:70% hit rate, 5 ns hit time for L1.90% hit rate, 14 ns hit time for L2.100% hit ...
784
views
asked
Jan 9, 2018
3
votes
2
answers
19
shift register
A 8-bit left-shift register and a D-flip flop are connected together as shown in the figure below and they are synchronized with the same clock. If the D-flip-flop is initially cleared, then the circuit will act as It will work like b7xor 0 b6 xorb5 b4 xorb3 b2xorb1 ??????? please give explain
A 8-bit left-shift register and a D-flip flop are connected together as shown in the figure below and they are synchronized with the same clock.If the D-flip-flop is init...
3.2k
views
asked
Jan 7, 2018
3
votes
1
answer
20
DB lossless join and dependency preserving decomposition
Consider the following relational schema R(ABCDEFG) with FD set {AB → C, BC → A, AC → B, B → D, D → E}. The minimum relations required to decompose R into BCNF which satisfy lossless join and dependency preserving decomposition are ________.
Consider the following relational schema R(ABCDEFG) with FD set {AB → C, BC → A, AC → B, B → D, D → E}. The minimum relations required to decompose R into BCNF ...
4.2k
views
asked
Jan 7, 2018
Page:
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register