Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
hacker16
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by hacker16
0
votes
0
answers
1
Trigger
what is the correct answer?
what is the correct answer?
393
views
asked
Jun 15, 2018
Databases
trigger
databases
+
–
0
votes
0
answers
2
Admission Query COAP
did COAP portal is only the m.tech acceptance portal or it is for both M.tech as well as M.S? *although i have got offer letter from iitk (ms), but still coap is showing no offer at all.
did COAP portal is only the m.tech acceptance portal or it is for both M.tech as well as M.S?*although i have got offer letter from iitk (ms), but still coap is showing n...
906
views
asked
May 25, 2018
IISc/IITs
iit-kanpur
gate2018-admissions
admissions
+
–
0
votes
1
answer
3
Time Complexity
int lcs_length(char * A, char * B) { if (*A == '\0' || *B == '\0') return 0; else if (*A == *B) return 1 + lcs_length(A+1, B+1); else return max(lcs_length(A+1,B), lcs_length(A,B+1)); } what is worst case time complexity of $\text{lcs_length}$ if size of $A$ is $m$ and size of $B$ is $n$? O($2^{m+n}$) O($2^{n}$) O($2^{mn}$) O($2^{max(m,n)}$) none of these
int lcs_length(char * A, char * B) { if (*A == '\0' || *B == '\0') return 0; else if (*A == *B) return 1 + lcs_length(A+1, B+1); else return max(lcs_length(A+1,B), lcs_le...
397
views
asked
Apr 28, 2018
Algorithms
time-complexity
recursion
algorithms
+
–
0
votes
0
answers
4
Recursion Tree
What is the max height of recursion tree of recurrence $c(100,50)$? here, the recursive function is defined as $c(n,k) = c(n-1,k-1) + c(n,k-1)$ terminating condition $c(n,n) = 1, c(n,0) = 1$.
What is the max height of recursion tree of recurrence $c(100,50)$?here, the recursive function is defined as$c(n,k) = c(n-1,k-1) + c(n,k-1)$terminating condition$c(n,n) ...
465
views
asked
Apr 28, 2018
Algorithms
algorithms
recursion
dynamic-programming
+
–
3
votes
1
answer
5
No of Schedules
Given, Transaction T1 has n operation Transaction T2 has m operation Prove that, the total number of schedules possible is $\frac{(m+n)!}{m!n!}$
Given, Transaction T1 has n operation Transaction T2 has m operationProve that, the total...
660
views
asked
Apr 13, 2018
Databases
transaction-and-concurrency
databases
+
–
0
votes
1
answer
6
Minus Operation
State true or false? {1,2} - {1,2,3} = ɸ
State true or false?{1,2} - {1,2,3} = ɸ
368
views
asked
Apr 12, 2018
2
votes
3
answers
7
BARC 2018
$\textbf{VPN}$ Works at which layer? Application layer Transport layer Network layer Data-link layer
$\textbf{VPN}$ Works at which layer?Application layerTransport layerNetwork layerData-link layer
1.3k
views
asked
Apr 5, 2018
Computer Networks
computer-networks
network-security
barc2018
+
–
0
votes
1
answer
8
Passing array as function argument
#include<stdio.h> void temp(int a[]); main(){ int a[5]={1,2,3,4,5}; printf("%d", sizeof(a)); temp(a); } void temp(int a[]){ printf(" %d", sizeof(a)); } Output of above code is, given size of int is 4 byte $20$ $20$ $20$ $8$ $8$ $8$ $8$ $20$
#include<stdio.h void temp(int a[]); main(){ int a[5]={1,2,3,4,5}; printf("%d", sizeof(a)); temp(a); } void temp(int a[]){ printf(" %d", sizeof(a)); }Output of above code...
502
views
asked
Apr 5, 2018
Programming in C
programming-in-c
+
–
1
votes
2
answers
9
OSI - Layer
Encode / Decode data for physical transmission is done by which layer of OSI reference model?
Encode / Decode data for physical transmission is done by which layer of OSI reference model?
3.5k
views
asked
Mar 24, 2018
Computer Networks
osi-model
computer-networks
+
–
1
votes
1
answer
10
ISRO Syllabus - Software Engineering
Where to study Software Engineering for ISRO Exam?
Where to study Software Engineering for ISRO Exam?
1.7k
views
asked
Feb 18, 2018
ISRO
is&software-engineering
isro-preparation
+
–
0
votes
0
answers
11
B-tree
B tree has minimum space utilization equals to 66.6%. explain?
B tree has minimum space utilization equals to 66.6%.explain?
353
views
asked
Jan 30, 2018
Databases
databases
b-tree
indexing
+
–
2
votes
3
answers
12
self doubt RSA Algorithm
How To Solve..? 17 * d = 1 mod 3120. should we need to apply bruteforce?
How To Solve..? 17 * d = 1 mod 3120.should we need to apply bruteforce?
2.9k
views
asked
Jan 29, 2018
Computer Networks
rsa-security-networks
+
–
3
votes
1
answer
13
Permutation and combination
in how many ways 2 alike apple, 3 alike orange and 4 alike mango can be given to 3 children if each child can have none or 1 or more than 1 fruits.
in how many ways 2 alike apple, 3 alike orange and 4 alike mango can be given to 3 children if each child can have none or 1 or more than 1 fruits.
825
views
asked
Jan 22, 2018
Combinatory
combinatory
engineering-mathematics
+
–
2
votes
1
answer
14
Permutation and Combination
How many words can be formed using the word "ARYASTARK" ?
How many words can be formed using the word "ARYASTARK" ?
681
views
asked
Jan 22, 2018
Combinatory
combinatory
engineering-mathematics
+
–
4
votes
2
answers
15
Permutation and Combination
A train has 12 stations on it's route and it has to stopped at any 4 station, such that no two stations are consecutive. find number of possible way for choosing 4 station's?
A train has 12 stations on it's route and it has to stopped at any 4 station, such that no two stations are consecutive.find number of possible way for choosing 4 station...
2.1k
views
asked
Jan 22, 2018
Combinatory
combinatory
engineering-mathematics
+
–
1
votes
0
answers
16
Combinatorics
If 100! = (2n ) * K, where K is odd number, find n ?
If 100! = (2n ) * K, where K is odd number, find n ?
269
views
asked
Jan 22, 2018
Combinatory
combinatory
+
–
2
votes
2
answers
17
Combinatoric
Find number of zero's at the end of (2018)! ?
Find number of zero's at the end of (2018)! ?
417
views
asked
Jan 22, 2018
Combinatory
combinatory
+
–
1
votes
1
answer
18
Function Call
which function will going to be call first? x = f1() + f2() is it compiler dependent ?
which function will going to be call first?x = f1() + f2()is it compiler dependent ?
268
views
asked
Jan 21, 2018
Programming in C
programming-in-c
non-gate
+
–
2
votes
1
answer
19
Asymptotic Notation
Given h(n) < f(n) < g(n). statement 1: h(n)=O(f(n)); g(n)=Ω(f(n)) Statement 1 is True / False?
Given h(n) < f(n) < g(n).statement 1: h(n)=O(f(n)); g(n)=Ω(f(n))Statement 1 is True / False?
871
views
asked
Jan 21, 2018
Algorithms
asymptotic-notation
algorithms
time-complexity
growth-rate
+
–
5
votes
1
answer
20
Ternary Tree Traversal
Someone Please Explain this https://gateoverflow.in/2046/gate2014-3-12
Someone Please Explain thishttps://gateoverflow.in/2046/gate2014-3-12
2.3k
views
asked
Jan 20, 2018
DS
data-structures
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register