I

ililtfifft ilff iltil flilrillll

Reg.No.
Name

fiil

M 2291 1

fiil

Vlll Semester B.Tech. Degree (Reg./Sup. - lncluding Part Time)

Examination, April 2013
(2007 Admn. Onwards)
2K6 CS 801 : OPERATIONS RESEARCH
Time: 3

Hours

Max. Marks : 100

Instruction : Answer all questions.

L a) Brielly explain any two matrix operations with examples.

b) Let S = {Vr, V2, V3, V4, V5} be a set of vectors in Ra where
V1 = (1 ,2,-2,1);Vz= (-3, O,-4,3);Vs =(2,1, 1, -1);V+= (-3,3, -9,6)
and Vu

- (9, 3, 7,4\,Find

a subset of 'S' that is a basis for W = spans.

c) Showthe following system has a degenerate solution

2x. +
3xt

xr-xr-

+2xr*

GEC WAYANAD

=$
d) Write the dual of the L.P.P.
Minimize

X3

z=4x1+ 6x, + 18xa

Subject to the constraints.

x.,

+3x, > 3;xr+2x, > 5andtj =0(j = 1,2,3).

e)

Explain how do you resolve the case of Degeneracy in a transportation problem.

l)

List the methods of finding initial basic feasible solution for a transportation
problem. Explain one of them.

g) Explain the diflerent service disciplines in the case of a queuing system.

h) A drive in bank window has a mean service time of 2 min while the customers
. arrive at a rate ol 20 per hr. Assumes that these represent rates with a
Poisson distribution

i) What is the percentage time willthe teller be idle ?

ii) What fraction of customers will have to wait in the line ?

(8x5=40)
P.T.O.

M 2291

-2-

ffiilil

lil

fiil il|il ll] lllt

ililill

2 1l
[r
ll. a) lf A=13 -4 ol . Find Ar + A-1
12 6el
OR

b)

For a' (6, 6) i az (9, 12) and a. (3, 9) with 1,, =

?".,+?,"r* Xs : 1 and all
graphically.

/r;L, = /git'"= /S (so that

I > 0). Find the convex hall and represent it

15

lll. a) Use two phase simplex method to

Max.

z=Sxj+Bx,

Subject to the constraints 3x.' + 2x,

> 3 ; xt + 4xt > 4

xr,xr>0.
xi+xr<5;
t zoR

b) Use Big m method to max. z = x1 + 2x" + 3xa - xo

Subject to x., + 2xr+ 3xa = 15' 2x, +x, + Sxa = 20
x, + 2xr+ x3 + X4 = 10 ; x1, X2, X3, xa t 0.

GEC WAYANAD

lV.

a) 5 jobs are to be processed

in 5 machines. Profit in Rs. is

Machines

Jobs

32

4Q

41

22

29

BC
38
24
27
38
33

40

28

40

28

21

36

33

30

37

41

36

36

40

35

39

Solve the assignment problem to maximize profit.

OR

15

ll]llil

lll

iltt illfi lllll llilt ilil

'-3

ffi

M22911

b) Solve the lollowing transportation problem

Destination

Dl

D3

Avail.
D4

5362
4791
3475

ol

Origin

D2

02
o3

16 18

Require

19

37

15

34

31

25

V. a) Use dynamic programming to find the value of max. Z = yt. yz -ys subject to
the constraints yt +yz+ v3 = 5 I yr, y2, y3 > 0.
OR

b) Use Bellman's principle of optimality to solve min. z = Vj * yz+

Subject to Yr, Yz ....Yn = d

O for j = 1,2, -...
U',

n'
GEC
WAYANAD

ys

* ... + yn
15

M 22912

rilruffiffiffiriltill|ilil
Reg. No.

Name:

Vlll Semester B.Tech. Degree (Reg./Sup. - lncluding Part Time)

Examination, April 2013
2K6CS 802
Time : 3

(2007 Admn. Onwards)

CRYPTOGRAPHY AND NETWORK SECURITY

Hours

Max. Marks : 100

lnstruction : Answer all

l. a)

questians.

(8x5=40)

Prove that the square ol any integer is of the lorm 3k or 3k + 1 but not of the
form 3k + 2, where k is a constant.

b) State and prove division algorithm. Give examples.

c) Write notes on the structure of AES.
d) Give some reasons forthe popularity as well as the complexity in internetwork
security.

GEC WAYANAD

e)

Draw the diagram and short notes on key generation, encryption and decryption
in Elgamal.

t)

Write short notes on asymmetric key cryptography.

g) Write notes on the benefits of lP security.

h) List any 5 reasons for the popularity of PGP.

ll. a) lf P is an odd prime, prove that :

f .32.52 ..... (p - 2,9 = (-1;(P + t)/2 lmod p) and
22 .42 .62 ..... (P

b)

- 1)2 = (-1 7(P + 1lt2 (mod P).

Find all solutions for the congruence

i) 589 x = 209 (mod 817)

ii) 64 x = 83 (mod 105)
iii) 57 x = 87 (mod 105)
iv) 20 x = 30 (mod 4).
OR
P.T.O.

M22912

c)

IilllililHlffiriltflilffiffiilil

Prove that every integer greater than 1 can be expresses as a product of

primes.

d) Prove that an integer is divisible by 3 if and only il lhe sum of its digits is
divisible by 3. Also prove that an integer is divisible by 9 if an only if the sum
of its digits is divisible by 9.

lll. a) Explain in detailthe

shift row transformation, mix columns transformation

and add around key transformations with suitable examples.

15

OR

b) Explain in detailthe different security services.

c) Write notes on transposition techniques with examples.
tv. a) Explain in detailSHA-512 with suitable examples and diagrams.

9
6
15

OR

b) Explain RsAalgorithm
V.

a)

in detailwith suitable examples.

Explain the lP security architecture in detailwith suitable diagrams.

GEC WAYANAD

15
15

OR

b) Explain in detailthe Multipurpose lnternet Mail Extension (MIME).

15

1|ililililil ilil il]t

ililililt

Reg. No.

ilil

M 22913

ilt

Name :

Eighth Semester B.Tech. Degree (Regular/Supplementary

Part Time) Examination, April 2013
(2007 Admn. Onwards)
2K6CS 803 : ARTIFICIAL INTELLIGENCE
Timq 3 Hours

lncluding

Max. Marks: 100

lnstruction: Answer all questions.

l.

a) Write notes

on the main themes that support agent oriented and emergent

view of intelligence.
(8x5=40)
b) Write notes on alpha-beta procedure with suitable examples.
c) List out the semantics of propositional calculus.
d) Write short notes on frames.
e) List out the tasks of connectionist approach of machine learning.
Write short notes on back propagation in connectionist learning with suitable
diagrams
g) Write short notes on how facts and rules are represented in PROLOG.
h) Write notes on atoms, list and strings in LISP with suitable examples.

f)

GEC WAYANAD
examples.

ll. a) Explain in detail the production systems with suitable

OR

b) Explain in detailthe

A* algorithm with suitable

examples.

15
15

lll. a) Explain the semantics of predicate calculus in detailwith suitable examples. 15

OR

b) Explain in detailthe semantic

lV.

nets with suitable diagrams and

a) Explain in detailcandidate elimination algorithm

examples.

for searching the concept

space.

b)

V.

15

OR
Explain in detail with suitable examples on how production systems can be
used for data driven reasoning and also how to implement heuristics and
control in rule based expert systems.
15

a) Explain in detail how Breadth First Search is done in pROLOG.

b)

15

OR
Explain with the help of LISP program, the creation of Pascal's triangle.

15
15

lillllil

ilt

illfi il]t

il]{]t ]]

Reg. No.

Name

M 22914

ffit

Vlll Semester B.Tech. Degree (Reg./Sup.- lncluding Part Time)

Examination, April 2013
2K6 CS 804 -

(2007 Admn. Onwards)

ADVANCED COMPUTER ARCHITECTURE

Time : 3 Hours

Max. Marks : 100

lnstruction : Answer all questions.

(8x5=40)

l. a) Write

notes on the different computing markets which arrived as a result of

changes in computers.

b) Write notes on DLX floating point pipelining with suitable diagrams.

c) Write notes

GEC WAYANAD

on the limitations of instruction level parallelism.

d) Write notes on the controldependencies

in instruction level parallelism.

e) Write notes on how cache performance is measured. Give examples.

f)

List out certain techniques for faster address translation. Give examples.

g) Differentiate

between connection oriented and connectionless communication.

Give examples.

h) Differentiate between a centralised memory multiprocessorand

a distributed

memory multiprocessor system.

ll. a)

Explain in detail on how the performance of a system is measured and reporting

of the same is done. Give suitable

examples.

15

OR

b) Explain the instruction set architectures

in detailwith suitable

examples.

15

P.T.O.

M22914

Iillllillllffiffiilllil1t]llilil

lll. a) Explain in detailthe hardware based speculations in instruction level

parallelism. Give suitable examples.

15

OR

b) Write notes on vector processing. With the help of diagrams and examples
explain the vector architecture and its features.

lV. a) Explain

15

in detailthe below given techniques used for reducing cache miss

penalty with examples

15

i) Giving priority to read misses over writes

ii) Merging write buffer
iii) Victim caches.
OR

b) Explain in detailthe cross cutting issues in the design of memory hierarchies.

15

V. a) Explain in detail the structure and properties

examples and

diagrams.

of a simple network with suitable

15

OR

GEC WAYANAD

b) Explain in detailwith suitable diagrams and examples, the distributed shared

memory

architecture.

15

lfflllililillllllllllllllllllllllllll
Reg. No.

'

M 2291s

Name : .............

Vlll Semester B.Tech. Degree (Reg./Sup-lncluding Part Time)

Examination, April 2013
(2007 Admn. Onwards)
2KG CS 805 (Dy2KG lT 80s (E) : MANAGEMENT INFORMATION
SYSTEMS
Time: 3

Hours

Max. Marks : 100

lnstructions : Answer all questions.

l.

a) What are the personalfactors influencing problem solving ?

b) Explain how formal information system is different from informal information
system.

c)

Differentiate program file with data file.

GEC WAYANAD

d) What do you mean by application software ?

e)

Explain Simon's phases of decision making.

f)

What do you mean by unstructured decision making ?

g) Mention
h)

the use of information system in human resource management.

Discuss the ethical issues in information system

ll. a) Explain

management.

(8x5=40)

the strategic use of lnformation Technology.

OR

b) Explain how MIS is usefulto

different levels of management.

15

lll. a) What are the advantages of a database systems approach ?

OR

b) What arethe characteristics of a good programmer

15

P.T.O.

M 2291 5

lV. a)

lllilil

ilt illfl ililt

ill] ilil

1ll

il]

What are the role of decision support system in decision making ?

OR

b)

Does the availability of marketing research softwares enables smallfirms to

15
conduct their own research projects ?

Explain.

V. a) Explain the security measures that can prevent misuse ol 17 resources.

OR

b) What are the factors for successful implementation of a system

GEC WAYANAD

15

ilutffifr|il||ilHflilffiffiffi
Reg. No.
Name

M 22916

............

Vlll Semester B.Tech. Degree (Reg./Sup. - lncluding Part Time)

Examination, APril 2013
(2OOT Admn. Onwards)
2K6 CS 805 (F) : DATA MINING AND DATA WAREHOUSING

Max. Marks: 100

Time: 3 Hours

lnstruetion: Answer all questions.

L

a) With the help of a neat diagram, explain the architecture of a typical data
mining system.

b) What are the features that distinguish data warehouses from other data
repository systems ? Explain each feature.

c)

Write notes on APRIORI algorithm for finding lrequent item set using candidate
generation.

GEC WAYANAD

d) Write notes on tree pruning with suitable examples.

e) Write notes on the interval scaled variables in cluster analysis with suitable
examples.

f)

Write notes on DENCLUE density based clustering method with suitable

example.

g) Write brief notes on mining time series data.

mining.
ll. a) Explain in detailthe data mining task primitives.
b) Explain in detailthe major issues in data mining.
h) Write notes

(8x5=40)

on text data and web data

OR

c)

Explain in detailthe following data pre-processing techniques in detail

i) Data cleaning
ii) Data integration

and

transformation.

'

15

P.T.O.

M 22916

lililil1 llt

til[

ilt

ill$

ffi

llll

llll

lll. a) Explain in detailthe mining of various kinds of association rules with suitable

examples.

15

OR

b) Explain in detail the support vector machines with suitable examples.

lV.

a) Explain in detail, K-means and K-medoids based classicalpartitioning

15

methods.
15

OR

b) Explain in detail the two grid based clustering methods (STING and WAVE
cluster) in detailwith suitable examples.
V.

a) Explain in detail the text data mining with suitable examples.

15
15

OR

b) Explain in detail with the help of an example on how APRIORI algorithm can
be implemented using WEKA.

GEC WAYANAD

15

M 22917

rililr]lilnmllHililril]lffitlll

Reg. No.
Name

Vlll Semester B.Tech. Degree (Reg./Sup. - lncluding Part Time)

Examination, April 2013
(2007 Admn. Onwards)
2KO CS 805 (G) : ADVANCED MOBILE COMMUNICATION SYSTEMS
Time: 3

Hours

Max. Marks : 100

lnstruction : Answer all questions.

l.

(8x5=a0)

a) Write notes on antennas used in wireless communication with suitable

diagrams.

b) Write notes on cellular systems and its advantages.

c) Write notes on 802.11 protocolarchitecture with suitable diagrams.

d) Write notes on adaptive differential pulse code modulation.
e) Write short notes on propagation models.

f)

GEC WAYANAD

Explain howyou getthe co-channel interference ratio of a hexagonalcell

cellular system.

s) Write notes on data gathering in WSN.

h) Write notes on any routing algorithm in WSN.

ll. a)

Explain in detailthe different types of spread spectrums. Also write shorl

notes on its coding and error control.

15

OR
b) Explain in detailthe wireless local loop and cordless systems.

lll. a)

Explain 802.11 MAC in detailwith suitable block diagrams.

15

OR

b)

Explain in detail the fonruard CDMA channel, the reverse CDMA channels and
WCDMA channels with suitable block

diagrams.

15

P.T.O.

ilffiilflrffitruffiffiilil||l

M22917

lV. a)

Explain the facilities engineering in detailwith suitable examples.

15

OR

b) Explain in detailthe GSM logicalchannels

and frame structure with suitable

15

diagrams.

V. a) Explain in detailthe WSN architecture with suitable diagrams,.

15

OR

b) Explain in detail, the node localization, clock synchronization

and power

management of WSN in detail.

GEC WAYANAD

15