Register
Filter

Questions by Anurag_s

14 votes
1 answer
1
what are the key differences among iits, top 4nits(W,T,S,C) and iiits(iiith,iiitb,iiitd ) w.r.t Masters(Mtech/MS) in CSE
What are the key differences among iits, top 4nits(W,T,S,C) and iiits(iiith,iiitb and iiitd only) w.r.t Masters (Mtech/MS) in CSE considering these aspects(feel free to m...
0 votes
2 answers
2
Select a data structure that you have seen previously, and discuss its strengths and limitations.
Select a data structure that you have seen previously, and discuss its strengths and limitations.
Select a data structure that you have seen previously, and discuss its strengths and limitations.
42 votes
2 answers
3
How To Prepare For Written and Interviews?Major Subjects To Focus and Type of Questions asked.
Which IIT's take admission through written Test and Interviews,Upto what Rank They call and Eg Major Subjects To Focus and Type of Questions asked.
Which IIT's take admission through written Test and Interviews,Upto what Rank They call and Eg Major Subjects To Focus and Type of Questions asked.
1 votes
0 answers
5
cardinality
1 votes
1 answer
6
CPU Scheduling
1 votes
0 answers
7
multithreading
1 votes
1 answer
8
consider a process which tries to acquire a lock
Explain why a and b must be true.I think it should be only b because block is .. process is in wait state ie not consuming cpu cycles whereas in busy wait cpu cycles are consumed
Explain why a and b must be true.I think it should be only b because block is .. process is in wait state ie not consuming cpu cycles whereas in busy wait cpu cycles are ...
2 votes
0 answers
9
cache hit quesion
Main purpose behind this question is, which access mechanism to consider by default:Simultaneous ie on Miss directly access from main memory without transferring to cache or Hierarchial ie First transfer to cache and then access from cache..
Main purpose behind this question is, which access mechanism to consider by default:Simultaneous ie on Miss directly access from main memory without transferring to cache...
2 votes
0 answers
11
Upto what depth i must cover these topics from dynamic programming 1>Travelling sales person 2>sum of subsets
I want to know that at what depth i must cover these topics from dynamic programming 1>Travelling sales person 2>sum of subsets .I know about the problems,Recurrence re...
1 votes
2 answers
14
consider following code segment in c
consider following code segment  in c main() { char * z="abc"; z[0]='x'; printf("%s",z); } what will be behavior of the program a>compiler error   b>runtime error c>no error prints xbc d>no error prints abc
consider following code segment  in cmain(){char * z="abc";z[0]='x';printf("%s",z);}what will be behavior of the programa>compiler error   b>runtime error c>no error pr...
2 votes
1 answer
17
Let L = {a, bb} How many strings of length 10 are present in L* ?
Let L = {a, bb} How many strings of length 10 are present in L* ?
Let L = {a, bb}How many strings of length 10 are present in L* ?
2 votes
1 answer
18
S1: L ≤ m {0n1n | n ≥ 0} then L is decidable.
Answer True/False for the statements: S1: $L ≤_m \{0^n1^n \mid n ≥ 0\}$ then $L$ is decidable. S2: if $L$ is R.E. and $L’ ⊆ L$ then $L’$ is recursively enumerable because enumerator for $L$ also enumerates $L’$.
Answer True/False for the statements:S1: $L ≤_m \{0^n1^n \mid n ≥ 0\}$ then $L$ is decidable.S2: if $L$ is R.E. and $L’ ⊆ L$ then $L’$ is recursively enumerable...
2 votes
3 answers
19
Consider 2 scenarios: C1: For DFA (ϕ, Ʃ, δ, qo, F), if F = ϕ, then L = Ʃ* C2: For NFA (ϕ, Ʃ, δ, qo, F)
Consider 2 scenarios:C1: For DFA (ϕ, Ʃ, δ, qo, F),if F = ϕ, then L = Ʃ*C2: For NFA (ϕ, Ʃ, δ, qo, F),if F = ϕ, then L = Ʃ*Where F = Final states setϕ = Total st...
2 votes
2 answers
20
Let Σ= {a}, assume language, L= { a^(2012.K) / K> 0}, what is minimum number of states needed in a DFA to recognize L
Let Σ= {a}, assume language, L= { a^(2012.K) / K 0}, what is minimum number of states needed in a DFA to recognize L
Page: