Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
debasree88
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by debasree88
0
votes
1
Made Easy
What will be subnet for all and also their DBA's???
What will be subnet for all and also their DBA's???
532
views
answered
Apr 22, 2020
Computer Networks
made-easy-test-series
computer-networks
subnetting
bad-question
+
–
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.]$
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 res...
625
views
answered
Apr 22, 2020
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
descriptive
+
–
0
votes
3
relation
Number of relations $S$ over set $\{0,1,2,3 \}$ such that $(x,y) \in S \Rightarrow x = y$
Number of relations $S$ over set $\{0,1,2,3 \}$ such that $(x,y) \in S \Rightarrow x = y$
44.5k
views
answered
Apr 18, 2020
Set Theory & Algebra
set-theory&algebra
relations
+
–
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’$
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’$
798
views
answered
Apr 15, 2020
Digital Logic
nielit2016dec-scientistb-cs
digital-logic
k-map
minimization
+
–
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
How many inputs are required in Full Adder Circuit?$2$$3$More than two inputsNone of the above
1.1k
views
answered
Apr 15, 2020
Digital Logic
nielit2016dec-scientistb-it
digital-logic
combinational-circuit
adder
+
–
1
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
The output of a sequential circuit depends on present inputs onlypast inputs onlyboth present and past inputspresent outputs only
1.0k
views
answered
Apr 15, 2020
Digital Logic
nielit2016mar-scientistb
digital-logic
sequential-circuit
+
–
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.
Show that the Dual of the Exclusive OR is equal to its complement.
752
views
answered
Apr 13, 2020
Digital Logic
digital-logic
morris-mano
boolean-algebra
+
–
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
In a simple connected undirected graph with n nodes(where n≧2), The maximum number of nodes with distinct degrees is n-1n-2n-32
2.9k
views
answered
Oct 31, 2019
Graph Theory
graph-theory
graph-connectivity
+
–
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'.
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) ...
621
views
answered
Aug 14, 2019
1
votes
10
C PROGRAM
345
views
answered
Jul 25, 2019
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?
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 n...
896
views
answered
Jul 25, 2019
Databases
databases
b-tree
+
–
2
votes
12
B+ Tree Records
2.0k
views
answered
Jul 25, 2019
Databases
databases
b-tree
bplustrees
+
–
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
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 ...
348
views
answered
Jul 24, 2019
2
votes
14
indexing
among primary index, secondary index, clustered index which index are dense or sparse or both?
among primary index, secondary index, clustered index which index are dense or sparse or both?
814
views
answered
Apr 27, 2019
Databases
indexing
databases
+
–
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++ ; }
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++ ;}
493
views
answered
Apr 23, 2019
Programming in C
programming-in-c
output
programming
+
–
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?
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...
1.3k
views
answered
Apr 21, 2019
Programming in C
programming-in-c
+
–
0
votes
17
Database question : Transactions
1.4k
views
answered
Feb 24, 2019
Databases
databases
transaction-and-concurrency
conflict-serializable
serializability
+
–
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 ??
T1LOCK-X (A)LOCK-S (B)R(A)R(B)W(A)UNLOCK (A)COMMITUNLOCK (B)is this following CONSERVATIVE 2PL ? doubt : in conservative locking schme ..all locks are aqured before start...
1.3k
views
answered
Feb 23, 2019
Databases
transaction-and-concurrency
+
–
1
votes
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
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$: $...
1.3k
views
answered
Feb 23, 2019
Databases
databases
serializability
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register