Questions by saurav04

1 vote

1 answer

1

IISC Aptitude Test/Interview
What are all subjects need to be covered for written test for IISC(Mtech) Aptitude test Scheduled at 18 Apr and also brief us about paper pattern and duration,cutoff,Interview experience?Seniors,If possible kindly share some questions(if remember so) or links to get some idea regarding test.

asked in Written Exam Mar 11, 2016

4.8k views

1 vote

2 answers

2

Left linear grammar
Consider the following right linear grammar. S->aA/abc A->aA/bB/a B->bB/cC/b C->cC/c Find left linear grammar is equivalent to the above right linear grammar?

asked in Theory of Computation Jan 29, 2016

2.2k views

0 votes

1 answer

3

Probability

asked in Probability Jan 28, 2016

309 views

1 vote

1 answer

4

Made easy

asked in Graph Theory Jan 26, 2016

659 views

1 vote

2 answers

5

Theory of Computation
Let $L = \{\text{madeeasy2016}\}$ over $\Sigma = \{m,a,d,e,s,y,2,0,1,6\},$ $L_1=\text{prefix}(L)$ and $L_2= L_1 \Big /{} { \Sigma ^*}$. The number of strings in $L_2$ (assume $L_1$ and $L_2$ do not include empty string) are ______.

asked in Theory of Computation Jan 25, 2016

1.9k views

4 votes

2 answers

6

Madeeasy
Which of the following is true? $f(n)=O\left(\left(f\left(n\right)\right)^{2}\right)$ $f(n)=O\left(g\left(n\right)\right)\Rightarrow 2^{f\left (n\right)}=O\left(2^{g\left(n\right)}\right)$ $f(n)+O\left(f\left(n\right)\right)=\theta \left(f\left(n\right)\right)$ Both (a) and (b)

asked in Algorithms Jan 4, 2016

1.0k views

1 vote

0 answers

7

Time complexity
Why [logn]! is not polynomial bounded where [loglogn]! is polynomial bounded? Note [ ] is greatest integer function

asked in Algorithms Dec 20, 2015

250 views

4 votes

1 answer

8

Pumping Lemma
Prove or Disprove below language is regular or not L1={w|w∈∑* where w visit all state of M atleast once where M is machine accepting L1 L2={w|w∈∑* where w visit all state of M equal no of times where M is machine accepting L2

asked in Theory of Computation Dec 4, 2015

1.1k views

2 votes

0 answers

9

No of final state
A FA accepting language L(A) has n states and m transition.L(A) is given as L(A)={x| if x∊L(A) then u∊L(A) for ∃u,v∊∑* where x=uv } Find no of final state in above NFA?

asked in Theory of Computation Dec 4, 2015

282 views

1 vote

1 answer

10

TOC
Why Min(L) ≠ Complement((Prefix(L))? Min(L) is set of all strings w in L where every proper prefix of w is not in L Prefix(L) is set of all prefix of w ∈L

asked in Theory of Computation Nov 30, 2015

1.2k views

1 vote

2 answers

11

Cache memory(made easy)
During a program execution out of 1000 memory references there are 250 and 120 misses in L1 (Level1) and L2(Level2) caches respectively. Hit times for L1 and L2 cache are 24 and 40 cycles respectively. If there are 2.5 memory references per instruction, how many average stall cycles per instruction? (Assume L2 to memory miss penalty is 250 cycles)? a)50 b)100 c)150 d)200

asked in CO and Architecture Nov 28, 2015

2.1k views

2 votes

1 answer

12

Time complexity
What is time complexity to evaluate prefix and postfix expression ? as per me it should be O(n) as atmost 2 pop operation perform and 1 push operation

asked in DS Nov 25, 2015

1.6k views

2 votes

1 answer

13

Disjoint sets
No of unordered disjoint sets of a set with n elements?

asked in Set Theory & Algebra Nov 14, 2015

915 views

1 vote

0 answers

14

Graph
Find Maximum and Minimum no of edges in a graph G with n vertices if G has 3 component with 2 non acyclic and 1 acyclic component?

asked in Graph Theory Oct 18, 2015

221 views

2 votes

0 answers

15

Aloha
Consider a slotted aloha channel with bandwidth 5Mbps. if frame size is equal to 10 user slots then what is effective data rate of a user if every 2nd slot is occupied by him?(Assume data if required)

asked in Computer Networks Oct 18, 2015

676 views

0 votes

1 answer

16

Let f(n) = O(n), g(n) = θ(n), and h(n) = Ω(n). Then f(n). h(n) + g(n) is_______________
let us consider f(n) is log(n) and g(n) = n and h(n) = n^2. since logn<= n n2 >= n for all values so given above equality holds true but when we substitute n+((logn)(n2) = O(n2) but ans is Ω(n) can somebody wxplain this plz

asked in Algorithms Jan 22, 2015

2.8k views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Questions by saurav04

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Subjects

Questions by saurav04

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments