Dark Mode

Recent activity by Anu007

3 answers

1

GATE IT 2008 | Question: 54
An operating system implements a policy that requires a process to release all resources before making a request for another resource. Select the TRUE statement from the following: Both starvation and deadlock can occur Starvation can occur but deadlock cannot occur Starvation cannot occur but deadlock can occur Neither starvation nor deadlock can occur

commented in Operating System Nov 22, 2019

15.6k views

1 answer

2

Normal Forms
Which of the following statement false of relation $R$ is in $3NF$ but not $BCNF$? Relation $R$ must consist atleast two over-lapped candidate keys. Relation $R$ must consist proper subset of candidate key determines proper subset of some other ... and other candidate keys simple candidate key. Relation $R$ must consist atleast two compound candidate keys. Please Explain every Option.

commented in Databases Nov 22, 2019

2.8k views

0 answers

3

Depth first search
The maximum number of edges possible with UDG of n nodes,when DFS call on any random node in the graph result in stack size of 5. i.e. 5 function calls present in stack simultaneously are ......... Ans. 10

commented in DS Aug 21, 2018

1.3k views

0 answers

4

Made Easy Operating System

closed in Operating System Jul 6, 2018

128 views

2 answers

5

self doubt
we know 2PL protocol ensures serializability then does it means that it also ensure conflict serializability nd view serializability??? nd do we need to check both conflict serialziabilty nd view Seri....if we are asked to check weather serializable or not

commented in Databases Jul 4, 2018

872 views

0 answers

6

Operating system

commented in Operating System Jul 4, 2018

191 views

2 answers

7

Languages
Consider a language over Σ={a,b} the description of L is given below. L={ PQ | P ∈(a,b)* , Q ∈ (a,b)* and na(P) = nb(Q) }. Select the correct option. 1. L is DCFL but not regular. 2. L is CSL but not CFL. 3. L is CFL but not DCFL. 4. None of these.

commented in Theory of Computation Jul 3, 2018

928 views

1 answer

8

Fog and gof function

commented in Mathematical Logic Jul 3, 2018

1.1k views

2 answers

9

UGC NET CSE | August 2016 | Part 3 | Question: 28
A slotted ALOHA network transmits $200$ bits frames using a shared channel with $200$ kbps bandwidth. If the system (all stations put together) produces $1000$ frames per second, then the throughput of the system is _______. $0.268$ $0.468$ $0.368$ $0.568$

answer edited in Computer Networks Jul 3, 2018

2.7k views

0 answers

10

C programming
What is the value of p and q at the end? #include<stdio.h> int main() { int n=1024; int p=0,q=0; int i,j; for( i = 1;i<=n;i=2*i) p=p+5; for(j = 1;j<=p;j=2*j) q=q+7; printf(" %d\n %d\n",p,q); } Please explain briefly.

commented in Programming in C Jul 1, 2018

335 views

4 answers

11

GATE CSE 2012 | Question: 55
A computer has a $256$-$\text{KByte}$, 4-way set associative, write back data cache with block size of $32$ $\text{Bytes}$. The processor sends $32$ $\text{bit}$ addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, ... tag directory is: $160$ $\text{Kbits}$ $136$ $\text{Kbits}$ $40$ $\text{Kbits}$ $32$ $\text{Kbits}$

commented in CO and Architecture Jul 1, 2018

12.2k views

1 answer

12

time complexity
What is the time complexity of the following program? main() { i = n; while(i>=1) { i=i/2; i=i/3; i=i/5; i=i*10; i=i-10; } } I am getting actual answer as $\log _3n$+ n/10 = O(n). Please explain briefly.

commented in Algorithms Jul 1, 2018

443 views

0 answers

13

Compiler design

commented in Compiler Design Jul 1, 2018

279 views

2 answers

14

BFS Traversal
How through a BFS we can find graph is connected or disconnected? Plz give some example and explain

commented in Algorithms Jul 1, 2018

894 views

0 answers

15

interview IIsc
Given a deck of 10 cards numbered 1 to 10. Select 3 cards one by one. Find the probability that selected cards is in increasing order. Eg : {1, 5, 7} or {8, 9, 10} etc

commented in Probability Jul 1, 2018

283 views

0 answers

16

Question Bank
Isn't x(xx)*=(xx)*x? If not why?

commented in Theory of Computation Jun 30, 2018

334 views

6 answers

17

TIFR CSE 2015 | Part B | Question: 8
Let $\sum_{1}= \left\{a\right\}$ be a one letter alphabet and $\sum_{2}= \left\{a, b\right\}$ be a two letter alphabet. A language over an alphabet is a set of finite length words comprising letters of the alphabet. Let $L_{1}$ and $L_{2}$ be the ... $L_{1}$ is countable but $L_{2}$ is not. $L_{2}$ is countable but $L_{1}$ is not. Neither of them is countable.

commented in Theory of Computation Jun 30, 2018

4.5k views

0 answers

18

Geeksforgeeks Array
Consider an array consisting of –ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign altogether i.e all +ve on one side and then all -ve on the other ? (A) N-1 (B) N (C) N+1 (D) (N*(N-1))/2

commented in Algorithms Jun 30, 2018

573 views

1 answer

19

Kenneth Rosen Edition 6th Exercise 7.1 Question 48 (Page No. 473)
Suppose that $R$ and $S$ are reflexive relations on a set A.Are the below statements true or false? (a) $R\, \cup \, S$ is reflexive (b)$R\, \cap \, S$ is reflexive (c)$R\, \oplus \, S$ is irreflexive (d)$R\, - \, S$ is irreflexive (e)$SoR$ is reflexive. My Answers are (a)-(e)-All true. Are my answers correct?

answered in Set Theory & Algebra Jun 30, 2018

1.6k views

1 answer

20

Kenneth Rosen Edition 6th Exercise 7.1 Question 44 (Page No. 473)
Let $S$ be a set with $n$ elements and let $a$ and $b$ be distinct elements of $S$. How many relations are there on $S$ such that (a) $(a,b) \in S$ (b) $(a,b) \not\in S$ (c) There are no ordered pairs in the relation that have "$a$" ... $2^{(n-1)^2}$ (f) $2^{n^2}-2^{(n-1)^2}$ Please let me know if my work is correct.

answered in Set Theory & Algebra Jun 30, 2018

2.0k views

2 answers

21

self doubt
i am getting 100+35+50=185 is it correct ???

commented in Set Theory & Algebra Jun 29, 2018

418 views

1 answer

22

UGC NET CSE | August 2016 | Part 2 | Question: 22
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is ${(i, j) | 1 \leq i \leq 12, 1 \leq j \leq 12}$. There is an edge between $(a, b)$ and $(c, d)$ if $|a – c| \leq 1$ or $| b – d | \leq 1$. The number of edges in this graph is $726$ $796$ $506$ $616$

commented in Graph Theory Jun 29, 2018

1.4k views

3 answers

23

GATE CSE 2001 | Question: 2.18
Consider the following three C functions: $[P1]$ int *g(void) { int x = 10; return (&x); } $[P2]$ int *g(void) { int *px; *px = 10; return px; } $[P3]$ int *g(void) { int *px; px = (int*) malloc (sizeof(int)); *px = 10; ... of the above three functions are likely to cause problems with pointers? Only $P3$ Only $P1$ and $P3$ Only $P1$ and $P2$ $P1, P2$ and $P3$

commented in Programming in C Jun 29, 2018

24.0k views

2 answers

24

Ace Test Series: Data Structures - Circular Linked List

commented in DS Jun 29, 2018

920 views

1 answer

25

Ace Test Series: Programming & DS - Array
According to me Option D. Because it should be an error because *("INDIA" + 2 ) = 'D' and we are doing 'D' = 'I' which is not valid so Error ??? But answer is C

commented in Programming in C Jun 29, 2018

599 views

4 answers

26

GATE CSE 2006 | Question: 57
Consider this C code to swap two integers and these five statements: the code void swap (int *px, int *py) { *px = *px - *py; *py = *px + *py; *px = *py - *px; } S1: will generate a compilation error S2: may generate a ... procedure correctly for some but not all valid input pointers S5: may add or subtract integers and pointers S1 S2 and S3 S2 and S4 S2 and S5

commented in Programming in C Jun 29, 2018

20.8k views

1 answer

27

GATE CSE
Consider language : L= {a3n+2 b2n +3 |n>=0} Is this language regular?

edited in Theory of Computation Jun 29, 2018

193 views

1 answer

28

Vertex connectivity
What is the vertex connectivity for a complete graph k4,k5,k6???

commented in Mathematical Logic Jun 27, 2018

1.8k views

3 answers

29

GATE CSE 1991 | Question: 1,vi
Consider the following PASCAL program segment: if i mod 2 = 0 then while i >= 0 do begin i := i div 2; if i mod 2 < > 0 then i := i - 1; else i := i – 2; end; An appropriate loop-invariant for the while-loop is ________

commented in Programming in C Jun 27, 2018

4.4k views

2 answers

30

DCFL or Not
$\left \{ a^{m+n}b^{m+n}c^{n}|m,n\geq 1 \right \}$ $\left \{ a^{m+n}b^{m+n}c^{k} |m,n,k\geq 1\right \}$ $\left \{ a^{m+n}b^{m+k}c^{n+k} |m,n,k\geq 1\right \}$ Which one DCFL, CFL or CSL?

comment edited in Theory of Computation Jun 25, 2018

1.6k views