Register
Filter

Recent questions

#19521
189
views
0 answers
0 votes
Fundamental of Programmable DSP
Distinguish between multiple access memory and multi ported memory
User Avatar
#19522
194
views
1 answers
0 votes
Made easy test series
User Avatar
#19523
155
views
1 answers
0 votes
Made easy test series question
User Avatar
#19524
222
views
1 answers
0 votes
Made easy test series
User Avatar
#19525
379
views
1 answers
0 votes
Made easy test series
User Avatar
#19526
568
views
0 answers
0 votes
Made easy Test series
User Avatar
#19527
521
views
1 answers
0 votes
pumping lemma
to check if a given language is regular or not, for this i have seen many solutions on the net and lectures but everyone has used a direct approach to determine ... solve it. which one should i do, pumping lemma or the direct approach one?
User Avatar
#19528
637
views
1 answers
1 votes
#CN Given are the sequence number field bits, tell the total sequence number possible and SWS simple SWP? (Self Doubt)
Say sequence # field has 5 bits.then what would be the max SWS (sender window size) in case of simple SWP where nothing is mentioned explicitly that the SWP is ... is not mentioned and only said SWP is used. So here how to calculate SWS?
User Avatar
#19529
376
views
0 answers
0 votes
Operating System - IPC
https://gateoverflow.in/200133/os-ipcWhat is the correct answer?
User Avatar
#19530
236
views
1 answers
0 votes
Self doubt
What is the number of linearly independent solution in case of unique solution (n=r) in linear non-homogenous system of equations ??Where , n=number of variables ... of coefficient matrix.
User Avatar
#19531
234
views
1 answers
0 votes
Gate 2016 - 2 - 8
In the first one, why is L3 compliment recursively enumerable?https://gateoverflow.in/39574#39584
User Avatar
#19532
884
views
0 answers
0 votes
C program
User Avatar
#19533
1.7k
views
0 answers
0 votes
Column Major Order
User Avatar
#19534
368
views
0 answers
0 votes
SELF DOUBT
https://gateoverflow.in/549/gate1992-01-ixWHAT IS CORRECT ANSWEER?
User Avatar
#19535
261
views
1 answers
0 votes
Self Doubt
What is order of T(n) ?T(n) = T(n-1) + 2$^{n}$ , n>1T(n) = 1 , n=1A) O(2$^{n}$)B) O(n.2$^{n}$)C) O(2$^{2n}$)
User Avatar
#19536
273
views
0 answers
0 votes
ACE Testseries
Given a set of n distinct integers. It is desired to determine smallest of these integers using comparisons. Which is true?A) n + O(1) comparisonsB) n + O(logn) comparisonsC) O(n) comparisonsD) O(log$^{2}$n) comparisons
User Avatar
#19537
387
views
0 answers
0 votes
time complexity
why n1/2k=2?
User Avatar
#19538
253
views
0 answers
0 votes
TOC doubt
How many states following DFA will have?1. (0+1)*1(0+1)(0+1)(0+1)(0+1)2. (0+1)*1(0+1)1(0+1)(0+1)(0+1)3. (0+1)*(0+1)(0+1)(0+1)(0+1)Is there any formula also for such questions?
User Avatar
#19539
403
views
0 answers
0 votes
self doubt
shouldn't the answer be b??
User Avatar
#19540
377
views
1 answers
0 votes
DYNAMIC PROGRAMMING [self doubts]
how to form The minimum number of scalar multiplications to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method
User Avatar
Page: