0% found this document useful (0 votes)
11 views5 pages

Ques Pape

The document outlines examination papers for various MCA and B.A. courses, detailing the structure, instructions, and topics covered in each paper. It includes sections on numerical methods, database management systems, object-oriented programming, and data structures, with specific questions to be answered. Each paper specifies time limits, maximum marks, and requirements for attempting questions from different sections.

Uploaded by

bhoomibassan941
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views5 pages

Ques Pape

The document outlines examination papers for various MCA and B.A. courses, detailing the structure, instructions, and topics covered in each paper. It includes sections on numerical methods, database management systems, object-oriented programming, and data structures, with specific questions to be answered. Each paper specifies time limits, maximum marks, and requirements for attempting questions from different sections.

Uploaded by

bhoomibassan941
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

MCA (FYIC, 2nd SEMESTER, CSL-1)

PAPER- NUMERICAL METAOE

NSTRUTION: ALL QUESTIONS ARE COMP:SORY


TIME: 5 HOUR MAX WM2AS: - 20

digits. Calculale 20»9ute


)Round oiff the number 75462 to 4 significant
Error arid relative error.

1.
() Calculate percentage error intime period T =2nforI=
iferror in measurement ofl is 0.01.
e r i v e expression for the erFrors in multiplication of two numbers
(4+4-4-12maks
Q1 Fnd irerative formula for VN. hence solve V17 correct to three
Decimal pBaces using newton Raphson formula. (4 marks)
Q3. Solve the foilowing system of linear equations by Gauss Jordan method.
2x +8y + 2z = 14

6x +6y - z = 13
2xy + 2z 5 =
(4 marks
Guru Nanak Dev University (End Term)
MCA(FYIC) SEMESTER 2

CSL-122: DATABASE MANAGEMENT SYSTEM

Attempt five questions and at least one question from each section.
Time:3 Hours
Max Marlks: 80

Section A

1. A) What is data dictionary? What is DBA? Explain responsibilities of

DBA.(8)
B) Explain commands of DDL and DML with the help of examples(8).
2. What is DBMS? Write advantages and disadvantages of BDMS?(16)

Section B

1. Whatis relational model? Explain different keys used in relational

model.(16)
2. A) What is Entity- Relationship model? Write and E-r diagram to
illustrate is model.(10)
B) Explain three-level architecture and data independence.(6)

Section C

1. What is normalization? Explain different dependencies it removes from


the database along with normal forms.(16)

2. A) What is relational algebra? Explain its operation.(8)

B) What is concurrency control? How can we manage it?(8)

Section D

1. What is 0ODBMS? What are the different terminologies used in


OODBMS? Comparison of RDBMS AND 0ODBMS.(16)
2. What is database security? Write different techniques used to recover
lost data in the database.(16)
Sr.No.17653

B.A. (Hons.) Social Science 2nd Semester


(Credit Based Evaluation and Grading System)
(2522)
Paper: PBL-131 Punjabi Compulsory-II
Time Allowed: 3hrs. C
Max. Marks: 80

HaH&-E
1.

2.

HaHS-t

(
HaH&-A
5.
6.

(i)
ii) (iv) t asi
( (vi)
(vii)
(ix) f o a Et H3, 3ferai er JHT

1.

8. 3TE, U6E fafa3 fafor feHE, HEE-HE r HEat fefi


16 X5 80

17653(2522)4000
Guru Nanak Dev University, Aimritsar
MCA (FYIC) Semester II
CSL 124: Object Oriented Programming C+
Max. Marks: 80
ime 2Hours at lcast onc qucstron rom Cach
irhriicfates arc requtcd to attcmpt any five qucstions sclecting
cion h fifth question may be attcmptcd from any scetion.
Scction A

in C+° Describe different data types along with thecir rcprescntalions


a) What is the need of data types
and sze in C++

to do simple operations like addition, subtractin.


Write a
caleulator program in C++ language
mltiplic ation ani division. Use switch statement in your progrant.
D e l i n c ternary opcratos Compare it with if and if-clsc statcnient.

(b) etine a recur:ion. Write a C recursive function for pmultiplying two integers whcre n finieiion cail is
a d witir me integers "m and "n.

Section- B

.i a Wiitr a pmogrann in C+ Pogrann1ingiomultipiy two matrices.


Fpai ai by Vaiue & Call by Reference using Suitable ExampBe.

3: W1ite a C program to maintain a record of "n" student dctails using an array »fstrtlures with four
iicld: Roil iumber. Name. Marks. and Grade). Each ficid is of an app.opriate daia type. Print the marks of
siticni givei situcieni namc as input.

(h) Define finction overloading. Write a C4+ program to overload arca() function to caBeulate arca of shapes
kriangle .square. circle.
Section- C

Nplan hriefiy characteristics of DOPS language and mentin edvantages of OOPS apioach ower
ctinai/piocedura yrogramning.
efine a ciass namcd Banl: Account to represent followving menmbers:

Daia ricmbers: Account Nunber - Name of Deposilor - Account Type - Balance Amount

Afemier imctions: - Initializc nicmbers - Deposil Amont Withdaw Ánont - Display B3alance

T ea i ogram to tcst the Bank Accouwt class for 10 customers.

Scction- D

7.1a)What do you mean b; uary operator overloading? Explain witlh the help ofsuitabie progranm.

What is irheritancc? lExpiain Ambiguity in Muitiplc Jnheritance with eampic

3. (a) wiat is a vitua! base cilass? Winy it is important to nmakc a class viriuai.

(h Viai is abstract class? When do we use the proiected visibility speeificrs to a class mcnmber?
Science
Depertment of Computer

MCA(FYIC) Semester-I1

File Processig
CSL 123:Data Structures And

End Semester Examinatiopn

Max.Marks: 80
Time: Three hour
be
FIFTH question nay
section and
at least question from cach
Aticmpt any FIVE qucstions. selecting
one

Oe
altept fiom any section.
Section A

structure?(8)
in opting any data
1aDiscuss with example. time and space tradeoff involved

the data clements can be rejpresented by mcans of sequentiat inemory


Discuss how linear relationship among
location. (8)
lecations? Elaborate sleps to insert an clement into given
a

location in linked list. Write its algorithnn ( 10)


linked list? How we can insert an clcment at given
a) What is
b) What is header linked list. 11ow we transverse cireular header Linked list?(6)

Section B

93. What do you mean by Qucue . Explain its inmplementation with algorithm. Also write its applications. 16

o1 What is a Graph? How is it represented in memory ? Discuss breadth first searclh technique for
traversing graph. (16)

Section C

AVIie an itcrative algorithn,to peform in order traversal. Also find preordcr and level order of given tree: (16)

Inorder D B
P'ostorder | F
C H
D
G - ------

a)plaim the concept of Quick sot and nsertion soit with Cxample? Also wrilc its conplexity.
(8)
) 1 hat are AVL Tees" Constuet AVL Scarch tree
an
by inscrting the following elements inn orcder of their
cnence:5 12 1098 14 23 29 28 17
(8)

Section D

Wrile short note on:

(a)Conmpaction
) Master file and tt.nsaction files
(C) Blocking
(16)

What is file
organization plan differcnt file organi/ation techniquc with relevant
cxample 16)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy