MC0066 01

Marks 40
OOPS USING C++
Questions From Book-I ! B06"1
1. Distinguished between procedural language and OOP language. And Explain the
key features of OOP. # $ Marks %
2. What is function oerloading! Write a c"" progra# to i#ple#ent a function
oerloaded. # $ Marks %
$. Discuss the constructors and Destructors with suitable exa#ple. # $ Marks %
%. What do you #ean by operator oerloading! &llustrate with suitable exa#ple for
oerloading 'nary operators. # $ Marks %
Questions From Book-I ! B0&1$
$' Write ("" progra# which de#onstrate the difference between static and dyna#ic
binding. # $ Marks %
6' Difference between a static #e#ber function and non)static #e#ber functions with
appropriate exa#ple. # $ Marks %
*. Writer ("" progra# to de#onstrate the co#plete i#ple#entation of class te#plate
stack. # $ Marks %
+. What is te#plate speciali,ation! Describe a scenario in which te#plate class partial
speciali,ation is considered appropriate. # $ Marks %

MC0066 0(
Marks 40
OOPS USING C++
Questions From Book-I ! B06"1
1. Write adantage of #ultiple inheritances. And write ac"" progra# to i#ple#ent the
#ultiple inheritances. # 10 Marks %
2.. Discuss the types of &nheritance with suitable exa#ple for each. # $ Marks %
)' Write a c"" progra# to i#ple#ents the relational operator oerloading for the
distance class. # $ Marks %
Questions From Book-I ! B0&1$
4' Write the adantages of using exception handling with its basic #odels.# $ Marks
%
$' Discuss the arious -./ co#ponents in brief. # $ Marks
%
6' Describe the ti#e oerhead of operations on se0uence containers. # $
Marks %
&' Discuss how ob1ect diagra#s are different fro# class diagra#. # $ Marks
%
MC006& 01
Marks 40
*+*B*S, M*N*G,M,N+
#,a-. Question -arries $ Marks%
BOO/ I! B0&16 0 BO&1&
1. Write about2
/inear -earch
(ollision (hain
With respect to 3ashing .echni0ues
2. Write about2
&ntegrity 4ules
4elational Operators with exa#ples for each
$. Write about2
.hree /eel Architecture of a database
-erices of a Database -yste#
%. Explain the -5/ syntax for2
.able (reation with constraint i#posing using an exa#ple
6unctions (ount7 -u#7 Aerage with appropriate exa#ples
8. (o#pare and (ontrast the (entrali,ed and (lient 9 -erer Architecture for D:;-.
<. .aking an exa#ple Enterprise -yste#7 /ist out the Entity types7 Entity -ets7 Attributes
and =eys
*. &llustrate with an exa#ple of your own the 4elational ;odel >otations
+. (onsider a 'niersity Database -yste# and deelop the E4 (onceptual -che#a
diagra# i.e. E)4 Diagra# for the sa#e
MC006& 0(
Marks 40
*+*B*S, M*N*G,M,N+
#,a-. Question -arries $ Marks%
BOO/ I! B0&16 0 BO&1&
1. Write about2
Physical -torage -tructure of D:;-
&ndexing
2. Write about2
Application /ogic
One .ier Architecture
(lient 9 -erer Architecture
$. Write about2
:asic (onstructs of E)4 ;odeling
E)4 >otations with exa#ples
%. Write about2
.ypes of Discretionary Priileges
Propagation of Priileges using ?rant Option
with appropriate exa#ples for each
8. Describe the following Association 4ules2
(lassification
(lustering
<. Write about2
(ategories of Data ;odels
-che#as7 &nstances and Database -tates
With an exa#ple for each
*. .aking an exa#ple Enterprise -yste#7 /ist out the 4elationship types7 4elationship
sets and roles
+. With an exa#ple show that -eriali,ability can be guaranteed with two @ phase locking
MC006"- 01
Marks 40
*+* S+1UC+U1,S USING 2C3
Questions From Book-I ! B0&01
1. Write the adantages of i#ple#entation checks preconditions. # $ Marks%
2. Discuss the -.A(= operation with -uitable exa#ple and -how how to i#ple#ent
stack operations of integer in ( by using array. # 10 Marks%
$. Discuss how 5ueues are differ fro# -tack. # $ Marks%
Questions From Book-I ! B0&0(
%. Explain the AA/ .ree with suitable exa#ple! # 4 Marks%
8. &nsert the keys in order show into an initially e#pty AA/ tree. And show the se0uence
of trees produced by these insertions.
*454B464+4M4,4744G484F4P4O4C494Q4S # 6 Marks%
<. Explain the ad1acency ;atrix and ad1acency /ist with suitable exa#ple. # $ Marks%
*. Write a algorith# for the followings2
i. Di1kstra Algorith#
ii. :ell#an)6ord Algorith# # $ Marks%
MC006"- 01
Marks 40
*+* S+1UC+U1,S USING 2C3
Questions From Book-I ! B0&01
1. &llustrate to i#ple#ent de0ue using circular linked list. # 10 Marks%
2. .What do you #ean by searching! Define searching proble# and how do you
ealuate the perfor#ance of any searching algorith#! # 10 Marks%
Questions From Book-I ! B0&0(
$. (o#pare and contrast D6- and :6- and D6-"&D approaches #$ Marks%
%. Discuss how -play .ree differs fro# a :inary .ree! Bustify your answer with
appropriate exa#ple. #$ Marks%
8. Write note on 2
i. .hreaded lists ii. Dyna#ic 3ashing # 10 Marks%
MC* :Ne;< II Semester *ssi=nments >or Fe?ruar@ (00" Session
Su?Ae-t CoBe ! MC006C *ssi=nment No! 01
Su?Ae-t Name ! S@stem *naD@sis anB esi=n Marks! 60
Book I! B0&14
,a-. Euestion -arries siF marks 10 F 6 G 60
1. Explain the four basic principles of #odeling.
2. 3ow do you #odel te#plate classes in the ';/!
$. Explain the significance of aggregation with an exa#ple.
%. Discuss ';/Cs extensibility #echanis#s.
8. ?ie a brief note on the ';/Cs fie behaioral diagra#s.
<. Explain the necessary steps to reerse engineer an ob1ect diagra#.
*. Explain the ter#s context7 ob1ects and roles7 links7 #essages
+. Explain the fie parts of a transition.
D. Explain the $ steps to be considered to #odel an AP&.
1E. Explain the i#portance of #odels.
MC* :Ne;< II Semester *ssi=nments >or Fe?ruar@ (00"
Session
Su?Ae-t CoBe ! MC006C *ssi=nment No! 0(
Su?Ae-t Name ! S@stem *naD@sis anB esi=n Marks! 60
Book I! B0&14
,a-. Euestion -arries siF marks 10 F 6 G 60
1. Explain the four kinds of relationships in UML.
2. What are the considerations that should be taken care to model the distribution of
responsibilities in a system?
3. Explain dependency in detail and also ho is it different from dependency.
!. "efine stereotype# ta$$ed %alue and constraint.
&. What is the main ad%anta$e of modelin$ a system at different le%els of abstraction
by presentin$ dia$rams ith different le%els of detail?
'. Explain the process of modelin$ a lo$ical database schema?
(. Explain the concept of se)uencin$.
*. Explain the different components of states ith reference to state machines.
+. Explain beha%ioral aspects of collaboration ith an example.
1,. Explain ith a neat dia$ram ho you ould model the architecture of a system.
MC* :Ne;< *ssi=nments >or Fe?ruar@ (00" Session
MC 00&0
Marks! 60
OP,1*+ING S6S+,MS
#Book I! B06"(%
#Book I! B06")%
Part)A
FEach 0uestion carries e0ual #arksG F1H 8G I8 #arks
1. /ist out salient Operating -yste# functions.
2. /ist out #a1or co#ponents of Operating -yste#
$. Define Process.
%. Define .hreads.
8. ;ention the necessary conditions for Deadlock occurrence.
Part):
1. Write a note on2 F8"8G ;arks
4eal .i#e Operating -yste#s F4.O-G
Distributed Operating -yste#s
2. Write a note on2 F8"8G ;arks
;icro =ernel Architecture
'nix Architecture
$. :ring out the features of :est 6it7 Worst 6it and 6irst 6it with a block diagra#s
illustrating the# F1EG ;arks
%. :ring out the salient features of2 F2"$G ;arks
Paging
-eg#entation

8. Define (ache ;e#ory2 F1EG ;arks
:ring out the concepts of :asic (ache ;e#ory structure
(oncept of Associatie #apping
6ully Associatie #apping
<. 6or the following reference string with three page #e#ory fra#e2
1E #arks
<7 E7 17 27 $7 %7 27 $7 <7 E7 $7 27 17 27 E7 17 <7 17 E7 $
a. Apply 6&6O algorith#
b. Apply /4' algorith#
c. Apply Opti#al algorith#
d. Apply (lock algorith#
MC 00&0 :B<
Marks! 60
OP,1*+ING S6S+,MS
#Book I! B06"(%
#Book I! B06")%
1. :riefly discuss 6ile syste# of '>&J Operating -yste#s F8 G #arks
2. Write the syntax for '-E4ADD7 ?4O'PADD7 '-E4DE/ co##ands
$. Define process. What is the significance following ter#s F1EG #arks
P&D7 PP&D7 '&D7 E'&D7 ?&D7 E?&D
%. Explain the forkF G and pipeF G syste# calls F1EG #arks
8. (onsider that you hae to carry out following tasks using '>&J O-2
;oe a file fro# operating_systems directory to unix directory
(opy a file fro# BCA directory to MCA directory
4e#oe a file fro# a directory called SMU
;ention the co##ands used along with co#plete syntax.
<. What is the significance of ch#od co##and.
Explain the two for#s of ch#od co##ands with proper exa#ples.
K ch#od * * % #eans!
K ch#od u"r w #eans!
*. Write the syntax for2 case state#ent and &f @ Else state#ent in shell scripts.