OUTLINES OF TESTS,

SYLLABI AND COURSES OF READING

FOR

BACHELOR OF COMPUTER APPLICATIONS (B.C.A)

(SEMESTER SYSTEM)

PART-II

(Semester 3rd and 4th)

FOR
2015-16, 2016-17, 2017-18 SESSION

PUNJABI UNIVERSITY,
PATIALA – 147 002

1
 OUTLINE OF PAPERS AND TESTS
for
B.C.A. Second Year(3rd Semester)
2015-16, 2016-17, 2017-18 SESSIONS

Hours University Internal Max. Exam.

Code Title of Paper per Examination Assessment Marks Duratio
Week n Hours
BCA-211 English Communication Skills – I 4 75 25* 100 3
BCA-212 Discrete Mathematics 4 75 25 100 3
BCA-213 Computer System Organizations 4 75 25 100 3
and Architecture
BCA-214 Object Oriented Programming using 4 75 25 100 3
C++
BCA-215 Fundamentals of Database 4 75 25 100 3
Management System
BCA-216 Software Lab – IV (based on paper 4 35 15 50 3
BCA-214: Object Oriented
Programming using C++)
BCA-217 Software Lab – V (MS Access Lab 4 35 15 50 3
based on BCA-215 Fundamentals of
Database Management System)
BCA-218 Punjabi (Compulsory) or 4 75 25 100 3
Punjabi Compulsory (Mudla Gyan)
**
Total 520 180 700

Note:
The break up of marks for the practical will be as under:
i. Lab Record (Internal Assessment) 15 Marks
ii. Viva Voce (External Evaluation) 15 Marks
iii. Program Development and Execution(External Evaluation) 20 Marks

The break up of marks for the internal assessment for theory papers except BCA-211 will be as under:
i. One or two tests out of which minimum one best will be 15 Marks
considered for assessment.
ii. Attendance 5 Marks
iii. Class participation/behaviour/assignment 5 Marks

*The break up of marks for the internal assessment for BCA-211: English Communication Skills – I will be as
under:
i. Formal assessment through Interview/Self 10 Marks
Introduction/Recitation etc.
ii. Conversation Skills (particularly listening and speaking to be 5 Marks
evaluated through oral examination)
iii. Attendance 5 Marks
iv. Class participation/behaviour/assignment 5 Marks

2
 OUTLINE OF PAPERS AND TESTS
for
B.C.A. Second Year(4th Semester)
2015-16, 2016-17, 2017-18 SESSIONS

Hours University Internal Max. Exam.

Code Title of Paper per Examination Assessment Marks Duratio
Week n Hours
BCA-221 English Communication Skills – II 4 75 25* 100 3
BCA-222 Computer Networks 4 75 25 100 3
BCA-223 Management Information Systems 4 75 25 100 3
BCA-224 Computer Oriented Numerical and 4 75 25 100 3
Statistical Methods
BCA-225 Relational Database Management 4 75 25 100 3
Systems with Oracle
BCA-226 Software Lab – VI (based on paper 4 35 15 50 3
BCA-224: Computer Oriented
Numerical and Statistical Methods)
BCA-227 Software Lab – VII (Oracle Lab 4 35 15 50 3
based on paper BCA-225: Database
Management Systems with Oracle )
BCA-228 Environmental and Road Safety 4 -- -- 100 3
Awarness (Qualifying Exam)
BCA-229 Punjabi (Compulsory) or 4 75 25 100 3
Punjabi Compulsory (Mudla Gyan)
**
Total 520 180 800

Note:
The break up of marks for the practical will be as under:
i. Lab Record (Internal Assessment) 15 Marks
ii. Viva Voce (External Evaluation) 15 Marks
iii. Program Development and Execution(External Evaluation) 20 Marks

The break up of marks for the internal assessment for theory papers except BCA-221 will be as under:
i. One or two tests out of which minimum one best will be 15 Marks
considered for assessment.
ii. Attendance 5 Marks
iii. Class participation/behaviour/assignment 5 Marks

*The break up of marks for the internal assessment for BCA-221: English Communication Skills – II will be as
under:
i. Formal assessment through Interview/Self 10 Marks
Introduction/Recitation etc.
ii. Conversation Skills (particularly listening and speaking to be 5 Marks
evaluated through oral examination)
iii. Attendance 5 Marks
iv. Class participation and behaviour 5 Marks

3
BCA-211: English Communication Skills – I

Max Marks: 75 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Lectures to be delivered: 45-55 Hrs

English Communication Skills has been designed to develop the student‟s communicative
competence in English. Therefore, content selection is determined by the student‟s present
and future academic, social and professional needs.

Texts Prescribed for Grammar and Vocabulary:

Prose Parable – (1-10 chapters)
W. Standard Allen: Living English Structure (Orient Longman)
The Written Wond by Vandana R. Singh

SECTION A

Q.1 (a) One essay type question with an internal alternative on the theme, incident &
character from Prose Parable. The answer should not exceed 250 words. 10 marks
(b) 5 short answer type questions to be attempted out of the given eight from Prose
Parables (40-50 words) 5×2 = 10
marks

SECTION B – COMPREHESION

Q.2 One unseen passage with five questions from the passage for five marks and 05
marks for vocabulary such as word formation and inferring meaning 10 marks

SECTION C – GRAMMAR

Q.3 (a) Transcoding : Prose to dialogue. (One passage will be given) 5 marks
(b) Error correction in sentences.(Attempt 5 out of 8 sentences) 5 marks
(c) Drafting questions based on given inputs 5 marks

SECTION D – COMPOSITION

Q.4 (a) Writing one out of two official letters from the given topics
1. Making inquiries
2. Suggesting changes
3. Registering complaints
4. Asking and giving information 10 marks
(b) Development of a story from given hints 10 marks
(c) Application for job including CV/Resume 10 marks

4
BCA-212: Discrete Mathematics

Max Marks: 75 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Lectures to be delivered: 45-55 Hrs

(A) INSTRUCTION FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Section A and B will have four
questions from the respective section of the syllabus carrying 15 marks for each question.
Section C will consist of 5-10 short answer type questions carrying a total of 15 marks, which
will cover the entire syllabus uniformly. . Candidates are required to attempt five questions in
all by selecting at least two questions each from the section A and B. Section C is
compulsory.

(B) INSTRUCTIONS FOR THE CANDIDATES

Candidates are required to attempt five questions in all by selecting at least two questions
each from the section A and B. Section C is compulsory.

SECTION-A
Set Theory: Sets, Type of sets, Set operations, Principle of Inclusion-Exclusion, Cartesian
prodouct of sets, Partitions.
Logic : Propositions, Implications, Precedence of logical operators, Translating English
sentences into logical expressions, Propositional equivalence
Principle of Mathematical induction.
Relations: Relations and diagraph, n-ary relations and their applications, properties of
relations, representing relations, closure of relation, equivalence relation, operation on
relations, partial ordering.

SECTION- B
Functions: Functions, One-to-one Functions, Onto Functions, Inverse and Composition of
Functions, Floor Function, Ceiling Function.
Basic Concepts (Only Definition): Big-O Notation, Big-Omega and Big-Theta Notation.
Graphs: Introduction to Graph, Graph terminology, Representing graphs and Graph
Isomorphism, Connectivity, Euler Paths and Circuits, Hamillonian paths and circuits,
Shortest Path Problems, Planar Graphs.
Trees : Trees, labelled trees, Tree Traversal, Undirected trees, Spanning Trees, Minimum
spanning trees.

Text Book

1. Discrete Mathematical Structures-Bernard Kolman, Robert C. Busby, Sharon C. Ross,

4th Edition, Pearson Education Asia.
References :
1. Discrete Mathematics-Richard Johnsonbaugh, 5th Edition, Pearson Education, Asia.
2. Elements of Discrete Mathematics, Second Edition, Tata McGraw Hill.
3. Discrete Mathematics, Seymon Lipschutz & Max Lans Lipson, Tata McGraw Hill.

5
BCA-213: Computer System Organization and Architecture

Max Marks: 75 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Lectures to be delivered: 45-55 Hrs

(A) INSTRUCTION FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Section A and B will have four
questions from the respective section of the syllabus carrying 15 marks for each question.
Section C will consist of 5-10 short answer type questions carrying a total of 15 marks, which
will cover the entire syllabus uniformly. Candidates are required to attempt five questions in
all by selecting at least two questions each from the section A and B. Section C is
compulsory.

(B) INSTRUCTIONS FOR THE CANDIDATES

Candidates are required to attempt five questions in all by selecting at least two questions
each from the section A and B. Section C is compulsory.

SECTION-A

Computer System Organisation: CPU Organisation, Instruction Execution (instruction cycle,

types of instructions), RISC v/s CISC, Design Principles for Modern Computers, Instruction
level parallelism. Processor level parallelism.
Primary memory: Memory addresses, Byte Ordering, Error-correcting codes, Cache memory.
Secondary memory: Memory hierarchy, SCSI disk, RAID.
Instruction Set Architecture: Instruction formats, Expanding opcodes, types of addressing
modes, data transfer and manipulation instructions, Program control( status-bit conditions,
conditional branch instructions, program interrupt, types of interrupt).

SECTION-B
Register Transfer Language: Register Transfer, Bus and memory transfer, Arithmetic micro-
operations, Logic micro-operations, Shift micro-operations, Arithmetic logic sift unit
Micro-programmed control, control word, control memory ( concepts only)
Input-output Organisation- I/O interfaces (I/O bus and interface modules, I/O versus memory
bus, isolated versus memory-mapped I/O).
Asynchronous Data transfer (strobe control, handshaking), modes of transfer (programmed
I/O, interrupt-initiated I/O, software considerations), Direct memory access.

Text Books:
1. Jyotsna Sengupta, „Fundamentals of Computer Organization and Architecture‟,
NuTech Books, Deep and Deep Publications, New Delhi, 2009,
References:
1. M. Morris Mano, Digital Logic and Computer Design, Prentice Hall of India.
2. Andrew S. Tannenbaum, “Structured Computer Organisation” 4th Edition, Prentice
Hall.
3. J.P.Hayes Tata McGraw-Hill, Computer Organization and Architecture TMH
4. William Stallings, "Computer System Architecture", PHI

6
BCA-214: Object Oriented Programming using C++

Max Marks: 75 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Lectures to be delivered: 45-55 Hrs

(A) INSTRUCTION FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Section A and B will have four
questions from the respective section of the syllabus carrying 15 marks for each question.
Section C will consist of 5-10 short answer type questions carrying a total of 15 marks, which
will cover the entire syllabus uniformly. Candidates are required to attempt five questions in
all by selecting at least two questions each from the section A and B. Section C is
compulsory.

(B) INSTRUCTIONS FOR THE CANDIDATES

Candidates are required to attempt five questions in all by selecting at least two questions
each from the section A and B. Section C is compulsory.

Section-A
Evolution of OOP : Procedure Oriented Programming, OOP Paradigm, Advantages and
disadvantages of OOP over its predecessor paradigms.
Characteristics of Object Oriented Programming : Abstraction, Encapsulation, Data
hiding, Inheritance, Polymorphism, code Extensibility and Reusability, User defined Data
Types.
Introduction to C++ : Identifier and keywords, Constants, Operators
Pointers: Pointer Operations, Pointer Arithmetic, Pointers and Arrays, Multiple indirections,
Pointer to functions.
Function : Prototyping, Definition and Call, Scope Rules, Parameter Passing Value, by
address and by reference, Functions returning references, Const Functions, recursion,
function overloading, Default Arguments, Const Arguments.
Classes, Objects and Members : Class Declaration and Class Definition, Defining member
functions, Defining Object, making functions inline, Members access control, Nested
Classes, This Pointer.

Section-B
Object as function arguments, array of objects, functions returning objects, const members
and member functions. Static data members and static member functions, Friend functions
and Friend classes.
Constructors : Properties, types of constructors (Default, parameterized and copy), Dynamic
constructors, Multiple constructors in classes.
Destructors : Properties, Virtual destructors, Destroying objects, Rules for constructors and
destructors, Array of objects.
Dynamic memory allocation using new and delete operators.
Inheritance : Defining derived classes, inheriting private members, single inheritance, types
of derivation, function, function redefining, constructors in derived class.
Types of inheritance: Single, Multiple, Multi level and Hybrid,
Types of base classes: Direct, Indirect, Virtual, Abstract, Code Reusability.
Polymorphism : Methods of achieving polymorphic behavior. Polymorphism with pointers,
virtual functions, late binding, pure virtual functions and abstract base class. Difference
between function overloading, redefining and overriding.
Operator overloading: Overloading binary operator, overloading unary operators, rules for
operator overloading, operator overloading using friend function. Function overloading, early
binding.
Open/ Close Files commands. Read/write operations on files.

7
Text Books
1. E. Balagurusamy, “ Object Oriented Programming with C++”, Tata McGraw-Hill.
2. Deitel and Deitel, “C++ How to Program”, Pearson Education.
References:

1 Herbert Schildt, The Complete Reference C++, Tata McGraw-Hill, 2001

2 Deitel and Deital, C++ How to program, Pearson Education 2001.
3 Robert Lafore, Object Oriented Programming in Turbo C++, Galgotia Publications,
1994.
4 Bajane Stautrup, The C++ Programming Language, Addition,-Wesley Publication
Co., 2001.
5 Stanley B. Lippman, Losee Lajoic, C++. Primer; Pearson Education, 2002
6 E. Balagurusamy, Object-Oriented Programming with C++, Tata McGraw-Hill, 2001
7 D. Ravichandran, Programming with C++ - 2nd edition, Tata McGraw-Hill
Publishing Company Ltd.

8
BCA-215: Fundamentals of Database Management System

Max Marks: 75 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Lectures to be delivered: 45-55 Hrs

(A) INSTRUCTION FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Section A and B will have four
questions from the respective section of the syllabus carrying 15 marks for each question.
Section C will consist of 5-10 short answer type questions carrying a total of 15 marks, which
will cover the entire syllabus uniformly. Candidates are required to attempt five questions in
all by selecting at least two questions each from the section A and B. Section C is
compulsory.
(B) INSTRUCTIONS FOR THE CANDIDATES
Candidates are required to attempt five questions in all by selecting at least two questions
each from the section A and B. Section C is compulsory.

SECTION A

Introduction: Database Approach, Characteristics of a Database Approach, Database System

Environment.
Roles in Database Environment: Database Administrators, Database Designers, End Users,
Application Developers.
Database Management Systems: Definition, Characteristics, Advantages of Using DBMS
Approach, Classification of DBMSs.
Architecture: Data Models, Categories of Data Models- Conceptual Data Models, Physical
data Models, Representational Data Models, such as, Object Based Models, Record Based
Models, Database Schema and Instance, Three Schema Architecture, Data Independence –
Physical and Logical data Independence.
Database Conceptual Modelling by E-R model: Concepts, Entities and Entity Sets,
Attributes, Mapping Constraints, E-R Diagram, Weak Entity Sets, Strong Entity Sets.
Enhanced E-R Modelling: Aggregation, Generalization, Converting ER Diagrams to
Tables.
Relational Data Model: Concepts and Terminology, Characteristics of Relations.
Constraints: Integrity Constraints- Entity and Referential Integrity constraints, Keys-
Super Keys, Candidate Keys, Primary Keys, Secondary Keys and Foreign Keys.

SECTION B

Relational Algebra: Basic Operations, Additional Operations, Example Queries.

Database Design: Informal Design Guidelines for Relation Schemas, Problems of Bad
DatabaseDesign,
Normalization: Functional Dependency, Full Functional Dependency, Partial Dependency,
Transitive Dependency, Normal Forms– 1NF, 2NF, 3NF, Boyce-Codd NF,
MS-ACCESS: introduction to MS-ACCESS, working with databases and tables, queries in
Access, Applying integrity constraints, Introduction to forms, sorting and filtering, controls,
Reports and Macro: creating reports, using Macros.

Text Book:
1. Elmisry Navathe, “Introduction to Database Systems”, Pearson Education India.
2. Content Development Group” Working with MS-OFFICE 2000 “, TMH.
References:
1. Henry F. Korth, Abraham, "Database System Concepts", Tata McGraw Hill.
2. Naveen Prakash, Introduction to Database Management”, TMH, 1993.
3. C.J. Date, "An Introduction to Data Base Systems", Pearsoned Education India.
9
BCA-216: Software Lab – IV
(Based on paper BCA-214: Object Oriented Programming using C++)

Max Marks: 50 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Practical Sessions to be conducted: 40-50 Hrs

This laboratory course will comprise as exercises to supplement what is learnt under paper
BCA-214: Object Oriented Programming using C++. Students are required to develop the
following programs in C++ language with internal documentation:

1. Create a class to store student information with data members as roll no, name, marks
in 3 subjects total and average using constructor where ever required.
2. Write a program using Abstract Data Type (ADT) to find largest and smallest
elements in an array.
3. Write a program in C++ to implement Bubble sort and Selection Sort
4. Write a program in C++ to implement Quick Sort.
5. Write a program using ADT to perform linear search.
6. Write a program using ADT to perform binary search.
7. Write a program using ADT to add and subtract two matrices.
8. Write a program using ADT to Multiply and Transpose two matrices.
9. Write a program to read 2 integers and perform simple arithmetic operations using
pointer technique. (Use new and delete operators)
10. Write a program to read an array and display an array using dynamic memory
allocation.
11. Write C++ programs to implement Stack ADT using array.
12. Write C++ programs to implement Queue ADT using array.
13. Write a program to create memory space for a class object using new operator and to
destroy it using delete operator.
14. Develop an Object Oriented program in C++ to read emp name, emp code,
designation, experience and age. Construct the database with suitable member
functions for initializing and destroying the data using constructor and destructor and
dynamic memory allocation operators new and delete.
15. Write a program in C++ to prepare mark sheet of an University exam by reading
stuname, rollno, subname, subcode, internal marks, external marks. Design a base
class consisting data members such as student name, roll no, sub name. Derived class
consists data members such as sub code, internal marks, external marks, construct
oops data to search for a record i.e. be printed.

The break up of marks for the practical will be as under

i. Lab Record (Internal Assessment) 15 Marks
ii. Viva Voce (External Evaluation) 15 Marks
iii. Program Development and Execution(External 20 Marks
Evaluation)

10
BCA-217: Software Lab – V

Max Marks: 50 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Practical Sessions to be conducted: 40-50 Hrs

This laboratory course will comprise as exercises to supplement what is learnt under paper
BCA-215: Fundamentals of Database Management System. Students are required to practices
following:

1. Creating tables in MS ACCESS using different ways.

2. Import and export data from MS ACCESS.
3. Creating queries in MS ACCESS for selection, projection, Cartesian product, union,
4. intersection and difference.
5. Creating queries in MS ACCESS for different types of joins.
6. Creating forms in MS ACCESS
7. Creating application using switchboard.

The break up of marks for the practical will be as under

i. Lab Record (Internal Assessment) 15 Marks
ii. Viva Voce (External Evaluation) 15 Marks
iii. Program Development and Execution(External 20 Marks
Evaluation)

11
 BCA-218 : phHphHJ/H$phH;hHJ/H$phHghHJhH Gkr^d{ik, gzikph bkiawh (;w?;No shik ns/ u"Ek)
2015^16, 2016^17 ns/ 2017^18 ;?PB bJh
(;w?;No shik)

e[b nze L 100 gk; j'D bJh nze L35

nzdo{Bh w[bKeD L 25 nze nzdo{Bh w[bKeD ftu'A gk; j'D bJh nze L 09
pkjoh gohfynkL 75 nze pkjoh gohfynk ftu'A gk; j'D bJh nze L 26
;wK L 3 xzN/ (nfXnkgBL 50 ghohnv, 6 ghohnv gqsh jcsk)

gkmeqw ns/ gqPB^gZso dh o{g^o/yk

Gkr^T

ejkDhnK dh g[;se ;zgkfds ehsh ikt/rh.

Gkr^n
n^1 ;zy/g ouBk
n^2 ftnkeoDL
(i) w{b ftnkeoBe fJekJhnK dh gSkD s/ ;Ekgsh
(ii) tke pDso ns/ tke ouBk
(iii) T[gtke pDso L gSkD s/ ekoi

Gkr^J

Gkr T ns/ n d/ ftnkeoD tkb/ Gkr ftu'A ;zy/g T[soK tkb/ gq;aB.

nµe^tµv s/ g/go ;?ZNo bJh jdkfJsK

1H Gkr T ftu'A ejkDh dk ftPk t;s{$;ko (fszB ftu'A fJe) 12 nze
2H gkso fusoB (fszB ftu'A fJe) 12 nµe
3H ;zy/g ouBk 09 nµe
4H Gkr n^2 ftub/ ftnkeoD tkb/ Gkr ftu'A toDBkswe gqPB (d' ftu'A fJ¤e) 12 nµe
5H Gkr T ftu'A ejkDhnK ns/ n^2 ftnkeoD tkb/ Gkr ftu'A ;zy/g T[soK tkb/
15 gqPB g[ZS/ ikDr/.ftfdnkoEhnK B/ ;ko/ gqPB eoB/ j'Dr/.
jo/e gqPB d/ 2 nze j'Dr/. 15x2=30 nµe

;jkfJe gkm^;kwqrh
1H vkH i'frµdo f;µx g[nko ns/ j'o, gµikph GkPk dk ftnkeoD Gkr^., gµikph GkPk nekdwh ibµXo, 1991,
gµBk 67^73
2H vkH i'frµdo f;µx g[nko ns/ j'o, gµikph GkPk dk ftnkeoD Gkr^.., gµikph GkPk nekdwh ibµXo, 1992
3H frH bkb f;µx s/ joehos f;µx, ekbi gµikph ftnkeoD, gµik; ;N/N :{BhH N?;eN p[¤e p'ov, uµvhrVQ
4H ;µs f;µx ;/y'A, ;kfjsnkoE, bkj"o p[¤e Pkg, b[fXnkDk
5H vkH pbd/t f;zx Xkbhtkb, gzikph ejkDh dk fJfsjk;, gzikph nekdwh, fdZbh
6H y'I gfsqek (rbg ftP/P nze), gzikph :{Bhtof;Nh, gfNnkbk
7H vkH irihs f;zx, gzikph ftnkeoBL Po/DhnK s/ fJekJhnK

12
 BCA-218 : gzikph bkIwh (w[ZYbk frnkB) Gkr^d{ik (;w?;No shik ns/ u"Ek)
2015^16 ;?a;aB bJh

;w?;No shik

e[b nze L 100 gk; j'D bJh nze L 35

nzdo{Bh w[bKeD L 25 nze nzdo{Bh w[bKeD ftu'A gk; j'D bJh nze L 09
pkjoh gohfynkL 75 nze pkjoh gohfynk ftu'A gk; j'D bJh nze L 26
;wK L 3 xzN/ (nfXnkgBL 50 ghohnv, 6 ghohnv gqsh jcsk)

gkmeqw ns/ gqaPB^gZso dh o{g^o/yk

fBoXkos g[;seL gzikph dh gkm g[;se, pbd/t f;zx uhwk,

gpbhe/PB fpT{o', gzikph :{Bhtof;Nh, gfNnkbk
(fJ; g[;se ftu'A Gkr gfjbkL gzikph ;kfjs tkbk Gkr fJ; ;w?;No
d/ f;b/p; ti'A gfVQnk ikDk j?.

Gkr^T

eftsk
Gkr^ n
n^1 ejkDh
n^2 BkNe
Gkr^J
T[go'es gkmeqw s/ nkXkos ;zy/g T[~soK tkb/ gqPB.
nze tzv s/ g/go ;?ZNo bJh jdkfJsK
1H ftfdnkoEhnK B/ gzikph GkPk ns/ r[ow[yh fbgh dk w[Ybk frnkB gqkgs ehsk j? . fJ; bJh ftfdnkoEhnK
d/ GkPk ns/ fbgh d/ frnkB B{z fXnkB ftu oyfdnK ;ob, ;gPN ns/ S'N/ T[~soK tkb/ gqPB jh g[ZS/ ikD.
2H ;ko/ GkrK ftZu'A gqPB g[ZS/ ikD.
3H ;ob s/ ;gPN gqPB g[ZS/ ikD.
4H toDkswe gqPB Bk g[ZS/ ikD.
5H b'V nB[;ko ftfdnkoEhnK B{z S'N iK u'D d/Dh bkIwh j?.
6H Gkr T ftu'A fe;/ eftsk d/ ;ob noE iK ;ko (gzi ftu'A d') 2x05=10 nµe
7H fe;/ ekft N[eV/ s/ Gkt noE (fszB ftu'A fJe) 05 nze
8H fe;/ ejkDh dk ;zy/g ;ko$fe;/ xNBk pko/ ikDekoh (fszB ftu'A fJe) 10 nze
9H gkso ;pzXh ;zy/g ikDekoh (fszB ftu'A fJe) 05 nze
10HBkNe dk ;zy/g ;ko$ftPk 10 nze
11Hgkso ;pzXh ikDekoh 05 nze
12HGkr J ftu ;ko/ f;b/p; s/ nkXkos ;zy/g T[ZsoK tkb/ 15 gqPB g[ZS/
ikDr/. ftfdnkoEh B/ ;ko/ gqPB eoB/ j'Dr/. jo/e gqPB dk T[so 3^4 ;soK
ftu d/Dk j't/rk. jo/e gqPB d/ 2 nze j'Dr/. 15x2=30 nµe

13
BCA-221: English Communication Skills – II

Max Marks: 75 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Lectures to be delivered: 45-55 Hrs

English Communication Skills has been designed to develop the student‟s communicative
competence in English. Therefore, content selection is determined by the student‟s present
and future academic, social and professional needs.

Texts Prescribed for Grammar and Vocabulary:

1. Old man and the Sea by Earnest Hemmingway
2. Living English Structure : W. Standard Allen (Orient Longman)
3. The written word by Vandana R. Singh
4. The Students’ Companion by Wilfred D. Best

SECTION A

Q.1 (a) One essay type question with an internal choice for about 250-300 words from Old
Man and The Sea. 10 marks
(b) 5 short answer type questions to be attempted out of the given eight from Old man &
the Sea (40-50 words) 5×2 = 10
marks
SECTION B – COMPOSITION
Q.2 (a) Small words for big ones from the book Students‟ Companion (Attempt 5 words out
of given 8) 5 marks
(b) Two short formal classified advertisements and display advertisement from the given
three. 5+5= 10
marks
(c) One Report writing from the given 2 topics 10 marks
(d) Two short formal notice writing such as public, legal and memorandum from the
given three 5+5 = 10
marks
SECTION C - GRAMMAR
Q.3 (a) Transforming one type of sentences to another type of sentences including narration,
voice & Tenses. Students are required to attempt 15 sentences out of given 18.
5+5+5 = 15
marks
(b) Transforming of Degree
Attempt 5 out of given eight sentences 5 marks

14
BCA-222: Computer Networks

Max Marks: 75 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Lectures to be delivered: 45-55 Hrs

(A) INSTRUCTION FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Section A and B will have four
questions from the respective section of the syllabus carrying 15 marks for each question.
Section C will consist of 5-10 short answer type questions carrying a total of 15 marks, which
will cover the entire syllabus uniformly. Candidates are required to attempt five questions in
all by selecting at least two questions each from the section A and B. Section C is
compulsory.
(B) INSTRUCTIONS FOR THE CANDIDATES
Candidates are required to attempt five questions in all by selecting at least two questions
each from the section A and B. Section C is compulsory.

SECTION-A
Introduction to Computer networks, Applications, Network hardware and Software (protocol
hierarchies, design issues for layers, interfaces and services: connection oriented and
connection less), Network structure and architecture- point to point, multicast, broadcast,
Classification of networks-LAN, MAN and WAN. Reference models, the OSI reference
model, TCP / IP reference model. Comparison between OSI and TCP / IP models. Data Link
Layer: Design issues, Services to network layer, Framing, Error control, Flow control,
Elementary data link protocols- unrestricted simplex protocol, simplex stop and wait
protocol, simplex protocol for a noisy channel.

SECTION-B
Network layer: Design issues, Services to the transport layer, Routing algorithms- Static/
non-adaptive and dynamic/adaptive algorithms. Congestion control algorithms – the leaky
bucket algorithm, the token bucket algorithm.
Transport layer, design issues, connection management-addressing, establishing and releasing
connection, transport layer protocols- TCP, UDP.
Application layer: The DNS Name Space, Electronic Mail, The World Wide Web, Network
security: Introduction to cryptography, substitution cipers, transposition cipers, one-time
pads, two fundamental cryptographic principles, public-key algorithms (RSA, other Public-
key algorithms), digital signatures (symmetric-key signatures, public key-signatures, message
digests

Text Books:
1. B Forousan, Introduction to data communication and networking
2. A S Tanenbaum, Computer Networks.

15
BCA-223: Management Information System

Max Marks: 75 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Lectures to be delivered: 45-55 Hrs

(A) INSTRUCTION FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Section A and B will have four
questions from the respective section of the syllabus carrying 15 marks for each question.
Section C will consist of 5-10 short answer type questions carrying a total of 15 marks, which
will cover the entire syllabus uniformly. . Candidates are required to attempt five questions
in all by selecting at least two questions each from the section A and B. Section C is
compulsory.

(B) INSTRUCTIONS FOR THE CANDIDATES

Candidates are required to attempt five questions in all by selecting at least two questions
each from the section A and B. Section C is compulsory.

SECTION-A
Management Information system: Meaning and definition, Role of information system,
Nature and scope of MIS.
Information and system concepts: Definition and types of information, Information quality,
dimensions of information, value of information, general model of human as an information
processor. System related concepts, elements of a system, and types of system.
Role and importance of Management: Introduction, levels and functions of management.
Structure and classification of MIS, Components of MIS, Framework for understanding MIS:
Robert Anthony‟s hierarchy of management activity, Information requirements and levels of
management.

SECTION-B
Decision making concept, types of decisions, methods of choosing among alternatives, Role
of MIS in decision making.
Simon‟s model of decision making, Structured and unstructured decisions.
Development of MIS: Stages in the development of MIS, System development approaches:
Waterfall model, Prototyping, Iterative enhancement model, Spiral model.
Applications of information systems in Functional areas: Marketing MIS, Financial MIS,
Production MIS, Personnel MIS.
Decision Support Systems: Definition and characteristics, MIS versus DSS, Tools and
Models for decision support.

Text Book:
1. D.P. Goyal, “Management Information Systems: Managerial Perspectives”,
Macmillan India Ltd.
References:
1. Robert G. Murdick, Joel E. Ross, James R. Claggett, “Information Systems for
Modern Management”, Prentice Hall of India Pvt. Ltd.
2. Gordon B. Davis, M.H. Olson, “Management Information Systems: Conceptual
Foundations, Structure & Development”, McGraw-Hill Book Co.
3. W.S. Jawadekar, “Management Information Systems”, Tata McGraw-Hill Publishing
Co.

16
BCA-224: Computer Oriented Numerical and Statistical Methods

Max Marks: 75 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Lectures to be delivered: 45-55 Hrs

(A) INSTRUCTION FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Section A and B will have four
questions from the respective section of the syllabus carrying 15 marks for each question.
Section C will consist of 5-10 short answer type questions carrying a total of 15 marks, which
will cover the entire syllabus uniformly. Candidates are required to attempt five questions in
all by selecting at least two questions each from the section A and B. Section C is
compulsory.

(B) INSTRUCTIONS FOR THE CANDIDATES

1. Candidates are required to attempt five questions in all by selecting at least two questions
each from the section A and B. Section C is compulsory.
2. Use of Non-Programmable Scientific calculator is allowed.

SECTION-A
Basics: Floating point representation of numbers, arithmetic operation with normalised
floating point numbers and its consequences, errors in numbers, binary representation of
numbers.
Solution of transcendental equations: Bi-section method, Regula-falsi method,
Newton/Raphson method, Secant method
Solution of simultaneous algebraic equations: Gauss elimination method, pivoting, ill-
conditioned equations, Gauss-Seidel iterative method, comparison of direct and iterative
method.

SECTION-B
Interpolation: Lagrange's interpolation, Newton Interpolation
Curve Fitting: Linear regression, Polynomial regression, Exponential Regression
Introduction to Statistics: Meaning, scope, collection, classification of data. Application
based on and processing logic of measures of central tendency, dispersion.
Bivariate Data: Correlation, Meaning, and Type of correlation, correlation and causation,
methods of studying correlation, algorithm to compute Karl Pearson's Correlation and rank
correlation. Applications based on correlation.
Linear Regression: Processing logic of and numericals based on fitting of regression lines
(Using least square method).( Properties without Proofs)

Text Book:
1. V. Rajaraman, "Computer Oriented Numerical Methods”, PHI, New Delhi, 1994
2. Murray R Spiegel, Larry J. Stephens - “Statistics” Schaum's Outlines
References:
1. J.H. Mathews," Numerical Methods for Computer Science, Engineering and
Mathematics", PHI,
2. M K. Jain, S.R.K. Iyengar and R.K. Jain," Numerical Methods for Scientific and
Enginerring Computation", Wiley Eastern Limited, New Delhi,
3. S.C. Chopra and R.P.C Anale,”Numarical Methods for Engineers”, McGraw-Hill,
New York

17
BCA-225: Relational Database Management System with Oracle

Max Marks: 75 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Lectures to be delivered: 45-55 Hrs

(A) INSTRUCTION FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Section A and B will have four
questions from the respective section of the syllabus carrying 15 marks for each question.
Section C will consist of 5-10 short answer type questions carrying a total of 15 marks, which
will cover the entire syllabus uniformly. . Candidates are required to attempt five questions
in all by selecting at least two questions each from the section A and B. Section C is
compulsory.

(B) INSTRUCTIONS FOR THE CANDIDATES

Candidates are required to attempt five questions in all by selecting at least two questions
each from the section A and B. Section C is compulsory.

SECTION-A
Introduction to RDBMS Product and their Features, Difference between DBMS and
RDBMS, Relationship among application programs, RDBMS,
Basic File Operations: Opening Files, Closing Files, Reading and Writing, Seeking
File Organization: Field and Record structure in file, Record Types, Types of file
organization, Sequential, Indexed, and Hashed.

Transaction Management: Transaction Concept, Properties, Transaction States, Concurrent

Execution, Serializability, Conflict Serializability, View Serializability, Recoverability,
Recoverable Schedule, Cascadless Schedule
Concurrency Control: Lock Based Protocol, Locks, Granting of Locks, Two Phase Locking
Protocol, Timestamp Based Protocol, Timestamp, Timestamp ordering protocol, Thomas‟s
Write Rule, Validation Based Protocol, Deadlock Handling, Deadlock Prevention, Deadlock
Detection, Deadlock Recovery

SECTION-B

Recovery System: Failure Classification, Transaction Failure, System Crash, Disk Failure,
Storage Structures, Storage Types, Data Access, Recovery & Atomicity, Log based
Recovery, Deferred Database Modification, Immediate Database Modification, Checkpoints,
Recovery with Concurrent Transaction, Transaction Rollback, Restart Recovery, Remote
Backup System

Relational Query Language: DDL, DML, DCL.

Introduction to Oracle: Oracle as client/server architecture, getting started, creating,
modifying, dropping databases. Inserting, updating, deleting data from databases, SELECT
statement, Data constraints ( Null values, Default values, primary, unique and foreign key
concepts)
Computing expressions, renaming columns, logical operators, range searching, pattern
matching, Oracle functions, grouping data from tables in SQL, manipulating dates.
Working with SQL: triggers, use of data base triggers, database triggers Vs. SQL*forms,
types of triggers, how to apply database triggers, BEFORE vs. AFTER triggers,
combinations, syntax for creating and dropping triggers.
Text Book :
1. B.P. Desai, “Database management system” BPB publications, New Delhi.

18
References:

1. C.J. Date, "An Introduction to Data Base Systems", 3rd Ed., Narosa Publishers
2. Jeffrey D. Ullman, "Principles of Database Systems", 2nd Ed., Galgotia Pub.
3. D. Kroenke., "Database Processing", Galgotia Publications.
4. Henry F. Korth, “Database System Concepts”, McGraw Hill. Inc.
5. Naveen Prakash, “Introduction to Database Management”, TMH
6. Ivan Bayross, “ Oracle 7 The complete reference”, BPB Publications.
7. Bobrowsky, “ Client server architecture and Introduction to Oracle 7”, 1996

19
BCA-226: Software Lab – VI
(Based on paper BCA-224: Computer Oriented Numerical and Statistical Methods)

Max Marks: 50 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Practical Sessions to be conducted: 40-50 Hrs

This laboratory course will comprise as exercises to supplement what is learnt under paper
BCA-224: Computer Oriented Numerical and Statistical Methods. Students are required to
develop the following programs in C/C++ language with internal documentation:

1. Write a program to compute the mean and weighted mean of raw data.
2. Write a program to compute the mean and weighted mean of discrete series (x, f).
3. Write a program to compute the mean and weighted mean of continuous series.
4. Write a program to compute the mode and median of raw data.
5. Write a program to compute the median of discrete series (x, f).
6. Write a program to compute the median of continuous series.
7. Write a program to compute the mode of discrete series (x, f).
8. Write a program to compute the mode of continuous series.
9. Write a program to compute the standard deviation and variance of discrete series.
10. Write a program to compute the standard deviation and variance of continuous series.
11. Write a program to compute the correlation using Karl Pearson's Correlation
12. Write a program to compute the regression coefficients.
13. Write a program for Bisection method.
14. Write a program for Regula-falsi method.
15. Write a program for Secant method.
16. Write a program for Newton-Raphson method.
17. Write a program for Gauss-Elimination method.
18. Write a program for Lahrange‟s Interpolation method.
19. Write a program for Newton-Interpolation method.

The break up of marks for the practical will be as under

i. Lab Record (Internal Assessment) 15 Marks
ii. Viva Voce (External Evaluation) 15 Marks
iii. Program Development and Execution(External 20 Marks
Evaluation)

20
BCA-227: Software Lab – VII
(Oracle lab based on paper BCA-225: Relational Database Management System with
Oracle)

Max Marks: 50 Maximum Time: 3 Hrs.

Min Pass Marks: 35% Practical Sessions to be conducted: 40-50 Hrs

This laboratory course will comprise as exercises to supplement what is learnt under paper
BCA-225: Relational Database Management System with Oracle. Students are required to
practices writing SQL statements for

1. Creating the Table

2. Querying the record using order by clause
3. Querying the record using group by clause
4. Querying the record using multiple conditions
5. Create Synonyms
6. Create Sequences
7. Create Views
8. Create Indexes
9. Create triggers
10. Create cursors for procedures

The break up of marks for the practical will be as under

i. Lab Record (Internal Assessment) 15 Marks
ii. Viva Voce (External Evaluation) 15 Marks
iii. Program Development and Execution(External 20 Marks
Evaluation)

21
BCA : 228 Environmental and Road Safety Awareness

Time Allowed : 3 hours Total Marks : 100

Total lectures : 50 Pass marks : 35

Theory Paper : 70 marks+Internal Assessment 30 marks

Instructions
(a) The paper has been introduced from the session 2013-14.
(b) The paper will be taught in the Second year/fourth Semester of all the U.G.
Courses (B.A., B.Com., B.Sc., Law, Engineering, Commerce, Agriculture etc.)
except L.L.B. Three year course and will be a qualifying paper only. The marks of
this paper will not be counted towards final score of the under graduate degree.
(c) This will cover only preliminary and basics of the subject and the paper will be set
accordingly.
(d) The question paper will consist of three sections A, B and C. Section A and B will
have four questions in each section from the respective sections of the syllabus
and will carry 10 marks each. Section C will syllabus uniformly and will carry 30
marks in all.
(e) Candidates are required to attempt two questions from each section A and B and
the entire Section C.

Section – A
Unit 1 : The multidisciplinary nature of environmental studies. Definition, scope and
importance
 Concept of Biosphere – Lithosphere, Hydrosphere, Atmosphere.
 Need for public awareness (6 lectures)
Unit – 2 Natural Resources – Renewable and non-renewable resources.
 Natural resources and associated problems.
a) Forest resources : use and over exploitation, deforestation and its impact.
b) Water resources ; use and overutilization of surface and ground water and its
impact.
c) Mineral resources : use and effects on environment on over exploitation.
d) Food resources : Effects modern agriculture, fertilizer-pesticide problem,
water logging and salinity.
e) Energy resources : Growing energy needs, renewable and non-renewable
energy sources, use of alternate energy resources.
f) Role of an individual in conservation of natural resources for sustainable
development. (7 lectures)
Unit 3 : Ecosystems
 Ecosystem and its components : Definition, structure and function; producer,
consumer and decomposer.
 Types of Ecosystem (Introduction only)
 Food Chains, food web and ecological pyramids (6 lectures)
Unit – 4 : Biodiversity and conservation
 Introduction – Definition : genetic, species and ecosystem diversity, value of
biodiversity.
 Hot spots of biodiversity
 Threats to biodiversity : habitat loss, poocting of wildlife, man-wildlife conflicts.
 Endangered and endemic species of India.
 Conservation of Biodiversity. (6 lectures)
22
 Section – II
Units 5 : Environmental Pollution
 Definition, causes, effects and control measures of
a) Air pollution
b) Water pollution
c) Soil pollution
d) Marine pollution
e) Noise pollution
f) Thermal pollution
g) Nuclear hazard
 Role of an individual in prevention of pollution.
 Solid waste management : vermicomposting.
 Disaster management : Floods, earthquake, cyclone and landslides (7 lectures)
Unit 6 : Social Issues and the Environment
 Urban problems related to energy.
 Water conservation rain water harvesting, water shed management.
 Resettlement and rehabilitation of people : its problems and concerns.
 Climate changes, global warming, acid rain, ozone layer depletion.
 Consumerism and waste products.
 Population explosion – Family welfare programme (6 lectures)

Unit 7 : Introduction to Environmental Protection Laws in India

 Environmental Protection Act.
 Air (Prevention and control of pollution) Act.
 Water (Prevention and Control of pollution) Act.
 Wild life Protection Act.
 Forest Conservation Act.
 Issues involved in the enforcement of environmental legislation. (6 lectures)
Unit 8 : Road safety Awareness
 Concept and significance of Road safety.
 Traffic signs.
 Traffic rules.
 Traffic Offences and penalties.
 How to obtain license.
 Role of first aid in Road Safety. (6 lectures)

23
 BCA : 229 : phHphHJ/H$phH;hHJ/H$phHghHJhH Gkr^d{ik, gzikph bkiawh (;w?;No shik ns/ u"Ek)
2015^16, 2016^17 ns/ 2017^18 P?;B bJh
(;w?;No u"Ek)

e[b nze L 100 gk; j'D bJh nze L 35

nzdo{Bh w[bKeD L 25 nze nzdo{Bh w[bKeD ftu'A gk; j'D bJh nze L 09
pkjoh gohfynkL 75 nze pkjoh gohfynk ftu'A gk; j'D bJh nze L 26
;wK L 3 xzN/ (nfXnkgBL 50 ghohnv, 6 ghohnv gqsh
jcsk)

gkmeqw ns/ gqPB^gZso dh o{g^o/yk

Gkr^T

eftsktK dh g[;se ;zgkfds ehsh ikt/rh.

Gkr^n
n^1 nB[tkd
n^2 ftnkeoDL
(i) r[ow[yh fbgh dk fJfsjk;
(ii) r[ow[yh fbgh dhnK ftP/PsktK
(iii) gzikph Ppd i'VK d/ fB:w

Gkr^J

Gkr T ns/ n d/ ftnkeoD tkb/ gkr ftu'A ;zy/g T[soK tkb/ gq;aB.

nµe^tµv s/ g/go ;?ZNo bJh jdkfJsK

1H Gkr T ftu'A eftsk dk ftPk t;s{$;ko (fszB ftu'A fJe) 12 nze

2H gq;zr ;fjs ftnkfynk (uko ftu'A d') 2x6=12 nµe

3H nB[tkd (nzro/Ih s'A gzikph) 09 nµe
4H Gkr n^2 ftub/ ftnkeoD tkb/ Gkr ftu'A toDBkswe gqPB (d' ftu'A fJ¤e) 12 nµe
5H Gkr T ftu'A eftsk dh g[;se ns/ n ^2 ftnkeoD tkb/ Gkr ftu'A ;zy/g T[soK
tkb/ 15 gqPB g[ZS/ ikDr/.
ftfdnkoEhnK B/ ;ko/ gqPB eoB/ j'Dr/. jo/e gqPB d/ 2 nze j'Dr/. 15x2=30 nµe

;jkfJe gkm^;kwqrh
1H vkH i'frµdo f;µx g[nko ns/ j'o, gµikph GkPk dk ftnkeoD Gkr^., gµikph GkPk nekdwh ibµXo, 1991,
gµBk 67^73
2H vkH i'frµdo f;µx g[nko ns/ j'o, gµikph GkPk dk ftnkeoD Gkr^.., gµikph GkPk nekdwh ibµXo, 1992
3H frH bkb f;µx s/ joehos f;µx, ekbi gµikph ftnkeoD, gµik; ;N/N :{BhH N?;eN p[¤e p'ov, uµvhrVQ
4H ;µs f;µx ;/y'A, ;kfjsnkoE, bkj"o p[¤e Pkg, b[fXnkDk
5H okfiµdo gkb f;µx, nkX[fBe gµikph eftsk g[Bo fuµsB, b'erhs gqekPB, uµvhrVQ.
6H okfiµdo gkb f;µx, nkX[fBe gµikph eftsk dk fJfsjk;, gµikph nekdwh, fd¤bh.
7H i;ftµdo f;µx , BthA gµikph eftsk gSkD fuµB, u/sBk gqekPB, b[fXnkDk

24
 BCA : 229 : gzikph bkIwh (w[ZYbk frnkB) Gkr^d{ik (;w?;No shik ns/ u"Ek)
2015^16 ;?a;aB bJh

;w?;No u"Ek

e[b nze L 100 gk; j'D bJh nze L 35

nzdo{Bh w[bKeD L 25 nze nzdo{Bh w[bKeD ftu'A gk; j'D bJh nze L 09
pkjoh gohfynkL 75 nze pkjoh gohfynk ftu'A gk; j'D bJh nze L 26
;wK L 3 xzN/ (nfXnkgBL 50 ghohnv, 6 ghohnv gqsh jcsk)

gkmeqw ns/ gqaPB^gZso dh o{g^o/yk

fBoXkos g[;seL gzikph dh gkm g[;se, pbd/t f;zx uhwk,

gpbhe/PB fpT{o', gzikph :{Bhtof;Nh, gfNnkbk
(fJ; g[;se ftu'A Gkr d{ikL ;fGnkuko ns/ b'eXkok, Gkr shikL gzikph GkPk tkb/ GkrK B{z
f;b/p; ti'A gfVQnk ikDk j?.

Gkr^T

;fGnkuko ns/ b'eXkok

Gkr^ n
n^1 gzikph GkPk
n^2 g?oQk ouBk
Gkr^J
T[go'es gkmeqw s/ nkXkos ;zy/g T[~soK tkb/ gqPB.
nze tzv s/ g/go ;?ZNo bJh jdkfJsK
1H ftfdnkoEhnK B/ gzikph GkPk ns/ r[ow[yh fbgh dk w[Ybk frnkB gqkgs ehsk j?. fJ; bJh ftfdnkoEhnK
d/ GkPk ns/ fbgh d/ frnkB B{z fXnkB ftu oyfdnK ;ob, ;gPN ns/ S'N/ T[~soK tkb/ gqPB jh g[ZS/ ikD.
2H ;ko/ GkrK ftZu'A gqPB g[ZS/ ikD.
3H ;ob s/ ;gPN gqPB g[ZS/ ikD.
4H toDkswe gqPB Bk g[ZS/ ikD.
5H b'V nB[;ko ftfdnkoEhnK B{z S'N iK u'D d/Dh bkIwh j?.
6H Gkr T ftu'A fe;/ b/y d/ ;ob noE iK ;ko (uko ftu'A d') 2x5=10 nµe
7H fe;/ b/y ftub/ ftukoK ;pzXh ;zy/g ikDekoh (d' ftu'A fJe) 05 nze
8H b'eXkok ;pzXh ;ob gqPB (uko ftu'A d') 2x5=10 nµe
9Hgzikph GkPk dh w[Ybh ikDekoh ;pzXh gqPB 10 nze
10Hgkm g[;se ftu'A g?oQk$tke dh ftjkoe ftnkeoDe ikDekoh
(ftnkeoD tkb/ Gkr nB[;ko) 10 nze
11HGkr J ftu ;ko/ f;b/p; s/ nkXkos ;zy/g T[ZsoK tkb/ 15 gqPB g[ZS/
ikDr/. ftfdnkoEh B/ ;ko/ gqPB eoB/ j'Dr/. jo/e gqPB dk T[so 3^4 ;soK
ftu d/Dk j't/rk. jo/e gqPB d/ 2 nze j'Dr/. 15x2=30 nµe

25