Bachelor of Science (Information Technology)
(I.T.) Semester—V Examination
SOFTWARE PROJECT MANAGEMENT
Paper—1
Time :
Three Hours] [ Maximum Marks : 50
N.B. :— (1) All questions
are compulsory and carry equal marks.
(2) Draw
neat and labelled diagrams wherever necessary.
EITHER
1. (A) What are the Key Process Area
(KPA) for project management ? 5
(B) Explain the role of senior
management in software projects. 5
OR
(C) Explain following stages in project management process :
(i) Project Planning
(ii) Project Execution. 5
(D) Explain different levels of CMMI. 5
EITHER
2. (A) What do you mean by process tailoring ? Explain
summary-level tailoring. 5
(B) Give standard process chart for software project
development and explain it. 5
OR
(C) How case point approach is used
for calculating efforts ? Explain. 5
(D) What are the steps considered in
change management process ? Explain. 5
EITHER
3. (A) Explain quantitative approach to quality management
in software development project. 5
(B) What is risk assessment ? Explain risk
identification and risk priortization. 5
OR
(C) What steps are taken for defect prevention activities at the
project level
? 5
(D) Explain how risks are controlled in software
project. 5
EITHER
4. (A) How are processes monitored through statistical
process control ? Explain. 5
(B) Explain the following point in team management :
(i) Team structure
(ii) Team development. 5
OR
(C) How customer communication is performed in software project
and how are the issues resolved
? 5
(D) What is project tracking ? Explain different types of
tracking used in projects. 5
5. (A)
Write a note on training for project managers. 2 ½
(B) What are actual efforts and estimated efforts ? Explain in
brief. 2 ½
(C) Explain risk management in brief. 2 ½
(D) Give the structure of project management
plan. 2 ½
Bachelor of Science (Information Technology)
(I.T.) (Semester—V) Examination
DOT NET FRAMEWORK AND C#
Paper—2
Time
: Three Hours] [ Maximum Marks : 50
N.B. :— (1) ALL questions
are compulsory and carry equal marks.
(2) Draw
well labelled diagrams wherever necessary.
EITHER
1. (a) Explain the Origins of .Net Technology in detail. 5
(b) Write short notes on :
(i) CTS
(ii) MSIL. 5
OR
(c) Explain various Components of CLR with a suitable
diagram. 5
(d) Explain Framework Base Classes in
detail. 5
EITHER
2. (a) Explain the various data types used in C#. 5
(b) Define a class. Explain how objects are created in
C#. 5
OR
(c) Explain the concept of Inheritance and Polymorphism in
detail. 5
(d) What is Operator Overloading ? Explain Overloading of Unary
Operator with a suitable program.
5
EITHER
3. (a) Explain Managing Console I/O Operation in detail. 5
(b) Explain Error Handling method in
C#. 5
OR
(c) Explain the concept of Multi threading in
C#. 5
(d) Write a program in C# to find the factorial of a given
number. 5
CC—9373 1 ( Contd. )
EITHER
4. (a) Explain different types of Web Services Provided by C#
in detail. 5
(b) Write steps to create a login web
form. 5
OR
(c) Explain any five server side ASP.Net form
controls. 5
(d) Explain Built in attributes with a suitable
example. 5
5. (a) Explain Just-In-Time Compilation Process in detail. 2 ½
(b) Explain Interfaces in C# with a suitable example. 2 ½
(c) Write short note on Networking and
Sockets. 2 ½
(d) Explain private and shared assemblies. 2½
Bachelor of Science (Information Technology)
(I.T.) (Semester—V) Examination
NETWORK SECURITY
Paper—3
Time :
Three Hours] [ Maximum Marks : 50
N.B. :— (1)
All questions are compulsory and carry equal marks. (2) Draw neat and labelled
diagram wherever necessary.
EITHER
1. (A) Explain the model for Internetwork Security. 5
(B) Explain the RFCS Access control mechanism in Networking.
5 OR
(C) What are the different types of threats over internet ?
5
(D) Explain client authentication mechanism in detail. 5
EITHER
2. (A) Explain :
` (i) Symmetric ciphers
(ii) Block ciphers. 5
(B) Explain RSA with suitable
examples. 5
OR
(C) Explain Bell-Lapadula model with
its important features. 5
(D) Explain the working
mechanism of Data Encryption Standard (DES). 5
EITHER
3. (A) Explain the concept of Key Management. 5
(B) Explain transport layer
security. 5
OR
(C) Explain the concept of Digital Signature. 5
(D) Explain IP encapsulating security protocol in
detail. 5
EITHER
4. (A) Explain the key features of SET.
5
(B) What do you mean by intruders ? Explain intrusion detection.
5
OR
(C) Write a note on :
`(i) Proxy Servers
(ii) Packet
filtering. 5
(D) Explain authentication mechanism in Smart Card. 5
5. (A) Explain Access Matrix in
brief. 2 ½
(B) Explain Key
Escrow. 2 ½
(C) What is Cryptanalysis?
2 ½
(D) Explain authentication Mechanism
for Biometrics. 2 ½
Bachelor of Science (Information Technology) (I.T.) (Semester–V) Examination
DATA WAREHOUSING
Paper—4
Time : Three Hours] [ Maximum Marks : 50
N.B. :— (1) ALL questions are
compulsory and carry equal marks.
(2) Draw neat and labelled diagram wherever necessary.
EITHER
1.
(A) Explain the architecture of Data Warehouse
in detail. 5
(B)
Explain the components of Data Warehouse in
detail. 5
OR
(C)
Explain Pushing and Pulling of data. 5
(D) Explain
the life cycle of data. 5
EITHER
2.
(A) Explain the various data Warehousing
schemas. 5
(B)
Explain Extract, Load, Transform (ELT) in
detail. 5 OR
(C)
Explain Dimensional model, its elements and
steps of Dimensional modelling. 5
(D) Explain
Fact Tables and Fetters Fact Tables. 5
EITHER
3.
(A) Explain Online Analytical Processing (OLAP)
in detail. 5
(B)
Explain the strategy of developing a Data
Warehouse. 5
OR
(C)
Explain Multidimensional Analysis in detail. 5
(D) Explain
Administration and Performance. 5
EITHER
4.
(A) Explain the steps to build a Data warehouse.
5
(B)
Explain the factors responsible for a successful
warehouse. 5
OR
(C)
Explain building and implementation of Data
Marts in detail. 5
(D) Explain
Backup and Recovery along with its importance in detail. 5
5.
(A) Explain Data Granularity. 2 ½
(B)
Write short note on ‘Data Quality’. 2 ½
(C)
Explain Feedback Loops. 2 ½
(D)
Write a short note on ‘Operating Warehouse’. 2 ½
Bachelor
of Science (Information Technology) (I.T.)
(Semester–V) Examination
VB PROGRAMMING
Paper—5
Time : Three Hours] [ Maximum Marks : 50
Note :— (1) ALL questions are
compulsory and carry equal marks.
(2) Draw neat and labelled diagrams wherever necessary.
EITHER
1.
(a) Write a short note on ‘Form Layout Window
and Property Window’. 5
(b)
List the basic controls supported by VB. Explain
List Box Control and Combo Control in detail.
5
OR
(c)
What do you mean by looping ? Explain :
(1)
While ......... Wend
(2)
For ........ Next with example. 5
(d)
Explain the term :
public
Private
static
with reference to scope of
variable. 5
EITHER
2.
(a) What is array ? Explain dynamic array with
example. 5
(b)
What do you mean by module ? Explain form module
in detail. 5
OR
(c)
Explain control array with suitable example. 5
(d)
What do you mean by procedure ? How we can pass
an argument to procedure ? 5
EITHER
3.
(a) Explain the procedure of creating menu with
suitable example. 5
(b)
Write the procedure to create database using
Visual Database Manager (VDM). 5
OR
(c)
Explain popup menu with example. Write the
procedure to create popup menu. 5
(d)
Explain Data Control with its properties. 5
EITHER
4.
(a) What
is ODBC ? Explain the process for connecting ADODC data control with MS-access
database. 5
(b)
Write a short note on :
(i)
Data List Control
(ii)
Data Combo Control 5
OR
(c)
What is data report ? Write the procedure to
create report using Data Environment designer.
5
(d)
Write a short note on ‘Error trapping and
handling’. 5
5.
(a) What do you mean by event ? List different
types of Mouse Event. 2 ½
(b)
Explain Math function supported by VB. 2 ½
(c)
Explain how to add separator bar in menu. 2 ½
(d)
Explain ERR Object. 2½
Bachelor of Science (Information Technology) (I.T.)
Semester—V Examination
GRAPH THEORY
Paper—6
Time :
Three Hours] [Maximum
Marks : 50
N.B. :— (1) ALL questions are compulsory and carry
equal marks.
(2) Draw neat
diagrams wherever necessary.
EITHER
1. (A) Define the following terms :
(i)
Graph
(ii) In-degree
(iii) Out-degree
(iv) Isolated vertex
(v) Null graph. 5
(B)
Write the adjacency matrix of the following graph and find path from vertex a
to d :
(i)
Simple
path
(ii)
Self
loop
(iii)
A
path of length three
(iv)
Closed
walk. 5
OR
(C) Define and explain Dijkstra shortest
path algorithm. 5
(D) Write short notes on :
(i)
Cut-vertex
(ii)
Vertex
connectivity. 5
EITHER
3. (A)
Define the following :
(i)
Tree
(ii)
Null
tree
(iii)
Decision
tree
(iv)
Distance
of a tree
(v)
Rooted
tree. 5
(B) Differentiate between binary tree and general tree. Give
example of each tree. 5
OR
(C) Prove that, a connected graph with n vertices is a tree if and only if, it has (n–1) edges. 5
(B)
Define directed graph. Explain different types of directed graph. 5
OR
(C) What is isomorphism of digraph ?
Explain with example. 5
Label the given network in the following figure with a flow that conserve flow at each node, except the source and the sink. Each edge is labelled with its maximum capacity
5. (A)
Explain matrix representation of a graph. 2 ½
(B) Define ring sum of any two cut sets. 2 ½
(C) State Kruskal’s algorithm. Give its
advantages. 2 ½
(D) Define network and flows of a graph with example. 2 ½
