Dark Mode

Recent activity by mohitbawankar

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 ?????

asked in Operating System Jan 23, 2018

351 views

1 answer

2

PAGE FAULTS
Consider a binary search algorithm to search an element in array of ‘n’ numbers. Assume that this array spans over multiple pages with each page holding ‘p’ elements (n>p). Every memory access will generate a page fault until the search range is less than ‘p’. The minimum value of ‘p’ that reduces the page fault is

answered in Operating System Jan 22, 2018

517 views

2 answers

3

doubt
Consider a simple system running a single process. The size of physical frames and logical pages is 16 bytes. The RAM can hold 3 physical frames. The virtual addresses of the process are 6 bits in size. The program generates the following 20 virtual ... map to any logical page. Calculate the number of page faults genrated by the accesses above, assuming a LRU page replacement algorithm

answered in Operating System Jan 22, 2018

3.0k views

0 answers

4

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); }

asked in Programming in C Jan 22, 2018

231 views

0 answers

5

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?

asked in Computer Networks Jan 22, 2018

284 views

0 answers

6

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?

asked in BARC Jan 21, 2018

318 views

2 answers

7

Output Under Dynamic Scoping
#include<stdio.h> int x=10; int main() { static int x=10; x+=f1()+f2()+f3()+f1(); printf("%d",x); return 0; } int f1(){static int x=25;x++;return x;} int f2(){int x=50;x++;return x;} int f3(){x*=10;return x;} What is the output of the above code, if dynamic scoping is used.

commented in Programming in C Jan 21, 2018

2.0k views

0 answers

8

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

asked in Operating System Jan 20, 2018

332 views

1 answer

9

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

commented in Others Jan 19, 2018

247 views

0 answers

10

IEEE 754
In IEEE double precision format, the sum of the largest and 2nd largest implicit fractional numbers is

commented in Digital Logic Jan 19, 2018

914 views

5 answers

11

GATE IT 2005 | Question: 81-b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$

commented in Operating System Jan 17, 2018

13.8k views

0 answers

12

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 _______

commented in Programming in C Jan 17, 2018

556 views

0 answers

13

The number of possibilities to place exactly one letter in its correct envelop ________.
Assume that there are 6 color letters L1, L2, L3, L4, L5 and L6 are to be placed in 6 same color envelop E1, E2, E3, E4, E5 and E6 (one letter for each envelop). The number of possibilities to place exactly one letter in its correct envelop ________.

commented in Combinatory Jan 17, 2018

703 views

2 answers

14

MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is ________. I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?

commented in Databases Jan 17, 2018

1.7k views

1 answer

15

Slop of Curve
please share your solution The maximum slope of the curve -x3+6x2+66x+666

commented in Mathematical Logic Jan 16, 2018

442 views

3 answers

16

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 ______.

commented in Programming in C Jan 15, 2018

15.2k views

1 answer

17

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

asked in Programming in C Jan 15, 2018

532 views

1 answer

18

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:

commented in Compiler Design Jan 15, 2018

1.6k views

1 answer

19

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)

commented in DS Jan 15, 2018

742 views

2 answers

20

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

asked in CO and Architecture Jan 14, 2018

520 views

1 answer

21

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)>

commented in Set Theory & Algebra Jan 10, 2018

499 views

0 answers

22

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.

comment edited in Set Theory & Algebra Jan 10, 2018

469 views

0 answers

23

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

commented in Programming in C Jan 10, 2018

655 views

0 answers

24

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

commented in Set Theory & Algebra Jan 10, 2018

606 views

0 answers

25

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?

commented in CO and Architecture Jan 9, 2018

798 views

1 answer

26

Test series
As we know that, PDA=Finite Automata + one Stack. Assume a modified PDA M1 in which, in place of stack if we use counter (where counter is able to count the number of occurrences of terminals in input string), i.e., PDA M1 = Finite Automata + one counter. Consider the given below languages: L1={an bn |n>0} L2={wwr| w ϵ {a,b}*} L3= {w | na(w) = nb(w)} Which language can M1 recognize?

commented in Theory of Computation Jan 9, 2018

698 views

1 answer

27

Digital test question about shift register.

commented in Digital Logic Jan 7, 2018

2.6k views

2 answers

28

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

asked in Digital Logic Jan 7, 2018

3.2k views

1 answer

29

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 ________.

asked in Databases Jan 7, 2018

4.2k views

4 answers

30

answered in Programming in C Jan 6, 2018

1.2k views