Dark Mode

Recent activity by Dexter

1 answer

1

Doubt database
What is basic difference between mandatory attributes and multivalued attributes???

answered in Databases Oct 19, 2017

301 views

1 answer

2

Hash function takes a message of arbitrary length and generates a fixed length code

answered in CO and Architecture Oct 19, 2017

418 views

1 answer

3

Question
On a system with N CPU, what is the maximum number of processes that can be in running state ? A) N process B)Depend on the processes in ready state C) Can't say

answered in Operating System Oct 19, 2017

727 views

1 answer

4

Regular expression
What is the regular expression for sigma = {0,1} where each string has odd 0's. Which one is correct? A) 1*0(1*01*01*)* B) 1*01*(1*01*01*)*

answered in Theory of Computation Oct 17, 2017

394 views

2 answers

5

Control Word
A computer has 170 different operations. Word size is 4 Bytes. one word instruction requires two address fields. One address for register and one address for memory. If there are 37 registers then the memory size is ____ (in KB).

answered in CO and Architecture Oct 16, 2017

3.5k views

1 answer

6

microprocessor
Which of the following statement is not correct? (a) We can transfer register to immediate number. (b) We can multiply 8-bit three register is one instruction. (c) 8051 is used for parallel port interface. (d) We can add two immediate numbers using only one ADD instruction. Codes : (c) and (d) (a) and (b) (a), (b), (c) and (d) (a), (b) and (d)

answered in Digital Logic Oct 16, 2017

783 views

1 answer

7

NPTEL
Return value of xchg instruction is_____________ 1. Old value 2. New value 3 . 1 if operation succeeds and 0 if operation fails 4. None of the above

answered in Operating System Oct 16, 2017

468 views

1 answer

8

NPTEL
By using Intel hardware xchg instruction ensures that The critical section is deadlock free Solution is starvation free Process enters CS in FIFO order More than one process enters critical section at same time Which of the above statement is TRUE?

answered in Operating System Oct 16, 2017

731 views

3 answers

9

NPTEL
State True/False Bakery algorithm ensures that no process is starved. 1. True 2. False

answered in Operating System Oct 16, 2017

786 views

1 answer

10

ME test
A byte addressable computer has a small data cache capable of holding 16 32 bit words. Each cache capable of holding 16 32 bit word. Each cache block consists of four 32 bit words. For the following sequence of addresses (in hexadecimal). The miss ratio if 4-way set associative LRU cache is used is ___________ ? 100, 104, 108, 104, 107, 108, 105, 102, 108, 103.

answered in CO and Architecture Feb 20, 2017

515 views

1 answer

11

self doubt
If there are no attributes in common between two relations R and S then, what should be the result of (R natural join S)? 1) R x S 2) $\phi$ I think option 2 because of following definition from Korth:

answered in Databases Feb 20, 2017

401 views

0 answers

12

compiler-design parsing no of states
The number of states in SLR parser for G is _______. for this type of question , Do we consider augmented entry state like S'->S. ????

closed in Compiler Design Feb 20, 2017

654 views

1 answer

13

NPTEL-Internetwork Security-Week2-Quiz-2
Which cipher is commonly used in network-based symmetric cryptographic applications? (A) Linear cipher (B) Block cipher (C) Permutation cipher (D) Stream cipher

answered in GATE Feb 20, 2017

798 views

1 answer

14

Predict serializability of given schedule
S:r1(P),r2(Q),r1(Q),r2(P),w1(Q),w2(P) Predict serializability of given schedule: a) It is view serializable NOT conflict serializble b) It is view serializable but NOT conflict serializble only if P= Q c) It is view serializable and conflict serializble d) It is neither view serializable nor conflict serializble

answered in Databases Feb 20, 2017

403 views

1 answer

15

Subnet Mask
What is the size of subnet mask? No. of bits in subnet mask or No. of subnets possible

closed in Computer Networks Feb 20, 2017

234 views

1 answer

16

Datagram switching and Virtual circuit
I. Datagram switching does not have set up and tear down phases. hence it is faster than virtual circuit approach II. Virtual circuit approach uses simple VC ID to decide next hope rather than complete addressing information. hence it is faster than datagram ... I only b) II only c) I is correct but reason is wrong d) II is correct, but reason is wrong

commented in Computer Networks Feb 20, 2017

1.2k views

0 answers

17

number of tuples returned by query
A) 3 B) 2 C) 1 D) 0

commented in Databases Feb 19, 2017

1.1k views

1 answer

18

MICROPROCESSOR PROGR
how many times the loop will be executed LXI H,0106 H DCR L LOOP :DCX H NZ LOOP HLT a)105 times b) 261 times c) 0 times d) forever

commented in CO and Architecture Feb 19, 2017

1.7k views

2 answers

19

Made Easy Test
Consider the following schedule for transaction T1,T2,T3 r1(x),r2(y),r3(y),w1(x),w3(x),r2(z),w1(x) Also assume that the timestamp for the three transaction is{30,10,20} which of the following statement is true with respect to the above schedule? ANS will be Thomas Write Time Stamp Protocol but not basic time stamp protocol HOW?

answered in Databases Feb 19, 2017

3.0k views

2 answers

20

Made easy test series
Which of the following is true? In 2PL protocol if all exclusive lock are acquired by transactions in only increasing order of their addresses then 2PL protocol is deadlock free. In 2PL protocol if all exclusive lock are acquire by transaction in only increasing order of their addresses then 2PL protocol is starvation free. Both (a) and (b) Neither (a) nor (b)

answered in Databases Feb 19, 2017

651 views

2 answers

21

E R model
why not b) option

answered in Databases Feb 19, 2017

729 views

2 answers

22

Threads
Since every thread can access every memory address within the process’ address space, one thread can read, write, or even wipe out another thread’s stack. I am not getting the above statement, stack is specific to a thread then how we can access other thread's stack through Process' address space?

answered in Operating System Feb 19, 2017

1.0k views

2 answers

23

Consider the following algorithm on a graph with edge weights.
Consider the following algorithm on a graph with edge weights. Sort the edges as [e1,e2,...,em] in decreasing order of cost. Start with the original graph. Consider each edge ej. If this edge is part of a cycle delete it. Which ... a minimum cost spanning tree. 3.Exactly m-n+1 edges will be deleted. 4.At most n-1 edges will be deleted.

commented in Computer Networks Feb 19, 2017

2.6k views

1 answer

24

which of the following is true..??
Consider the following statements: S1 : Increasing the number of page frames allocated to a process sometime increase the page fault rate in FIFO page replacement policy irrespective of page reference string. S2 : It is not necessary to have loader everytime in main memory. ... S1 is true B) Only S2 is true C) Both S1 and S2 are true D) Neither S1 and S2 are true

answered in Operating System Feb 19, 2017

2.6k views

1 answer

25

GATE CSE 2000 | Question: 2.13
A graphics card has on board memory of $1$ MB. Which of the following modes can the card not support? $1600 \times 400$ resolution with $256$ colors on a $17$ inch monitor $1600 \times 400$ resolution with $16$ million colors on a $14$ inch monitor ... with $16$ million colors on a $17$ inch monitor $800 \times 800$ resolution with $256$ colors on a $14$ inch monitor

answer selected in Computer Graphics Jan 17, 2017

11.2k views

9 answers

26

GATE CSE 2016 Set 1 | Question: 28
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.

commented in Set Theory & Algebra Jan 12, 2017

21.5k views

6 answers

27

GATE CSE 1997 | Question: 6.3
The number of equivalence relations of the set $\{1,2,3,4\}$ is $15$ $16$ $24$ $4$

commented in Set Theory & Algebra Jan 10, 2017

21.2k views

9 answers

28

GATE CSE 2014 Set 2 | Question: 3
The maximum number of edges in a bipartite graph on $12$ vertices is____

commented in Graph Theory Jan 10, 2017

26.9k views

3 answers

29

GATE CSE 2007 | Question: 40
Consider a hash table of size seven, with starting index zero, and a hash function $(3x + 4)\mod 7$. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence $1, 3, 8, 10$ is inserted into the table using closed hashing? Note that − denotes an ... $3$ $1$, −, −, −, −, −, $3$ $1, 10, 8$, −, −, −,$ 3$

commented in DS Jan 3, 2017

15.9k views

8 answers

30

GATE CSE 2006 | Question: 49
An implementation of a queue $Q$, using two stacks $S1$ and $S2$, is given below: void insert (Q, x) { push (S1, x); } void delete (Q) { if (stack-empty(S2)) then if (stack-empty(S1)) then { print( Q is empty ); return; } else while (!(stack-empty(S1))){ x=pop ... and $2m\leq y\leq 2n $ $ 2m\leq x<2n $ and $2m\leq y\leq n+m $ $ 2m\leq x<2n $ and $2m\leq y\leq 2n $

commented in DS Jan 3, 2017

32.8k views