Recent activity

0 votes

1 answer

1

DBMS-Decomposition
Which of the following statement is true while decomposition ? 3NF guaranteed dependency preserving 3NF guaranteed lossless property Both of the above None of the above

answered 14 seconds ago in Databases by Priyanka Agarwal (429 points) | 6 views

0 votes

3 answers

2

UGCNET-dec2009-ii-18
Match the following : (1) Determinants (a) No attribute can be added (2) Candidate key (b) Uniquely identified a row (3) Non-redundancy (c) A constraint between two attribute (4) Functional dependency (d) Group of attributes on the left hand side of arrow of function dependency. (A) 1 - ... 4 - a, 3 - b, 2 - c, 1 - d (D) 3 - a, 4 - b, 1 - c, 2 - d

answered 1 minute ago in Databases by rishu_darkshadow Active (1.9k points) | 7 views

0 votes

2 answers

3

UGCNET-dec2009-ii-09
The answer of the operation (10111)2 * (1110)2 in hex equivalence is (A) 150 (B) 241 (C) 142 (D) 101011110

answer selected 3 minutes ago in Digital Logic by rishu_darkshadow Active (1.9k points) | 14 views

0 votes

3 answers

4

UGCNET-dec2009-ii-17
Specialization is __________ process. (A) top-down (B) bottom up (C) both (A) and (B) (D) none of these

answered 8 minutes ago in Databases by rishu_darkshadow Active (1.9k points) | 10 views

0 votes

3 answers

5

UGCNET-dec2009-ii-23
At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car can’t leave until all the cars in front of it have left. Is the parking lot more like (A) An array (B) A stack (C) A queue (D) A linked list

answered 9 minutes ago in DS by rishu_darkshadow Active (1.9k points) | 7 views

+1 vote

2 answers

6

NPTEL
Consider two relations R and S of size 600 and 500 bytes respectively.The size of a tuple in both relations is 20B. The block size of the system is 200B. How would many extra block transfers be required, in the worst case, if nested loop join is used instead of block nested loop join technique to compute R⋈S? 1. 78 2. 93 3. 66 4. 105

answered 9 minutes ago in Databases by Shubham Sharma 2 Loyal (3k points) | 254 views

0 votes

3 answers

7

UGCNET-dec2009-ii-16
The E-R model is expressed in term of I. Entities II. The relationship among entities. III. The attributes of the entities. IV. Functional relationship. (A) I, II (B) I, II, IV (C) II, II, IV (D) I, II, III

answered 11 minutes ago in Databases by rishu_darkshadow Active (1.9k points) | 13 views

0 votes

3 answers

8

UGCNET-dec2009-ii-36
In the process management Round-robin method is essentially the pre-emptive version of _________ (A) FILO (B) FIFO (C) SSF (D) Longest time first

answered 12 minutes ago in Operating System by rishu_darkshadow Active (1.9k points) | 17 views

0 votes

3 answers

9

UGCNET-dec2009-ii-11
Recursive functions are executed in a (A) First in first out-order (B) Last in first out-order (C) Parallel fashion (D) Load balancing

answered 13 minutes ago in Algorithms by rishu_darkshadow Active (1.9k points) | 22 views

0 votes

3 answers

10

UGCNET-dec2009-ii-34
Contex-free Grammar (CFG) can be recognized by (A) Finite state automata (B) 2-way linear bounded automata (C) push down automata (D) both (B) and (C)

answered 14 minutes ago in Theory of Computation by rishu_darkshadow Active (1.9k points) | 23 views

0 votes

4 answers

11

UGCNET-dec2009-ii-06
The simplified form of the Boolean expression (X + Y + XY) (X + Z) is (A) X + Y + ZX + Y (B) XY – YZ (C) X + YZ (D) XZ + Y

answered 15 minutes ago in Digital Logic by rishu_darkshadow Active (1.9k points) | 20 views

0 votes

1 answer

12

Online test series
#include<stdio.h> int f(int x,int *py,int **ppz){ int y,z; **ppz+=1; z=**ppz; *py+=2; y=*py; x+=3; return(x+y+z); } void main(){ int c,*b,**a; c=4; b=&c; a=&b; printf("%d",f(&c,b,a)); return 0; } Here why doesn't the value of x increment even though the pointers are changed by value? Why is the answer 19 and not 22?

commented 15 minutes ago in Programming by saxena0612 Active (1.8k points) | 22 views

0 votes

1 answer

13

Mod 16 Down counter
The initial state of Mod 16 down counter is 0110. After 37 clock pulses the state of the counter will be __________

answered 17 minutes ago in Digital Logic by Priyanka Agarwal (429 points) | 4 views

+1 vote

4 answers

14

UGCNET-dec2009-ii-10
How many 1’s are present in the binary representation of 3 × 512 + 7 × 64 + 5 × 8 + 3 (A) 8 (B) 9 (C) 10 (D) 11

answered 17 minutes ago in Digital Logic by rishu_darkshadow Active (1.9k points) | 26 views

+1 vote

1 answer

15

Lossless decomposition
Relation: R(ABCDE): FDs: A->BC, CD->E, B->D, E->A This relation is not in BCNF bcz of FD B->D. So how it make BCNF by decomposition so that the resultant decomposition is both lossless and dependency preserving ? plzz explain ?

commented 21 minutes ago in Databases by rishu_darkshadow Active (1.9k points) | 26 views

0 votes

2 answers

16

multipal printf statement
how to deal with multiple printf statement in C language. how this code will work?? void main() { clrscr(); printf("%d%d%d", printf("GATE"),printf("2018"),printf("IITian")); }

answered 25 minutes ago in Programming by saipriyab (165 points) | 31 views

+3 votes

1 answer

17

Non-isomorphic graphs
How many non-isomorphic simple graph are there with N vertices, where N = 4 ?

commented 29 minutes ago in Graph Theory by $ruthi (229 points) | 354 views

+1 vote

1 answer

18

mock test
Considering size of int as 2 Bytes and size of char as 1 Byte what will be the output int main() { int a=300; char *b=(char *)&a; *==b=2; printf("%d",a); return 0; }

commented 31 minutes ago in Programming by saxena0612 Active (1.8k points) | 12 views

0 votes

0 answers

19

printf
What is the use of %n being used in printf statement

commented 33 minutes ago in Programming by saxena0612 Active (1.8k points) | 4 views

+2 votes

1 answer

20

UGCNET-June2014-II-19
The notation $\exists ! x P(x)$ denotes the proposition “there exists a unique $x$ such that $P(x)$ is true”. Give the truth values of the following statements : I.$\exists ! x P(x) \rightarrow \exists x P(x)$ II.$\ ... Both $I$ & $II$ are true. Both $I$ & $II$ are false. $I$ - false, $II$ - true $I$ - true, $II$ - false

commented 44 minutes ago in Mathematical Logic by Rahul Garg (121 points) | 157 views

+6 votes

2 answers

21

GATE2012-19
The amount of ROM needed to implement a $4-bit$ multiplier is $64$ bits $128$ bits $1$ Kbits $2$ Kbits

commented 1 hour ago in Digital Logic by anchitjindal07 (499 points) | 1.6k views

0 votes

0 answers

22

serial schedules
If total n! serial schedules are possible , will all of them give the same result?

asked 1 hour ago in Databases by Parshu gate (381 points) | 4 views

0 votes

1 answer

23

2's complement addition of two negative numbers

answered 1 hour ago in Digital Logic by pawan kumarln Boss (8.8k points) | 15 views

0 votes

0 answers

24

dfa-finite automata
Let L1 and L2 be the languages L1 = {x ∈ {a, b}∗ | aa is not a substring of x} L2 = {x ∈ {a, b}∗ | x ends with ab} Construct an FA Accepting L1 ∩ L2

asked 1 hour ago in Theory of Computation by set2018 Loyal (3.5k points) | 5 views

+1 vote

2 answers

25

decompose to 3nf

answered 1 hour ago in Databases by rishu_darkshadow Active (1.9k points) | 249 views

+15 votes

5 answers

26

GATE 2016-2-15
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following ... together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$

commented 1 hour ago in DS by Nikunj Acharya (49 points) | 3.3k views

+13 votes

7 answers

27

GATE 2016-1-42
Consider the following context-free grammars; $G_1 : S \to aS \mid B, B \to b \mid bB$ $G_2 : S \to aA \mid bB, A \to aA \mid B \mid \varepsilon,B \to bB \mid \varepsilon$ Which one of the following pairs of languages is generaed by $G_1$ and $G_2$ ,respectively? $\{ a ... ^n \mid m \geq 0 \ and \ n >0\} \ and \ \{ a^mb^n \mid m > 0 \ or \ n>0\}$

answer selected 1 hour ago in Theory of Computation by pawan kumarln Boss (8.8k points) | 1.8k views

+5 votes

2 answers

28

GATE2006-IT-3
In the automaton below, s is the start state and t is the only final state. Consider the strings u = abbaba, v = bab, and w = aabb. Which of the following statements is true? The automaton accepts u and v but not w The automaton accepts each of u, v, and w The automaton rejects each of u, v, and w The automaton accepts u but rejects v and w

commented 1 hour ago in Theory of Computation by sid1221 Active (1.6k points) | 272 views

+1 vote

2 answers

29

C programming
Does C perform array out of bound checking? What is the output of the following program? int main() { int i; int arr[5] = {0}; for (i = 0; i <= 5; i++) printf("%d ", arr[i]); return 0; }

answered 2 hours ago in Programming by Ankit001 (303 points) | 16 views

0 votes

1 answer

30

is regular grammar does not generate empty string?

commented 2 hours ago in Theory of Computation by set2018 Loyal (3.5k points) | 41 views

+1 vote

0 answers

31

mutual exclusion
Initial values of S1 ansd S2 are random assigned Method by P1 do { flag[i] = true; S1 = S2; while( flag[j]=true and S1 == S2) critical section flag[i]=false; remainder section }while(1); Method used by P2 do { flag[j]= ... while(flag[i]=true and S1!=S2); criticals ection flag[j]=false; remainder section } while(1); Does this gurantee mutual exclusion?

commented 2 hours ago in Operating System by Red_devil (231 points) | 4 views

+1 vote

0 answers

32

DMA cycle stealing.
Consider 1 mbps hard-disk is interfaced to the processor in a cycle stealing mode of DMA whenever 64 bytes of data is available in the buffer,then it is transferred to main memory (1 word = 64 bits) and machine cycle time is 2 micro sec. Then, percentage of CPU time consumed for DMA operation is ? Assume BR and BG requests take 5 micro seconds each.

commented 2 hours ago in CO & Architecture by Xylene Loyal (2.9k points) | 5 views

+7 votes

4 answers

33

GATE2001-2.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by 6 and number of b's divisible by 8. What is the minimum number of states that the DFA will have? 8 14 15 48

commented 3 hours ago in Theory of Computation by sid1221 Active (1.6k points) | 2.2k views

+1 vote

1 answer

34

Bit stuffing

commented 3 hours ago in Computer Networks by vamp_vaibhav Active (1.2k points) | 40 views

+1 vote

1 answer

35

Fragmentation

commented 3 hours ago in Computer Networks by A_i_$_h Loyal (4.6k points) | 29 views

+1 vote

0 answers

36

UGC NET jUNE 2006 -QN 5
Let A = {x | -1<x<1} = B. The function f(x)=x/2 from A to B is: (A) injective (B) surjective (C) both injective and surjective (D) neither injective nor surjective How it can be both injective and surjective ??

commented 3 hours ago in Mathematical Logic by A_i_$_h Loyal (4.6k points) | 12 views

+1 vote

3 answers

37

if WXW^R is regular W,X belongs (a,b)* then www^R is not regular language,why? w belongs (a,b)*

answered 4 hours ago in Theory of Computation by vamp_vaibhav Active (1.2k points) | 68 views

+1 vote

0 answers

38

Corman Algo
if f(n)=n/log n and c=2 Than f*(n)=?

commented 4 hours ago in Algorithms by Nitesh Choudhary Active (2k points) | 11 views

+3 votes

2 answers

39

if $w \in (a+b)^*$ satisfies $abw = wab$, then $\text{length}(w)$ is ?

answered 4 hours ago in Theory of Computation by navya n (81 points) | 189 views

+2 votes

3 answers

40

Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive zeros} is

answered 4 hours ago in Theory of Computation by navya n (81 points) | 1.1k views

Recent activity

Recent Posts

Recent Blog Comments