Scribd
Upload
11 views

FOCS 2014-15

This document is an examination paper for the Foundations of Computer Science course, consisting of various theoretical and practical questions. It includes topics such as equivalence relations, posets, lattices, group theory, context-free languages, and algorithmic problems like sorting and the N-Queens problem. Students are required to attempt a selection of questions from different sections, each carrying equal marks.

Uploaded by

Kartikeya Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

FOCS 2014-15

This document is an examination paper for the Foundations of Computer Science course, consisting of various theoretical and practical questions. It includes topics such as equivalence relations, posets, lattices, group theory, context-free languages, and algorithmic problems like sorting and the N-Queens problem. Students are required to attempt a selection of questions from different sections, each carrying equal marks.

Uploaded by

Kartikeya Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Printed Pages : 4

rffitullllHlffiil[illl!ffilIIt cs/IT-11
(X'otlmingPaperlD and RolI No. to befiIIed in yourAn

Roll No.

Tech. ilI.
(sEM. D TT{EORY EXAMINATTON, 2014-ts
FOTINDATIONS OF COMPUTER SCTENCE

Time : 3 Hours] [Total Marks : 100

Note : Attempt all the questions. All question carry equal marks.

Attempt any ficur parts of following :

(a) Let X be the set of all programs of a given


programming language. Let R the relation on X be
defined as Pl R P2. If P1 and P2 gsve the same
output on all the inputs for which they terminate, is
R an equivalence relation ? If not which property
fails ?

O) Let (A,<) amnd (f,<) be two partial order

posets. Prove that (A*.8,<) is a poset, where


(o,b)<(",d\ if and only if dlc,b<d.

02113s I I Contd.,.
(c) Define modular and complemented Lattice, Prove
that every distributive Lattice is modular.
:

(d) Dray Hasse diagram'and find the complemenl of


Each element
,
of Drr.
IL

(e) Show that the argument is valid : "If I drive to


, " ';-, . work then I will arrive in time. tr do not drive to
work. Therefore I wll not arrive -in time :"
(0 Solve the followiligrecurrence relation :

!n+2-4!n+113!r=0 and lO=2, ll=4

2 Attempt any four parts of following :

(a) Prove that fourth roots of unity l,-1,1,-i form an


abelian muhiplicative group.
@} Prove that every cyclic group is abelian

(c) Defioe permutation group. Let A= {1,2,3,4,5\ .

Find (12 3)o(4 s)


(d) What do you mean by group homomorphism and
grogp'isomorphism ? Explain with example.

(e) tr (4,, *) *d ,(rr,*) ." both sr@roup of the


I
group (G,*), then prove {ttruttr,*), is also

zubgr,orlp or (C, *).


(f) Define and explain the following with suitable
example:
0 Field

(r) Symmetric group of degre , (Sr)


021133 1 2 lContd...
3 Attelpl any two parrs of following :

(a) What are the applications of context free languages


'Construct a graflrmar for the language L which has
all the strings which are all palindrome over
L= {a,b} .

(b) Specify the two types of moves in pDA. Design a


two stack PDA which accepts the language

L={o'b'c" lz>=o}.
t

(c) What is the language accepted by TM ? Design a


Turning Machine that recognizes the Languages

t={o"{l"ro}

4 Attempt any two parts :

(a) Consider the following list of elements :

70, g0, 40, 50, 60, 11, 35, g5,2.


Sort the above list using Merge Sort

O) Explain N-Queens problem. Find the all possible


solution s for 4x4 (only tree structure) and 8x8
(only matrix for*) chessboard queens problem,

(c) Detennine the LCS of (1,0,0,1,0,1,0,I) and


<0,1,0, 1,1,0,1,1,0>

021133 | 3 I Contd...
5 Attempt any two parts .

(a) Write the short note on Knapsack problem. Explain


0-I knapsack and fractional knapsack problem.
O) An RBT with n internal nodes has height at most
2lag (n+1) Write the property of Red Black
Tree.

(c) Consider the following recurrence

r @f aT @/ z)+n and T(n):T(d3 )+T(2rl3 )+n


Obtain the asymptotic bound using recursion tree
method.

021133 14s0 I
J [

You might also like