Register
Filter

Answers by aik138463

2 votes
1
subnetting
is 255.255.255.52 a valid subnet mask? if yes then what is the no. of subnets?
is 255.255.255.52 a valid subnet mask? if yes then what is the no. of subnets?
0 votes
3
COAP 2017
How successful was COAP 2017?
How successful was COAP 2017?
0 votes
5
gate 2018
do anyone has complete exam paper ??? i am not able to get complete question paper of computer science gate paper............ please share a link although gate forum has uploaded the paper but it is not complete .............
do anyone has complete exam paper ???i am not able to get complete question paper of computer science gate paper............please share a linkalthough gate forum has upl...
0 votes
6
ace mock test
Is this solution wrong?
Is this solution wrong?
0 votes
9
theory of computtion
find regular expression of 1. S-> 01A/10B A->0B/1 B->1A/0 and 2. A->A00 /A1/0 3. S->baS/aA A->bbA/bb
find regular expression of1.S- 01A/10BA->0B/1B->1A/0and2.A->A00 /A1/0 3.S->baS/aAA->bbA/bb
0 votes
10
complexity
1 votes
12
Operator Precedence
E → E + E | E * E | ( E ) | id What will be operator precedence for above grammar.Is precedence differs due to ambiguity
E → E + E | E * E | ( E ) | idWhat will be operator precedence for above grammar.Is precedence differs due to ambiguity
0 votes
13
#time-complexity#daa
What will be time complexity for the following algo where n is a Prime number? main() { for(i=1; i<=n; i=2*i) for(j=1; j<=n; j++) { if(n%i == 0) while(k<=n) { a=b+c k=k+1 } } }
What will be time complexity for the following algo where n is a Prime number?main(){for(i=1; i<=n; i=2*i) for(j=1; j<=n; j++) { if(n%i == 0) while(k<=n...
0 votes
14
programming
for(i=n/2;i<=n;i++) how many times will this loop be executed..?
for(i=n/2;i<=n;i++) how many times will this loop be executed..?
3 votes
15
Ace Test Series: Databases - Functional Dependencies
Find what FD is violated by the Relation R = { } i.e. empty relation a. All FD b. Does not violate FD's c. Cannot say d. None of the Above
Find what FD is violated by the Relation R = { } i.e. empty relationa. All FDb. Does not violate FD'sc. Cannot sayd. None of the Above
1 votes
16
oop c++
Consider a pointer declaration int i=10,*p; p=&x; Is p – – ; a valid statement, justify? explain in as simple way as possible.
Consider a pointer declaration int i=10,*p; p=&x;Is p – – ; a valid statement, justify? explain in as simple way as possible.
0 votes
17
Madeeasy test series
The number of Binary Tree's with 4 nodes (1,2,3,4) where in every Binary Search tree '1' is leaf node are ________________.
The number of Binary Tree's with 4 nodes (1,2,3,4) where in every Binary Search tree '1' is leaf node are ________________.
1 votes
18
Ds-tree
Given numbers from 1 to 8. Number 5 is the root of BST.How many number of BST are possible with given constraint.
Given numbers from 1 to 8. Number 5 is the root of BST.How many number of BST are possible with given constraint.
0 votes
19
Semaphore
Is it's possible for two process to execute P(s) and V(s) operation at the same time on a semaphore variable 's' , means if one process executed p(s) and at the same time another process executed v(s) simultaneously on the same semaphore variable ??
Is it's possible for two process to execute P(s) and V(s) operation at the same time on a semaphore variable 's' , means if one process executed p(s) and at the same time...
1 votes
20
regular expression
write the regular expression for the given language L= { W | NO OF a mod 2= 1} (odd no of a's )
write the regular expression for the given language L= { W | NO OF a mod 2= 1} (odd no of a's )
0 votes
21
Non CS student requesting for tips!!
I am from non cs background and would like to prepare for gate cs so what subjects should be done first for a good foundation for advanced subjects?
I am from non cs background and would like to prepare for gate cs so what subjects should be done first for a good foundation for advanced subjects?
1 votes
23
Question Bank GATE
Find the Odd one Out: Candidate Key Super Key Primary Key Alternate Key
Find the Odd one Out: Candidate KeySuper KeyPrimary KeyAlternate Key
0 votes
24
GATE Admissions
What colleges i get through gate? GATE 2017...AIR-777...CSE...General Category
What colleges i get through gate?GATE 2017...AIR-777...CSE...General Category
0 votes
26
Asymptotic notations
Is $ (5 - n^3) \in \Omega (n^2) $ ?
Is $ (5 - n^3) \in \Omega (n^2) $ ?
0 votes
27
geeksforgeeks Computer NEtwork IP adressing
My answer is 255.255.255.224 but answer given there was A
My answer is 255.255.255.224 but answer given there was A
1 votes
29
made-easy
Consider the following productions along with their semantic rules Here ⋅ i and ⋅ s corresponds to inherited and synthesized attributes respectively. The value for expression 3 ∗ 4 __________.
Consider the following productions along with their semantic rulesHere ⋅ i and ⋅ s corresponds to inherited and synthesized attributes respectively. The value for exp...
Page: