2020

QUESTION BANK

S5- COMPUTER SCIENCE AND ENGINEERING

 INDEX

CODE SUBJECT PAGE NO.

CS301 Theory of Computation 2

CS303 System Software 14

CS305 Micro Processors and Micro Controllers 23

CS305 Data Communication 28

CS309 Graph Theory and Combinatorics 36

CS361 Soft Computing 46

1
 CS301 THEORY OF COMPUTATION

CS301 THEORY OF COMPUTATION

MODULE 1

Sl. Questions Mar KTU/KU

No ks Month/Year
1 Define Non Deterministic Finite Automata? Compare its ability with 3 DEC 17
Deterministic Finite Automata in accepting languages
2 Write the notations for the language accepted by DFA, NFA, e-NFA 3 DEC 17
3 Design a Finite state automata which accepts all strings over {0,1} with 5 DEC 17
odd number of 1's and even number of 0's
4 Show the changes needed to convert the above designed automata to 4 DEC 17
accept even number of 1's and odd number of 0's
5 Design a non-deterministic automata (with ɛ move)for the regular 3 APR 18
language that consist of all strings with at least two consecutive zeroes.
Assume ∑={0,1}
6 List some of the applications of automata theory 3 APR 18
7 Prove the equivalenceof non-deterministic finite automata and 9 APR 18
deterministic finiteautomata
8 Compare the transition functions of NFA and DFA 3 DEC 18
9 Explain in English language the language accepted by the DFA in 3 DEC 18
aboveQuestion
10 Convert the NFA to DFA 4.5 DEC 18

2
 CS301 THEORY OF COMPUTATION

11 Prove the equivalence of NFA and e-NFA 4.5 DEC 18

12 Draw a six state DFA which can be minimized to a three state DFA 4.5 DEC 18
where set of input symbols is {a, b, c}. Draw both the DFAs. Assume
whatever is required
13 Define nondeterministic finite automata(NFA). Draw the NFA for the language 3 DEC 19
L={a n b m | n, m>=1}

14 Convert the following NFA to DFA. 3 DEC 19

15 Write the notation for the language defined by a DFA. Write a string belong to the 3 DEC 19
language L3 if L={0,1}

MODULE 2

Sl. Questions Mar KTU/KU

No ks Month/Year

1 Define Two-way finite automata 3 DEC 17

2 Construct Regular grammar for the regular expression : L= (a+ b)*(aa 5 DEC 17
+ bb)(a + b)*
3 List the closure properties of Regular sets 4 DEC 17

Department of Computer Science And Engineering

 CS301 THEORY OF COMPUTATION
4 State Myhill-Nerode theorem. Minimize the following DFA by table 9 DEC 17
method using Myhill-Nerode theorem describing the steps in detail

5 Construct a regular expression for the language that consist of all 3 APR 18
strings ending with 00 .Assume∑={0,1}
6 Define regular grammar with suitable example 3 APR 18
7 Prove the equivalence of non deterministic finite automata with regular 9 APR 18
expression
8 Construct a non-deterministic automata with ɛ moves for regular 4 APR 18
expression (0+1)*1
9 Compare and contrast Mealy and Moore Machines (Justify with 5 APR 18

Department of Computer Science And Engineering

 CS301 THEORY OF COMPUTATION

Diagrams)
10 What is the regular expression for the DFA APR 18

11 Can we use finite state automata to evaluate 1's complement of a binary 3 DEC 18
number? Design a machine to perform the same
12 What is a Moore machine? How is it different from mealy machine 3 DEC 18
13 Prove the equivalence of regular expression and Finite state automata 4.5 DEC 18
14 What is Myhill Nerode Theorem? 4.5 DEC 18
15 Write regular expression for the language L={1n 0 m |n>=1, m>=0} 3 DEC 19
16 Differentiate Moore machine from Mealy machine. Write the tuple 3 DEC 19
representation for both machines
17 Construct NFA without ϵ – transitions from the following NFA. 6 DEC 19
M=({q0, q1, q2}, {a, b, c}, δ , q0, {q2}) and δ(q0 , a) = {q0}, δ(q0
, b) = {q1}, δ(q0 , c) = {q2} δ(q1 , ϵ) = {q0}, δ(q1 , a) = {q1}, δ(q1
, b) = {q2}, δ(q2 , ϵ) = {q1}, δ(q2 , a) = {q2}, δ(q2 , c) = {q0}.
18 Minimize the following DFA. 6 DEC 19

MODULE 3

Sl. Questions Mar KTU/KU

No ks Month/Year
Department of Computer Science And Engineering
 CS301 THEORY OF COMPUTATION
1 What do you mean by useless symbol in a grammar? Show the 3 DEC 17
elimination of useless s;mbqls with an example
2 Define CFG for the following languages over the alphabets {a,b} 9 DEC 17
i. L: { am+nbmcnn,m>0)
ii. L contains all odd length stringsonly
iii. L: { 0n1n2n, n>0}
3 Prove that the following languages are not regular 9 DEC 17
i. L - {0i2 such that i ≥1} is notregular
ii. L = {ap such that p is a primenumber
4 Construct Context Free grammar for L={wcwR | w in (a+b)*}, reverse 3 APR 18
of w is dented as wR
5 List conditions for symbols to become useful symbols in context free 3 APR 18
grammar
6 Do the following 9 APR 18

Department of Computer Science And Engineering

 CS301 THEORY OF COMPUTATION

a. Derive any two representative strings with minimum length4

from the given context Free Grammar
G=({S,A,B},{a,b},P,S)
S bA | aB
AbAA |aS |a
BaBB | bS | b
b. Draw the derivation tree corresponding to stringaabbab
with respect to aforementioned grammar
7 What is a derivation tree? 3 DEC 18
8 Is the grammar { EE+E | E-E | id} ambiguous? Why 3 DEC 18
9 Construct the CFG for the union of the languages 0n1n and anbn for n>0 4.5 DEC 18
10 Convert the grammar {SAaCb|ABa, AbAa | a, B BaB |b, 4.5 DEC 18
Cc} to Chomsky normalform
11 Convert the following grammar to Chomsky Normal Form. S-> 3 DEC 18
0S0|1S1| ϵ
12 Whether the following grammar is ambiguous? E-> E+E| E*E|I I- 3 DEC 18
> 0|1|a|b

MODULE 4

Sl. Questions Mar KTU/KU

No ks Month/Year
1 Which Normal Form representation of CFG will you prefer in 3 DEC 17
converting CFG to NPDA? Why
2 Explain the different methods by which a PDA accepts a language 3 DEC 17
3 Can we construct a Deterministic PDA for the language wwR. Justify 9 DEC 17
your answer. Otherwise how can we modify this language to make it
accepted by DPDA
4 Design a Push Down Automata forthelanguage L={anb2n | n>0) 9 DEC 17
Trace your PDA withn=3

Department of Computer Science And Engineering

 CS301 THEORY OF COMPUTATION
5 List the conditions for Push Down Automata to qualify as deterministic 3 APR 18
Push Down Automata
6 Do the following 9 APR 18
a. Construct Push Down Automata with empty stack as final
condition for Context Free Language. L={ wcwR |w in (a+b)*}

Department of Computer Science And Engineering

 CS301 THEORY OF COMPUTATION

reverse of w is dented as wR
b. Describe all Instantaneous description from Initial ID ( start
state, abcba,initial stak symbol)|- to final ID(state,ɛ,ɛ) with
respect to constructed push down automata
7 Prove the equivalence of Push down automata and Context Free 9 APR 18
Grammar
8 What is the difference between NPDA and DPDA 3 DEC 18
9 Is the language wwR where w is string of zeroes and ones, accepted by 3 DEC 18
DPDA? Why
10 Construct the PDA for the language(0n1n)* 4.5 DEC 18
11 Give the formal definition of an NPDA 3 DEC 18
12 Show that NPDA and CFG are equivalent 6 DEC 18
13 Write the conditions for a pushdown automaton to be considered as 3 DEC 19
deterministic.
14 Which are the methods to accept a string in a PDA? Whether both type 3 DEC 19
of PDAs can define the same language. Justify your answer. 3 10

MODULE 5

Sl. Questions Mar KTU/KU

No ks Month/Year
1 State pumping Lemma for context free language 5 APR 18
2 State and prove pumping lemma for context Free Languages 10 DEC 17
3 State pumping lemma for CFL. Mention one application of Pumping 5 DEC 18
lemma
4 Consider L: {ww | w € {0, 1}}. Prove L is not a CFL. 5 DEC 18
5 Define formally Turing machine Model 5 APR 18
6 How does a Turing machine differ from PDA and FSA? 5 DEC 17
7 What is the instantaneous description for a Turing machine? Explain 5 DEC 17
with an example

Department of Computer Science And Engineering

 CS301 THEORY OF COMPUTATION
8 Do the following APR 18
a. Design Turing machine to accept language L= {0n1n |n>0} 6
b. Describe all instantaneous descriptions (ID) from initial IDq001 4
to Final ID with respect to constructed TM. Assume q0asstart

Department of Computer Science And Engineering

 CS301 THEORY OF COMPUTATION

State
9 Construct a Turing machine that recognizes the language L= {anbncn | 10 DEC 17
n>0}
10 Do the following 6 APR 18
a. Design Turing machine to compute addition of twonumbers.
Assume unary notation for number representation 4
b. Describe all instantaneous descriptions (ID) from initial ID:
q0010 to Final ID: 00 with respect to constructed Turing
Machine (assume q0as initialstate.)
11 Design a Turing machine that determines whether the binary input 5 DEC 18
string is of odd parity or not
12 Design a Turing machine that accepts anbmwhere n>0 and m>0 5 DEC 18
13 a. Whatisacontextsensitivegrammar(CSG). Design a CSG to 6 DEC 17
accept language Y= {0n1n2n |n>0}
b. Define Linear BoundAutomata 4
14 Which are the methods to accept a string in a PDA 4.5 DEC 19

15 Whether both type of PDAs can define the same language. Justify 4.5 DEC 19
your answer.

16 a) State Pumping lemma for CFLs. Write the applications of 10 DEC 19

pumping lemma for CFL s.
b) Check whether L={a i b i c i | i > 0} belong to CFL or not

MODULE 6

Sl. Questions Mar KTU/KU

No ks Month/Year
1 Write a note on Recursive Enumerable Languages 5 DEC 17

Department of Computer Science And Engineering

 CS301 THEORY OF COMPUTATION
2 Discuss about Universal Turing Machines? Explain the significance of 5 DEC 18/ APR
universal Turing machine 18
3 Explain Chomsky hierarchy and corresponding type0, type1, type2 and 5 DEC 18
type 3 formalism
4 Let L = {x | x є (a + b + c)* and |x|a=|x|b = |x|c}. What class of 4 DEC 18
language does L belong? Why? What modification will you suggest in
the Grammar to accept this language
5 Discuss the undecidable problems About Turing Machines 10 DEC 18
6 Show that normal single tape Turing machine can perform 5 DEC 18
computations performed by multi-tape Turing machine(informal

Department of Computer Science And Engineering

 CS301 THEORY OF COMPUTATION

explanation is sufficient).
7 What is nondeterministic Turing Machine? 5 DEC 18
8 How does the Universal Turing machine simulate other Turing 5 DEC 18
machines

9 Compare and contrast recursive and recursively enumerable languages 5 APR 18

10 Prove that union of two recursive languages is recursive 5 APR 18
11 Explain the significance of halting problem. 5 APR 18
12 Explain why Halting problem is unsolvable problem 5 DEC 18
13 Explain general notations for productions of each formal language APR 18
from Chomsky hierarchy

14 What is a recursive language? Give an example 5 DEC 18

15 Prove that complement of a recursive language is recursive 5 APR 18
16 a) Discuss about Multitape Turing Machines. Explain informally how they 10 DEC 19
can simulate the moves of a Turing Machine
b) Write a note on Universal Turing machines
17 a)How to identify deterministic Turing machine from nondeterministic TM 10 DEC 19
b) Write notes on the following:
i) decidable and undecidable problems
ii) Halting Problem of Turing machine.

18 a) Write the properties of recursive languages and recursively enumerable 10 DEC 19

languages. 3 b) Write the Chomsky hierarchy of languages. Prepare a table
indicating the automata and grammars for the languages in the Chomsky
Hierarchy.
19 a) Define Turing machine [Write the tuple representation for TM]. 10 DEC 19
b) Design a Turing machine to identify the strings belong to the language
L={0 n 1 n | n>0}.
20 Design the Turing machine to recognize the language: {0n 1 n 0 n | n >=1} 10 DEC 19

Department of Computer Science And Engineering

 CS 303 SYSTEM SOFTWARE

CS 303-SYSTEM SOFTWARE

MODULE 1

Sl. Marks KTU/

No Questions KU
Month/Year
1 Explain the instruction format and addressing modes of SIC. 3 DEC
What are the various addressing modes supported by SIC/XE 17
DEC
18
2 Explain program relocation with an example 3 DEC
17
3 Write a sequence of instructions for SIC/XE to divide BETA by 3 DEC
GAMMA and to store Quotient in ALPHA and remainder in 17
DELTA
4 What are assembler directives? List any five assembler 4 DEC
directives in SIC machine 17,APR
18,
MAY
19
5 Write notes on the architecture ofSIC/XE 4 DEC
17,AP
R
18
6 Let Numbers be an array of 100 words. Write a sequence of 5 DEC
instructions for SIC to set all 100 elements of the array to1 17

7 Write notes on SIC machine architecture. 3 APR

Compare the features of standard SIC and SIC/XE architecture 9 18
MA
Y 19

Department of Computer Science And Engineering 14

 CS 303 SYSTEM SOFTWARE

8 Write a subroutine for SIC/XE that will read a record into a 4 APR
buffer. The record may be any length from 1 to 100 bytes. The 18
end of record is marked with “null” character (ASCII code 00).
The subroutine should place the length of record into a variable
named LENGTH. Use immediate addressing and register –to –
register instructions to make the process efficient aspossible.
9 Write a sequence of instructions for SIC to set ALPHA = 3 DEC
BETA*9 + GAMMA 18
10 List out the various used in SIC along with their purpose 3 DEC
18
11 Distinguish between Application software and system software. 3 DEC
18
12 What are the functions of operating systems 3 DEC
18,

13 A,Let
B and
A, BC and
are array
C are of
array
10 words
of 10 words
each. Write
each. Write
a SIC/Xeprogramto
a SIC/XEprogramto 6 MAY
6 add the18
correspo
6 add the corresponding elements of A & B and store the resu

14 Explain how floating point numbers are represented in SIC/XE. 3 SEP 20

15 List the basic assembler functions 3 SEP 20

What is the difference between the instructions LDA #5 and LDA
16 FIVE? Explain how each instruction is executed. 3 SEP 20
Compare the following with reference to SIC and SIC/XE machines:
17 i. Memory 4 SEP 20

ii. Instruction format

Suppose RECORD contains a 100-byte record. Write a subroutine for
18 SIC that will write this record onto device 05. 5 DEC 20

MODULE 2

1 What is meant by forward reference? How is it resolved by 3 DEC18,

two pass assembler. MAY19

2 Describe data structures used in the two pass SIC assembler 3 DEC 17
program Give algorithm for pass 1 of a two pass SIC assembler

Department of Computer Science And Engineering 15

 CS 303 SYSTEM SOFTWARE

With suitable examples, how the different instruction formats and DEC 17
3 5
addressing modes of SIC/XE are handled during assembling
DEC 17
4 Describe the format of object program generated by the two-pass 5
SIC assembler algorithm
5 DEC 17
Explain the format of the object program generated by a two pass 5
SIC assembler ,highlighting the content of each record type
DEC 17
6 Explain the datastructures used and their purposes in a 3
two- pass assembler

7 With the aid of an explain the second pass of a two pass 6 MAY 19
algorithm

8 Explain the working of any one type of one pass Assembler 6 DEC 18

9 Explain the syntax of records in the Object Program file 3 APR 18

Consider the statements in SIC program. Consider the program being

10 assembled using a 2 pass assembler. 3 SEP 20

What will be the address value assigned to the symbol NEW during
pass 1?

Suppose the address associated with the symbol RETADR is 0030 and
11 the machine equivalent code for STL is 14. Assemble the given 5 SEP 20
SIC/XE instruction, by clearly indicating the instruction format,
addressing mode and the setting of different flag bits, given the address
value assigned to RETADR is 0030.

What is a relocatable program? Do all instructions of SIC/XE machine

12 program need modification because of relocation? Justify your answer 4

Department of Computer Science And Engineering 16

 CS 303 SYSTEM SOFTWARE

MODULE 3
1 Write notes on multi pass assembler with example 5 APR18,
DEC17

Distinguish between program blocks and control section DEC

2 9 18
How the assembler handles multiple program blocks
Write notes on MASM assemblers DEC
3 3
17
Explain the concept of single pass assembler with a suitable 5 DEC
4
example 17
What are control section of a program block? What are the 4 DEC
5
advantages of using them? Explain with proper example the 17,
purpose of EXTREF and EXTDEF assembler directives DEC
18
Distinguish between Program blocks and control section. 7 DEC
6
How does the assembler handle multiple program blocks? 18
SEP
2020
List out the basic functions of assemblers with proper examples 4 APR
7
18
Explain two passes of assembler algorithm with proper example 9 APR
8
18
What is literal? How is it handled by assembler? 3 APR
9
18
Explain how external references are handled by assembler 5 APR
10
18
With the help of an example explain how to find target address 6 DEC
11
during assembling in each case 18
Give the format and purpose of the different record types present in an 4 SEP
12 object program that uses multiple control sections. 20
Develop the records (excluding header, text and end records) for the 5 SEP
13 following control section named COPY 20

Department of Computer Science And Engineering 17

 CS 303 SYSTEM SOFTWARE

MODULE 4
Give algorithm for an absolute loader 3 DEC
1
17,
APR
18,
MA3Y
19
Write notes on Dynamic linking. Explain with exa 4 APR18,
2
MAY19

Department of Computer Science And Engineering 18

 CS 303 SYSTEM SOFTWARE

Differentiate between linkage loaders and linkage editors 3 DEC

3
18
Describe the data structures used for linking loading algorithm. 5 DEC
4
Give algorithm for pass1 of the linking loader 17
Write notes on machine independent loader features 4 DEC
5
17
Explain the concept of program relocation with an example 4 MAY
6
19
Write the algorithm for Pass 2 of a Linking loader 6 MAY
7
19
List and explain different machine independent features of 9 DEC
8
loader. Explain the working of one type of one pass Assembler 18
SEP
2020
Explain the algorithm of pass1 of a linking loader 6 APR
9
18
What is the use of bitmask in program relocation 3 DEC
10
18
Given an idle computer with no programs in memory, how do 3 DEC
11
we get things started? 18
Explain the concept of Automatic library search 3 MA
12
Y 19
What is a load and go assembler? 3 DEC
13
20
What is the use of bitmask in program relocation? Illustrate with 3 DEC
14
example. 20
Give the algorithm for pass 2 of a linking loader. 5 DEC
15
20
With a help of neat diagram explain what is a linkage editor? 4 DEC
16
20
MODULE 5
Explain the concept of macro definition and expansion with the 5 DEC
1
help of an example 17
Give algorithm for one pass macro processor and explain the 10 DEC
2
process. Describe the data structures used in one pass macro 17
processor DEC
18

Department of Computer Science And Engineering 19

 CS 303 SYSTEM SOFTWARE

How are unique labels generated in macro expansion? Explain 10 DEC

3
conditional macro expansion with an example 17,
APRIL
2018
Explain recursive macro expansion with an example 5 DEC
4
17,
APR
18
Explain macro processor algorithm 10 APR
5
18
What are the different data structures used in the implementation 5 APR
6
of the macro processor algorithm? Give examples. 18
DEC
20
Differentiate between keyword and positional macro parameters 3 DEC
7
18
Is it possible to include labels in the body of macro definition? 10 DEC
8
Justify your answer. 18
Write short note on concatenation of macro parameters SEP 20
within a character string
A code segment need to be repeatedly used in various parts 10 MAY 19
9
of assembly language program and fast execution is also
needed. Would you use a macro or a subroutine ?Justify
your answer with the help of examples.
List and explain the different design options available for
macro- processors

Certain macro processor feature are independent ofthe 10 MA

10
machine Y10
19architec

What is meant by line-by-line macro processor? What are its 5 SEP

11
advantages? 20
What are the important factors considered while designing general 5 SEP 20
12 purpose macro
processors?

Department of Computer Science And Engineering 20

 CS 303 SYSTEM SOFTWARE

What is conditional macro expansion? 5 SEP 20

13
What are the important factors considered while designing general 5 SEP 20
14 purpose macro
processors?
MODULE 6

1 Describe any two commonly used debugging methods Give 5 DEC17

general design of a device driver
Write notes on debugging functions and capabilities of an
2 interactive debugging system. 5 DEC17
Differentiate between character and block devices 10 DE
3
C17
,
AP
R18
,
DEC18,S
EP 20
5
4 Explain the structure of text editors with the help of example and DEC17,
diagram MAY19
SEP 20
5
5 Explain various text editors .Write notes on the user interface of a DEC17,
text editor APR18

What is a debugger ?Explain the different debugging methods in detailS 10 APR 18

6
5 DEC18
7 What is a device driver? What are the major design issues of
a device driver?

Draw the structure of a typical text editor and describe the 10 DEC
8
functions of each block. List out the main four tasks 18
associated with the documented editing process.

Department of Computer Science And Engineering 21

 CS 303 SYSTEM SOFTWARE

List out the criteria that should be met by the user interface 4 DEC
9
18
of an efficient debugging system

A new device is plugged into the system.Which isthe 10

10
appropriate system software needed for the proper working MA
Y 19
of the new hardware? Give its functionalities and general
architecture

Write down the situations where debugging by induction 10 SEP

11
,deduction and backtracking are used, explaining each 20
process
With a neat diagram show the relationship between viewing 5 SEP
12
and editing buffer. 20

Discuss the debugging functions and capabilities. 4 SEP

13
20

Department of Computer Science And Engineering 22

 CS 305 MICRO PROCESSORS AND MICRO CONTROLLERS

CS 305 - MICROPROCESSORS AND MICROCONTROLLERS

MODULE 1

Sl.No. Questions Marks KU/KTU, Year

1 List the registers used in 8086 microprocessor. 3 KTU-Dec.2017

2 Describe the functions of INTR, READY and HOLD 3 KTU-Dec.2017
signals.
3 Draw and explain the internal block diagram of 8086. 9 KTU-Dec.2017
4 Give architectural and signal difference between 8086 4 KTU-Dec.2017
5 What are the flag bits available in flag register of 8086? 3 KTU-Apr. 2018
6 With the help of timing diagram shows the transition of 3 KTU-Apr. 2018
control signals involved in the I/O read operation of 8086
in minimum mode.
7 Explain the physical and logical memory organization of 9 KTU-Apr.
8086? 2018,KTU-Dec 2020
8 How does the 8086 processor access a word from an odd 3 KTU-Dec.2018
memory location? Howmany memory cycles does it take?
9 Find the physical address of the destination operands 3 KTU-Dec.2018
referred in the following instructions, if DS=0223H,
DI=0CCCH and SI=1234H a) MOV [DI], AL b) MOV
[SI][56H], BL
10 Draw the Memory Read timing diagram of 8086 in 9 KTU-Dec.2018,
Minimum mode. Describe the status of the relevant KTU-Dec 2020
signals during each clock period.
11 Find the physical address of the memory locations 3 KTU-Dec.2019
referred by the following instructions, when DS=BCOOH,
SI=0023H, BX=0012H a)MOV AL,[SI] b) MOV
[BX][SI],DL
MODULE 2

1 State the significance of assembler directives in an 3 KTU-Dec.2017

assembly language program with suitable examples.

2 Compare Macro and Subroutine. 3 KTU-Dec.2017,

KTU-Dec 2020

3 What are the different addressing modes supported by 9 KTU-Dec.2017

8086.Explian with examples. KTU-Dec.2018
4 Write a program to find the largest number from an 5 KTU-Dec.2017
unordered array of 8-bit numbers.

Department of computer Science And Engineering 23

 CS 305 MICRO PROCESSORS AND MICRO CONTROLLERS

5 With the help of an example state the differences in the 3 KTU-Apr. 2018
functioning aspects of the instructions SHR and SAR of
8086.
6 Describe any three addressing modes used in 8086. 3 KTU-Apr. 2018
7 Write an 8086assembly language program to check 9 KTU-Apr. 2018
whether a string is palindrome or not. Assume that the
string and its length are stored at known memory
locations.
8 Write 8086 assembly language program to find the count 9 KTU-Dec. 2018
of even and odd numbers from a set of 10 sixteen bit
numbers stored in location staring from a known address.
Store the results in two different locations.
9 What is the difference in the execution of an 8086 3 KTU-Dec.2018
intersegment and intrasegment CALL instruction?
10 Define the functions of the following 8086 assembler 3 KTU-Dec.2018,
directives: a) ASSUME b) EQU c) OFFSET ,SEGMENT KTU-Dec 2020
11 Explain the working of the following instructions with 3 KTU-Dec 2020
suitable example. a) IN b)SAR
21 Differentiate 8086 and 8088 microprocessors. 4 KTU-Dec 2020
MODULE 3

1 Describe interrupt cycle of 8086/8088 with neat diagram. 3 KTU-

Dec.2017,KTU-Dec
2020
2 Give description about maskable and non maskable 3 KTU-Dec.2017,
interrupt. KTU Dec 2020
3 Interface two 4K*8 EPROMS and two 4K*8 RAM chip 6 KTU-Dec.2017
with 8086.Select suitable address maps.
4 Give a brief description about Interrupt Service Routine. 3 KTU-Dec.2017
5 What are the disadvantages of polling scheme over 3 KTU-Apr.2018
interrupt scheme?
6 What is an Interrupt Vector Table (IVT)? Provide a 3 KTU-Apr.2018
diagrammatic representation of the IVT of 8086.
7 With the help of a diagram explain the different blocks of 9 KTU-Apr.2018
8259 Programmable Interrupt Controller.
8 What are the five dedicated interrupts of 8086? 5 KTU-Dec 2020

9 Write the condition(s) which cause 8086 to perform a 3 KTU-Dec.2018

Type 1, Type 2 and Type 3 interrupts.
10 Discuss 8086 interrupt acknowledgement cycle 3 KTU-Dec.2018
11 Draw the architectural block diagram of 8259 9 KTU-Dec.2018
Programmable Interrupt Controller and explain the role of
each functional part.
12 What do you mean by Interrupt Vector Table (IVT)? The 5 KTU-Dec.2018
starting address for a type 7 interrupt-service procedure is

Department of computer Science And Engineering 24

 CS 305 MICRO PROCESSORS AND MICRO CONTROLLERS

1112:1314. Show where and in what order this address

should be placed in the 8086 IVT.
13 Explain how the priority resolver block of 8259 select the 3 KTU-Dec 2020
request to be served next.
14 Explain the interfacing of an IO device to 8086 using 3 KTU-Dec 2020
peripheral IO method
MODULE 4

1 Mention the salient features of basic I/O mode operation 3 KTU- Dec.2017
of 8255. KTU-Dec 2020
2 Compare I/O mapped and memory mapped interfacings. 3 KTU- Dec.2017
3 Draw the internal architecture of 8279 and explain. 9 KTU- Dec.2017
KTU-Dec 2020
4 Describe different modes of operation of peripheral 6 KTU- Dec.2017,
ICs:8255 and 8259. KTU Dec2020
5 What is DMA? State the sequence of operations 3 KTU-Apr.2018
performed by DMA controller in DMA transfer operation.
6 What are the different operational modes of 8279. 9 KTU-Apr.2018
7 List any four features of 8257 DMA controller. 4 KTU-Apr.2018
8 Write notes on scanned keyboard with 2-key lock out of 3 KTU-Dec.2018
8279 keyboard/display controller.
9 Describe the control word format of 8255 PPI. 4 KTU-Dec.2018
10 Design an interface with an 8086 CPU and two chips of 9 KTU-Dec.2018
16*8 EPROM and two chips of 32*8 ROM.Select the
starting address of EPROM suitably.The RAM address
must start at 00000H
11 Explain output modes of 8279, programmable 3 KTU-Dec 2020
keyboard/display interface.
12 Interface two numbers of 16Kx8 EPROM and 2 numbers 9 KTU-Dec.2020
of 4Kx8 RAM to 8086. Select suitable address map.
MODULE 5

1 What are the different types of micro controllers? 5 KTU-Dec.2017

2 What factors are needed to be considered for selecting a 5 KTU-Dec.2017
microcontroller?
3 Give brief description of memory and I/O addressing of 10 KTU-Dec.2017
8051.
4 With the help of a block diagram describe the different 10 KTU-Apr.2018
components of 8051.
5 Consider four LEDs connected to the lower 4 bits of Port 10 KTU-Apr.2018
P0 of 8051 microcontroller. Assume that the LEDs will
glow if the corresponding bit is 1. Write an 8051 program
which makes the group of LEDs to function as 4-bit Ring
Counter. The program should iterate to display the Ring

Department of computer Science And Engineering 25

 CS 305 MICRO PROCESSORS AND MICRO CONTROLLERS

Counter sequence five times continuously and then exit.

(Hint: 4bit Ring Counter sequence is 1000, 0100,0010 and
0001.
6 What are the different addressing modes supported by 5 KTU-Dec.2017,
8051? KTU-Dec 2020
7 What is a microcontroller? Distinguish between a 5 KTU-Apr.2018
microcontroller and a microprocessor
8 How the 8051 differentiate between internal and external 1 KTU-Dec.2018
program memory?
9 Discuss the selection criteria of a typical microcontroller 4 KTU-Dec.2018
11 Discuss the structure of internal data memory (RAM) of 5 KTU-Dec.2018
8051.
12 What is the size of 8051 Stack Pointer (SP)? Discuss the 4 KTU-Dec.2018
operation of 8051stack.
13 Describe Internal data memory organization of 8051 9 KTU-Dec.2020
microcontroller.
14 Explain PSW of 8051 microcontroller 5 KTU-Dec.2020
15 Explain the organization of stack in 8051 5 KTU-Dec.2020
microcontrollers.
MODULE 6

1 Draw internal architecture of 8051 with brief description. 10 KTU-Dec.2017

2 Draw internal architecture of 8254/8253 with brief 10 KTU-Dec.2017,
description. KTU-Dec 2020
3 Write a 8051 based assembly language program to find 10 KTU-Dec.2017
the product of two 2*2 matrices.
4 Describe the architecture and functionalities of 8253 10 KTU-Apr.2018
interval timer.
5 Describe the program status word (PSW) of 8051. 3 KTU-Dec.2018
6 What are the five different categories of 8051 instruction 10 KTU-Apr.2018
set? Explain each category with appropriate examples
7 What are the five different interrupts in 8051? 5 KTU-Apr.2018,
KTU Dec2020
8 Write an 8051 program to find the sum of digits of an 8bit 5 KTU-Apr.2018
unsigned decimal number.
9 What is the difference between LCALL and ACALL 2 KTU-Dec.2018
instructions?
10 Write an 8051 assembly language program to find the 6 KTU-Dec.2018
largest of ten numbers stored in RAM location 47H
onwards. Output the result in port1.
11 Is “DIV A, R1” a valid instruction? Justify your answer. 2 KTU-Dec.2018
12 How many interrupts have been provided in 8051? 7 KTU-Dec.2018
Explain the necessary conditions which cause these
interrupts to be generated. Also arrange them in
decreasing order of priority

Department of computer Science And Engineering 26

 CS 305 MICRO PROCESSORS AND MICRO CONTROLLERS

13 Describe the following instructions of 8051 5 KTU-Dec.2020

microcontroller. a) AJMP b) SJMP c) XCHD d) MOVX
e) SWAP
14 Write an 8051 assembly language program to count the 7 KTU-Dec.2020
occurrence of a given byte in a sequence of n bytes.

Department of computer Science And Engineering 27

 CS 307 DATA COMMUNICATION

CS307 DATA COMMUNICATION

MODULE 1

Sl. Questions Mar KTU/KU

No ks Month/Year

1 Write any four issues encountered in the design of communication 3 KU MAY

systems 2019

2 What do you mean by Nyquist bandwidth and Shannon capacity 3 KU

formula MAY 19
3 Define the terms - Direct Link, Point-to- point link, full duplex mode, 3 DEC 17
half duplex mode
4 Define simplex, half duplex and full duplex transmission mode. Give 3 DEC 17,
one example for each. APR 18
MAY 19
5 List and explain different factors which determine the performance of 3 DEC 17,
communication in a network? APR 18
6 List various impairments and explain how they affect information 4 DEC 17
carrying capacity of a communication link?
7 Define Channel Capacity. What key factors affect highest data rate 4 APR 18
fornoiseless channel and noisy channel?
8 Signal to Noise Ratio is often given in decibels. Assume SNR db=36 5 APR 18
and the channel bandwidth is 2Mhz. Calculate theoretical channel
capacity?
9 What is the channel capacity for a teleprinter channel with a 300-Hz 3 DEC 18
bandwidth and a signal-to-noise ratio of 3 dB, where the noise is white
thermal noise?
10 What is Bandwidth? A periodic signal has a Bandwidth of 20 Hz. 3 DEC 18
TheHighest frequency is 60 Hz. What is the lowest Frequency? Draw
the Spectrum if the signal contains all frequencies of same amplitude.

28
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
 CS 307 DATA COMMUNICATION
11 Differentiate attenuation and Delay Distortion. 3 DEC 18
12 Discuss time domain and frequency domain concept of a signal . Draw 3 MAY 19
the frequency domain plot of a periodic signal.
13 What are the various transmission impairments and explain how they 9 MAY 19
affect performance of a communication link?
14 Define Channel Capacity. Calculate the appropriate bit rate and signal 5 MAY 19
levels for a channel with 100 Mhz bandwidth and SNR of 255.
15 Define frequency, phase and wavelength of a signal 3 DEC 19
16 Explain the three most significant transmission impairments. 3 SEP 20

MODULE 2

Sl. Questions Mar /KU

No ks Month/Year
1 Briefly describe terrestrial microwave 4 DEC 18
2 Briefly explain NRZ-L and NRZ-I schemes for digital to digital 4 DEC 17
encoding
3 What do you mean by bipolar AMI schemes for encoding ? What are 4 DEC 17
its merits anddemerits?
4 Write physical and transmission characteristics of Optical Fibre Cable 3 DEC 17
guided transmission media.
5 What are the advantages of microwave transmission over radio wave 3 DEC 17
transmission?
6 Explain the wireless propagation techniques 15 DEC 17
7 How does cross talk occurs in twisted pair cables? Give the purpose of 5 DEC 17
CAT5e,CAT6,CAT7 twisted pair cables.
8 Mention the purpose of cladding in Optical Fibres? 3 DEC 18
9 For a parabolic reflective antenna operating at 12 GHz with a diameter 3 DEC 18
of 2 ,Calculate the effective area and the antenna gain
10 Briefly discuss Line of Sight Propagation. 3 DEC 18
11 Explain the following terms: i) Direct broadcast satellite (DBS) ii) 7 DEC 18
Isotropic antenna
29
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
 CS 307 DATA COMMUNICATION
12 Compare terrestrial and satellite microwave transmission. 4 MAY 19

13 Explain the working principle of parabolic reflective antenna with 5 MAY 19

suitable diagrams.
14 Describe briefly ground wave propagation. 5 DEC 19

15 Give the physical description of satellite microwave communication 5 DEC 19

system.Mention some applications.
16 Transmission characteristics of Fibre Optic cable differs from Coaxial 3 SEP 20
cable.How?
17 Explain in detail transmission modes of Fibre optic cable? 5 SEP 20

18 Briefly discuss Line of Sight propagation. 4 SEP 20

MODULE 3

Sl. Questions Mar KTU/KU

No ks Month/Year
1 Give the significance of delta modulation over pulse code modulation 3 DEC 17
during the process of transforming analog data in to digital signal.
2 Show the equivalent analog sine-wave pattern of the bit string 3 DEC 17
00110101 using amplitude shift keying, frequency shift keying and
phase shift keying
3 For the bit stream 11000110010, sketch the wave form for each of the 5 DEC 17
code of NRZ-I.NRZ-L, Bipolar-AMI, Pseudoternary, Manchester,
Differential Manchester.
4 Explain the modulation technique used in Asymmetric Digital 4 DEC 17
Subscriber Line(ADSL) and cablemodems
5 With suitable example explain the working principle of Code division 5 DEC 17
multiplexing for CDMA technology.

30
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
 CS 307 DATA COMMUNICATION
6 Describe the scrambling technique B8ZS 5 DEC 17
7 State Sampling theorem. With help of suitable diagrams, explain the 5 DEC 17
process of transforming analog data in to digital signal using Pulse 3 SEP 20
Code Modulationtechnique.
8 Indicate some significant differences between broadcast radio and 3 DEC 17
microwave.
9 Find the Bandwidth for a signal transmitting at 12 Mbps for QPSK. 3 DEC 18
The value ofd=0.
10 Encode the given bit stream using NRZ-I. 100010001111 5 DEC 18
11 What is polar NRZ line encoding? What are its variations? 5 DEC 18
12 Differentiate amplitude modulation and frequency modulation 8 DEC 18
13 Encode the bit stream 10101010 into the following line coding 6 MAY 19
schemes assuming that the last signal level has been negative:
i) NRZ-I
ii) NRZL
iii) Manchester
iv) Differential Manchester
v) Bipolar AMI
vi) Pseudoternary
14 Convert the bit stream 101010 in to analog signals by using ASK, 3 MAY 19
Binary FSK and Binary PSK
15 With neat diagram, explain delta modulation technique. 6 MAY 19
16 Encode the bit pattern 01001100011 using Differential Manchester 3 DEC 19
encodingtechnique.
17 Define Sampling Theorem 3 DEC 19
18 Differentiate between NRZL and NRZI encoding techniques with 3 DEC 19
examples.
19 With neat diagram, explain delta modulation technique. 6 MAY 19

MODULE 4

31
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
 CS 307 DATA COMMUNICATION
Sl. Questions Mar KTU/KU
No ks Month/Year
1 What type of multiplexing is preferred in optical fiber communication? 3 DEC 17,
Justify your answer APR 18
2 What do you meant by single bit error and burst error 3 APR 18
3 Explain time domain and frequency domain concept of a signal in a 5 DEC 17
communication system
4 How Time division Multiplexing (TDM) handle disparity in the input 5 DEC 17
data rate, if data rate of all input lines are not same?
5 Explain major types of noise occur during data transmission, which 5 DEC 17
causes errors.
6 What are the advantages of using multiplexing in data communication? 5 DEC 17
7 How does a synchronized time division multiplexer stay synchronized 3 DEC 17
with de-multiplexer on receiving end?
8 Explain the frame format of Synchronous Optical Network (SONET) 4 DEC 17
for the version SDH. 3 DEC 19
9 With suitable examples explain sliding window error control 5 DEC 18
mechanism in datacommunication.
10 What is CDMA? Explain. 5 KU
11 Explain Space Division Multiplexing. 5 DEC 17
12 Differentiate between Synchronous TDM and Statistical TDM. Why is 5 DEC 17
a statistical time division multiplexer more efficient than a synchronous
time division multiplexer?
13 With a neat Sketch discuss the various steps involved in PCM 5 DEC 17
14 Given the bit pattern 101110001. Encode the stream using BFSK and 5 DEC 18
QPSK.
15 Explain frequency division multiplexing. How is interference avoided 5 DEC 18
by using FDM? 6 MAY 19
16 Discuss Digital Carrier Systems. 3 MAY 19

17 Discuss wave length division multiplexing. 3 MAY 19

32
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
 CS 307 DATA COMMUNICATION
18 What is byte interleaving technique in Time Division Multiplexing 3 DEC 19

MODULE 5

Sl. Questions Mar KTU/KU

No ks Month/Year

1 For a parabolic reflective antenna with a diameter of 2m, operating at 5 DEC 17

12 GHz. Calculate the antenna gain? Given effective area= 56π.
2 Explain with suitable diagram, how asynchronous and synchronous 5 DEC 17
connections are used in data communication. 4 MAY 19
6 SEP 20
3 Why would you expect a CRC to detect more errors than a parity bit? 5 DEC 17
4 For P=110011 and M=11100011, Find CRC. 5 DEC 17
5 What are the different architectural components in public 5 DEC 18
communication network? Explain its workingprinciple.
6 Given the dataword 1001001111 and the devisor 10111,show the 5 DEC 18
generation of the CRC codeword at the sender site using binary
division.
7 Calculate the hamming pairwise distance among following codewords; 5 DEC 17
i) 00000,10101,01010 ii) 000000,010101,101010,110110
8 Explain the analog modulation techniques briefly. 5 DEC 17
9 Discuss Synchronous Optical NETwork (SONET). 5 DEC 17
10 In a CRC error-detecting scheme, choose divisor polynomial P: x 4 + x 7 DEC 18
+ l. Encode the bits 10010011011
11 Why would you expect a CRC to detect more errors than a parity bit? 3 DEC 18
12 What is meant by Hamming distance? 3 DEC 17
13 Derive a Hamming code for single bit error correction (For a data of 7 July 18
length 7 Bit)
14 How errors are detected using parity checking? What are the 5 MAY 19
limitations of parity checking?

33
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
 CS 307 DATA COMMUNICATION
15 Using CRC, given the dataword 1010011110 and the divisor 10111 10 MAY 19
i. Show the generation of the codeword at the sender site
ii. Show the checking of the codeword at the receiver site
16 What is the Hamming distance for each of the following codewords: 4 MAY 19
a. d (10000, 11000)
b. d (10101, 10010)
c. d (11111,11111)
d. d (000, 100)
17 In a CDMA process two users are having the codes as given below. 5 DEC 19
User1: 1,1,1,1
User2: 1,-1,-1,1
Explain the data transmission process if user1 wants to transmit a bit 0
and user2wants to transmit a bit1.
18

MODULE 6

Sl. Questions Mar KTU/KU

No ks Month/Year
1 Briefly explain packet switching 3 KU
2 How does spread spectrum eliminates narrow band interferences? 5 DEC 17
Explain Direct Sequence Spread Spectrum(DSSS) technique.
3 Give any two reasons why baseband signal cannot be directly 5 DEC 17
transmitted in a wireless system? How Frequency Hopping Spread 4 SEP 20
Spectrum(FHSS) spread the baseband signal for transmission.
4 Explain the datagram approach for packet switching network. What is 5 DEC 17
the significance of packet size in packet switching network? 5 DEC 19
5 SEP 20
5 List four major components of packet switch and write their function 5 DEC 17
6 With suitable example illustrate working of virtual circuit approach for 5 DEC 17
packet switching 5 DEC 19

34
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
 CS 307 DATA COMMUNICATION
7 Discuss synchronous transmission. How is synchronization provided 10 DEC 18
for synchronous transmission? What is a major disadvantage of
asynchronoustransmission?
8 Explain the difference between datagram and virtual circuit operation 7 DEC 18
5 MAY 19
9 What is the significance of packet size in a packet-switching network? 3 DEC 17
10 What are the advantages of packet switching compared to circuit 7 DEC 17
switching.
11 What is meant by setup phase in circuit switching? 3 DEC 17
12 Explain the following terms: i) DSSS ii) FHSS 10 DEC 18
13 Discuss Frequency hopping spread spectrum technique 10 MAY 19
5 DEC 19
14 What is Circuit switching? Explain the three phases in Circuit 10 MAY 19
switching with suitable diagrams
15 With the help of a neat block diagram, explain the structure of a packet 5 MAY 19
switch.
16 Generate the CRC code for the data word of 110010101. The divisor is 5 DEC 19
10101.

35
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
 CS309 GRAPH THEORY AND
COMBINATORICS

CS309 GRAPH THEORY AND COMBINATORICS

MODULE 1

Sl. Questions Mar KTU/KU

No ks Month/Year

1 Consider a graph G with 4 vertices: vl, v2, v3 and v4 and the degrees 3 DEC 17
of vertices are 3, 5, 2 and 1 respectively. Is it possible to construct such
a graph G? If not,why?
2 Draw a disconnected simple graph Gl with 10 vertices and 4 3 DEC 17
components and also calculate the maximum number of edges possible
in Gl.
3 What are the basic conditions to be satisfied for two graphs to be 6 DEC 17
isomorphic? Are the two graphs below isomorphic? Explain with valid
reasons.

4 Write any two applications of graphs with sufficient explanation . 3 DEC 17

5 Prove that the number of vertices of odd degree in a graph is always 3 DEC 18
even.
6 Show that in a simple graph with n vertices, the maximum number of 3 DEC 18
edges is n(n-l)/2 and the maximum degree of any vertex is n-1.
7 Define isomorphism between graphs? Are the two graphs below 5 DEC 18
isomorphic? Justify

Department of Computer Science And Engineering

36
 CS309 GRAPH THEORY AND
COMBINATORICS

8 Prove that in a simple with n vertices and K components can have at 3 Model
most (n-k)(n-k+1)/2 edges. Question
9 Prove that if a connected graph G is decomposed into two subgraphs gl 3 DEC 18
and g2 there must be at least one vertex common between gl and g2.
10 Write a note on Konigsberg Bridge Problem 3 Model
Question
11 A graph has exactly 10 vertices, 4 vertices of degree 3, 4 vertices of 3 Model
degree 2 and 2 isolated vertices. How many edges the graph have? Question
12 19 students in a nursery school play a game each day, where they hold 4 Model
hands to form a circle. For how many days can they do this, with no Question
students holding hands with the same playmates more than once?
Substantiate your answer with graph theoretic concepts.
13 Differentiate walk , path and circuit. 3 Model
Question
14 Using the graph classify each sequence as a walk, a path or a circuit 4.5 Model
Question

Department of Computer Science And Engineering

37
 CS309 GRAPH THEORY AND
COMBINATORICS

MODULE 2

Department of Computer Science And Engineering

38
 CS309 GRAPH THEORY AND
COMBINATORICS
Sl. Questions Mar KTU/KU
No ks Month/Year

1 Consider the graph G given below: 3 DEC 17

Define Euler graph. Is G an Euler? If yes, write an Euler line from G

2 What is the necessary and sufficient condition for a graph to be Euler? 5 DEC 17
And also prove it .
3 Define Hamiltonian circuits and paths with examples. Find out the 5 DEC 17
number of edge-disjoint Hamiltonian circuits possible in a complete
graph with five vertices.
4 State Travelling-Salesman Problem and how TSP solution is related 5 Model
with Hamiltonian Circuits? Question
5 State Dirac's theorem for hamiltoniancity and why it is not a necessary 4 DEC 17
condition for a simple graph to have a Hamiltonian circuit.
6 Differentiate between symmetric and asymmetric digraphs with 4 Model
examples and draw a complete symmetric digaph of four vertices. Question
7 Differentiate between complete symmetric and complete asymmetric 4 Model
graph with an example each. Question
8 State Dirac's Theorem and check its applicability in the following 3 DEC 17
graph, G .

9 Consider a complete graph G with l1 vertices. 4 DEC 18

a) Find the maximum number of edges possible in G.
b) Find the number of edge-disjoint Hamiltonian circuits in G

Department of Computer Science And Engineering

39
 10 A connected graph G is a Euler graph if and only if it can be 6 DEC 18
decomposed into circuits.
11 The total number of different, not edge disjoint, Hamiltonian circuits in 6 Model
a complete graph of n vertices is (n-1)!/2. Prove. Question

MODULE 3

Sl. Questions Mar KTU/KU

No ks Month/Year
1 Find the number of possible labeled trees that can be constructed with 2 DEC 18
50 vertices.
2 Consider a binary tree with four weighted pendent vertices. Let their 3 DEC 18
weights be 0.5, 0.12, 0.13 and 0.11. Construct a binary tree with
minimum weighted path length.
3 Define spanning tree. Show that the edges forming a spanning tree in a 5 DEC 18
planar graph G correspond to the edges forming a set of chords in the
dual G*.
4 Draw the flow chart of spanning tree algorithm and also clearly mark 6 DEC 18
the five conditions to be tested in connection with the spanning tree
construction in the flowchart.
5 Prove that all trees will have either one or more centers. 3 Model
Question
6 What is eccentricity of a node? How it is used in finding the center of a 3 Model
graph? Explain with examples. Question
7 Show that a connected graph of n vertices and n edges has n-1 tree 5 Model
branches and e-n+1 chords. Question
8 Find the number of edges and vertices of a graph G if its rank and 6 Model
nullity are 6 and 8 respectively. Define rank and nullity of a graph G. Question
9 Define rooted binary tree with an example. Draw all trees of n labeled 5 Model
vertices for n=3 and n=4. Question
CS309 GRAPH THEORY AND

DEPARTMENT OF COMPUTER SCIENCE AND

ENGINEERING
 COMBINATORICS

10 Prove that a tree with n vertices has n-1 edges. 5 Model

Question
11 Prove that the distance between vertices of a connected graph is a 5 Model
metric. Question
12 Write an algorithm for finding the shortest spanning tree (Kruskal 6 Model
algorithm) Question
13 List down any two properties of trees and also prove the theorem: A 6 Model
graph is a tree if and only if it is a minimally connected. Question
14 Let G= (V,E) be a connected graph, and let T:=(V, S) be a spanning 4 DEC 17
tree of G. Let e = (a, b) be an edge of G not in T. Prove that, for any
edge f on the path from a to b in T, (V, (Su{e}) -{f}) is another
spanning fee for G.
15 Define spanning trees. Consider the graph G given below and obtain 5 DEC 17
any three spanning trees from G. Calculate the number of distinct
spanning trees possible from a complete graph with n vertices.

MODULE 4

Sl. Questions Mar KTU/KU

No ks Month/Year
1 Prove the statement: Every cut-set in a connected graph G must also 3 DEC 17
contain at least one branch of every spanning tree of G
2 List down the properties stating the relationship between the edges of 3 DEC 17
graph G and its dual G
3 Define cut set. Find any four sets from graph G given below and also 5 DEC 17

DEPARTMENT OF COMPUTER SCIENCE AND

ENGINEERING
 CS309 GRAPH THEORY AND
COMBINATORICS
find the edge connectivity of G.

4 Draw two Kuratowski’s graphs and also prove that Kuratowask’s first 4 DEC 17
graph is non planar using appropriate inequality.
5 Draw a geometric dual (G*) of G given and also write about the 6 DEC 18
relationship between a planar graph G and its dual G*

6 Prove the statement “Every circuit has an even number of edges in 4 DEC 18
common with any cut-set”.
7 Define edge connectivity and vertex connectivity. 3 Model
Question
8 Show that a vertex v in a connected graph G is a cut vertex iff there 5 Model
exist two vertices x and y in such that every path between x and y Question
passes through v.
9 State and prove Cayley’s theorem. 9 Model
Question
10 Prove that : A graph has a dual if and only if it is planar. 7 Model
Question

DEPARTMENT OF COMPUTER SCIENCE AND

ENGINEERING
 CS309 GRAPH THEORY AND
COMBINATORICS
11 Prove that: The complete graph of five vertices is nonplanar. 6 Model
Question
12 Write a short note on Connectivity and separability. 5 Model
Question

MODULE 5

Sl. Questions Mar KTU/KU

No ks Month/Year

1 Derive the relationship between incidence matrix, fundamental circuit 10 Model

matrix and fundamental cut-set matrix representations of a graph. Question

2 Write any two matrix representations of a graph. 10 Model

Question
3 3 Prove that if B is a circuit matrix of a connected graph G with e edges 5 Model
and n vertices, rank of B=e-n+1 Question
4 List down any four properties of adjacency matrix. 4 DEC 18
5 Construct an adjacency matrix(x) for the following graph and also 6 DEC 18
mention how the concept of edge sequences is described with X3.

6 Define vertex connectivity and Edge connectivity. 4 Model

Question
7 Two graphs Gl and G2 are isomorphic if and only if their incidence 6 DEC 17
matrices A(Gl) and A(G2) differ only by permutation of rows and

DEPARTMENT OF COMPUTER SCIENCE AND

ENGINEERING
 CS309 GRAPH THEORY AND
COMBINATORICS
columns

8 Let A and B be, respectively, the circuit matrix and incidence matrix of 4 DEC 17
a self-loop-free graph G.Prove that A x BT=0 (mod 2)
9 Explain circuit matrix and its properties. 5 Model
Question
10 Let B and A be the circuit matrix and incidence matrix whose columns 5 Model
are arranged using the same order of edges. Show that every row of b Question
is orthogonal to every row A.
11 Write the properties of incidence matrix. 5 Model
Question
12 Explain cut set matrix and path matrix. 5 Model
Question
13 Define adjacency matrix and construct a graph from the following 4 DEC 17

adjacency matrix:

MODULE 6

Sl. Questions Mar KTU/KU

No ks Month/Year

1 Draw the flow chart of minimum spanning tree algorithm. 7 DEC 17

2 Find MST from the graph given below by simply applying Kruskal’s 3 DEC 17
procedure.

DEPARTMENT OF COMPUTER SCIENCE AND

ENGINEERING
 CS309 GRAPH THEORY AND
COMBINATORICS

3 Write the Dijkstra’s shortest path algorithm. Apply this algorith to find 10 DEC 17
the shortest path between v1 and v6.

4 Write the Dijkstras Shortest Path Algorithm and apply this algorithm to 6 DEC 17
find the shortest path between a and z.

5 Write an algorithm to find the connectedness and components of a 10 Model

graph and analyse the complexity of the algorithm Question
6 Explain Floyd warshall algorithm with suitable example. 10 Model
Question
7 Using Prim’s algorithm, find a minimal spanning tree for the following 10 Model
Question

DEPARTMENT OF COMPUTER SCIENCE AND

ENGINEERING
 CS309 GRAPH THEORY AND
COMBINATORICS

weighted graph

8 Write an algorithm for the shortest path between all pairs of vertices 7 Model
Question
9 Write an algorithm for Depth- first search on a graph 10 Model
Question
10 Explain planarity with example. 5 Model
Question
11 Explain cut-vertices and blocks bridges. 5 Model
Question
12 Explain computer representation of a graph. 3 Model
Question

46
 CS 361 Soft Computing

CS361 SOFT COMPUTING

MODULE 1

Sl. Questi Marks KTU/KU

No ons Month/Year
1 Explain different learning mechanisms used in Artificial Neural 3 DEC 17
Networks with the help of necessary diagrams
2 With the help of example , state the role of bias in determining the 3 DEC 17
net output of Artificial Neural Network.
3 Design a Hebb network to realize logical OR function 9 DEC 17
4 With graphical representations, explain the activation functions used 4 DEC 17
in Artificial Neural Networks.
5 Compare feed forward and feedback networks 3 DEC 18
6 Why McCulloch-Pitts neuron widely used in logic functions? 3 DEC 18
7 Implement AND function using bipolar inputs and targets using 9 DEC 18
Hebb rule method
8 Implement AND function using McCulloch-Pitts neuron 4 DEC 18
(using binary data representation).
9 Differentiate Soft Computing and Hard Computing. Give any three 4
applications of soft computing
10 Explain supervised and unsupervised learning techniques. 3 SEP 2020

11 Implement ANDNOT function using McCulloch-Pitts neuron. (Take 7 May 19

binary data)
13 With the help of an example explain Supervised, Unsupervised, 6 May 19
Reinforcement learning

Department of Computer Science And Engineering

47
 CS 361 Soft Computing

14 Design a Hebb net to implement OR function. 9

X1 X2 b Y
1 1 1 1
1 -1 1 1
-1 1 1 1
-1 1 1 1
-1 -1 1 -1

MODULE 2

Sl. Questions Mar KTU/KU

No ks Month/Year
1 Explain the concept of Widrow-Hoff rule 3 DEC 18
2 State the significance of error portion ᵟk and ᵟj in Back Propagation 3 DEC 18
Network
3 Implement OR function using perceptron training algorithm with 9 DEC 18
binary inputs and bipolar targets
4 Explain training algorithm used in adaptive linear neuron 5 DEC 18
5 State the concept of delta rule used in Adaptive Linear Neurons 3 DEC 17
6 Illustrate the different steps involved in the training algorithm of 3 DEC 17,SEP
perceptrons. 2020

7 How is the training algorithm performed in back propagation neural 5 DEC 17

networks
8 Explain the five different neural network architectures 5 Dec 2018

9 Explain the architecture and training algorithm of Back Propagation 9 Sep 2020
network. Describe the various terminologies used in the algorithm
10 Explain the difference between Adaline and Perceptron nets. (with 3 Sep 2020
network diagram)

56
 CS 361 Soft Computing

11 Give the Perceptron training algorithm for single output class. 3 May 19

56
 CS 361 Soft Computing

12 Describe the sigmoidal activation function. List the drawbacks. 5 SEP 2020

13 Write the learning factors of Back Propogation network 3 May 19,

14 Explain why Widrow-Hoff rule is adopted to minimize error in 4 SEP 2020
ANN learning.
15 Use Adaline network to train AND NOT function with bipolar 9 Sep 2020
inputs and targets. Calculate total mean error after 1 epoch of
training. Initially the weights and bias have assumed a random
value say 0.2. The learning rate is also set to 0.2.

MODULE 3

Sl.No Questions Mar KTU/KU

ks Month/Year
1 Distinguish between fuzzy and probability with example. 3 DEC 18
2 Explain any two methods of composition techniques on fuzzy relations 3 DEC 18
with examples
3 Given two fuzzy sets A and B on a universe X = [0,1,2,3,4]. 5 Dec 2020

4 Why the excluded middle law does not get satisfied in fuzzy sets. 3 Dec 2020
Describe with an example

56
 CS 361 Soft Computing

5 Consider the two fuzzy sets. Perform the Cartesian product over these 3 Dec 2018
given fuzzy sets.

6 Let U be the universe of military aircraft of interest as defines as below 4 Dec 2018
U = {a10,b52,c130,f2,f9}.

7 Law of contradiction and law of excluded middle cannot be applied to 3 Dec 2020
fuzzy sets. Give proper justification to the statement

56
 CS 361 Soft Computing

8 Given three universes X={x1,x2,x3}, Y={y1,y2,y3} and 9 SEP 2020

Z={z1,z2,z3}, the fuzzy sets A defined on X , fuzzy set B defined on Y
and fuzzy set C defined on Z are givenas

9 What are tolerance and equivalence relations? Given a relation R, 9 MAY 19,SEP
check whether R is equivalent. Else transform the relation to an 2020
equivalencerelation.

10 Discuss the operations on crisp sets 3 MAY 19,SEP

2020
11 Whether a power set can be formed for a fuzzy set? Justify 3 Dec 2020

12 Represent the standard fuzzy set operations using Venn diagram 3 MAY 19,SEP
2020
13 What is cardinality of a fuzzy set.Whether a power set can be formed 4 MAY 19
for a fuzzy set.Justify your answer
14 7 Dec 2020

56
 CS 361 Soft Computing

15 4 DEC 17

16 3 SEP 2020

MODULE 4

Sl. Questions Mar KTU/KU

No ks Month/Year

56
 CS 361 Soft Computing

1 State the relevance of fuzzification . Explain different types. 3 Dec 2018

2 Using the intuition method develop fuzzy membership functions for 3 DEC 18,SEP
the following shapes. (a) Trapezoid. (b) Gaussian function. (c) 2020
Isosceles triangle.
3 With the help of a figure, explain the features of fuzzy membership 3 MAY 19
functions.
4 Using inference approach , find the membership values for each of the DEC 18
triangular shapes (I,R,IR,E,T) for a triangle with angles 55°, 45°, 80°. 4
5 What is meant by Lambda-Cuts for Fuzzy Sets? 3 Sep 2020

6 Explain different defuzzification methods? 9 MAY 19

7 Using your own intuition and definition of universe of discourse, 3 Sep 2020
plot membership functions for liquid level in the tank. (empty,
very less, less, full, very full)

56
 CS 361 Soft Computing

7 Explain inference method used for membership value assignment? 4 DEC 17

8 5 DEC 17

9 5,4 DEC 18,SEP

2020

10 5 DEC 17

11 4.5 DEC 17

12 4.5 DEC 17

13 Using the inference approach, obtain the membership values for 6 MAY 19
the triangular shapes,(I,R,T) for a triangle with angles 40,60,80.

MODULE 5
Sl.No Questions Mar KTU/KU
ks Month/Year

56
 CS 361 Soft Computing

1 Define Fuzzy Propositions. Explain different fuzzy propositions. 10 DEC 18

56
 CS 361 Soft Computing

2 Mention the general forms that exist for a linguistic variable 5 DEC 18
3 Differentiate between Mamdani FIS and Sugeno FIS 5 DEC 18/
MAY19,SEP
2020
4 Explain how can one perform the aggregation of fuzzy rules 4 DEC 17
5 With the help of necessary block diagram,compareMamdani and 10 DEC 17
Sugeno fuzzy inference systems
6 With the help of examples,explain the various fuzzy propositions 6 DEC 17
7 Explain the different methods for fuzzy approximate reasoning. 4 DEC 17
8 Formulate a problem that can derive inference through fuzzy system 4 DEC 17

9 Explain two types of fuzzy inference systems with example. 4 MAY 19

10 Write a note on Fuzzy Qualifiers 4 MAY 19

11 Describe two methods used for Aggregation of Fuzzy Rules 3 MAY 19
12 Explain the methods used for decomposing compound linguistic rules 6 MAY 19
into simple canonical rules.
13 List the five functional blocks FIS is constructed on with a block 5 SEP 2020
diagram
14 Explain the following terms: 10 MAY 19, SEP
1.Cooperative Neural Fuzzy system 2020
2. General Neuro Fuzzy hybrid system

MODULE 6

Sl. Questions Marks KTU/KU

No Month/Year

56
 CS 361 Soft Computing

1 Mention the stopping condition for genetic algorithm flow 5 DEC18 ,

MAY
19,SEP
2020
2 Difference between uniform and three parent cross over 4
3 Explain the characteristics and different classifications of a neuro- 10 DEC 18
fuzzy hybrid system.
4 Explain different types of Encoding Techniques. 10 DEC 18
5 Compare genetic learning of rule bases and knowledge bases 4
6 Compare and contrast traditional algorithm and genetic 5 SEP 2020
algorithm.
7 Explain the Roulette wheel technique for traditional GA selection 5 SEP 2020

56
 CS 361 Soft Computing

8 Illustrate the different steps in genetic neuro-hybrid systems with the 6 DEC 17
help of a neat block diagram
9 With the help of examples,explain the various crossover techniques 10 DEC 17
employed in genetic algorithms.
10 Distinguish between the process of tuning and learning in genetic – 4 DEC 17
fuzzy rule based systems
11 Explain the different methods of encoding that are possible in genetic 6 DEC 17
algorithm
12 Describe five types of crossover. 5 MAY
19,SEP 2020
13 Explain Stochastic Universal Sampling with example 4 MAY 19
14 Explain the steps of genetic algorithm 4 MAY 19

(*)(*)(*)(*)(*)(*)(*)(*)(*)(*)(*)(*)(*)

56