mca ii sem assignments

8/12/2019 MCA II Sem Assignments

1/11

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 %


2/11

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 obect diagra#s are different fro# class diagra#. # $ Marks

%


3/11

MC006& 01

Marks 40

**B*S, M*N*G,M,N

#,a. Question arries $ Marks%

BOO/ I! B0&16 BO&1&

1. Write about

/inear -earch

(ollision (hain

With respect to 3ashing echni0ues

2. Write about

&ntegrity 4ules

4elational Operators with exa#ples for each

$. Write about

hree /eel Architecture of a database

-erices of a Database -yste#

%. Explain the -5/ syntax for

able (reation with constraint i#posing using an exa#ple

6unctions (ount7 -u#7 Aerage with appropriate exa#ples8. (o#pare and (ontrast the (entrali,ed and (lient 9 -erer Architecture for D:;-.

otations


4/11

+. (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 BO&1&

1. Write about

Physical -torage -tructure of D:;-

&ndexing

2. Write about

Application /ogic

One ier Architecture (lient 9 -erer Architecture

$. Write about

:asic (onstructs of E)4 ;odeling

E)4 >otations with exa#ples

%. Write about

ypes of Discretionary Priileges

Propagation of Priileges using ?rant Option

with appropriate exa#ples for each

8. Describe the following Association 4ules

(lassification

(lustering


5/11

(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

** SUCU,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 A/ ree with suitable exa#ple! # 4 Marks%

8. &nsert the keys in order show into an initially e#pty A/ tree. And show the se0uence

of trees produced by these insertions.

*5BM,7G8FPOC9QS # 6 Marks%


6/11

MC006"- 01

Marks 40

** SUCU,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

i. hreaded lists ii. Dyna#ic 3ashing # 10 Marks%


7/11

MC* :Ne;< II Semester *ssi=nments >or Fe?ruar@ (00" Session

Su?Aet Coe ! MC006 *ssi=nment No! 01

Su?Aet Name ! S@stem *naD@sis an esi=n Marks! 60

Book I! B0&14,a. Euestion arries si marks 10 6 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.


8/11


9/11

MC* :Ne;< *ssi=nments >or Fe?ruar@ (00" SessionMC 00&0

Marks! 60

OP,*ING SS,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 #aor co#ponents of Operating -yste#

$. Define Process.

%. Define hreads.

8. ;ention the necessary conditions for Deadlock occurrence.

Part):

1. Write a note on F8"8G ;arks

4eal i#e Operating -yste#s F4O-G

Distributed Operating -yste#s

2. Write a note on 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# F1G ;arks

%. :ring out the salient features of F2"$G ;arks

Paging

-eg#entation


10/11

8. Define (ache ;e#ory F1G ;arks

:ring out the concepts of :asic (ache ;e#ory structure

(oncept of Associatie #apping

6ully Associatie #apping


11/11

MC 00&0 :B

mca ii sem assignments

Documents