Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
syncronizing
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by syncronizing
1
votes
0
answers
1
Time complexity
Is this the correct way to solve ? Q) int algorithm(int n) { int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorithm(n/2)+algorithm(n/2)*algorithm(n/2) }
Is this the correct way to solve ?Q) int algorithm(int n){ int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorit...
1.3k
views
asked
Mar 15, 2019
Algorithms
time-complexity
algorithms
recurrence-relation
+
–
0
votes
0
answers
2
next larger double precision number is 2P
The difference between 201 and next larger double precision number is 2P , if IEEE double precision format is used then the value of P is ________. what is next larger precision number here ?
The difference between 201 and next larger double precisionnumber is 2P, if IEEE double precision format is used then thevalue of P is ________.what is next larger precis...
497
views
asked
Feb 28, 2019
Digital Logic
digital-logic
floating-point-representation
made-easy-test-series
+
–
1
votes
1
answer
3
Identify the function f3
The given logic circuit is realizing the boolean function and function Identify the function f3(A,B,C,D) Answer given is
The given logic circuit is realizing the boolean function and function Identify the function f3(A,B,C,D)Answer given is
1.1k
views
asked
Feb 28, 2019
Digital Logic
digital-logic
+
–
0
votes
0
answers
4
MadeEasy TestSeries-2019
In the given Synchronous counter circuit, initially, all the flip-flop outputs are ‘0’. it is required to replace FF2 with A-B Flip-Flop. The A-B flip-flop excitation table is given below. the FF2 inputs are? The answer given is A=Q1’ B=Q1’ This is how I approached the above question.
In the given Synchronous counter circuit, initially, all the flip-flop outputs are ‘0’. it is required to replace FF2 with A-B Flip-Flop. The A-B flip-flop excitation...
571
views
asked
Feb 28, 2019
Digital Logic
dital-logic
+
–
0
votes
1
answer
5
IIT Bombay
I’m getting 25.99 in gate 2019, OBC. can I get RA in IIT Bombay?
I’m getting 25.99 in gate 2019, OBC. can I get RA in IIT Bombay?
638
views
asked
Feb 12, 2019
Written Exam
getting-to-iits
+
–
4
votes
0
answers
6
isro form filling ?
Will ISRO 2019 recruit this year? till now there is no information about ISRO 2019 form. Please share if you have information regarding it.
Will ISRO 2019 recruit this year? till now there is no information about ISRO 2019 form.Please share if you have information regarding it.
455
views
asked
Feb 5, 2019
GATE
userisro2019
usermod
+
–
0
votes
1
answer
7
ISRO 2019
Can anyone pls write about ISRO cut off for CSE in GEN and OBC category?
Can anyone pls write about ISRO cut off for CSE in GEN and OBC category?
1.2k
views
asked
Feb 5, 2019
GATE
isro19
+
–
2
votes
0
answers
8
ISRO Recruitment 2019
When ISRO 2019 form filling will start?
When ISRO 2019 form filling will start?
640
views
asked
Feb 4, 2019
GATE
isro19
+
–
2
votes
1
answer
9
Less than equal to 40 In OBC ,branch CSE
Will I get any IITs under 40 marks in gate 2018 in OBC category ?
Will I get any IITs under 40 marks in gate 2018 in OBC category ?
967
views
asked
Jan 26, 2019
0
votes
2
answers
10
the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables
Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables: S1 = 3, S2 = 2, S3 = 1; P(S1); P(S2); P(S3); Critical Section V(S3); V(S2); V(S1); Does it satisfy mutual exclusion, progress and bounded waiting?
Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables:S1 = 3, S2 = 2, S3 = 1;P(S1);P(S...
4.8k
views
asked
Jan 6, 2019
Operating System
made-easy-test-series
semaphore
operating-system
+
–
1
votes
5
answers
11
LL(1)
Every LL(1) grammar is ______ A.SLR(1) B.LALR(1) C.LR(1) D.Both B & C
Every LL(1) grammar is ______A.SLR(1)B.LALR(1)C.LR(1)D.Both B & C
1.6k
views
asked
Sep 22, 2018
Compiler Design
compiler-design
parsing
lr-parser
ll-parser
+
–
0
votes
1
answer
12
Fortran statement
The number of tokens in the fortran statements DO 10 I = 1.3 is ?
The number of tokens in the fortran statements DO 10 I = 1.3 is ?
285
views
asked
Sep 22, 2018
Compiler Design
compiler-tokenization
+
–
0
votes
0
answers
13
semantic analyzer
Incompatable types work with the _____________ A. Syntax tree B.semantic analyzer C.Code optimizer D.Lexical analyzer Answer is B Please explain why?
Incompatable types work with the _____________A. Syntax treeB.semantic analyzerC.Code optimizerD.Lexical analyzerAnswer is BPlease explain why?
1.1k
views
asked
Sep 22, 2018
Compiler Design
compiler-design
semantic-analysis
+
–
0
votes
0
answers
14
tokens
Which of the following is not a token of c -program? A. 1.02e + 2 B. # define C. 123.33 D. MAX please explain why?
Which of the following is not a token of c -program?A. 1.02e + 2B. # defineC. 123.33D. MAXplease explain why?
398
views
asked
Sep 22, 2018
Compiler Design
compiler-design
compiler-tokenization
+
–
0
votes
1
answer
15
number of tokens
Question: Find the number of tokens in the following C code using lexical analyzer of the compiler.
Question:Find the number of tokens in the following C code using lexical analyzer of the compiler.
5.3k
views
asked
Sep 21, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
numerical-answers
+
–
7
votes
9
answers
16
AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
8.8k
views
asked
Sep 15, 2018
DS
data-structures
avl-tree
numerical-answers
+
–
0
votes
0
answers
17
Strongly connected components
Consider the following graph: The number of strongly connected components of the graph are ________.
Consider the following graph:The number of strongly connected components of the graph are ________.
2.5k
views
asked
Sep 15, 2018
Algorithms
algorithms
graph-algorithm
made-easy-test-series
+
–
0
votes
1
answer
18
Test series
T(n) = T(root(n)) + n where n>=2 Time complexity ?
T(n) = T(root(n)) + n where n>=2Time complexity ?
584
views
asked
Sep 7, 2018
Algorithms
algorithms
test-series
recurrence-relation
+
–
2
votes
2
answers
19
Test series
int main() { int a = 1, b = 2, c = 3; printf("%d", a += (a += 3, 5, a)); } How is this evaluated ?
int main() { int a = 1, b = 2, c = 3; printf("%d", a += (a += 3, 5, a)); } How is this evaluated ?
2.1k
views
asked
Aug 30, 2018
Programming in C
programming-in-c
+
–
0
votes
1
answer
20
Test- series
An implementation of a queue Q, using two stacks S1and S2, is given below: The number Push and Pop operation needed is represented by X and Y, then the value of X + Y for following operation are ________.
An implementation of a queue Q, using two stacks S1and S2, is given below: The number Push and Pop operation needed is represented by X and Y, then the value of X + Y for...
483
views
asked
Aug 23, 2018
DS
programming-in-c
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register