Questions by VS

0 votes

1 answer

41

Breadth first Search

asked in Algorithms Nov 26, 2017

972 views

1 vote

0 answers

42

Graph theory
What type of graph is STAR? A. Bipartite B. Tripartite C. Mutipartite PS : I know a star graph is bipartite but can't we say that a bipartite graph is also tripartite . I. E. It can be partitioned into 3 independent sets. Similarly , it is mutipartite as well.

asked in Others Oct 23, 2017

534 views

2 votes

0 answers

43

Complete lattice and Bounded lattice
Is every Bounded lattice Complete ? Eg : ( { x : 0<=x<= 1} , <= ) This lattice is bounded , but is it complete ? (I have a doubt ; what if we consider irrational no.s as well)

asked in Set Theory & Algebra Oct 22, 2017

986 views

1 vote

1 answer

44

Compiler
Out of LL(2) and LR(1) which is more powerful?

asked in Compiler Design Sep 6, 2017

388 views

1 vote

2 answers

45

Asymptotic notations
g(n)=Ώ(n) h(n)=O(n) g(n) . h(n) =?

asked in Algorithms Sep 6, 2017

544 views

1 vote

1 answer

46

CFL or not
L={ wε(a+b)* | #a - #b <=10 } CFL or Reg ?

asked in Theory of Computation Sep 5, 2017

483 views

3 votes

2 answers

47

Regular or CFL
L={w| length of w is odd and its middle symbol is 0, wε{0,1}* } Reg or CFL?

asked in Theory of Computation Sep 5, 2017

1.2k views

1 vote

2 answers

48

Mapping Reducible
A={<M,w> M is a TM that accepts w} B=Ʃ* Is A Mapping reducible to B? http://theory.stanford.edu/~trevisan/cs154-12/reductions3.pdf

asked in Theory of Computation Sep 5, 2017

962 views

0 votes

0 answers

49

Left linear regular grammar to machine
Can we directly convert a given Left linear regular grammar to machine ? or First convert Left linear regular grammar to Right linear regular grammar and then to machine . http://scanftree.com/automata/conversion-of-left-linear-grammar-to-finite-automata

asked in Compiler Design Sep 5, 2017

1.1k views

2 votes

1 answer

50

TOC-DFA
Design a NFA and DFA for the following :: 1) Accepting all substrings of the string abab. 2) Accepting all prefixes of the string abab. 3) Accepting all suffixes of the string abab.

asked in Theory of Computation Aug 12, 2017

993 views

2 votes

1 answer

51

TOC-reg
Complement of : {anbn | n>=0} ? Also tell if it is CFL or CSL?

asked in Theory of Computation Aug 11, 2017

379 views

0 votes

1 answer

52

toc-reg
{ambncp|m+n+p>=10} Reg or not ?

asked in Theory of Computation Aug 11, 2017

357 views

1 vote

1 answer

53

TOC RE REC
A RE language can also be called as Turing Recognizable,Turing Acceptable or Turing Enumerable. And REC can be called as Turing Decidable. Now When we say that a language is Turing Computable, Strictly what we could say that it is RE or REC? (Ofcourse if it is REC then it is RE also) PS : It would be great if you could provide some reliable source for it.

asked in Theory of Computation Aug 9, 2017

2.3k views

2 votes

2 answers

54

DCFL or CFL
{w| number of Zeros=number of Ones} Alphabet= {0,1} It is a CFL for sure. But,is it also a DCFL i.e. can we construct a DPDA for it? My Approach:: for 0 push in stack , for 1's pop ---> In end stack should be empty Hence, a DCFL. But, eg given string :: 1100 Now,for 1's pop but, nothing in stack to pop .... STUCK HERE !!

asked in Theory of Computation Aug 8, 2017

475 views

1 vote

0 answers

55

Fragmentation
In both IPv6/4 reassembly is done only at the destination. Can anyone provide a Reliable source or reference for this ?? I found this :https://blog.apnic.net/2016/01/28/evaluating-ipv4-and-ipv6-packet-frangmentation/ which says : Evaluating IPv4 ... the pack onward, fragmenting as required. Above implies that Defragmentation can also be done at intermediate routers in case of IPv4.

asked in Computer Networks Aug 1, 2017

322 views

1 vote

2 answers

56

Complete Binary tree
What exactly is a Complete Binary Tree? Different sources provide different definitions: Source 1 : A complete binary tree of depth d is the strictly binary tree all of whose leaves are at level d. http://faculty.cs.niu.edu/~mcmahon/CS241/Notes/ ... which case they call this type of tree an almost complete binary tree or nearly complete binary tree. Which definition to follow ?

asked in DS Jul 16, 2017

1.6k views

1 vote

0 answers

57

others
I have this doubt that the Two pass assembler,Macro,linker and related topics,are they still included in gate syllabus.Because there have been no questions from these topics since years.

asked in GATE Jul 5, 2017

158 views

0 votes

1 answer

58

cil-2017 AQ24

asked in Quantitative Aptitude Apr 9, 2017

365 views

0 votes

2 answers

59

cil-2017 AQ17

asked in Verbal Aptitude Apr 9, 2017

289 views

0 votes

2 answers

60

cil-2017 AQ11

asked in Quantitative Aptitude Apr 9, 2017

450 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 VS

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Subjects

Questions by VS

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments