B.E.

II EXAMINATION NOV-DEC, 2017 17117

INFORMATION TECHNOLOGY
2ET455
MICROPROCESSORS & ALP
Time:3Hr Max.
s Marks: 10
0
Min.
Marks: 3 5
Note: All questions are compulsory. Attempt any two parts from each
question. Assume suitable assumption if necessary.

Q.l(a) Explain the following instructions in brief: 10

(i) XRA A (ii) POP B (Hi) MVIA, E6H (iv) RAL
(b) Draw and explain the architecture of 8085 microprocessor in brief. 10
(c) Draw the timing diagram of instruction MOV A,B and IN 20H. 10

Q.2(a) Explain the following instruction with flag status: 10

(i) PUSH PSW (ii) POP PSW
(b) Write a program to add two 16 bit numbers. Store the result (sum) at 10
memory location 4020H, 4021H and carry at 4022H.
(c) Explain the peripheral and memory mapped interfacing techniques. 10

Q.3(a) Write short note on 8259 interrupt controller. 10

(b) Write short note on interrupts available in 8085. 10
(c) Interface an 8 bit D/A converter with the 8085. Write a program to
generate continuous ramp waveform. 10

Q.4 (a) Explain the block diagram of 8255 in detail. 10

(b) Explain the 8253/8254 programmable interval tinier in detail. 10
(c) Write short note on 8155. 10

Q.5(a) Write short note on RS-232C. 10

(b) Draw the block diagram of DMA controller. Explain its working in 10
Master and Slave mode.
(c) Draw the block diagram of 8279 keyboard/display interface. Explain its 10
operation in brief.
 17380
II B. E. Examination November-December'2017
Information Technology
2IT403: Business Data Processing
Duration: 3 Hrs. Maximum Marks : 100
Minimum Pass Marks: 35
Note: Attempt all questions & each question carries equal marks. Answer any two part of each question.
Make suitable assumptions if necessary. Use only COBOL85 or higher version for programming
questions.
Q. 1 (a) What is System? Define. Also define Business Systems and Business Processes with 10
suitable examples.
(b) What is a report'.' What are the types of reports? Explain with suitable example. 10
(c) Differentiate between batch, online and real-time transaction processing systems with 10
suitable example.

Q. 2 (a) Explain following COBOL85 in-built functions with suitable example; 10

i. ANNUITY
ii. CURRENT-DATE
iii. PRESENT-VALUE
iv. INTEGER-OF-DATE
v. DAY-OF-INTEGER
(b) Explain the use of following in COBOL85, with suitable example: 10
i. ACCEPT
ii. BLANK WHEN ZERO Clause
iii. SIGN IS
iv. AFTER ADVANCING
v. CONDITION-NAME
(c) Show the use of following COBOL85 control structures, with suitable example: 10
i. EXIT
ii. PERFORM VARYING
iii. PERFORM TIMES
iv. PERFORM paragraph-1 WITH TEST AFTER UNTIL condition-!
v, PERFORM paragraph-! THROUGH paragraph-2

Q. 3 (a) Write formats of OPEN statement and various file-opening modes. 10

(b) Given STOCK-FILE for the XYZ Supermarket. The key field is the SKU (Stock Keeping 10
Unit). Code the entire PROCEDURE DIVISION only if
a) Records are to be sorted in ascending SKU order, and
b) Records are to be counted after sorting. Use an OUTPUT PROCEDURE.
(c) Show with example implementation of Serial and Binary search in COBOL 85 or higher 10
version.

Q, 4 (a) Who are the stakeholders in systems development? Explain the role of system analyst. 10
(b) What is CASE? Explain with example. Also describe features of any two CASE tools 10
available in the market,
(c) What are the 10 fundamental principles of systems development? Explain. 10

Q. 5 (a) Explain the use of Decision Table and Decision Trees requirements gathering. 10
(b) Construct an E-R diagram for a hospital with a set of patients and a set of medical doctors. 10
Associate with each patient a log of the various tests and examinations conducted.
(c) Construct a DFD for the Hospital Information System, with making suitable assumptions, 10
which shows the details of-
• Context - Level, Level 0 and Level 1
 Roll no.
17382
B.E. II EXAMINATION NOV DEC 2017
IT Engg.
2IT451: Discrete Structures

Duration: 3 Hrs] [Max. Marks: 100

[Min. Pass Marks: 35

Note: Attempt any TWO parts from each question. All questions carry equal marks.

Q.I. (a) State and prove the principle of Inclusion-Exclusion. Find the number of elements in (10)
AiUA 2 UA 3 if there are 100 elements in Ai, 1000 in A2 and 10,000 in A3, if
(i) AicA2and A2CA3.
(!i) The sets are pairwise disjoint.
(iii) There are two elements common to each pair of sets and one element in all 3
sets.

(b) ~n(n + l)" 2 (10)

Using mathematical induction prove that I 3 +23 + 33 + +n 3 = , Vn.
2
(c) (i) Check whether the following is a tautology or not: (05)
[(pvq)A(~pvr)]->(qvr)
(ii) Write the converse, inverse and contrapositive of the following implication:
(05)
"Iff have enough money, then I will buy a car and 1 will buy a house".
Q.2. (a) (i) Construct the Hasse diagram for relation "a divides b" on the set {2, 3, 5, 10, 11, 15, (05)
25}.
(ii) State and prove the Generalized Pigeon Hole principle. Find the minimum number
of elements that one needs to take from the set of numbers from 1 to 12, to be sure that ^ '
two of the numbers add upto 13.
(b) Use hashing function h, which takes the first three digits of the account number as one (10)
number and ihe last four digits as another number, adds them and then applies mod 59
function. Assume that there are 7500 customer records to be stored using this hashing
function. Then (i) How many linked lists will be required for the storage of these
records? (ii) To which list the following customer account should be attached:
3759273, 7149021, 5167249, 2561384, 6082376, 4984620?
(c) Use Warshall's Algorithm to find the Transitive Closure of the following relation R on (10)
the set A = ( 1 , 2 , 3 , 4 ) :
R « {(1, 1), (1, 4), (2, 1), (2, 3), (3, 1), (3, 2), (3, 4), (4, 2)}

Q.3. (a) Evaluate the following prefix expression: (10)

+ ~ t 3 2 t 2 3 / 6 4 2

(b) Use Dijkshtra's algorithm to find the shortest path in the following weighted graph: (10)
b - d
4,
8,

PTO
 (c) Use Prim's Algorithm to find a minimum spanning tree for the following weighted (10)
graph:

Q.4. (a) Use generating function to solve the recurrence relation an - 4an-i + 3an-2 - 0, n > 2, (10)
with ao - 0 and ai - 4.
(b) Find the solution to the recurrence relation an - 2an-i + an-2 - 2an-s, for n > 3, with the (10)
initial conditions ao = 3, ai - 6 and 32 = 0.

(c) Let X = {1, 2, 3, 4, 5, 6} be the universal set and A and B be two fuzzy sets given by (10)
0 0.1 0.3 0.5 1 0.2 0 0 0.2 0.4 0.6 O8J
I T 2 ' 3 ' 4 '5' 6 '2' 3 ' 4 ' 5 ' 6 j
Then which of the following equalities holds?
(i) ( A n 6 ) ' = A ' u B ' (ii) A+ A.B=A (iii) (A-B)u (AnB)= B.

Q.5. (a) Determine whether the set G = {0, 1, 2, 3, 4, 5} is a group under the operations of (10)
(i) addition modulo 6 and (ii) multiplication modulo 6.
(b) Prove that in a distributive lattice, if an element has a complement then this (10)
complement is unique.
(c) Find the product-of-sums expansions of the Boolean function: (10)
F(x,y, z)=xy.
*****
Roll No.:- 17384

B. E. II Examination Nov-Dec 2017

Information Technology
2IT453: System Programming (EX Old)

Duration: 3 Hrs Max. Marks: 100

Total No. of questions: 05 Min. Marks: 35

Note: All questions are compulsory. Attempt any two parts from each question.
Make suitable assumptions if necessary. Answer should be to the point.

Ql. A. What is Data Structure? Explain criteria for selection of data 10

structure in language processing.

B. Give the classification of grammars on the basis of the nature of 10

productions used in them.

C. What do you mean by System Program? Explain the difference 10

between application software and system software with suitable
example.

Q2. A. What is Macros? Explain the need of Macros with syntax and 10
assembly example.

B. Write an assembly language program for problem of reading N 10

numbers and finding their sum.
Using this program explain the task of an assembler.

C. Explain the purpose of Mnemonic table and Symbol Table in 10

assembler design.

Q3. A. What are the different activities performed by lexical analyzer? 10

Also explain Token, Lexeme, and Pattern.

B. What do you mean by parsing? Explain top down parsing with 10

suitable requirement in compilation process.
 C. Write down rules to compute FOLLOW(A) for a grammar G, Where 10
A is a nonterminal. Use specific symbols and notations while writing
rules. Also write an algorithm for constructing SLR-parsing table.
Algorithm should include input, output and method.

Q4 A. Write the purpose of Code hoisting, dead code elimination, 10

eliminating common sub expression and loop unrolling with
programming examples.

B. Write short notes on: 10

I. Frequency reduction

II. Common subexpression elimination

III. Loop optimization

IV. Bootstrapping

C. What do you mean by code optimization? How it improve the 10

efficiency of execution? Explain why it is option in pass structure of
compiler.

Q5. A. Write short notes on: 10

1. Overlays
2. Shared Library

B. What do you mean by Linker and Loader? Explain their purpose 10

with suitable block diagram.

C. Explain Object Module of a program and its components. 10

 Roll No 1733?

BE-II Examination Nov-Dec 2017

Information Technology
AIR4C1 Numerical & Optimization Techniques

Duration: 3 Hours Max. Marks [GO]

Note: Attempt all the 5 questions with any two of (a) , (6) and (c) from each.

Q.I (a) Find the greatest negative root, correct to four places of decimal, of In (x 4- 2) — x cos x = 0 using
Newtori-Raphson's method. [6]

(6) Perform six iterations of Gauss-Seidal method to solve [6]

-3K + Gy - 2z = -4; 9x + 2y + 4z — 5; 4x + 2y - 5z = 2.

dy x -j- sin j/
(c) Find y (0.80) in two steps from — = , y (0.20) = 1.2 using R — K method of fourth
dx 2y + ex
order. [6]
Q.2 (a) A simply supported beam carries a concentrated load P (Ib) at its mid point. Corresponding to
various values of P, the maximum deflection Y (in) is measured. The data are given below-

P 100 120 I 140 160 180

Y 0.45 0.55 j 0.60 0.70 0.80

Find the rate of change of deflection at 173 (Ib) . [6]

(b) Using Lagange's interpolation formula, find the pull P required to lift a load W — 105 kg by
means of a pully block from the following table- [6]

W 50 70 110 130 160

P 12 15 21 23 26

f'1 In (x -f- 1)
(c) Evaluate the integral / — d x using Simpson's 1/3 and 3/8 rules taking 11 ordinates. [6]
JQ 1 + X2

Q.3 (a) A firm making castings uses electric furnace to melt iron with the following specifications-

Minimum Maximum
Carbon 3.20% 3.40%
Silicon 2.25% 2.35%

Specifications and costs of various raw materials used for this purpose are given below-
**'•:

Material Carbon % Silicon % Cost (Rs.)

Steel scrap 0.4 0.15 850/ionne
Cast iron scrap 3.80 2.40 900/fonne
Remelt from foundry 3.50 2.30 500/tonne

If the total charge of iron metal required is 4 tones, formulate the problem as an LPP to find the
weight in kg of each raw material that must be used in the optimal mix at minimum cost. [6]
V

(b) Using graphical method solve Max Z = 5xi -j- 3x2,Subject to [6]

4xi + 5x2 < 1000; 5xi + 2x2 < 1000; 3xa + 8x2 < 1200; xj, x 2 > 0.

(c) Solve Max Z = 4xa + 3x2 -f 6x3,Subjcct to [6]

2zi -f- 3x2 + 2x3 < 440; 4a;i + 3x3 < 470; 2xi + 5x2 < 430; Xj, X 2 , x 3 > 0.
Q.4 (a) Write the mathematical (LPP) formulation of the assignment and transportation problems. [6]

(6) Four jobs are to be done on four different machines. The cost (in Rs.} of processing the ith job on
the j th machine is given below. Assign the jobs to different machines so as to minimize the total
cost. [6]
Machines
Mi M2 M3 M4
15 11 13 15
Jobs 17 12 12 13
14 15 10 14
16 13 11 17

(c) A company has three cement factories at Ci, C2 and C3 which supply cement to four projects
located at towns Pj, P2, P3 and P4. Each plant can supply 6, 1, 10 truck loads of cement daily
respectively and the daily cement requirements of the projects are respectively 7, 5, 3, 2 truck loads.
The transportation costs per truck load of cement (in hundreds of Rs.) from each plant to each
project site are as follows:
Warehouses
P! P2 P3 P4
Factory 2 3 11 7
C2 1 0 6 1
C3 5 8 15 9

The initial allocations are xn = 1,0:12 = 5, x24 = 1, #31 = 6,2:33 — 3, £34 — !• Determine
whether this is an optimal solution. If not, find the optimal distribution so as to minimize the total
shipping cost. [6]

Q.5 (a) (i) Solve the game with the following payoff matrix- [3]

A A2
A3

(ii) Construct the recurrence functions using dynamic programming approach to solve Max Z =
xi.xt-x$....xn', Subject to x\f x2 + x3 -+- .... + xn == c, Xi > 0. [3]
(6) Obtain the optimal strategies for both persons and the value of the game for zero-sum two-person
game whose payoff matrix is as follows- [6]

1 -3
3 5
i 6
4 1
2 2
-5 0

(c) Using dynamic programming approach to solve

Maximize Z = 4- 4x3

subject to
+ 2x 2 -f- xs < 8, > 0.

X X X **X * * X
 .

17372
IIBE. EXAMINATION NOVDEC'2017
INFORMATION TECHNOLOGY
ITR3C3 Data Structures
Duration: 3 Hrs Max. Marks: 60

Note: Attempt any two-sub part of each question. Each question carries equal marks. Assume
suitable data if necessary. Use proper comments in your code/ algorithm to enhance the
readability.
.
Ql. (a) Sort the following data in ascending order using Bubble sort and write the 6
intermediate values' sequences after each iteration (step). Write program to
implement Bubble sorting technique. Data: 8,6, 2, 9, 1, 7.
(b) Compare Array and Link list on following issues: 6
(i) Accessing of the data (ii) Insertion of element (iii) Deletion of element
(c) Explain Hashing search technique with suitable example. Mention the various 6
collision resolution techniques used in hashing.

Q2. (a) Write a program to represent a sparse metrics using singly link list (each node 6
should have row and column information of non-zero elements in sparse metrics).
(b) Consider a singly link list called List having numerical information. Write a 6
program to find and delete all nodes having repeated values (store only first
occurrence).
(c) Design a structure for two-way link list and write a program for following 6
operations:
• To insert an element at middle position.
• To delete an element from middle position.

Q3. (a) Consider an array for maintaining two stacks so that all odd number stored in one 6
stack and even numbers are stored in another stack. Stack (have even data) start
from one end and another stack (have odd data) start from other end of an array.
Write a program to implement push and pop operation for storing data in
appropriate stack.
(b) Write an algorithm; program to convert infix notation to Postfix notation. Convert 6
following infix notation into Postfix notation.
Infix Notation: A+(B*C-(D/E-F)*G)*H
(c) What is recursion? Write recursive and non-recursive program /algorithm for tower 6
of Hanoi problem.

Q4. (a) Write an program to perform the following operation in given binary search tree 6
(assuming linked implementation of binary search tree).(Any two )
• No. of leaf nodes.
• Number of nodes with exactly one child
• Find the address of parent node to specific node
(b) (i) A binary tree T has 9 nodes. The Inorder and Preorder traversals of T yield the 6
following sequences of nodes and draw the tree:
Inorder : E A C K F H D B G
Preorder : F A E K C D H G B
(ii) Draw the Binary Search Tree using following sequence :
14 7 6 2 11 4 8 13 10 5 19 9 18 24 3 12 20 21 16
(c) Write C/C++ program to delete the node from Binary Search Tree and write
function for display tree contents in Post-order traversal sequence.
P.T.O.
Q5.
Consider the adjacency metric of a graph perform the following operations (Any
Two).
12

Count all the possible path of length 3 & 4 using path metrics.
Compute the in-degree and out-degree of each node.
Draw the equivalent link list representation
 IInd B.E Year Examination November-Dec ember 2017
Branch: Information Technology
ITR3C4 :Digital Electronics
Time: 3 hours Maximum Marks: 60
NOTE: AH questions are compulsory. Attempt any two parts from each question.
Q.I (a) Convert the following: 6
1). (329.54),0 - () 1G 2). (BD02.1A)iG - ()10 3). (1102)^= (),
4). (967.345)10 = ( )B 5). (3906),0 = ( )ECD

(b) shows the circuit of a two input NAND gate and two input NOR gate using CMOS
transistor. 6
(c) explain with diagram the working of resistor transistor logic. 6
Q.2 (a) Minimize the following expression using K-map
1). Y =£m (0, 1, 2, 5, 13, 15) 2). Y=R M (0, 2, 3, 5,7) 6
(b) Implement a 16:1 multiplexer using 4:1 multiplexers. 6
(c) Implement the lollowing multiple output function using a suitable decoder.
1). fl(A. B, C) =Zm (0, 4,7) +d (2, 3) 2). f2 (A, B, C) - £m (1, 5,6)
3). f3 (A, B, C) =£m (0, 2, 4, 6) 6
Q.3 (a) explain the operation of a J-K flip-flop. What is meant by race-around condition and
how is it eliminated? 6
(b) what is flip-flop. Draw the circuit of SR flip-flop using NAND gate. 6
(c) differentiate between synchronous and asynchronous counters. Design a 2-bit up
counter. 6
Q.4 (a) with a neat diagram explain the operation of 4-bit right shift resister. Give its truth
table and timing diagram. 6
(b) Draw a diagram for a 4-bit Johnson counter and explain its working. 6
(c) Determine the output state of a 4- bit SIPO shift register after 3 clock pulses if the
serial in terminal is HIGH and the initial contents of the shift register are:
1). 1 0 0 1 2). 0 0 0 1 6
Q.5 write short notes on (any two)
r
(a) Astable Multivibrator 6
(b) Counter type ADC 6
(c) Microprocessor 6
Roll No.:- 17374

B. E. II Examination Nov-Dec 2017

Information Technology
ITR3G1: Computer Organization and Architecture

Duration: 3 Hrs Max. Marks: 60

Total No. of questions: 05

Note: All questions are compulsory. Attempt any two parts from each question. Make
suitable assumptions if necessary. Answer should be to the point.

Ql. A. Explain the processor clock. Also derive the basic performance equation for the 06
processor time T.

B. Define the following: 95

1. Desktop Computer 2. Server 3. Data Center

4. Super Computer 5. Embedded Computer 6. Petabyte

C. Write the following rules for arithmetic operations on floating-point numbers; 06

1. Add/Subtract Rule 2. Multiply Rule 3. Divide Rule

Q2. A. Explain caches on the processor chip. 06

B. Describe ROM cell by using a suitable diagram. Also describe all types of ROM. 06

C. Consider a computer that has a cache holds 8-word blocks and a typical DRAM 06
main memory. 17 cycles are needed to load a block into the cache. Assume that
30 percent of the instruction in a typical program performs a read or a write
operation. Assume that hit rate in the cache are 0.95 for instructions and 0.9 for
data. 1 clock cycle is needed to access information in the cache. Let us further
assume that the miss penalty is the same for both read and write accesses.
How effective this cache is compared to an ideal cache?

Q3. A. For a given CPU, the first machine cycle Ml always consist of 4-states, and the 06
remaining machine cycles consist either of 3 or 4 states. An instruction cycle
consists of a minimum of 2 and a maximum of 5 machine cycles. If the CPU's
clock rate is 50 MHz and every memory access introduces one wait state. Then
calculate:

A).The shortest instruction execution time,

B).The longest instruction execution time,

B. Design a firmware architecture for a digital component that have four states, 06
three inputs (J, K and Clock) and two outputs (ZERO and ONE).

C. A processor has 16 registers, an ALU with 16 logic and 16 arithmetic functions, 06

and a shifter with 8 operations, all connected by an internal processor bus.
Design a microinstruction format to specify the various micro-operations for the
processor.
Q4 A. List three broad classifications of external, or peripheral, devices. 06
B. Write short notes on: I) SCSI Bus II) PCI Bus HI) USB 06
C. What is the difference between programmed-driven I/O and interrupt-driven 06
I/O? Give one advantage and one disadvantage of each.

Q5. A. If an unpipelined processor having a cycle time of 25 ns is evenly divided into 5 06

pipeline stages using pipeline latches with 1-ns latency, what is the total latency
of the pipeline? How about if the processor is divided into 50 pipeline stages?

B. Give the principle of linear pipelining with the basic structure of a linear pipeline 06
processor and the space time diagram.

C. The diagram shown below is a reservation table for a unifunctional pipeline 06

system. Identif} a collision vector and draw a state diagram for this pipeline
system. Also find out minimum average latency for the given pipeline system.

to U ti
1 X ..
X
2 X X X
3 X
V
4 X
5 X X
 17375
B.E. II Yr. (Ex) Examination Nov-Dec 2017
Information Technology
ITR4C2: Operating System
Duration: 3 hours Maximum Marks: 60

Note: Make necessary assumptions if required. All parts of a question should be at one place.
Attempt any two parts from each question.
Ql.(a) Categorized the different type of Operating System with proper example. (6)

(b) (i).What protocol has to be followed by O.S in order to make communication between (2)
user mode and the kernel mode?
(ii). Differentiate between: (i). Multiprogramming & Time sharing OS (4)
(ii). Real Time & Distributed OS

(c) "Operating System act as a Resource Manager and Control Programmer", justify the (6)
statement.

Q2.(a) What do you mean by Inter-process Communication? What are the two different (6)
communication models also differentiate between them.

(b) Consider the following set of processes, with the length of CPU burst given in (6)
milliseconds:
Process Burst Time Priority
pi 10 3
P2 1 1
P3 2 T

P4
i 4
P5 5 2
The processes are assumed to have arrived in the order pi, p2, p3, p4, p5, all at time 0.
(i). Draw four Gantt charts that illustrate the execution of these processes using the
following scheduling algorithms: FCFS, SJF, non-pre-emptive priority,
(ii). Calculate the average waiting time and average turnaround time for each algorithm,
(iii). Which of the algorithm results in minimum average waiting time.

(c) What are the different states of process? Explain it through process state diagram. What (6)
is Process control block?

Q3. (a) Write down the solution of readers-writer problems using semaphores. (6)
 (b) Consider the following snapshot of a system: (6)
Process Allocatio Max. Available
n Allocation ABC
ABC A B C
PC 0 1 0 753 3 3 2
Pi 200 3 2 2
P2 302 902
P3 2 1 1 2 2 2
P4 002 433
Answer the following question using Banker's Algorithm:
(i)What is the content of the matrix need? (ii)Find out the system in a safe state?

(c) What is Deadlock? How we can prevent a system from deadlock? (6)

..Q4. (a) What are different techniques to implement virtual memory? Explain Demand Paging. (6)

(b) Compare FIFO and LRU algorithm for given memory references, where frame size is 3 (6)
and find out which algorithm provides least page fault.
1,2, 3, 4, 5, 3, 4, 1,6, 7, 8, 7, 8, 9, 7, 8, 9, 5

(c) What happened when CPU wants to increase the degree of multiprogramming but the (6)
desired page for a process does not remain in main memory?

Q5. (a) Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently (6)
serving a request at cylinder 143, and the previous request was at cylinder 125. The queue
of pending request, in FIFO order is:
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
Starting from the current head position, what is the total distance (in cylinders) that the
disk arm moves to satisfy all the pending requests for each of the following disk
scheduling algorithms?
FCFS, SSTF, SCAN.

(b) Write a note on(any two): (6)

(i). Virus and Worms (ii). Security problems (iii). Protection

(cX Explain interrupt driven IO in detail. (6)

Roll No. 17376

B.E. II EXAMINATION Dec' 2017

INFORMATION TECHNOLOGY
ITR4C3: SOFTWARE ENGINEERING

Duration: 3 Hrs. Max Marks: 60

Minimum Marks:
Note: Attempt all the questions. Attempt any two parts of each question. All parts of
question must be solved at one place. Take the suitable assumption if necessary.

Ql (a) Write a note on the working of the domain expert and also explain the 6
qualities of a good software.

(b) Write about the SDLC and also explain which the most crucial phase 6
ofSDLC

(c) Describe the following:- 6

(i) Black box testing
(ii) white box testing

Q2 (a) Write down the features of Use-Case diagram. Draw the use case diagram 6
of an ATM machine .Write the use case description of any one use case,

(b) Explain why should we capture the functional requirement and non 6
functional requirement of a software.
(c) Explain the meaning of feasibility in software specification. 6

Q3 (a) Differentiate between Verification and validation model. 6

(b) Explain Unit testing, regression testing. 6

(c) Which testing methodology we have to adopt in order to check whether 6

we are getting some output on providing a certain input to the system or
not ?Explain it in detail.

Q4 (a) Draw an "ACTIVITY" diagram and "Sequence" diagram for the library 6
system, which should consist of description of all the entities involved in
it.

(b) Enlist the different risk factors for the organisation when a client make 6
change of request.

(c) In which software model you see the problem of inflexible 6

partitioning explain that model with the help of neat diagram

Q5 (a) Write a short note on reverse engineering. 6

(b) Explain the CASE tool. 6

(c) Explain fault tolerant architecture with a neat diagram. 6

**************
 . ,o • . ' • ; • : _ ;•• j , | • - l U ^
, , '-• ' • •• 3lBpt| ;;ir3 - M H puu
;f •-•• H i v*uo<- . • •
'•
JBU< fpmajjojss ^ui pun v - . '{j "0 ': I ',-J XI ' > ; : i *\d uoinnaj aq tspis :•>;;> [in

- • ";,'' >V "• - 8 >

-: 9S(j;II|]l , : : - V M" v ' j j j i;OU«l^> '' JO U1OJ TBI - : - - i H{3l -:t|. ^ :ij (l) 1-"
•9|dnr;x9 OB qiiM BJ ae ; uoijejaj » suoittuado
IC ;,.'"- : .^-; - • - . . i - - i c i ' . : ' _ • ' . ; • oaurjjodri! \\\w ( B / '- -

uiB? •
• • ; • • . .'.I-';.:, - . ; • - • - , ^dXtqns/ > ' E)Jddrhf ji pa^n s1}) •, ]snoo -m -:,•.;.:-!-

ir;o . ri\ at[|^oj UIP -::ip>|3 ; •••••• o pui us tpar

-;; oj ;7 •• qon ;
OOS T: pire (6^f ; -i , ; i ' • : • ' • • • " ; i " ' ' • - ; ' • ' :'"'M ";':r
phv. ui^ai 3soq s-r o) ;>ai • . '.i' ;f..;i.\>j o,tt] '.;'••'•!. ..^, ; • • • ' !H s; . :,> y (IA)
'JSXRTcf -' . '•;. .. (163 Ie; • 1 - . \ \
'spioogj \jn tin .i - s ^ pus -.
SjoSupv LJ ?| s?8 qons) uoijisod ^ *atu •; ;: '^q v\->»i ••••:;?.. : \ i >
•urP3] awo -.;i;o OT ^uopq • >Ke i = / •
^0S B pUB "ili^ldBO ^ .; '; " - > r 'A. ':D :' ' • • ' fl ' * -<T -Jltc-'" | ^i)
• 'y-w-'- • • • '• -•>•} •• .
:' ]; r ) ~-nti-.
9 .r>y; .K>; -.i::^t'UlTtp :\s B JOJ > v . ; > r u . u u i r - t M U I . V O T ; : ; oi^uaA] '. -•
•tjdmnxa UK l|i;.\p ';-M ".(• \j sn s -Viiqu
*) jo s^dA] snoi :;';•''. ureh-'v; ;.--]ti^uT.v '*tr jo UTBI T JOI' » > i ? .

aun jpAOp 3SU r,*rip i M C f x i ;

; . ••• . • : : -'• qtnBp 1 ' ' " oue [. . . r j ; juosar (q

(*)

• -^- I
.- : '-. -•• :- : ": ? ;--t idiu^?-: v ' : ••>•

* -'f/

H
-ija) Consider •:< siu-Jenf. registration database comprising of the below given table 6
: -.;ma:
Student (RoH.jjto,, Name, Address, Contact No)
Course : • Title, Hours, P>.'ios; : or_id)
VrofcrViO:': h;;*i_^so' "• tie. Gi'ilee;
Registration(RoUj:tc Cct: >:- ..Id, Date)
Co?v;-v--j' suitable sample v'tuples for the i^bove mentioned tables and \vtit^
1QJ fctemeEitto L"SV si HV* allowing question:
r ;: •• coursed ufj-"i ? ^pc-jji'iv •'•iicssiv leach"-
(ii) : ursc_id and date of registration of students in
ascending order of *1 . '; numbe
:j:;; . uches a specific course a :a \\iiere ishis/nci .-fPee 9
(tv; - • •: . .":, stu^snti ocionii :.o IndoroV
fb.l Define PL/SQL, l&cpkmi Jt.j working oi trigger wtih an example 6
- : I^fiM.;. sc tedule? Whut ^ 1 e '.'-irous types of'schedule? Check wbciher the 6
schedule^ ss conflict seri ; al le or QOt ? S R :i V); 'A :.. ',;. R3(C); W2(B):
W3(A); W3(< i: R?<7 ); Rl( v Wl(A): W1(B).

5(a) i >cj lain the concept of B^ tree file organization. 6

Discuss \s oataba*.:c ' cc-ivej'y strategics. 6
(c) 'Vriie Sh - -.' - i . (ai ; <-•• ••) 6
.i'! f>fi)aL»r •- iecuritv
(ii)Generii i vo level data \g architecture
(ii)O AJ oo!
 II BE Exaiiiiiiiition NovcrnbtrDccembcr 3017
IT II YEAR (A/B)
ITR4G2 DIGITAL COMMUNICATION ENGINEERING (EX)

Time 3 Hours Max. Marks: 60

All question carry equal marks.
Q.I a) State and prove the frequency convolution theorem of fourier transform.

Or

b) Explain amplitude modulation in detail.

Q.2 a) Compare unipolar NRZ, bipolar NRZ, unipolar RZ and bipolar RZ.

Or

b)write properties of auto-correlation & proof all properties also.

Q3 a) Explain in detail PCM.

Or

b) Explain in detail DM.

Q.4 a) Construct a Shannon-Fano code for X and calculate average bit per massage.
X, ^ X2 X-j #4 X$ XQ

p(x>) 0.30 0.25 0.20 0,12 0.08 0.05

Or

b) Determine the halfman code for the following message with their probabilities
given.
X, rt^ A-, X* Xt X,- Ac A-.

jA' 0.05 0.15 0.2 0.05 0.15 0.3 0.1

Q.5 a) Explain direct sequence pseudo noise (DSPN) spreading.

Or

b) Explain frequency HOP spreading.