(An Autonomous Institute)

Second Year B.Tech. (Information Technology)

END SEMESTER EXAMINATION: SEMESTER-I NOVEMBER-2018
DISCRETE MATHEMATICS (31T201)

Exam Seat Number

Dateand Time: Saturday, 17/11/2018, 02.30pmto 04.30pm

Max Marks 50
branch etc.
IMP: Verify that you have received question paper with correct course, code,
The answers may not be
dions: i) All questions are compulsory. Writing question number is compulsory.
assessed if question number is not written. Assume suitable data uwherever necessary
ii) Figures to the right of question text indicate full marks.
ii) Mobile phones and programmable calculators are strictly prohibited.
iv) Except Exam Seat Number writing anything on question paper is not allowed.

Exchanse/Sharingafstationerv calculatar etc nat allawed Marks

n the right of marks indicates course outcomes (only for faculty use).
4CO
A) Find the cquivalent formula for (P-»Q)R that contains only

-OR-
Show the cquivalence (Without using truth table)

(PAQ)>GPV(GPYg)4a(Pv2)
1 B) What is cquivalence relation? Provec that relation 'Congruence
modulo' is an equivalence 3 CO
relation.
3CO2

1 C) Draw the Hasse diagram for the Poset (PA).C)Where A-t1.2.3,4)

C02
*
be the operation Q defined by a*b 4
2 A) Consider the set Q of rational numbers, and let
on

atb-ab
a. Is (O.*) a semigroup? 1s it commutative
b. Find the identity element for
c. Do any of the elements in Q have an inverse? W hat is
it?

Answer for each of these graphs Is it planar? Is it bipartite? Justify Answer 4 CO3
2 B)

Ca

(b)
4 CO3
Q2 C) For following graph,
i. Find Euler path or Euler Circuit if it exits.
i. Find Hamiltonian Path or Hamiltonian circuit if it exits.
 St ath
Warshalls Algorithm
tor folloiwi Path.
Floyd
Q3 A) Apply
2

3 6

given below:
o r the adajancency representation ofthe
graph
B)
D:E; E:D; F: null)
G=[A:D. F, B: B: C, D; C: E:.
. Draw Graph
ii. Give linked representation of the graph.

Q3 C) What are the applications of Minimum spanning tree? Find minimum cost spanning tree
ree
of the following graph using kruskals algorithm.

10
F

B
D
H
G E

Q4 A) Solve following: (Three marks

i.
each)
Factory Fl produces 1000 article, 20 out of them being defective; Factory F2 produces
9
4000 articles, 40 out of them
being defective and Factory F3
out of them
being defective. From the stock of produces 5000 articles, 50
all these articles one
is found to be defective.
What is the of them is chosen and
i. A coin is probability
that it is from factory
F1.
weightedso that
P(Head)=
3/4 and
P(Tail)= 1/4. The coin is
times. Let X denotes the tossed three
number of head that
of X (b) Find the appear. (a) Find the
ii. When two dice are
expectation E(X). probability distribution
rolled, find the probability of getting a greater
die than the one on the
second, given that the sum should number on the first
equal 8.
04 B) How many
vOwels
arrangements of the letters of the word
are never
together. (1i) if the vowels are to 'BENGALI can be made (G) if the
-OR occupy only odd 3
A student has to
places.
answer 10
there are 6 questions,
choosing at ieast 4 from each
questions in Part A and 7 in Part B, in how many of Parts A and R If
10 questions?
ways can the student choose
---
 WALCHAND COLLEGE OF ENGINEERING, SANGL.
ESE
An Autonomus Instiute)
Second Year B.Tech. (Information Technology)
END SEMESTER EXAMINATIOON: SEMESTER-I NOVEMBER-2018
DATA STRUCTUURES (3IT 202)

Exam Seat Number:

Date and 1 imme: Tucsdayv, 20/11/2018. 02 30pm to 04.30pm
Max Marks: 50
IMP: Verify that you have received question paper with correct course, code, branch etc.
tctions: i) All questions are compulsory. Writing question number is compulsory. The answers may not be
assessed if question number is not written. Assume suitable data wherever necessary.
ii) Figures to the right of question text indicate full marks.
) Mobile phones and programnmable calculators are strictly prohibited.
4
iv) Except Exam Seat Number writing anything on question paper is not allowed.
ExchanoeSharine ofsiationerv.calculator.ctc. natallawed.
fon the ripht of marks indicates course outcomes (only for faculty use)
Marks
1 A) Discuss the algorithm cfficiency 2 CO
Q1 B)
List applications ofstack and Queue? Using stack write an algorithm to determine 4 CO2
whether given sring is palindrome
C)What are the different types of linked list? Write aC function to count no of elements 4 CO2
present in single linked list?

Q2 A) A binary tree has cight nodes. The preorder and post order traversal ofthe tree are given 2 CO2
below draw the tree Preorder: FECHGDBA Postorder: FCEABHDG
Q2 B) Draw the expression tree and find infix and prefix expressions for the following post fix 2 CO3
expression AB*CD/+EF-*
02 C) Create a binary search tree using following data entered as sequential list 3 CO2
80 70 66 56 33 23 14 107 Insert 44 and 50 into the tree
02 D) Show the resulting heap after 33,22 and 8 are added to following heap 3 CO2
50 30 40 20 10 25 35 105
02 E) Write a note on Multiway trees 2 CO3

03 A) An anray contains the elememts shown below.Using binary search algorithm trace the 3 CO3
sieps followed to find 88. At each iteration including the last,show the content of first,last
and mid 18 13 17 26 44 56 97 88
03 B) Using the modulo division method and lincar probing store the keys shown below in an 3 CO2
array with 19 elements. lHow many collisions occurred?what is the density ofthe list after
all keys have been inserted?
562 456 362 145 576 245 467 645 534
93 C) An array contains the elements shown below. Using quick sort, sort the elements 3 CO2
andshow the contents of the array after the first pivot has been placed in correct location
cach pass 44 78 22 7 98 56 34 2 38 35 45
Q3 D) An array contains the elements shown below. Show the contents of the
array after it has 3 CO2
gone through a one increment pass of the shell sort.the increment factor is k=3
23 3 7 13 89 7 66 26 44 18 90 98 57
Q4 A) In the graph in figure i.Give DFS, BFS ii.Give adjacency matrix representation ii.Give
ii.Give
the adjacency list representation iv. Draw the spanning tree that can be found in the or.
graph

Q4 B) Wrire note on file

organization andoperations on the file
Q4 C) Discribe the various method for
resolving hash collision
 WALCHAND COLLEGE OF ENGINEERING, SANGLI.
ESE
(An Autonomous Institute)
Second Year B.Tech. (Information Technology)
END SEMESTER EXAMINATION: SEMESTER-I NOVEMBER-2018
DATA COMMUNICATION AND NETWORKING (31T204)

Exam Seat Number:

Date and Time: Saturday. 24/11/2018, 02.30pm to 04.30pm
Max Marks: 50
IMP: Verify that you have received question paper with correct course, code, branch etc.
uctions: i) All questions are compulsory. Writing question nunmber is compulsory. The answers may not be
assessed if question number is not written. Assume suitable data wherever necessary.
ii) Figures to the right of question text indicate full marks.
i) Mobile phones and programmable calculators are strictly prohibited.
iv) Except Exam Seat Number writing anything on question paper is not allowed.
ExchangelSharino of statianerv calculator etc nat allowed
on the right of marks indicates course outcomes (only for faculty use).
Marks
1 A) Draw and Explain Logical connections in ATM network. 4 CO3
1 B) Define (Stricthly in one sentence): 4 CO3
1) Virtual Packet Switching 2) Circuit Switching 3) Frame Relay 4) Congestion
i C) Answer any one with reference to below graph: 5 CO3
1.Write Dijkstra's Algorithm and find the shortest path from source to all other nodes.
-OR-
2.Write Bellman Ford Algorithm and find the shortest path from source to all other
nodes.

D) Consider the Computer 'A' generates a packet with login on to www.facebook.com. CO3
Elaborate the journey of the packet from Application layer to Physical layer with header
concatenation.

Q2 A) In a wireless cellular system how Frequency Reuse helps in increasing the capacity of the 4 CO3
system.
Q2 B) What happens when load increases in the network? Plot a graph of packet delay and 5 CO3
throughput versus load to illustrate network performance.
2 C) Discuss mechanisms involved in Congestion Control. 4 CO3
Q2 D) Consider Machine 'A' wish to communicate packet I to packet 6 to Machine H' 3 Co3
using
packet switching as shown in figure:
 where the enl
networks
computer
choice for large
Which topology
is a good management:
A) easy
divided into small parts for

1.Startopology
2.Tree topology
3.Mesh topology o v e r the area they cover 4
networks designed to operate
computer
Q3 B) LISt some of the types of
electrical
from data link layer to
data packets
Which layer is responsible for converting
functions in OSI model.
signals?. Write the layers and sender sends
the irames and 4
of and Wait Protocol where the
9 D) Draw the flow diagram Stop
waits for feedback from the receiver.
MutlipleXing
of Frequency Division
Q3 E) With a neat diagram summarize the concepts
(FDM).What is the use of Gaurd Bands?
 (An Autonomous Instilule)
Second Year B.Tech. (Information Technology)
END SEMESTER EXAMINATION: SEMESTER-I NOVEMBER-2018

LINEAR ALGEBRA (3MA204)

Exam Seat Number:

02.30pm to 04.30pm
Day, Date and Time: Thursday, 15/11/2018, Max Marks: 50
code, branch etc.
IMP: Verify that you have received question paper with correct course,
All questions are compulsory. Writing question number is compulsory. The answers may not be
Instructions: 1)
assessed if question number is not written. Assume suitable data wherever necessary.
) Figures to the right of question text indicate full marks.
ii) Mobile phones and programmable calculators are strictly prohibited.
iv) Except Exam Seat Number writing anything on question paper is not allowed.

Exchanae/Sharina af statianerv calculatorete not allawed

Text on the right of marks indicates course outcomes (only for faculty use). Marks
4 CO1
Q1 A) Find reduced row echelon form of matrix [2 2-1 0

COl
Q1 B)Explainthe concept of partitioned matrices. that CO2
Q1 C) Find the general flow pattern in the network shown in the figure. Assuming
the flow must be in the direction indicated, find the minimum flow in the
branches denoted by x2, X3, X4 and xs. 30 40
80

D
60
20
-*******

COl
Show that
Q2 A) Let V be a space of the functions f: R->R.
vector
function with 0(x)=0
W={ f(x) |f(-x)-fx)} is subspace of V.(Given 0 is a zero
, for all x) their dimensions and verify Rank- 7 CO2
Q2 B) Pind basis for NulA, ColA and RowA. Also find 5 6
Nullity Theorem. Where A= 3-214
0 -1
l2 3 5
4 CO1
'. that the eigen values of
Q2)Find the eigen values of matrix A and also of A Verify
values of A. Where A
A are reciprocal ofeigen

8CO2
find the modal matrix P and verify that
Q3 iA) For the matrix A given below,
2
P'AP D. Where A
3

COl
Gram -Schmidt process to transform the basis
set
3 B) Apply
1 ,1 , 1 - , 0 ) (1,2, 1)} in to orthonormalbasis. COL
Q3 C)Let f-f(x),g=g(x) be two
functions in the vectore space V of continuous 4

defined on [0, 1]. Define

functions .a)=f(x) »*) dx.
Show that this formula defines inner product.

(P.T.
 W
of it along v .

Q3 D) (a) Write formula of orthogonal projection

V. END S
(b) Define basis of vector space value of matrix
then what is the eigen
()Iis an eigen value of matrix A
adjoint of A.
and Time:
, Date

IMP: Verif
ructions: i) All ques
assessed i
ii) Figuress
ii) Mobil
iv) Excep
Exchang=
t on the right of mark

01 A) Design
assumpi
Q1 B) Discuss

Q2 A) Give fi-
cycles
Q2 B) Discus-

Q3 A) How te
Q3 B) How s
Q3 C) Givet
progra

Q4 A) Give
Q4 B) What
addre
Q4 C) How

Q5 A) Expl=
exter

Q5 B) Expl
 WALCHAND COLLEGE OF ENGINEERING, SANGLI.
(An Autonomous Institute) ESE
Second Year B.Tech. (Information
END SEMESTER Technology)
EXAMINATION: SEMESTER-I NOVEMBER-2018
MICROPROCESSORS (31T203)

Exam Seat Number:

av. Date and Time: Tuesday, 27/1 1/2018, 02.30pm to 04.30pm
Max Marks: 50
IMP: Verity that you have received
question paper iswith
structions: i) All questions are compulsory. Writing question number
correct course, code, branch etc.
compulsory. The answers may not be
assessed if question number is not
written. Assume suitable data wherever
necessary.
i) Figures to the right of question text indicate full marks.
ii) Mobile phones and programmable calculators are
strictly prohibited.
iv) Except Exam Seat Number writing anything on question paper is not allowed.
Exchanoe/Sharing of stationerv calculator ete not alloed
Xt on the rightof marks indicates course outcomes (only for faculty use). Marks
Q1 A) Design the Binary Coded Decimal to Excess-3 code. Assume suitably. Mention your 4 CO
assumption.
01 B) Discuss about sign extension in of 2's
case
complement system. 2 CO
Q2 A) Give five instructions each of 8085 microprocessors according to the number of machine 4 CO2
cycles they take.
Q2 B) Discuss about flags of 8085 & there importance in assembly language 3 CO2

03 A) How to implement STACK in 8085? CO2

Q3 B) How subroutines are designed in 8085 assembly language programming? 4 CO2
Q3 C) Give the general framework for loops & counters in 8085 assembly language 2 CO2

programming.

Q4 A) Give the design of programming model of 8086. CO3

Q4 B) What are addressing modes in assembly language programming? Explain any 6 CO3
addressing modes of 8086 microprocessor.
04 C) How 20 bit address is generated in 8086? 2 CO3

Q5 A) Explain the memory management terms: swapping, internal memory fragmentation, 10 CO3
external memory fragmentation, first fit, and best fit algorithm.
OS B) Explain Paging & segmentation. 5 CO3