Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by ankit_thawal
0
votes
1
answer
1
Nitd placement, admission
How is the NIT Delhi for M.tech,can anyone from NITD please share ur experience? Please post stats about placements.Does average student can get placement (atleast 6LPA)?
How is the NIT Delhi for M.tech,can anyone from NITD please share ur experience? Please post stats about placements.Does average student can get placement (atleast 6LPA)?...
1.0k
views
asked
Apr 26, 2018
NITs
nit
+
–
0
votes
0
answers
2
ISRO S-C
Can anybody elaborate on how to apply for the ISRO's scientist C post(from recent advertisement)
Can anybody elaborate on how to apply for the ISRO's scientist C post(from recent advertisement)
574
views
asked
Feb 5, 2018
ISRO
isro-application
+
–
0
votes
1
answer
3
ACE TEST
SELECT * FROM TABLENAME WHERE column_name = (SUBQUERY which returns same data types as column_name); Is this query erroneous bcoz of an equal operator?
SELECT * FROM TABLENAME WHERE column_name = (SUBQUERY which returns same data types as column_name); Is this query erroneous bcoz of an equal operator?
291
views
asked
Feb 2, 2018
0
votes
1
answer
4
DOUBT
Consider a pipelined processor having 5 stages. The stage delays are 1, 1.4, 1.2, 3, 2ns and interstage buffer delays are 1ns. The 3rd stage is capable of deciding branch target address. The processor starts fetching new instruction when the conditional branch outcome is known. 30% of instructions are the conditional branch, then calculate the execution time for 1200 instructions?
Consider a pipelined processor having 5 stages. The stage delays are 1, 1.4, 1.2, 3, 2ns and interstage buffer delays are 1ns. The 3rd stage is capable of deciding branch...
362
views
asked
Feb 2, 2018
0
votes
1
answer
5
Made easy doubt
Consider the following keys that are hashed into the hash table in the given order using the hash function H(key) = key mod 11. 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 21 Where hash table using quarditic probing of mod11 to handle the ... inside the hash table ________ (value will be a whole number). I can't understand what is "i" is it number of collision?
Consider the following keys that are hashed into the hash table in the given order using the hash function H(key) = key mod 11.12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 21W...
747
views
asked
Feb 1, 2018
0
votes
0
answers
6
made easy
Consider the following grammar with corresponding synthesized attributes: If “F.val” gives the value of the binary fraction generated by F in above grammar then, the value of F.val on input {0.110} is _______. (Upto 3 decimal places)
Consider the following grammar with corresponding synthesized attributes:If “F.val” gives the value of the binary fraction generated by F in above grammar then, the v...
270
views
asked
Feb 1, 2018
0
votes
2
answers
7
SELF DOUBT
Which gates are functionally complete? e.g.NAND
Which gates are functionally complete?e.g.NAND
352
views
asked
Feb 1, 2018
1
votes
1
answer
8
cd lexical analysis token
1. macros are not considered as tokens in tokenizing. 2.#include considered as single token 2.stdio.h considered as single token. Are the above statements true?
1. macros are not considered as tokens in tokenizing.2.#include considered as single token2.stdio.h considered as single token. Are the above statements true?
743
views
asked
Feb 1, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
true-false
+
–
0
votes
0
answers
9
ravula
Let f(n) = 1000 n6 +299 n log n and g(n) = 5 n5 log n + 1024 n2. Which of the following is true?( Marks: -0.33 ) f(n) is O(g(n)), but g(n) is not θ(f(n)) f(n) is not O(g(n)) and g(n) is not θ(f(n)) f(n) is not O(g(n)) but g(n) is O(f(n)) Explanation: f(n) is O(n6) while g(n) is O(n5) f(n) is O(g(n)) and g(n) is θ(f(n)). How to infer and solve such question?
Let f(n) = 1000 n6 +299 n log n and g(n) = 5 n5 log n + 1024 n2. Which of the following is true?( Marks: -0.33 ) f(n) is O(g(n)), but g(n) is not θ(f(n)) f(n) is not O...
244
views
asked
Feb 1, 2018
0
votes
0
answers
10
ravula
Let x is a binary number and a function f(x)= 1’s Complement(2’s Complement ( x )) If x= 0110 then f6(x)= ____. Note: fk(x)= f(fk-1(x)) ,k>1.
Let x is a binary number and a functionf(x)= 1’s Complement(2’s Complement ( x ))If x= 0110 then f6(x)= ____.Note: fk(x)= f(fk-1(x)) ,k>1.
429
views
asked
Feb 1, 2018
1
votes
0
answers
11
ravula
Consider a schema R(ABCD) and fallowing functional dependencies A->B B->C C->D D->B Decomposition of R into R1(A,B), R2(B,C) and R3(B,D) is ------( Marks: -0.66 ) Dependency preserving but not lossless join Lossless join but not dependency preserving Not Dependency preserving and Not lossless join Dependency preserving and lossless join plz explain in detail, I m confused.
Consider a schema R(ABCD) and fallowing functional dependenciesA->BB->CC->DD->B Decomposition of R into R1(A,B), R2(B,C) and R3(B,D) is ( Marks: -0.66 ) Dependency pr...
1.2k
views
asked
Feb 1, 2018
0
votes
0
answers
12
ACE TEST
Is the given conversiion from XNOR to XOR true?
Is the given conversiion from XNOR to XOR true?
249
views
asked
Jan 31, 2018
0
votes
0
answers
13
test series doubt
Use of Auxillary carry flag? Which flag is used in jump instruction?
Use of Auxillary carry flag? Which flag is used in jump instruction?
133
views
asked
Jan 31, 2018
2
votes
0
answers
14
ACE TEST
How to solve such ex? Here anwer is (A)
How to solve such ex?Here anwer is (A)
195
views
asked
Jan 31, 2018
0
votes
1
answer
15
ace test
When to consider seek time,rotational latency,transfer time? Here answer is option(D)
When to consider seek time,rotational latency,transfer time?Here answer is option(D)
185
views
asked
Jan 31, 2018
0
votes
0
answers
16
test ace
195
views
asked
Jan 31, 2018
0
votes
0
answers
17
Self Doubt
Can anyone please give differences, disadvantage, equations(of sum and carry) for Half Adder Half Subtractor Full adder Full subtractor
Can anyone please give differences, disadvantage, equations(of sum and carry) forHalf AdderHalf SubtractorFull adderFull subtractor
106
views
asked
Jan 31, 2018
0
votes
1
answer
18
me test
Let $f (n) = Ο(n), g(n) = \Omega(n)$ and $h(n) = \theta(n)$. Then $g(n) + f(n).h(n)$ is ______ How to solve such examples. Rules for math of asymptotic notations(mul,div,add,sub of diif notations)
Let $f (n) = Ο(n), g(n) = \Omega(n)$ and $h(n) = \theta(n)$. Then $g(n) + f(n).h(n)$ is ______How to solve such examples.Rules for math of asymptotic notations(mul,div,a...
249
views
asked
Jan 30, 2018
Algorithms
algorithms
asymptotic-notation
made-easy-test-series
+
–
0
votes
0
answers
19
ME TEST
The format of double operand instruction of a CPU consist of $5$ bits opcode and $6$ bits for source and destination. $26$ double operand instructions and $184$ single operand instructions must be implemented. What will be the total number of zero operand instructions can be implemented? How to solve such questions? I always get confused.
The format of double operand instruction of a CPU consist of $5$ bits opcode and $6$ bits for source and destination. $26$ double operand instructions and $184$ single op...
261
views
asked
Jan 30, 2018
CO and Architecture
co-and-architecture
+
–
1
votes
0
answers
20
ravula test
σ(x<y) ( π(x,y) R ) Is this type of query valid or should I have selection operator inside the and projection outside or both are same?
σ(x<y) ( π(x,y) R ) Is this type of query valid or should I have selection operator inside the and projection outside or both are same?
275
views
asked
Jan 29, 2018
Page:
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register