Dark Mode

Answers by debasree88

0 votes

1

Made Easy
What will be subnet for all and also their DBA's???

answered in Computer Networks Apr 22, 2020

310 views

0 votes

2

Kenneth Rosen Edition 7 Exercise 2.5 Question 40 (Page No. 177)
Show that if $S$ is a set, then there does not exist an onto function $f$ from $S$ to $P(S),$ the power set of $S$. Conclude that $\mid S\mid < \mid P(S)\mid .$ This result is known as Cantor's theorem. [Hint: Suppose such a function ... $s$ can exist for which $f (s) = T.]$

answered in Set Theory & Algebra Apr 22, 2020

441 views

0 votes

3

relation
Number of relations $S$ over set $\{0,1,2,3 \}$ such that $(x,y) \in S \Rightarrow x = y$

answered in Set Theory & Algebra Apr 18, 2020

44.0k views

2 votes

4

NIELIT 2016 DEC Scientist B (CS) - Section B: 45
What will be the equation of the given K-map? $A’B’D’+C’D+AB’C’$ $B’CD’+AB’C’+A’C’$ $B’D’+C’D$ $C’D+B’CD’$

answered in Digital Logic Apr 15, 2020

503 views

3 votes

5

NIELIT 2016 DEC Scientist B (IT) - Section B: 33
How many inputs are required in Full Adder Circuit? $2$ $3$ More than two inputs None of the above

answered in Digital Logic Apr 15, 2020

702 views

0 votes

6

NIELIT 2016 MAR Scientist B - Section C: 3
The output of a sequential circuit depends on present inputs only past inputs only both present and past inputs present outputs only

answered in Digital Logic Apr 15, 2020

649 views

0 votes

7

Morris Mano Edition 3 Exercise 2 Question 18 (Page No. 71)
Show that the Dual of the Exclusive OR is equal to its complement.

answered in Digital Logic Apr 13, 2020

538 views

0 votes

8

Number of nodes of distinct degree
In a simple connected undirected graph with n nodes(where n≧2), The maximum number of nodes with distinct degrees is n-1 n-2 n-3 2

answered in Graph Theory Oct 31, 2019

2.5k views

2 votes

9

How it works. Please give some example.
Consider the following foo function and identify the return value of foo function. int foo (unsigned int n) { int c, x = 0; while (n! = 0) { if (n & 01) x++; n >>= 1; } return x; } (a) It counts the total number of bits ... counts the number of bits which are zero. (c) It counts the number of occurrences of 01. (d) It returns the same value as n'.

answered in Programming Aug 14, 2019

417 views

1 vote

10

answered in Programming Jul 25, 2019

273 views

0 votes

11

Self doubt
Consider a B+ tree in which the maximum number of keys in a Internal node is 5 and maximum number of keys in a leaf node is 4. What is the minimum number of keys in any non-root node?

answered in Databases Jul 25, 2019

622 views

2 votes

12

B+ Tree Records

answered in Databases Jul 25, 2019

1.6k views

0 votes

13

database indexing
Consider a disk with blocksize 1024B . A block pointer 6B and recird pointer 8B . The file has 10000 employee records . Every record is fixed length of 100B . Its key is SSN which is of 2B. the file is not ordered by thr keyfield and want to construct a ... the above file if we make it into multilevel index find out thr no of total blocks required A)102 B) 100 C)119 D) 118

answered in Databases Jul 24, 2019

211 views

2 votes

14

indexing
among primary index, secondary index, clustered index which index are dense or sparse or both?

answered in Databases Apr 28, 2019

631 views

0 votes

15

output of C program
int i = 0 ; main( ) { printf ( "\nmain's i = %d", i ) ; i++ ; val( ) ; printf ( "\nmain's i = %d", i ) ; val( ) ; } val( ) { i = 100 ; printf ( "\nval's i = %d", i ) ; i++ ; }

answered in Programming Apr 24, 2019

375 views

0 votes

16

Static Variable
Is it static declaration or static assignment? int main() { int x=20; static int y=x; if(x==y) printf("Equal"); else printf("Not Equal"); return 0; } What is output?and why?

answered in Programming Apr 21, 2019

893 views

0 votes

17

Database question : Transactions

answered in Databases Feb 24, 2019

1.1k views

0 votes

18

Transactions
T1 LOCK-X (A) LOCK-S (B) R(A) R(B) W(A) UNLOCK (A) COMMIT UNLOCK (B) is this following CONSERVATIVE 2PL ? doubt : in conservative locking schme ..all locks are aqured before starting but locks can be released at ANY time ..so conservative need not be strict/rigorous OR is it only after commit ??

answered in Databases Feb 23, 2019

955 views

1 vote

19

How to solve this question.
A schedule S contains three transactions $T_1$, $T_2$, $T_3$ and the oeprations sequence is given below: $T_1$: $Read$ $A$; $T_2$: $Write$ $A$; $T_3$: $Read$ $A$; $T_1$: $Write$ $A$; $T_3$: $Write$ $A$ and all ... above schedule is serializable or not? If yes it is equivalent to which serial schedule. Find the proper combination of the given alternatives from I to VII

answered in Databases Feb 23, 2019

1.1k views