Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
akash.dinkar12
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by akash.dinkar12
2
votes
121
#newgradiance #dbms #sql #joins Q5
Suppose relations R(A,B) and S(B,C,D) have the tuples shown below: R = A B 1 2 3 4 5 6 S = B C D 2 4 6 4 6 8 4 7 9 Compute the result of the join query: SELECT A, R.B, C, D FROM R, S WHERE R.B = S.B Then, identify which of the following tuples is in the result. a) (1,4,7,9) b) (5,6,4,6) c) (3,4,7,9) d) (3,4,2,6)
Suppose relations R(A,B) and S(B,C,D) have the tuples shown below:R =AB123456S =BCD246468479Compute the result of the join query:SELECT A, R.B, C, D FROM R, S WHERE R.B =...
1.2k
views
answered
May 5, 2017
Databases
newgradiance
databases
sql
joins
+
–
0
votes
122
Recursive languages.
If L1 is Recursive language and L2 is RE. Then L1 ⋂ L2 is RE? Since every Recursive language is RE, then how intersection of the Recursive and RE is RE?
If L1 is Recursive language and L2 is RE. Then L1 ⋂ L2 is RE? Since every Recursive language is RE, then how intersection of the Recursive and RE is RE?
2.0k
views
answered
May 3, 2017
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
123
operating system
Above solution GUARANTEES : Progress DOESNOT GUARANTEE : Mutual Exclusion,Bounded waiting,starvation Is this correct ???
Above solution GUARANTEES : ProgressDOESNOT GUARANTEE : Mutual Exclusion,Bounded waiting,starvationIs this correct ???
286
views
answered
May 2, 2017
Operating System
operating-system
+
–
0
votes
124
GATE 2000 Q 2.10
The simultaneous equations on the Boolean variables x, y, z and w, X+Y+Z=1 XY=0 XZ+W=1 have the following solution for x, y, z and w, respectively: (a) 0 1 0 0 (b) 1 1 0 1 (c) 1 0 1 1 (d) 1 0 0 0
The simultaneous equations on the Boolean variables x, y, z and w, X+Y+Z=1XY=0XZ+W=1have the following solution for x, y, z and w, respectively:(a) 0 1 0 0 (b) 1 1 0 1 (...
506
views
answered
Apr 25, 2017
3
votes
125
time complexity
T(n)=2.T((n)^(1/2)) + log ((n)^(1/2)) whats the time complexity?????????????????????????/
T(n)=2.T((n)^(1/2)) + log ((n)^(1/2))whats the time complexity?????????????????????????/
325
views
answered
Apr 24, 2017
Programming in C
time-complexity
+
–
2
votes
126
time complexity
Arrange in increasing order of rate of growth: 2n nlogn n(logn) n(3/2)
Arrange in increasing order of rate of growth:2nnlognn(logn)n(3/2)
3.0k
views
answered
Apr 24, 2017
Algorithms
time-complexity
+
–
3
votes
127
Coa-cache memory.
Cache size = 512KB ; Tag size = 7, Find out main memory size and tag directory. Given it is 8-way set associative .
Cache size = 512KB ; Tag size = 7, Find out main memory size and tag directory. Given it is 8-way set associative .
1.0k
views
answered
Apr 24, 2017
CO and Architecture
co-and-architecture
+
–
0
votes
128
order of precedence
Please tell why answer is (d)?
Please tell why answer is (d)?
2.5k
views
answered
Apr 24, 2017
1
votes
129
c question
#include <stdio.h> void reverse(int i); int main() { reverse(1); } void reverse(int i) { if (i > 5) return ; printf("%d ", i); return reverse((i++, i)); } I am not able to understand how to solve this "return reverse((i++, i));" statement.
#include <stdio.h>void reverse(int i);int main(){reverse(1);}void reverse(int i){if (i 5)return ;printf("%d ", i);return reverse((i++, i));}I am not able to understand h...
10.1k
views
answered
Apr 23, 2017
0
votes
130
databases
what is the difference between a "Block" and "Sector" in Hard disk ..??? Are they both same ???
what is the difference between a "Block" and "Sector" in Hard disk ..??? Are they both same ???
366
views
answered
Apr 23, 2017
Databases
databases
b-tree
co-and-architecture
operating-system
+
–
1
votes
131
C programming Question
#include <stdio.h> int main() { int a=10; while (a<20) { Printf("a value : %d",a); a++; } return0; } This program gives output as - a value: 10a value: 11a value: 12a value: 13a value: 14a value: 15a value: 16a value: 17a value: 18a value: 19 BUT HOW CAN I HAVE OUTPUT LIKE (each output in new line): a value:10 a value:11 . . a value:20
#include <stdio.h int main() { int a=10; while (a<20) { Printf("a value : %d",a); a++; } return0; }This program gives output as - a value: 10a value: 11a value: 12a val...
1.9k
views
answered
Apr 23, 2017
Programming in C
programming-in-c
output
+
–
3
votes
132
Find the output of C program
What will be the output of the program? #include<stdio.h> int addmult(int ii, int jj) { int kk, ll; kk = ii + jj; ll = ii * jj; return (kk, ll); } int main() { int i=3, j=4, k, l; k = addmult(i, j); l = addmult(i, j); printf("%d %d\n", k, l); return 0; }
What will be the output of the program?#include<stdio.h int addmult(int ii, int jj) { int kk, ll; kk = ii + jj; ll = ii * jj; return (kk, ll); } int main() { int i=3, j=4...
3.2k
views
answered
Apr 23, 2017
Programming in C
programming-in-c
functions
+
–
2
votes
133
normal forms
why there is need of normal forms in the context free grammer ????????????????? elaborate with example plz.
why there is need of normal forms in the context free grammer ????????????????? elaborate with example plz.
1.1k
views
answered
Apr 22, 2017
Theory of Computation
theory-of-computation
context-free-grammar
+
–
1
votes
134
C Programming
what will be the output of following program ? would this program compile properly ? #include <stdio.h> void swap(int **cc,int *dd) { int t=**cc; **cc=*dd; *dd=t; } void exchange(int *cc,int *dd) { swap(&cc,dd); } int main(void) { int c=10,d=20; printf("befor swap c=%d d=%d \n",c,d); exchange(&c,&d); printf("after swap c=%d d=%d \n",c,d); }
what will be the output of following program ?would this program compile properly ?#include <stdio.h>void swap(int cc,int *dd){int t= cc; cc=*dd; *dd=t;}void exc...
519
views
answered
Apr 22, 2017
Programming in C
programming-in-c
+
–
3
votes
135
What will be the output of following program?
#include<stdio.h> int main() { int i=10; printf("address of i=%d value of i=%d",&i,i); &i=7200; printf("address of i=%d value of i=%d",&i,i); return 0; }
#include<stdio.h>int main(){ int i=10; printf("address of i=%d value of i=%d",&i,i); &i=7200; printf("address of i=%d value of i=%d",&i,i); return 0;...
1.3k
views
answered
Apr 22, 2017
Programming in C
programming-in-c
output
+
–
7
votes
136
Push Down Automata
Which one is more powerful Deterministic push down automata or Non Deterministic push down automata ?
Which one is more powerful Deterministic push down automata or Non Deterministic push down automata ?
4.3k
views
answered
Apr 21, 2017
0
votes
137
Peter Linz, 3rd Ed, Chapter 1, Pg 15, Ques 19
if f(n) = O(n2) and g(n) = O(n3), then what is the complexity of f(n)*g(n) and f(n)/g(n) in big-o-notation?
if f(n) = O(n2) and g(n) = O(n3), thenwhat is the complexity of f(n)*g(n) and f(n)/g(n) in big-o-notation?
415
views
answered
Apr 21, 2017
Theory of Computation
theory-of-computation
asymptotic-notation
+
–
3
votes
138
C programming
int main() { int n = 3,i,count=0; for(i=0;i<1<<n;i++) { int p = i; while(p) { int k = p & -p; p = p - k; count++; } } } The value of count variable after execution of the above code? The value of count variable when $n = m$ ? [EDITED]
int main() { int n = 3,i,count=0; for(i=0;i<1<<n;i++) { int p = i; while(p) { int k = p & -p; p = p - k; count++; } } }The value of count variable after execution of the ...
685
views
answered
Apr 20, 2017
Programming in C
programming-in-c
bitwise
+
–
1
votes
139
ISI-JRF
A machine M has the following five pipeline stages; their respective time requirements in nanoseconds (ns) are given within parentheses: F-stage - instruction fetch (9 ns), D-stage - instruction decode and register fetch (3 ns), X-stage - execute/address ... , where every 3rd instruction needs a 1-cycle stall before the X-stage. Calculate the CPU time in seconds for completing P.
A machine M has the following five pipeline stages; their respective time requirements in nanoseconds (ns) are given within parentheses:F-stage — instruction fetch (9 n...
460
views
answered
Apr 20, 2017
CO and Architecture
co-and-architecture
pipelining
+
–
0
votes
140
Measurement of performance of computer system
Response time, elapsed time, access time all are consider same and equivalent ? Explanation.
Response time, elapsed time, access time all are consider same and equivalent ? Explanation.
1.1k
views
answered
Apr 20, 2017
CO and Architecture
co-and-architecture
+
–
1
votes
141
pointer
please tell how to solve it?
please tell how to solve it?
525
views
answered
Apr 20, 2017
3
votes
142
ISRO2014-78
Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm? Minimum CPU utilization Maximum throughput Minimum turnaround time Minimum waiting time
Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm?Minimum CPU utilizationMaximum throughputMinimum turnaround timeMinimu...
4.6k
views
answered
Apr 18, 2017
Operating System
isro2014
operating-system
process-scheduling
+
–
2
votes
143
ISRO2014-79
Consider the following Deterministic Finite Automaton $M$. Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of strings in $S$ that are accepted by $M$ is 0 1 2 3
Consider the following Deterministic Finite Automaton $M$.Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of str...
4.8k
views
answered
Apr 18, 2017
Theory of Computation
isro2014
theory-of-computation
finite-automata
+
–
6
votes
144
regular expression
1(01)* and (10)*1, are both regular expressions are equal? i think not, as 10 can be accepted by first regular expression, but it cannot be accepted by the second RE i.e (10)*1 in which strings always ends with 1. Is it correct? Please correct me if iam wrong. Thank You.
1(01)* and (10)*1, are both regular expressions are equal?i think not, as 10 can be accepted by first regular expression, but it cannot be accepted by the second RE i.e ...
1.7k
views
answered
Apr 18, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
3
votes
145
Concurrency Control
Consider the following schedules: S1: W2(x), W1(x), R3(x), R1(x), W2(y), R3(y), R3(z), R2(x) S2: R3(z), W2(x), W2(y), R1(x), R3(x), R2(z), R3(y), W1(x) S3: R2(z), W2(x), W2(y), W1(x), R1(x), R3(x), R3(z), R3(y) Which one of the above schedules are conflict equivalent?
Consider the following schedules:S1: W2(x), W1(x), R3(x), R1(x), W2(y), R3(y), R3(z), R2(x)S2: R3(z), W2(x), W2(y), R1(x), R3(x), R2(z), R3(y), W1(x)S3...
2.2k
views
answered
Apr 18, 2017
Databases
transaction-and-concurrency
concurrency
conflict-serializable
+
–
1
votes
146
Normalization
Is the following relation in 3NF or not ?
Is the following relation in 3NF or not ?
850
views
answered
Apr 17, 2017
Databases
databases
bad-question
+
–
0
votes
147
GATE CSE 2017 Set 2 | Question: GA-6
We lived in a culture that denied any merit to literary works, considering them important only when they were handmaidens to something seemingly more urgent - namely ideology. This was a country where all gestures, even the most private, were ... that ideology is not as important as literature is revealed by the word: culture' seemingly' urgent' political'
“We lived in a culture that denied any merit to literary works, considering them important only when they were handmaidens to something seemingly more urgent – namely...
6.7k
views
answered
Apr 17, 2017
Verbal Aptitude
gatecse-2017-set2
passage-reading
verbal-reasoning
+
–
5
votes
148
#theory of computation #DFA #NFA
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are: A NFA – 3, DFA – 4 B NFA – 3, DFA – 3 C NFA – 3, DFA – 3 D NFA – 4, DFA – 4
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are:ANFA – 3, DFA – 4BNFA – 3, DFA – 3...
4.1k
views
answered
Apr 17, 2017
Theory of Computation
theory-of-computation
number-of-dfa
finite-automata
+
–
1
votes
149
solve the recurrence using any method just solve it
T(n) = 100 T (n/99) + log(n!) Answer is T(n) = θ (n log n) a)answer is justified b)answer is not justified c)cannot be determined d)none
T(n) = 100 T (n/99) + log(n!) Answer is T(n) = θ (n log n)a)answer is justifiedb)answer is not justifiedc)cannot be determinedd)none
4.4k
views
answered
Apr 16, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
2
votes
150
Number of productions to derive a string of length x
3.0k
views
answered
Apr 16, 2017
Page:
« prev
1
2
3
4
5
6
7
8
9
10
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register