Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by ushamya
2
answers
1
ISRO2013-ECE 2s compliment number
The two numbers represented in signed $\text{2s}$ complement form are $\text{P}= 11101101$ and $\text{Q}= 11100110.$ If $\text{Q}$ is subtracted from $\text{P},$ the value obtained in signed $\text{2s}$ complement form is: $1000001111$ $00000111$ $11111001$ $111111001$
The two numbers represented in signed $\text{2s}$ complement form are $\text{P}= 11101101$ and $\text{Q}= 11100110.$ If $\text{Q}$ is subtracted from $\text{P},$ the valu...
9.1k
views
answer edited
Aug 7, 2019
Digital Logic
isro-ece
isro2013-ece
digital-logic
number-representation
+
–
1
answer
2
ACE Test series: Database
972
views
asked
Jun 7, 2019
Databases
transaction-and-concurrency
ace-test-series
databases
+
–
1
answer
3
Virtual Gate Test Series: Databases - ER to Relational Model
how many tables are required?
how many tables are required?
1.4k
views
commented
Jun 5, 2019
Databases
databases
er-to-relational
virtual-gate-test-series
+
–
3
answers
4
ACE Test Series : dependency preserving
R(A,B,C) is a relation.Which of the following don't have dependency preserving BCNF decomposition? A->B, B->C A->B,B->C,C->A AB->C,C->A None of these
R(A,B,C) is a relation.Which of the following don't have dependency preserving BCNF decomposition?A->B, B->CA->B,B->C,C->AAB->C,C->ANone of these
921
views
asked
Jun 3, 2019
Databases
ace-test-series
databases
dependency-preserving
bcnf-decomposition
+
–
4
answers
5
Doubt on database normalization for relation having all prime attributes
In a relation, if every attribute is prime but key may not be simple then the relation is in ______. A. 1NF B. 2NF C. 3NF D. BCNF
In a relation, if every attribute is prime but key may not be simple then the relation is in ______.A. 1NFB. 2NFC. 3NFD. BCNF
2.4k
views
commented
May 27, 2019
Databases
databases
database-normalization
rdbms
+
–
2
answers
6
MadeEasy Test Series 2018: Databases - Indexing
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for database file are ______.
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for...
1.3k
views
commented
May 27, 2019
Databases
databases
indexing
made-easy-test-series
+
–
1
answer
7
MADE EASY Relational Algebra
In a relational algebra ∩ is not a basic operator, to make it basic only relational operator we should have are X, – X, U U, –
In a relational algebra ∩ is not a basic operator, to make it basic only relational operator we should have areX, – X, UU, –
2.1k
views
answered
May 26, 2019
Databases
databases
relational-algebra
+
–
1
answer
8
Geeksforgeeks: GATE CS Mock 2018
Consider the given schedule and choose the suitable option S = T1:R(x), T1:R(y), T1:W(x), T2:R(y), T3:W(y), T1:W(x), T2:R(y) Schedule is view serializable Schedule is conflict serializable but not view serializable Schedule is view serializable but not conflict serializable Neither view serializable nor conflict serializable
Consider the given schedule and choose the suitable option S = T1:R(x), T1:R(y), T1:W(x), T2:R(y), T3:W(y), T1:W(x), T2:R(y)Schedule is view serializableSchedule is confl...
8.1k
views
commented
May 24, 2019
Databases
view-serializable
conflict-serializable
+
–
1
answer
9
MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest ...
1.1k
views
commented
May 19, 2019
Databases
databases
indexing
made-easy-test-series
+
–
2
answers
10
Made Easy Test Series:Database-Indexing
The minimum number of nodes (both leaf and non-leaf) of $B^{+}$ tree index required for storing $5500$ keys and order of $B^{+}$ tree is $8$________________(order is max pointers a node can have) See here first level should be divide by $7$ ... pointer of 1st level has $8$ pointer in 2nd level. Am I missing something?? But in ans they divided by only $8$ :(
The minimum number of nodes (both leaf and non-leaf) of $B^{+}$ tree index required for storing $5500$ keys and order of $B^{+}$ tree is $8$________________(order is max ...
1.5k
views
answered
May 18, 2019
Databases
databases
made-easy-test-series
indexing
+
–
1
answer
11
Made Easy Test Series:Databases-Indexing
Consider the following statement below: $A)$ A clustered index may be either sparse or dense. $B)$ Every $B^{+}$ tree index is dense. Which of the above statement is true? Is clustering Index can be dense. Dense means non-ordering field, but clustering field should be ordering field right??
Consider the following statement below:$A)$ A clustered index may be either sparse or dense.$B)$ Every $B^{+}$ tree index is dense.Which of the above statement is true?Is...
1.8k
views
commented
May 18, 2019
Databases
databases
indexing
made-easy-test-series
+
–
1
answer
12
Made Easy Test Series:Database-Super-Keys
Consider the relation $R\left ( A,B,C,D,E \right )$ $A\rightarrow BC$ $C\rightarrow E$ $B\rightarrow D$ $E\rightarrow A$ Total number of superkeys present in relation will be ____________________
Consider the relation $R\left ( A,B,C,D,E \right )$$A\rightarrow BC$$C\rightarrow E$$B\rightarrow D$$E\rightarrow A$Total number of superkeys present in relation will be ...
1.8k
views
commented
May 15, 2019
Databases
databases
superkeys
made-easy-test-series
+
–
2
answers
13
dbms normalization - 2nf/bcnf query
Consider the following relational schemes: R(A, B, C, D, E, F) and S(A, B, C) with in the following functional dependencies: I. AB --> C II. C --> ABDE III. ADE --> F Assume {A,B} is the key for both schemes. Which of the ... C is the relation for the S table, which satisfies BCNF properties. (So S is in BCNF) Please let me know if it is correct or not.
Consider the following relational schemes: R(A, B, C, D, E, F) and S(A, B, C) with in the following functional dependencies:I. AB CII. C ABDEIII. ADE FAssume {A,B} ...
1.1k
views
commented
May 14, 2019
Databases
database-normalization
databases
+
–
5
answers
14
Made Easy Test Series:DBMS-Functional Dependency
Consider a relation $R\left ( A,B,C,D,E \right )$ and functional dependencies are $F=\left \{ AC\rightarrow B,C\rightarrow D,A\rightarrow E,C\rightarrow B \right \}$ Relation $R$ ... Then Is it a lossless decomposition? I am getting doubt, how it can be not lossless decomposition?
Consider a relation $R\left ( A,B,C,D,E \right )$ and functional dependencies are $F=\left \{ AC\rightarrow B,C\rightarrow D,A\rightarrow E,C\rightarrow B \right \}$Relat...
1.5k
views
answered
May 14, 2019
Databases
database-normalization
databases
lossless-decomposition
+
–
5
answers
15
GATE CSE 2012 | Question: 3
What will be the output of the following C program segment? char inChar = 'A'; switch ( inChar ) { case 'A' : printf ("Choice A \ n"); case 'B' : case 'C' : printf ("Choice B"); case ... : printf ("No Choice"); } No Choice Choice A Choice A Choice B No Choice Program gives no output as it is erroneous
What will be the output of the following C program segment?char inChar = 'A'; switch ( inChar ) { case 'A' : printf ("Choice A \ n"); case 'B' : case 'C' : printf ("Choic...
10.9k
views
answered
Oct 24, 2018
Programming in C
gatecse-2012
programming
easy
programming-in-c
switch-case
+
–
11
answers
16
GATE CSE 2017 Set 2 | Question: 14
Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); } The output of invoking $printxy(1,1)$ is: $0, 0$ $0, 1$ $1, 0$ $1, 1$
Consider the following function implemented in C:void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); }The output of invoking $...
9.7k
views
answered
Sep 4, 2018
Programming in C
gatecse-2017-set2
programming-in-c
identify-function
pointers
+
–
5
answers
17
GATE CSE 2017 Set 1 | Question: 55
The output of executing the following C program is _______________ . #include<stdio.h> int total(int v) { static int count = 0; while(v) { count += v&1; v >>= 1; } return count; } void main() { static int x=0; int i=5; for(; i>0; i--) { x = x + total(i); } printf("%d\n", x); }
The output of executing the following C program is _______________ .#include<stdio.h int total(int v) { static int count = 0; while(v) { count += v&1; v >>= 1; } return c...
22.4k
views
answered
Sep 4, 2018
Programming in C
gatecse-2017-set1
programming
programming-in-c
normal
numerical-answers
+
–
1
answer
18
Control Statements
What will be the output of the below C program? #include <stdio.h> int xyz(int b) { return (b--); } int main() { int a = xyz(12); printf("%d", ++a); return 0; } (a)10 (b)11 (c)12 (d)13
What will be the output of the below C program?#include <stdio.h int xyz(int b) { return (b ); } int main() { int a = xyz(12); printf("%d", ++a); return 0; }(a)10 (b)11 (...
383
views
asked
Aug 31, 2018
Programming in C
programming-in-c
+
–
3
answers
19
UGC NET CSE | January 2017 | Part 2 | Question: 12
Which one of the following is correct for overloaded functions in $C++$? Compiler sets up a separate function for every definition of function. Compiler does not set up a separate function for every definition of function. Overloaded functions cannot handle different types of objects. Overloaded functions cannot have same number of arguments.
Which one of the following is correct for overloaded functions in $C++$?Compiler sets up a separate function for every definition of function.Compiler does not set up a s...
1.8k
views
answered
Aug 29, 2018
Object Oriented Programming
ugcnetjan2017ii
object-oriented-programming
functions
+
–
2
answers
20
C Programming
#include <stdio.h> int main() { int a=9; printf("%d %d %d",++a,a++,++a); return 0; } what is the output? According to me it should be 12 10 10
#include <stdio.h>int main(){ int a=9; printf("%d %d %d",++a,a++,++a); return 0;}what is the output?According to me it should be 12 10 10
633
views
answered
Aug 29, 2018
11
answers
21
GATE CSE 2016 Set 1 | Question: 35
What will be the output of the following $C$ program? void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } void main(){ count (3); } $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4 \ 4 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2 \ 2 \ 2$ $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2$
What will be the output of the following $C$ program?void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } ...
15.5k
views
answered
Aug 29, 2018
Programming in C
gatecse-2016-set1
programming-in-c
recursion
normal
+
–
1
answer
22
Conditional Expression
What is the output of given program? #include<stdio.h> int main() { int x; x = 4 > 8 ? 5!= 1<5 == 0 ? 1:2:3; printf("%d",x); return 0; } option a. 1 b.2 c.3 d.compilation error
What is the output of given program?#include<stdio.h>int main(){ int x; x = 4 8 ? 5!= 1<5 == 0 ? 1:2:3; printf("%d",x); return 0;}option a. 1 b.2 c.3 d.compi...
1.2k
views
answered
Aug 29, 2018
5
answers
23
GATE CSE 2004 | Question: 2,ISRO2017-54
Consider the following function void swap(int a, int b) { int temp; temp = a; a = b; b = temp; } In order to exchange the values of two variables $x$ and $y$. call $swap(x, y)$ call $swap(\&x, \&y)$ $swap (x, y)$ cannot be used as it does not return any value $swap (x, y)$ cannot be used as the parameters are passed by value
Consider the following functionvoid swap(int a, int b) { int temp; temp = a; a = b; b = temp; }In order to exchange the values of two variables $x$ and $y$.call $swap(x, ...
14.7k
views
answered
Aug 29, 2018
Compiler Design
gatecse-2004
compiler-design
programming-in-c
parameter-passing
easy
isro2017
runtime-environment
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register