Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
kirti_k
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by kirti_k
0
answers
1
Rank of node: dependacy graph
please describe in detail I have no idea how to find rank of the node?
please describe in detail I have no idea how to find rank of the node?
345
views
commented
Jan 13, 2018
Compiler Design
compiler-design
+
–
1
answer
2
WBSET 2015
1.Suppose A=1/2,B=-1/2,C-7,D=3.1 then what is the value of (|_A_|-|-b-|+|_C_|*|-D-|)/C? A)3 B)4 C)5 D)0 link:-http://www.wbcsc.org.in/wbcsc/PDFQuestionPaper_2015/SET15-Computer%20Science%20And%20Applications-P%20II-A.pdf
1.Suppose A=1/2,B=-1/2,C-7,D=3.1 then what is the value of (|_A_|-|-b-|+|_C_|*|-D-|)/C? A)3 B)4 C)5 D)0 link:-http://www.wbcsc.org.in/wbcsc/PDFQuestionPaper_2015/SET15-Co...
288
views
answer edited
Nov 29, 2017
0
answers
3
Address Translation
Which one is TRUE? Give explaination 1)The main reason to have multilevel page to speed up address translation 2)The main reason to have hardware TLB to speed up address translation
Which one is TRUE? Give explaination1)The main reason to have multilevel page to speed up address translation2)The main reason to have hardware TLB to speed up address tr...
1.2k
views
commented
Nov 25, 2017
1
answer
4
Algorithms recurrence relation
Base condition T(n) = 1 Otherwise T(n) = T(n-1) +n Then After solving i got to this step ...how should i generalize now T(n) = T( n-k) + n-(k-1) + n-(k-2)+n
Base condition T(n) = 1Otherwise T(n) = T(n-1) +n Then After solving i got to this step ...how should i generalize nowT(n) = T( n-k) + n-(k-1) + n-(k-2)+n
304
views
commented
Nov 25, 2017
Algorithms
algorithms
recurrence-relation
+
–
0
answers
5
MadeEasy Subject Test: Algorithms - Time Complexity
https://gateoverflow.in/?qa=blob&qa_blobid=6856287731579574233 someone plz tell ??
https://gateoverflow.in/?qa=blob&qa_blobid=6856287731579574233someone plz tell ??
445
views
commented
Nov 23, 2017
Algorithms
made-easy-test-series
algorithms
time-complexity
+
–
1
answer
6
Test Series
Kindly explain this problem. Thank you in advance.
Kindly explain this problem. Thank you in advance.
323
views
answered
Nov 23, 2017
GATE
theory-of-computation
+
–
2
answers
7
self doubt
min no. of tables ? (participation of dependent is total)
min no. of tables ?(participation of dependent is total)
808
views
answered
Nov 23, 2017
Databases
er-diagram
+
–
2
answers
8
Binary Tree DS
How many distinct binary tree can be formed with three distinct keys? Please help me to find the correct answer?
How many distinct binary tree can be formed with three distinct keys?Please help me to find the correct answer?
845
views
answered
Nov 23, 2017
Programming in C
binary-tree
data-structures
+
–
1
answer
9
Whether the following languages are same or not
Whether the following two are same or not a*b* and ambn {where m >=0 and n>=0 }
Whether the following two are same or not a*b* and ambn {where m >=0 and n>=0 }
237
views
answered
Nov 23, 2017
Theory of Computation
regular-expression
+
–
1
answer
10
google
main() { int a; scanf("%i"&a); printf("%i %d",a,a); scanf("%d",&a); printf("%i %d",a,a); } suppose user entered 0101 as input .what is printed by above program?
main(){int a;scanf("%i"&a);printf("%i %d",a,a);scanf("%d",&a);printf("%i %d",a,a);}suppose user entered 0101 as input .what is printed by above program?
734
views
commented
Nov 22, 2017
Programming in C
programming-in-c
non-gate
+
–
1
answer
11
Time complexity for below Code
i = n; While(i > 0) { i= i/2; }
i = n;While(i 0){ i= i/2;}
268
views
answered
Nov 22, 2017
Algorithms
time-complexity
algorithms
+
–
1
answer
12
Time Complexity of the following code
for i <--- 1 to n for j <---- 1 to n/2 X = X + 1 (i and j both are incrementing by 1) Outer runs for n times and inner for n/2 So will it be n(n/2) => O(n^2) times...
for i < - 1 to n for j < 1 to n/2 X = X + 1(i and j both are incrementing by 1)Outer runs for n times and inner for n/2 So will it be n(n...
958
views
commented
Nov 22, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
1
answer
13
google
main() { int a; scanf("%i"&a); printf("%i %d",a,a); scanf("%d",&a); printf("%i %d",a,a); } suppose user entered 0x56 as input .what is printed by above program?
main(){int a;scanf("%i"&a);printf("%i %d",a,a);scanf("%d",&a);printf("%i %d",a,a);}suppose user entered 0x56 as input .what is printed by above program?
317
views
answered
Nov 22, 2017
Programming in C
programming-in-c
non-gate
+
–
1
answer
14
pointers
char a[]="gateoverflow"; char *p="gateoverflow"; Why even though both are same way if representing string .By second way we cannot change the value???
char a[]="gateoverflow";char *p="gateoverflow";Why even though both are same way if representing string .By second way we cannot change the value???
300
views
comment edited
Nov 22, 2017
5
answers
15
Compiler desigb
consider the following grammar $E\rightarrow int|int+E|int-E |int-(E) |int*E$ Which statement is true? a) Grammer is left factored b) Cant be determined
consider the following grammar$E\rightarrow int|int+E|int-E |int-(E) |int*E$Which statement is true?a) Grammer is left factoredb) Cant be determined
869
views
answered
Nov 22, 2017
Compiler Design
compiler-design
grammar
left-recursion
+
–
1
answer
16
Tree Traversal doubt
Please tell me - 1) What is top down evaluation of Parse tree? 2) What is Bottom Up evaluation of Parse Tree 3) What is Depth First left to right evaluation of Parse tree? Is 1 and 3 are equal? Please make a small tree and show how to traverse Top down and Bottom up? Also, Explain how Top down and Bottom up Parser work is it same as Tree evaluation?
Please tell me - 1) What is top down evaluation of Parse tree?2) What is Bottom Up evaluation of Parse Tree3) What is Depth First left to right evaluation of Parse tree?I...
539
views
answered
Nov 22, 2017
Compiler Design
binary-tree
compiler-design
lr-parser
+
–
0
answers
17
Recursion
T(n) =$\log$n + T($\sqrt{n}$) How to solve this?
T(n) =$\log$n + T($\sqrt{n}$)How to solve this?
219
views
asked
Nov 21, 2017
Programming in C
recurrence-relation
+
–
2
answers
18
[TOC] Basic doubt in DPDA
Following is the PDA that accept equal number of a and b. How can this be converted to DPDA? When stack top is Z,that it can read epsillon or a or b,which can create choice.So how can i remove choice in this and make it deterministic?
Following is the PDA that accept equal number of a and b.How can this be converted to DPDA? When stack top is Z,that it can read epsillon or a or b,which can create choic...
2.3k
views
answered
Nov 21, 2017
Theory of Computation
theory-of-computation
pushdown-automata
context-free-language
deterministic-context-free-grammars
+
–
2
answers
19
Circular single linked list conceptual
Please explain how to approach this problem?
Please explain how to approach this problem?
507
views
answered
Nov 20, 2017
Mathematical Logic
linked-list
+
–
2
answers
20
ACE test series
PLEASE anyone can explain the states step wise Ans is given D
PLEASE anyone can explain the states step wise Ans is given D
382
views
answered
Nov 19, 2017
Compiler Design
compiler-design
context-free-grammar
lr-parser
ace-test-series
+
–
1
answer
21
Test by Bikram | Programming | Test 2 | Question: 11
Which of the following will print the value $2$ for this code snippet? #include<stdio.h> int main() { int arr[10][20][30] = {0}; arr[5][2][1] = 2; __________ // missing line here return 0; } The missing line above is: printf("%d",*(( ... 5)+2)+1); printf("%d",*(*(*(arr+5)+2)+1)); printf("%d", *(*((arr+5)+2)+1);
Which of the following will print the value $2$ for this code snippet?#include<stdio.h int main() { int arr[10][20][30] = {0}; arr[5] = 2; __________ // missing line he...
197
views
answered
Nov 19, 2017
Programming in C
tbb-programming-2
+
–
4
answers
22
Test by Bikram | Programming | Test 2 | Question: 13
What is the output of the code? #include <stdio.h > int main() { int a; printf("%d",scanf("%d",&a)); return 0; } $10$ $9$ $-1$ An undefined behavior
What is the output of the code? #include <stdio.h int main() { int a; printf("%d",scanf("%d",&a)); return 0; }$10$$9$$-1$An undefined behavior
876
views
commented
Nov 19, 2017
Programming in C
tbb-programming-2
+
–
2
answers
23
Space complexity
Worst case and best case space complexity of merge sort is ___________________________
Worst case and best case space complexity of merge sort is ___________________________
603
views
commented
Nov 11, 2017
Algorithms
algorithms
space-complexity
+
–
3
answers
24
Problem on TOH
We solve TOH problem recursively breaking the task in three sections, which of the following recurrence will accord well with the approach , that is shows correct order of work done on each recursive step A) T(n)=T(n-1)+1+T(n-1) B) T(n)=T(n-1)+T(n-1)+1 C) T(n)=1+T(n-1)+T(n-1) D) T(n)=T(n-1)+T(n-1)+2
We solve TOH problem recursively breaking the task in three sections, which of the following recurrence will accord well with the approach , that is shows correct order o...
735
views
answered
Nov 11, 2017
DS
data-structures
stack
recurrence-relation
+
–
3
answers
25
Test by Bikram | Data Structures | Test 2 | Question: 1
A $2$-dimentional array is declared as $A[-8 \text{ to } 12, \ -4 \text{ to } 16]$ , what will be the address of $A[1,3]$ if it is stored in row major order , each element occupies $4$ bytes and starting address of array is $2000$. $2784$ $2776$ $2794$ $2764$
A $2$-dimentional array is declared as $A[-8 \text{ to } 12, \ -4 \text{ to } 16]$ , what will be the address of $A[1,3]$ if it is stored in row major order , each eleme...
597
views
answered
Nov 9, 2017
Programming in C
tbb-ds-2
+
–
1
answer
26
Memory Management
What is the difference between Physical Address, Virtual Address and Absolute Address?
What is the difference between Physical Address, Virtual Address and Absolute Address?
559
views
answered
Aug 9, 2017
Operating System
memory-management
operating-system
virtual-memory
+
–
4
answers
27
Basic 3NF doubt .
Suppose we have a relation R(ABCD) where AB is candidate key. Now if there is a FD B -> AD, then will this FD satisfy the condition of 3NF ? I mean condition of X->Y where X is super key or Y is prime attribute as here only A is prime attribute ... FD as B->A and B->D and here B->A satisfies the condition and B->D doesn't Any help would be appreciated.
Suppose we have a relation R(ABCD) where AB is candidate key.Now if there is a FD B - AD, then will this FD satisfy the condition of 3NF ? I mean condition of X->Y where...
1.9k
views
answered
Aug 9, 2017
Databases
database-normalization
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register