Dark Mode

Recent activity by learncp

4 answers

1

GATE CSE 2018 | Question: 19
Let $G$ be a finite group on $84$ elements. The size of a largest possible proper subgroup of $G$ is _____

commented in Set Theory & Algebra Nov 10, 2019

10.5k views

4 answers

2

UGC NET CSE | December 2012 | Part 2 | Question: 4
The power set of the set $\{ \Phi \}$ is $\{ \Phi \}$ $\{ \Phi, \{ \Phi \} \}$ $\{ 0 \}$ $\{ 0, \Phi , \{ \Phi \} \}$

commented in Set Theory & Algebra Oct 24, 2019

1.8k views

5 answers

3

GATE CSE 2010 | Question: 46
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: $\text{if} (i\%2==0) \{$ $\quad\text{if} (i<n) \text{ request } R_i;$ ... which of the following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$

commented in Operating System Nov 1, 2017

24.0k views

7 answers

4

GATE CSE 2014 Set 3 | Question: 24
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit-string is: $0111110100$ $0111110101$ $0111111101$ $0111111111$

commented in Computer Networks Feb 1, 2016

18.4k views

4 answers

5

GATE CSE 2013 | Question: 14
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D. Network layer - $4$ times and Data link ... $4$ times and Data link layer - $6$ times Network layer - $2$ times and Data link layer - $6$ times

commented in Computer Networks Jan 30, 2016

14.4k views

3 answers

6

GATE CSE 2003 | Question: 20
Consider the following three claims: $(n+k)^m = \Theta(n^m)$ where $k$ and $m$ are constants $2^{n+1} = O(2^n)$ $2^{2n+1} = O(2^n)$ Which of the following claims are correct? I and II I and III II and III I, II, and III

commented in Algorithms Jan 29, 2016

14.9k views

1 answer

7

Virtual Gate Test Series: Theory Of Computation - Decidable Language
$L$ is surely decidable if (A) both $L$ and its complement are not recognizable (B) $L \subseteq \{0\}^*$ (C) $L \leq_m \{0^n1^n\;\mid\;n\geq0\}$ (D) $L^R$ is decidable

asked in Theory of Computation Jan 26, 2016

557 views

1 answer

8

Virtual Gate Test Series: Databases - Aggregation
Which of the following is not true? Generalization is the result of taking the union of two or more disjoint entity sets to produce a higher level entity set. Specialization is an abstraction in which ... condition. The concurrency control management component of the database is responsible for handling the concurrency control policies.

asked in Databases Jan 26, 2016

371 views

3 answers

9

Virtual Gate Test Series: Programming & DS - AVL Tree
Insert the given values in the order in initially empty $\text{AVL}$ tree. $\text{34,21,10,27,24,43,15,6}$ What is the value at the root of the tree$?$

asked in DS Jan 26, 2016

462 views

3 answers

10

Virtual Gate Test Series: Discrete Mathematics - Graph Theory (Matching Number)
Find the matching number for the given graph-

asked in Graph Theory Jan 26, 2016

679 views

1 answer

11

Is there an easy way to check whether a given decomposition of a relation is lossless and dependency preserving ?

asked in Databases Jan 22, 2016

675 views

2 answers

12

Calculating time compleity of recurrence relations.
I am having some problems in calculating time complexities for recurrence relations. In one of the books, I saw two questions- 1. A(n) { if(n<=1) return (n); else { return ( A(n/2)+ A(n/2)+ n); } } The recurrence for this is given as T(n)= T(n/2)+ ... )+T(n/2) +c if n>1 I think it should be T(n)= 2T(n/2)+6T(n/2) +n^2 What am I missing here ?

edited in Algorithms Jan 17, 2016

230 views

3 answers

13

GATE IT 2005 | Question: 5
Which of the following statements is TRUE about the regular expression $01^*0$? It represents a finite set of finite strings. It represents an infinite set of finite strings. It represents a finite set of infinite strings. It represents an infinite set of infinite strings.

commented in Theory of Computation Jan 16, 2016

7.8k views

5 answers

14

GATE CSE 2007 | Question: 21
How many different non-isomorphic Abelian groups of order $4$ are there? $2$ $3$ $4$ $5$

commented in Set Theory & Algebra Jan 14, 2016

16.3k views

5 answers

15

GATE CSE 2002 | Question: 2.17
The binary relation $S= \phi \text{(empty set)}$ on a set $A = \left \{ 1,2,3 \right \}$ is Neither reflexive nor symmetric Symmetric and reflexive Transitive and reflexive Transitive and symmetric

commented in Set Theory & Algebra Jan 14, 2016

10.6k views

2 answers

16

GATE CSE 1999 | Question: 2.4
If $L1$ is context free language and $L2$ is a regular language which of the following is/are false? $L1-L2$ is not context free $L1 \cap L2$ is context free $\sim L1$ is context free $\sim L2$ is regular

commented in Theory of Computation Jan 14, 2016

9.9k views

2 answers

17

GATE CSE 2006 | Question: 33
Let $L_1$ be a regular language, $L_2$ be a deterministic context-free language and $L_3$ a recursively enumerable, but not recursive, language. Which one of the following statements is false? $L_1 \cap L_2$ is a deterministic CFL $L_3 \cap L_1$ is recursive $L_1 \cup L_2$ is context free $L_1 \cap L_2 \cap L_3$ is recursively enumerable

commented in Theory of Computation Jan 13, 2016

10.4k views

4 answers

18

GATE CSE 2001 | Question: 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 in Theory of Computation Jan 12, 2016

15.7k views

6 answers

19

GATE2012 CY: GA-5
Choose the most appropriate alternative from the options given below to complete the following sentence: If the tired soldier wanted to lie down, he ___ the mattress out on the balcony. should take shall take should have taken will have taken

answered in Verbal Aptitude Jan 2, 2016

3.4k views

6 answers

20

GATE IT 2006 | Question: 49
Which one of the choices given below would be printed when the following program is executed ? #include <stdio.h> struct test { int i; char *c; }st[] = {5, "become", 4, "better", 6, "jungle", 8, "ancestor", 7, " ... $\text{etter, u, 6, ungle}$ $\text{cetter, k, 6, jungle}$ $\text{etter, u, 8, ncestor}$

commented in Programming Jan 2, 2016

16.0k views

4 answers

21

GATE CSE 1992 | Question: 02,vii
A $2-3$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length The number of internal nodes of a $2-3$ tree having $9$ leaves could be $4$ $5$ $6$ $7$

commented in DS Dec 31, 2015

7.1k views

8 answers

22

GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$

commented in DS Dec 31, 2015

26.0k views

4 answers

23

GATE CSE 2005 | Question: 1, ISRO2017-55
What does the following C-statement declare? int (*f) (int * ); A function that takes an integer pointer as argument and returns an integer A function that takes an integer as argument and returns an integer pointer A pointer ... pointer as argument and returns an integer A function that takes an integer pointer as argument and returns a function pointer

commented in Programming Dec 30, 2015

17.7k views

3 answers

24

GATE CSE 2002 | Question: 2.18
The C language is: A context free language A context sensitive language A regular language Parsable fully only by a Turing machine

commented in Programming Dec 30, 2015

7.8k views

3 answers

25

GATE CSE 2014 Set 1 | Question: 40
Consider a hash table with $9$ slots. The hash function is $h(k)= k \mod 9$. The collisions are resolved by chaining. The following $9$ keys are inserted in the order: $5, 28, 19, 15, 20, 33, 12, 17, 10$. The maximum, minimum, and average chain lengths in the hash table, respectively, are $3, 0,$ and $1$ $3, 3,$ and $3$ $4, 0,$ and $1$ $3, 0,$ and $2$

commented in DS Dec 30, 2015

8.2k views

8 answers

26

GATE CSE 2011 | Question: 29
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$

commented in DS Dec 30, 2015

24.1k views

2 answers

27

GATE CSE 2012 | Question: 41
A file system with $300$ GByte disk uses a file descriptor with $8$ direct block addresses, $1$ indirect block address and $1$ doubly indirect block address. The size of each disk block is $128$ Bytes and the size of each disk block address is $8$ Bytes. ... file size in this file system is $3$ KBytes $35$ KBytes $280$ KBytes dependent on the size of the disk

commented in Operating System Dec 26, 2015

16.2k views

4 answers

28

GATE CSE 1997 | Question: 3.8
When an interrupt occurs, an operating system ignores the interrupt always changes state of interrupted process after processing the interrupt always resumes execution of interrupted process after processing the interrupt may change state of interrupted process to ‘blocked’ and schedule another process.

commented in Operating System Dec 25, 2015

11.5k views

1 answer

29

GATE CSE 2006 | Question: 62, ISRO2016-50
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a translation look-aside buffer (TLB) which can hold a total of $128$ page table entries and is $4$-way set associative. The minimum size of the TLB tag is: $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$

commented in Operating System Dec 25, 2015

22.4k views

3 answers

30

GATE CSE 1999 | Question: 2.11
Which of the following is/are advantage(s) of virtual memory? Faster access to memory on an average. Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory. Program larger than the physical memory size can be run.

commented in Operating System Dec 25, 2015

10.9k views