Indira Gandhi University Meerpur Rewari

(A State University established under Haryana Act No.29 of 2013)

Examination Scheme & Syllabus for Bachelor of Computer Applications

(Semester-I to IV)

OUTCOME BASED EDUCATION SYSTEM /

LEARNING OUTCOME CURRICULUM FRAMEWORK

OBES / LOCF, CBCS CURRICULUM

VISION AND MISSION OF THE DEPARTMENT

VISION

To train students to be highly effective instructors, researchers, and contributors to IT companies

globally. Be regarded as a prestigious centre of scholarly achievement worldwide.

MISSION

1. To advance research and education in IT domain.

2. To create skilled employees for businesses and industries based on latest IT technologies.
3. To offer learning environments that are centered on the needs of the students in order to help
them develop as people as a whole.
Programme Outcomes (PO), BCA, Department of CSE, Indira Gandhi University, Meerpur,
Rewari

PO1 Knowledge Capable of demonstrating comprehensive disciplinary knowledge gained

during course of study.

PO2 Research Capability to ask relevant/ appropriate questions for identifying, formulating
Aptitude and analyzing the research problems and to draw conclusion from the
analysis.

PO3 Communication Ability to communicate effectively on general and scientific topics with the
scientific community and with society at large.

PO4 Problem Capability of applying knowledge to solve scientific and other problems.
Solving

PO5 Individual and Capable to learn and work effectively as an individual, and as a member or
Team Work leader in diverse teams, multidisciplinary settings.

PO6 Investigation of Ability of critical thinking, analytical reasoning and research based
Problems knowledge including design of experiments, analysis and interpretation of
data to provide conclusions.

PO7 Modern Tool Ability to use and learn techniques, skills and modern tools for scientific
usage practices.

PO8 Science and Ability to apply reasoning to assess the different issues related to society and
Society the consequent responsibilities relevant to the professional scientific
practices.

PO9 Life-Long Aptitude to apply knowledge and skills that are necessary for participating
Learning in learning activities throughout life.

PO10 Ethics Capability to identify and apply ethical issues related to one’s work; avoid
unethical behaviour such as fabrication of data, committing plagiarism and
unbiased truthful actions in all aspects of work.

PO11 Project Ability to demonstrate knowledge and understanding of the latest IT

Management technologies and apply these to manage projects.
Programme Educational Objectives (PEOs):
The Department of CSE has formulated the Programme Educational Objectives (PEO's) with
those in fields. The Programme educational objectives (PEO) are the statement that describes the
career and professional achievement after receiving the degree. The PEO's of the Bachelor’s degree
in Computer Applications are as follows:
PEO1: To have fundamental as well as advanced knowledge of the Information Technologies.
PEO2: To provide the professional services to IT industries, Research organization, in the domain
of super specialization.
PEO3: To opt for higher education, disciplinary & multi-disciplinary research and to be a life-long
learner.

Programme Specific Outcomes (PSO’s):

The Programme outcomes (PSO) are the statement of competencies/ abilities. PSOs are the
statement that describes the knowledge and the abilities the under-graduate will have by the end of
Programme studies.
PSO1: The detailed functional knowledge of theoretical concepts and experimental aspects of
computer science.
PSO2: To integrate the gained knowledge with various contemporary and evolving areas in
computer sciences like Artificial Intelligence, Machine Learning, Data Science etc.
PSO3: To understand, analyze, plan and implement qualitative as well as quantitative problems in
computer science.
PSO4: Provide opportunities to excel in academics, research or Industry.

Mapping of PEO’s with PO’s and PSO’s

S. Programme Educational
PSO1
PSO2
PSO3
PSO4
PO10
PO11
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9

No Objectives
.

1 To have fundamental as
well as advanced √ √ √ √ √ √ √ √ √ √ √ √ √ √ √
knowledge of IT.

2 To provide the
professional services to
industries, Research √ √ √ √ √ √ √ √ √ √ √ √ √ √ √
organization, in the domain
of super specialization.

3 To opt for higher

education, disciplinary &
multi-disciplinary research √ √ √ √ √ √ √ √ √ √ √ √ √ √ √
and to be a life-long
learner.
General objectives of the course

The broad objective of the BCA programme is to prepare under graduates for
productive careers in software industry, corporate sector, Govt. organizations and academia
by providing skill based environment for teaching and research in the core and emerging
areas of the discipline. The Programme’s thrust is on giving the students a thorough and
sound background in theoretical and skill-oriented courses relevant to the latest computer
software development. The programme emphasizes the application of software technology
to solve mathematical, computing, communications/networking and commercial problems.
This Bachelor’s Degree Programme has been designed with a semester approach in mind.

The first year courses are aimed at skills development in computers using various
technologies and focused on core courses providing conceptual frame work and the second
year provides the specialization and the project work.
1. Produce knowledgeable and skilled human resources which are employable in IT
and ITES.
2. Impart knowledge required for planning, designing and building complex
Application Software Systems as well as provide support to automated systems or
application.
3. Produce entrepreneurs who can develop customized solutions for small to large
Enterprises.
4. To develop academically competent and professionally motivated personnel,
equipped with objective, critical thinking, right moral and ethical values that
compassionately foster the scientific temper with a sense of social responsibility.
5. To develop students to become globally competent.
6. To inculcate Entrepreneurial skills among students

Expected Programme Outcomes

The Bachelor of Computer Applications (BCA) Programme will prepare its graduates to achieve:

1. The understanding to apply knowledge of computing and technological advances

appropriate to the programme.
2. Skills to analyze a problem, and identify and define the logical modeling of
solutions.
3. An ability to design implements and evaluate a computer-based system, process,
component, or programme to meet stakeholder needs.
4. The knack to function effectively in teams to accomplish a common goal.
5. A sense of professional, ethical, legal, security and social issues and
responsibilities.
6. Effectiveness in communicating with a wide range of audiences.
7. An ability to analyze the local and global impact of business solutions on
individuals, organizations, and society.
8. An identification of the need to engage in continuing professional development.
 BACHELOR OF COMPUTER APPLICATIONS (BCA) Regular
SYLLABUS AND SCHEME OF EXAMINATION – Ist YEAR( Ist and 2nd SEMESTERS)
w.e.f. 2017-18
Period per week: 6 for each theory paper and 6 for each practical group in each semester.

Paper No. Title of Paper Max. Marks Exam

Duration

External Internal 3 Hours

BCA-101 Computer & Programming 80 20 3 Hours
Fundamentals
BCA-102 PC Software 80 20 3 Hours
BCA-103 Mathematics 80 20 3 Hours
BCA-104 Logical Organization of 80 20 3 Hours
Computer-I
BCA-105 Practical software Lab – Based 80 20 3 Hours
on paper
BCA-102 i.e Word, Excel and
Power
point

Paper No. Title of Paper Max. Marks Exam

Duration

External Internal 3 Hours

BCA-106 ‘C’ Programming 80 20 3 Hours
BCA-107 Logical Organization of 80 20 3 Hours
Computer-II
BCA-108 Mathematical Foundations of 80 20 3 Hours
Computer Science
BCA-109 Structured System Analysis 80 20 3 Hours
and Design
BCA-110 Practical software Lab – 80 20 3 Hours
Based on paper BCA-106,
i.e.‘C’ Programming
 BCA-101: COMPUTER & PROGRAMMING FUNDAMENTALS

External Marks: 80
Internal Marks: 20
Time: 3 hours

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course objectives: The objectives of the course are:

(1) Provide fundamentals of programming.
(2) Provide fundamentals of C programming language.
(3) Provide fundamental knowledge of database management system which is relevant to GIS.

UNIT-I
Computer Fundamentals: Generations of Computers, Definition, Block Diagram along with
its components, characteristics & classification of computers, Limitations of Computers,
Human-Being VS Computer, Applications of computers in various fields.
Memory: Concept of primary & secondary memory, RAM, ROM, types of ROM, Cache
Memory, flash memory, Secondary storage devices: Sequential & direct access devices viz.
magnetic tape, magnetic disk, optical disks i.e. CD, DVD, virtual memory.
UNIT-II
Computer hardware & software: I/O devices, definition of software, relationship between
hardware and software, types of software.
Overview of operating system: Definition, functions of operating system, concept of
multiprogramming, multitasking, multithreading, multiprocessing, time-sharing, real time,
single-user & multi-user operating system.
Computer Virus: Definition, types of viruses, Characteristics of viruses, anti-virus software.
UNIT-III
Computer Languages: Analogy with natural language, machine language, assembly
language, high-level languages, forth generation languages, compiler, interpreter,
assembler, Linker, Loader , characteristics of a good programming language, Planning the
Computer Program:
Concept of problem solving, Problem definition, Program design, Debugging, Types of
errors in programming, Documentation.
Structured programming concepts, Programming methodologies viz. top-down and bottom-
up programming, Advantages and disadvantages of Structured programming.
UNIT-IV
Overview of Networking: An introduction to computer networking, Network types (LAN,
WAN, MAN), Network topologies, Modes of data transmission, Forms of data
transmission, Transmission channels(media), Introduction to internet and its uses,
Applications of internet, Hardware and Software requirements for internet, Intranet,
Applications of intranet.

Course Outcome:
CO1 :Understanding the concept of input and output devices of Computers
CO2:Learn the functional units and classify types of computers, how they process
information and how individual computers interact with other computing systems and
devices.
CO-3:Understand an operating system and its working, and solve common problems related
to operating systems
 CO4:Learn basic word processing, Spreadsheet and Presentation Graphics Software skills.
CO5: Study to use the Internet safely, legally, and responsibly.
CO6: Ability to use internet for searching information on web, sending e-mails and many
other tasks.
Mapping of Paper No. BCA-101

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S M S S S S M
CO2 S M S M S S S S S S S S S S S
CO3 S M S S S M S S S S S M S S S
CO4 S S M M S S S S M S S S S S S
CO5 M S S S S S M S S S S M S S M
CO6 S S S S S S S S S M S S M S S
S = Strong, M = Medium, W = Weak
SUGGESTED READINGS
1) Satinder Bal Gupta, Amit Singla: Computer Fundamentals & Programming in C, Shree
Mahavir Book (Publishers), Delhi.
2) Gill Nasib Singh: Computing Fundamentals and Programming in C, Khanna Books
Publishing Co., New Delhi.
3) Balagurusamy E, Computing Fundamentals and C Programming, Tata McGraw Hill.
4) Rajaraman, V., Fundamentals of Computers, PHI
5) Ram, B., Computer Fundamentals, Architecture & Organization, New Age International (P)
Ltd.
 BCA-102: PC SOFTWARE

External Marks: 80
Internal Marks: 20
Time: 3 hours

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course Objectives:
 To introduce the students about the system software and its application.
 To understand the working of different translators viz. Assembler and Compiler.
 To learn about the instructions of assembly language.
 To familiarize with various software development tools.
UNIT - I
MS-Windows: Operating system-Definition & functions, basics of Windows. Basic
components of windows, icons, types of icons, taskbar, activating windows, using desktop,
title bar, running applications, exploring computer, managing files and folders, copying and
moving files and folders. Control panel – display properties, adding and removing software
and hardware, setting date and time, screensaver and appearance. Using windows
accessories.
UNIT - II
Documentation Using MS-Word - Introduction to word processing interface, Toolbars,
Menus, Creating & Editing Document, Formatting Document, Finding and replacing text,
Format painter, Header and footer, Drop cap, Auto-text, Autocorrect, Spelling and
Grammar Tool, Document Dictionary, Page Formatting, Bookmark, Previewing and
printing document, Advance Features of MS-Word-Mail Merge, Macros, Tables, File
Management, Printing, Styles, linking and embedding object, Template.
UNIT - III
Electronic Spread Sheet using MS-Excel - Introduction to MS-Excel, Cell, cell address,
Creating & Editing Worksheet, Formatting and Essential Operations, Moving and copying
data in excel, Header and footer, Formulas and Functions, Charts, Cell referencing, Page
setup, Macros, Advance features of MS-Excel-Pivot table & Pivot Chart, Linking and
Consolidation, Database Management using Excel-Sorting, Filtering, Validation, What if
analysis with Goal Seek, Conditional formatting.
UNIT - IV
Presentation using MS-PowerPoint: Presentations, Creating, Manipulating & Enhancing
Slides, Organizational Charts, Excel Charts, Word Art, Layering art Objects, Animations
and Sounds, Inserting Animated Pictures or Accessing through Object, Inserting Recorded
Sound Effect or In-Built Sound Effect.

Course Outcomes:
CO1: Detailed knowledge of Compilation process of a program.
CO2:Knowledge of internal working of macro processor.
CO3: Familiarization with Assembly language.
CO4:Understanding the working of linker and loaders – components used during the process of program
execution.
CO5:Skill to work with MS-Word, Excel and PowerPoint.
CO6: Initiation into the process of writing business letters or job applications, tabulating data, preparing
PPTs etc using MS-Office.
Mapping of Paper No. BCA-102

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S S S S S S S
CO2 S M S M S S S S S S S S S S S
CO3 S M S S S M S S S S S M S S M
CO4 M S S S S M S S S M S M S S S
CO5 S S M S M S S S M S S S S S S
CO6 S S S M S S S S S S S S S S M
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1) Microsoft Office – Complete Reference – BPB Publication
2) Satinder Bal Gupta, Introductory Concepts of Information Technology, Shree
Mahavir Book(Publishers), Delhi
3) Learn Microsoft Office – Russell A. Stultz – BPB Publication
4) Courter, G Marquis (1999). Microsoft Office 2000: Professional Edition. BPB.
5) Nelson, S L and Kelly, J (2002). Office XP: The Complete Reference. Tata
McGraw-Hill.
 BCA-103: MATHEMATICS

External Marks: 80
Internal Marks: 20
Time: 3 hours

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course Objectives:
 To understand and solve discrete mathematical problems.
 To impart knowledge regarding relevant topics such as set Theory, basic logic, graphs, trees or
discrete probability.
To familiarize students with linear Algebra, differential and integral calculus, numerical methods
and statistics.
UNIT I
SETS: Sets, Subsets, Equal Sets Universal Sets, Finite and Infinite Sets, Operation on Sets,
Union, Intersection and Complements of Sets, Cartesian Product, Cardinality of Set, Simple
Applications.
DETERMINANTS: Definition, Minors, Cofactors, Properties of Determinants, Applications of
determinants in finding area of triangle, Solving a system of linear equations.
MATRICES: Definition, Types of Matrices, Addition, Subtraction, Scalar Multiplication and
Multiplication of Matrices, Adjoint, Inverse, solving system of linear equation Cramer’s Rule.
UNIT II
RELATIONS AND FUNCTIONS: Properties of Relations, Equivalence Relation, Partial
Order Relation Function: Domain and Range, Onto, Into and One to One Functions,
Composite and Inverse Functions.
LIMITS & CONTINUITY: Limit at a Point, Properties of Limit, Computation of Limits of
Various Types of Functions, Continuity of a function at a Point, Continuity Over an Interval,
Sum, product and quotient of continuous functions, Intermediate Value Theorem, Type of
Discontinuities.
UNIT III
DIFFERENTIATION: Derivative of a function, Derivatives of Sum, Differences, Product &
Quotient of functions, Derivatives of polynomial, trigonometric, exponential, logarithmic,
inverse trigonometric and implicit functions, Logarithmic Differentiation, Chain Rule and
differentiation by substitution.
UNIT IV
INTEGRATION: Indefinite Integrals, Methods of Integration by Substitution, By Parts, Partial
Fractions, Integration of Algebraic and Transcendental Functions, Reduction Formulae for
simple and Trigonometric Functions, Definite Integral as Limit of Sum, Fundamental Theorem
of Integral Calculus, Evaluation of definite integrals by substitution, using properties of definite
integral.

Course Outcome:
CO1: Students will be able to demonstrate competency in the areas that comprise the core of the
mathematics major.
CO2: They will be able to solve applied problems with the application of differentiation and
integration.
CO3: They will be able to use appropriate technologies to solve mathematical problems.
CO4: They will be able to apply matrices in different industry problems.
CO5: They will be able to generate mathematical models to solve different types of practical
problems.
 CO6: Ability to communicate knowledge, capabilities and skills related to the computer engineer
profession.

Mapping of Paper No. BCA-103

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S M S S S S S S
CO2 S S S S S S S S S S S S S S S
CO3 M M S S S M S S S S S M S S S
CO4 S S M S S S S M S S S S S M S
CO5 S S S S S S S S S S M S S S S
CO6 S S S M S S S S S S S S S S M
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1) Satinder Bal Gupta: Discrete Mathematics and Structures, University Science Press,
Delhi.
2) C.L.Liu: Elements of Discrete Mathematics, McGraw Hill.
3) Lipschutz, Seymour: Discrete Mathematics, Schaum’s Series
4) Trembley, J.P & R. Manohar: Discrete Mathematical Structure with Application to
Computer Science, TMH.
5) Kenneth H. Rosen: Discrete Mathematics and its applications, TMH.
6) Doerr Alan & Levasseur Kenneth: Applied Discrete Structures for Computer
Science, Galgotia Pub. Pvt. Ltd.
 BCA-104 : LOGICAL ORGANIZATION OF COMPUTER-I

External Marks: 80
Internal Marks: 20
Time: 3 hours

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course Objectives :
 To enable the students to understand the functionality and implementation of computer system.
 To familiarize with the various instruction codes and formats of different CPUs.
 To introduce the students to I/O and memory organization of computer system.
 To deliver an overview of Control Unit of a computer system.
 To learn the usage of parallel and vector processing.

UNIT - I
Information Representation: Number Systems, Binary Arithmetic, Fixed-point and
Floatingpoint representation of numbers, BCD Codes, Error detecting and correcting codes,
Character Representation – ASCII, EBCDIC, Unicode
UNIT - II
Binary Logic: Boolean Algebra, Boolean Theorems, Boolean Functions and Truth Tables,
Canonical and Standard forms of Boolean functions, Simplification of Boolean Functions –
Venn Diagram, Karnaugh Maps.
UNIT - III
Digital Logic: Introduction to digital signals, Basic Gates – AND, OR, NOT, Universal
Gates and their implementation – NAND, NOR, Other Gates – XOR, XNOR etc. NAND,
NOR, AND-OR-INVERT and OR-AND-INVERT implementations of digital circuits,
Combinational Logic – Characteristics, Design Procedures, analysis procedures, Multilevel
NAND and NOR circuits.
UNIT - IV
Combinational Circuits: Half-Adder, Full-Adder, Half-Subtractor, Full-Subtractor, Parallel
binary adder/subtractor, Encoders, Decoders, Multiplexers, Demultiplexers, Comparators,
Code Converters, BCD to Seven-Segment Decoder.

Course Outcomes :
CO1: Ability to understand the functionality, organization and implementation of computer
system.
CO2:Skill to recognize the instruction codes and formats.
CO3: Knowledge of the internal working of main memory, cache memory, associative
memoryand various modes of data transfer.
CO4: Familiarization with the working of parallel processing and vector processing.
CO5: Understand the theory and architecture of central processing unit.
CO6: Analyse some of the design issues in terms of speed, technology, cost, performance.
Mapping of Paper No. BCA-104

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 M S S M S S M S S M S S S S S
CO2 S S S S S S S S S S S S S S M
CO3 S M S S S M S S S S S M S S S
CO4 M S S M S S S S M S M S S S S
CO5 S S S S S S M S S S S S S S S
CO6 S S S M S S S S S S S S M S M
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1) Gill, Nasib Singh and Dixit J.B.: Digital Design and Computer Organisation,
University Science Press (Laxmi Publications), New Delhi.
2) M. Morris Mano, Digital Logic and Computer Design, Prentice Hall of India Pvt.
Ltd.
3) V. Rajaraman, T. Radhakrishnan, An Introduction to Digital Computer Design,
Prentice Hall of India Pvt. Ltd.
4) Andrew S. Tanenbaum, Structured Computer Organization, Prentice Hall of India
Pvt. Ltd.
5) Nicholas Carter, Schaum’s Outlines Computer Architecture, Tata McGraw-Hill
 BCA-105 : Practical- Software lab
(Based on paper BCA-102, PC Software)
 BCA-106 : ‘C’ PROGRAMMING

External Marks: 80
Internal Marks: 20
Time: 3 hours

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.
Course Objective:
1. To develop programming skills using the fundamentals and basics of C language.
2. To learn problem solving techniques.
3. To study the advantages of user defined data type which provides flexibility for application
development?
4. To study the basics of pre-processors available with C compiler.
5. To enable effective usage of arrays, structures, functions and pointers.
UNIT-I
Overview of C: History of C, Importance of C, Elements of C: C character set, identifiers
and keywords, Data types, Constants and Variables, Assignment statement, Symbolic
constant, Structure of a C Program, printf(), scanf() Functions, Operators & Expression:
Arithmetic, relational, logical, bitwise, unary, assignment, shorthand assignment operators,
conditional operators and increment and decrement operators, Arithmetic expressions,
evaluation of arithmetic expression, type casting and conversion, operator hierarchy &
associativity.
UNIT-II
Decision making & branching: Decision making with IF statement, IF-ELSE statement,
Nested IF statement, ELSE-IF ladder, switch statement, goto statement.
Decision making & looping: For, while, and do-while loop, jumps in loops, break, continue
statement, Nested loops.
UNIT-III
Functions: Standard Mathematical functions, Input/output: Unformatted & formatted I/O
function in C, Input functions viz. getch(), getche(), getchar(), gets(), output functions viz.,
putch(), putchar(), puts(), string manipulation functions.
User defined functions: Introduction/Definition, prototype, Local and global variables,
passing parameters, recursion.
UNIT-IV
Arrays, strings and pointers: Definition, types, initialization, processing an array, passing
arrays to functions, Array of Strings. String constant and variables, Declaration and
initialization of string, Input/output of string data, Introduction to pointers.
Storage classes in C: auto, extern, register and static storage class, their scope, storage, &
lifetime.
Algorithm development, Flowcharting and Development of efficient program in C.

Learning Outcomes:
CO1. Read, understand and trace the execution of programs written in C language.
CO2. Write the C code for a given algorithm.
CO3. Write programs that perform operations using derived data types.
CO4. Implement Programs with pointers and arrays, perform pointer arithmetic, and use the pre-
processor.
CO5. Understand Opening/Closing a file, Reading from and writing to a file.
CO6: Program using C features such as composition of objects, Operator overloading, inheritance,
Polymorphism etc.
Mapping of Paper No. BCA-106

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S S S S S M S
CO2 S M S S S S S S S S S S S S S
CO3 S S S M S M S S S S S M S S S
CO4 M S S S S M S S M S S M S S S
CO5 S S S S M S S S S S S S S S M
CO6 S S M S S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1) Satinder Bal Gupta, Amit Singla: Computer Fundamentals & Programming in C, Shree
Mahavir Book (Publishers), Delhi.
2) Gottfried, Byron S., Programming with C, Tata McGraw Hill
3) Gill Nasib Singh: Computing Fundamentals and Programming in C, Khanna Books
Publishing Co., New Delhi.
4) Yashwant Kanetker, Let us C, BPB.
5) Rajaraman, V., Computer Programming in C, PHI.
6) Yashwant Kanetker, Working with C, BPB.
 BCA-107: LOGICAL ORGANIZATION OF COMPUTER-II

External Marks: 80
Internal Marks: 20
Time: 3 hours

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.
Course Objectives :
 To enable the students to understand the functionality and implementation of computer system.
 To familiarize with the various instruction codes and formats of different CPUs.
 To introduce the students to I/O and memory organization of computer system.
 To deliver an overview of Control Unit of a computer system.
 To learn the usage of parallel and vector processing.

UNIT - I
Sequential Logic: Characteristics, Flip-Flops, Clocked RS, D type, JK, T type and Master-
Slave flip-flops. State table, state diagram and state equations. Flip-flop excitation tables

UNIT - II
Sequential Circuits: Designing registers – Serial Input Serial Output (SISO), Serial Input
Parallel Output (SIPO), Parallel Input Serial Output (PISO), Parallel Input Parallel Output
(PIPO) and shift registers. Designing counters – Asynchronous and Synchronous Binary
Counters, Modulo-N Counters and Up-Down Counters

UNIT - III
Memory & I/O Devices: Memory Parameters, Semiconductor RAM, ROM, Magnetic and
Optical Storage devices, Flash memory, I/O Devices and their controllers.

UNIT - IV
Instruction Design & I/O Organization: Machine instruction, Instruction set selection,
Instruction cycle, Instruction Format and Addressing Modes. I/O Interface, Interrupt
structure, Program-controlled, Interrupt-controlled & DMA transfer, I/O Channels, IOP.

Learning Outcomes:
CO1: Understand about concepts of Computer Organization and design.
CO2: Understand and implement Instruction codes and op-codes.
CO3: Understand Registers, Computer Instructions, timing and control.
CO4: Understand CPU basics, Stack Organization, Instruction format, Addressing formats.
CO5: Understand Memory system of a Computer.
CO6: Understand basics of 8-bit Microprocessor.

Mapping of Paper No. BCA-107

PSO1

PSO2
PSO3
PSO4
PO10

PO11

Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

Outcomes
CO1 S S M S S S M S S M S S S M S
CO2 S S S S S S S S S S S S S S S
CO3 S S S S S M S S M S S M S S M
 CO4 S S S S S S S S S M S S S S S
CO5 M S S M S S M S S S S S S S S
CO6 S S S S S S S S M S S S M S S
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1) Gill, Nasib Singh and Dixit J.B.: Digital Design and Computer
Organisation,University Science Press (Laxmi Publications), New Delhi.
2) M. Morris Mano, Digital Logic and Computer Design, Prentice Hall of India
Pvt.Ltd.
3) V. Rajaraman, T. Radhakrishnan, An Introduction to Digital Computer Design,
Prentice Hall of India Pvt. Ltd.
4) Andrew S. Tanenbaum, Structured Computer Organization, Prentice Hall of India
Pvt. Ltd.
5) Nicholas Carter, Schaum’s Outlines Computer Architecture, Tata McGraw-Hill
 BCA-108: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

External Marks: 80
Internal Marks: 20
Time: 3 hours

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.
Course Objectives:
 To understand and solve discrete mathematical problems.
 To impart knowledge regarding relevant topics such as set Theory, basic logic, graphs, trees or discrete
probability.
 To familiarize students with linear Algebra, differential and integral calculus, numerical methods and
statistics.
UNIT-I
Basic Statistics: Measure of Central Tendency, Preparing frequency distribution table,
Mean, Mode, Median, Measure of Dispersion: Range, Variance and Standard Deviations,
Correlation and Regression.
UNIT-II
Algorithm: Algorithms, merits and demerits, Exponentiation, How to compute fast
exponentiation. Linear Search, Binary Search, "Big Oh" notation, Worst case, Advantage of
logarithmic algorithms over linear algorithms, complexity.
Graph Theory: Graphs, Types of graphs, degree of vertex, sub graph, isomorphic and
homeomorphic graphs, Adjacent and incidence matrices, Path Circuit ; Eulerian
Hamiltonian path circuit.
UNIT-III
Tree: Trees, Minimum distance trees, Minimum weight and Minimum distance spanning
trees.
Recursion: Recursively defined function.
Merge sort, Insertion sort, Bubble sort, and Decimal to Binary.
UNIT-IV
Recurrence Relations: LHRR, LHRRWCCs, DCRR. Recursive procedures.
Number Theory: Principle of Mathematical induction, GCD, Euclidean algorithm,
Fibonacci numbers, congruences and equivalence relations, public key encryption schemes.

Course Outcomes:
CO1:Develops formal reasoning.
CO2: Creates habit of raising questions.
CO3:Knowledge regarding the use of Discrete Mathematics in Computer Science.
CO4:Helpful in formulating questions.
CO5: Ability to communicate knowledge, capabilities and skills related to the computer engineer
profession.
CO6: Understand and be able to apply basic definitions and concepts in set and function theory.
Mapping of Paper No. BCA-108

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S M S S S S S M S S S S
CO2 S M S S S S S S S S S S S M S
CO3 S S S M S M S S S S S M S S S
CO4 M S S S S S S M S S S M S S S
CO5 S S M S S S S S S M S S S S M
CO6 S S S S S S M S S S S S M S S
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1) Satinder Bal Gupta: Discrete mathematics and Structures, University Science Press,
Delhi.
2) Gupta S.P. and Kapoor, V.K., Fundamentals of Applied statistics, Sultan Chand &
Sons, 1996.
3) Gupta S.P. and Kapoor, V.K., Fundamentals of Mathematical statistics, Sultan
Chand and Sons, 1995.
4) Graybill, Introduction to Statistics, McGraw.
5) Anderson, Statistical Modelling, McGraw.
6) Babu Ram : Discrete Mathematics
 BCA-109 : Structured Systems Analysis and Design

External Marks: 80
Internal Marks: 20
Time: 3 hours

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Learning Objective :
1. To know about the various steps of software devolvement life cycle.
2. To analyze the structure of a system using structured analysis tools such as DFD, ER diagram,
Data dictionary etc.
3. To learn about the importance of feasibility study in development model.
4. To know about the system maintenance and its various types.
5. Understand the concept of Quality assurance goals in SDLC.

UNIT-I
Introduction to system, Definition and characteristics of a system, Elements of system,
Types of system, System development life cycle, Role of system analyst, Analyst/user
interface, System planning and initial investigation: Introduction, Bases for planning in
system analysis, Sources of project requests, Initial investigation, Fact finding, Information
gathering, information gathering tools, Fact analysis, Determination of feasibility.
UNIT-II
Structured analysis, Tools of structured analysis: DFD, Data dictionary, Flow charts, Gantt
charts, decision tree, decision table, structured English, Pros and cons of each tool,
Feasibility study: Introduction, Objective, Types, Steps in feasibility analysis, Feasibility
report, Oral presentation, Cost and benefit analysis: Identification of costs and benefits,
classification of costs and benefits, Methods of determining costs and benefits, Interpret
results of analysis and take final action.
UNIT-III
System Design: System design objective, Logical and physical design, Design
Methodologies, structured design, Form-Driven methodology(IPO charts), structured
walkthrough, Input/Output and form design: Input design, Objectives of input design,
Output design, Objectives of output design, Form design, Classification of forms,
requirements of form design, Types of forms, Layout considerations, Form control.
UNIT-IV
System testing: Introduction, Objectives of testing, Test plan, testing techniques/Types of
system tests, Quality assurance goals in system life cycle, System implementation, Process
of implementation, System evaluation, System maintenance and its types, System
documentation, Forms of documentation.

Learning Outcomes :
CO1: A firm basis for understanding the life cycle of a systems development project.
CO2:An understanding of the analysis and development techniques required as a team member of a
medium-scale information systems development project.
CO3: An understanding of the ways in which an analyst's interaction with system sponsors and users
play a part in information systems development.
CO4: Experience in developing information systems models.
CO5: Experience in developing systems project documentation.
CO6: An understanding of the object-oriented methods models as covered by the Unified Modelling
Language.

Mapping of Paper No. BCA-109

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S M S M S S M S S S S S
CO2 S M S S S S S S S S S S S S M
CO3 S S S M S M S S S S M M S S S
CO4 M S S S S M S M S S M S S M S
CO5 M S M S S S S S S S S S M S S
CO6 S S S S S S S S M S S S S S M
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1) Systems Analysis and design, E.M. AWAD Galgotia Pub.(P) Ltd.
2) Data Management and Data Structures, Loomis (PHI)
3) System Analysis and Design. Elias Awad.
4) Introductory System analysis and Design, Lee Vol. I & II
 BCA-110: Practical- Software lab
(Based on paper BCA-106, C Programming)
 BACHELOR OF COMPUTER APPLICATIONS (BCA) Regular
SYLLABUS AND SCHEME OF EXAMINATION – 2nd YEAR( IIIrd and IVth
SEMESTERS)
w.e.f. 2018-19
Period per week: 6 for each theory paper and 6 for each practical group in each semester.

IIIrd Semester
Paper No. Title of Paper Max. Marks Exam
Duration

External Internal 3 Hours

BCA-201 Introduction to Operating System 80 20 3 Hours
BCA-202 Data structures – i 80 20 3 Hours

BCA-203 Introduction to database system 80 20 3 Hours

BCA-204 Communication skills (English) 80 20 3 Hours
BCA-205 Practical software Lab – Based 80 20 3 Hours
on paper
BCA-202 & 203 using C
Language and SQL

IVth Semester
Paper No. Title of Paper Max. Marks Exam
Duration

External Internal 3 Hours

BCA-206 Web Designing 80 20 3 Hours
BCA-207 Data Structures – II 80 20 3 Hours
BCA-208 Object Oriented Programming 80 20 3 Hours
Using C++
BCA-209 Software Engineering 80 20 3 Hours
BCA-210 Practical software Lab– Based 80 20 3 Hours
on paper BCA– 206 & 208,
i.e.HTML and C++
Programming
 BCA-201 : Introduction to Operating System

Time: 3 hours External Marks: 80

Internal Marks: 20
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.
Course Objectives :
 To deliver a detailed knowledge of integral software in a computer system – Operating
System.
 To understand the working of operating system as a resource manager.
 To familiarize the students with Process and Memory management.
 To describe the problem of process synchronization and its solution.
UNIT – I
Fundamentals of Operating system: Introduction to Operating System, its need and
operating System services, Early systems, Structures - Simple Batch, Multi programmed,
timeshared, Personal Computer, Parallel, Distributed Systems, Real-Time Systems.

Process Management: Process concept, Operation on processes, Cooperating Processes,

Threads, and Inter-process Communication.

UNIT-II

CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms : FCFS, SJF,
Round Robin & Queue Algorithms.
Deadlocks: Deadlock characterization, Methods for handling deadlocks, Banker’sAlgorithm.
UNIT-III

Memory Management: Logical versus Physical address space, Swapping, Contiguous

allocation, Paging, Segmentation.
Virtual Memory: Demand paging, Performance of demand paging, Page replacement, Page
replacement algorithms, Thrashing.
UNIT-IV
File management: File system Structure, Allocation methods: Contiguous allocation, Linked
allocation, Indexed allocation, Free space management: Bit vector, Linked list, Grouping,
Counting.
Device Management: Disk structure, Disk scheduling: FCFS, SSTF, SCAN, C-SCAN,
LOOK, C-LOOK.

Course Outcomes :
CO1: Ability to apply CPU scheduling algorithms to manage tasks.
CO2:Initiation into the process of applying memory management methods and allocation
policies.
CO3: Knowledge of methods of prevention and recovery from a system deadlock.
CO4: Responsible for allocating resources to users and processes.
CO5: Some operating systems implement significant OS functionality in user-mode, e.g.
User-mode such as Linux.
CO6: Program execution, Access to I/O devices – Display, disk, network, printer, keyboard,
camera, etc. Controlled access to files – Access protection, System access – User
authentication.
\
Mapping of Paper No. BCA-201

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S M S S S S M S S S S S S S
CO2 S S S S S S S S S S M S S M S
CO3 M S S S M S S S S S S M S S S
CO4 S S S M S S S S M S S S S S S
CO5 S M S S S S S S S S M S S S M
CO6 M S S S S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

Suggested Readings

1. Abraham Silberschatz, Peter B. Galvin, “ Operating System Concepts”, Addison-Wesley

publishing. Co., 7th. Ed., 2004.
2. Nutt Gary, "Operating Systems", Addison Wesley Publication, 2000.
3. Andrew S. Tannenbaum, "Modern Operating Systems", Pearson Education Asia, Second
Edition, 2001.
4. William Stallings, "Operating Systems, "Internals and Design Principles", 4th Edition, PH,
2001.
5. Ekta Walia, "Operating Systems Concepts", Khanna Publishes, New Delhi, 2002.
 BCA – 202 : DATA STRUCTURES – I
External Marks: 80
Internal Marks: 20
Time: 3
hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.
Course Objectives :
 To familiarize the students with data structures used for representing data in memory like
Arrays, Linked Lists, Graphs, Trees etc.
 To analyze the performance of algorithms.
 To learn how to apply algorithms of data structures on data.
 To gain knowledge of various methods used in data structures such as brute force, divide and
conquer, greedy, etc.

UNIT – I
Introduction: Elementary data organization, Data Structure definition, Data type vs. data
structure, Categories of data structures, Data structure operations, Applications of data
structures, Algorithms complexity and time-space tradeoff, Big-O notataion.
Strings: Introduction, Storing strings, String operations, Pattern matching algorithms.
UNIT – II
Arrays: Introduction, Linear arrays, Representation of linear array in memory, address
calculations, Traversal, Insertions, Deletion in an array, Multidimensional arrays, Parallel
arrays, Sparse arrays.
Linked List: Introduction, Array vs. linked list, Representation of linked lists in memory,
Traversal, Insertion, Deletion, Searching in a linked list, Header linked list, Circular linked
list, Two-way linked list, Threaded lists, Garbage collection, Applications of linked lists.
UNIT – III
Stack: Introduction, Array and linked representation of stacks, Operations on stacks,
Applications of stacks: Polish notation, Recursion.
Queues: Introduction, Array and linked representation of queues, Operations on queues,
Deques, Priority Queues, Applications of queues.
UNIT – IV
Tree: Introduction, Definition, Representing Binary tree in memory, Traversing binary trees,
Traversal algorithms using stacks.
Graph: Introduction, Graph theory terminology, Sequential and linked representation of
graphs.
Course Outcomes :
CO1: Skill to analyze algorithms and to determine algorithm correctness and their time
efficiency.
CO2: Knowledge of advanced abstract data type (ADT) and data structures and their
implementations.
CO3: Ability to implement algorithms to perform various operations on data structures.
CO4:To access how the choices of data structure & algorithm methods impact the
performance of program.
C05: To Solve problems based upon different data structure & also write programs.
CO6:Choose an appropriate data structure for a particular problem.
Mapping of Paper No. BCA-202

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S M S S S S S M S M S S S S S
CO2 M S S M S S S S S S S S S S M
CO3 S S M S S S S S S S S M S S S
CO4 S S S S M S S S M S S S S S S
CO5 S S S S S S S S S S M S S S M
CO6 S S S M S S S M S S S S M S S
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1. Seymour Lipschutz, “Data Structure”, Tata-McGraw-Hill
2. Horowitz, Sahni & Anderson-Freed, “Fundamentals of Data Structures in C”,
Orient Longman.
3. Trembley, J.P. And Sorenson P.G., “An Introduction to Data Structures With
Applications”, Mcgrraw- Hill International Student Edition, New York.
4. Mark Allen Weiss Data Structures and Algorithm Analysis In C, Addison- Wesley,
(An Imprint Of Pearson Education), Mexico City.Prentice- Hall Of India Pvt. Ltd.,
New Delhi.
5. Yedidyan Langsam, Moshe J. Augenstein, and Aaron M. Tenenbaum, “Data
Structures Using C”, Prentice- Hall of India Pvt. Ltd., New Delhi.
 BCA – 203 : INTRODUCTION TO DATABASE SYSTEM
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.
Course Objectives :
 To introduce the students to the database system.
 To learn how to design a database by using different models.
 To enable the students to understand the database handling during execution of the
transactions.
 To understand the handling of database by concurrent users.
 To gain complete knowledge of SQL and PL/SQL.

UNIT – I
Basic Concepts – Data, Information, Records and files. Traditional file –based Systems-File
Based Approach-Limitations of File Based Approach, Database Approach-Characteristics of
Database Approach, advantages and disadvantages of database system, components of
database system, Database Management System (DBMS), Components of DBMS
Environment, DBMS Functions and Components, DBMS users, Advantages and
Disadvantages of DBMS, DBMS languages.
Roles in the Database Environment - Data and Database Administrator, Database
Designers, Applications Developers and Users .
UNIT – II
Database System Architecture – Three Levels of Architecture, External, Conceptual and
Internal Levels, Schemas, Mappings and Instances .
Data Independence – Logical and Physical Data Independence .
Classification of Database Management System, Centralized and Client Server architecture to
DBMS .
Data Models: Records- based Data Models, Object-based Data Models, Physical Data
Models and Conceptual Modeling.
UNIT – III
Entity-Relationship Model – Entity Types, Entity Sets, Attributes Relationship Types,
Relationship Instances and ER Diagrams, abstraction and integration.
Basic Concepts of Hierarchical and Network Data Model, Relational Data Model:-Brief
History, Relational Model Terminology-Relational Data Structure, Database Relations,
Properties of Relations, Keys, Domains, Integrity Constraints over Relations, .
UNIT – IV
Relational algebra, Relational calculus, Relational database design: Functional dependencies,
Modification anomalies, Ist to 3rd NFs, BCNF, 4th and 5th NFs, computing closures of set
FDs, SQL: Data types, Basic Queries in SQL, Insert, Delete and Update Statements, Views,
Query processing: General strategies of query processing, query optimization, query
processor, concept of security, concurrency and recovery.

Course Outcomes :
CO1:Familiarization with Database Management System.
CO2:Comprehensive knowledge of database models.
CO3: Ability to code database transactions using SQL.
CO4:Skill to write PL/SQL programs.
CO5:Understand the use of structured query language and its syntax, transactions,
database recovery and techniques for query optimization.
CO6:Acquire a good understanding of database systems concepts and to be in a position to
use and design databases for different applications.
Mapping of Paper No. BCA-203

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S M S S S S S M S S S S M S S
CO2 S S M S S S S S S S S S S S M
CO3 S S S M S S S S S S M S S S S
CO4 S S S S M S S S M S S S S S M
CO5 M S S S S S S S S S S S S S S
CO6 S S M S S M S S S S S S M S S
S = Strong, M = Medium, W = Weak
SUGGESTED READINGS
1. Satinder Bal Gupta & Aditya Mittal, “Introduction to Data Base Management
System”, University Science Press, New Delhi.
2. Elmasri & Navathe, “Fundamentals of Database Systems”, 5th edition, Pearson
Education.
3. Thomas Connolly Carolyn Begg, “Database Systems”, 3/e, Pearson Education
4. C. J. Date, “An Introduction to Database Systems”, 8th edition, Addison Wesley
N. Delhi.
BCA-204 : COMMUNICATION SKILLS (ENGLISH)
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.
Course Objectives :
 To enable the learner to communicate effectively and appropriately in real life situation.
 To use English effectively for study purpose across the curriculum.
To develop and integrate the use of four language skills: a) Reading b) Writing c) Listening
d) Speaking
 To revise and reinforce structure already learnt.

UNIT-I
Introduction to Basics of Communication: Communication and its various definition,
features/characteristics of the communication, process of communication, communication
model and theories, barrier to effective communication.
UNIT-II
Improving LSRW: introduction, verbal and nonverbal communication, listening
process, group discussion, forms of oral presentation, self-presentation, dyadic
communication, 5C’s of communication, Developing dialogues, soft skill.

UNIT-III
Basic vocabulary: how to improve vocabulary, prefix/suffix, synonyms/antonyms, one
word substitution, spellings
Developing fluency: grammar (conjunction, auxiliaries, prepositions, articles,
tenses……), language games.
UNIT-IV
Proper use of Language: The Communication Skills, The effective Speech.
Effective self-presentation & facing interview: The interview process & preparing for
it, The presentation skills.

Course Outcomes :
CO1:Reading Skills:- Ability to read English with ability to read English with understanding
and decipher paragraph patterns, writer techniques and conclusions.
CO2: Writing Skills:- Skill to develop the ability to write English correctly and master the
mechanics of writing the use of correct punctuation marks and capital letter.
CO3: Listening Skills:- Ability to understand English when it is spoken in various contexts.
CO4: Speaking Skills:- Develop the ability to speak intelligibly using appropriate word stress,
sentence stress and elementary intonation patterns.
CO5:Confidently use English in both written and spoken forms.
CO6: Have a practical and humorous approach to language learning
Mapping of Paper No. BCA-204

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 M S S M S S M S S M S S S S M
CO2 S M S S S S S S S S S S S S S
CO3 S S M S S M S S S S S S M S S
CO4 M S S S S S S S M S S S S S S
CO5 S S S S S S S S S S M S S S M
CO6 S S S S S S M S S S S S M S S
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1. Vik, Gilsdorf, “Business Communication”, Irwin
2. K K Sinha, “Business Communication”, Himalaya Publishing House / Galgoria
Publication
3. Bovee, “Business Communication”, Pearson ‘ PHI
4. Mohan, Banerjee, Business Communication, Mac million
5. Raman, Singh – Business communication – Oxford Press
 BCA-205 : PRACTICAL- SOFTWARE LAB
PRACTICAL BASED ON PAPER BCA-202 & 203 USING C LANGUAGE AND
SQL.
 BCA – 206 : WEB DESIGNING

External Marks:80
Internal Marks:20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist
of total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16
marks. In addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV.
Examiner will set two questions from each Unit of the syllabus and each question will carry 16
marks. Student will be required to attempt FIVE questions in all. Question Number 1 will be
compulsory. In addition to compulsory question, student will have to attempt four more
questions selecting one question from each Unit.
Course Objectives:
 To learn various Web Technologies.
 To enable the students to design and implement static and dynamic Web pages.
 To acquire fundamental skills to maintain web server services required to host a website.
 To learn MySQL.

UNIT – I
Introduction to Internet and World Wide Web; Evolution and History of World Wide Web;
Basic features; Web Browsers; Web Servers; Hypertext Transfer Protocol, Overview of
TCP/IP and its services; URLs; Searching and Web-Casting Techniques; Search Engines and
Search Tools;
UNIT – II
Web Publishing: Hosting your Site; Internet Service Provider; Web terminologies, Phases of
Planning and designing your Web Site; Steps for developing your Site; Choosing the
contents; Home Page; Domain Names, Front page views, Adding pictures, Links,
Backgrounds, Relating Front Page to DHTML.
Creating a Website and the Markup Languages (HTML, DHTML);

UNIT – III
Web Development: Introduction to HTML; Hypertext and HTML; HTML Document
Features; HTML command Tags; Creating Links; Headers; Text styles; Text Structuring;
Text colors and Background; Formatting text; Page layouts;

UNIT – IV
Images; Ordered and Unordered lists; Inserting Graphics; Table Creation and Layouts;
Frame Creation and Layouts; Working with Forms and Menus; Working with Radio
Buttons; Check Boxes; Text Boxes;
DHTML: Dynamic HTML, Features of DHTML,CSSP(cascading style sheet positioning)
and JSSS(JavaScript assisted style sheet), Layers of netscape, The ID attributes, DHTML
events.
Course Outcomes :
CO1:Ability to develop web pages using HTML and Cascading Style Sheets.
CO2: Skill to create XML documents and Schemas.
CO3: Knowledge of client-side (JavaScript) and server-side scripting (PHP, ASP.NET)
languages to build dynamic web pages.
CO4:Familiarization with Web Application Terminologies, Internet Tools, E – Commerce
and other web services.
CO5: Ability to develop database applications with MySQL.
CO6: Understand, analyze and build interactive web applications.
Mapping of Paper No. BCA-206

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S M S M S S M S S M S S S S S
CO2 S S S S S S S S S S S S S S M
CO3 S S S S S M S S S S S M S S S
CO4 S S S S M S S S M S S S S S S
CO5 M S M S S S S S S S M S S S S
CO6 S S S S S S S M S S S S M S M
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1. Raj Kamal, “Internet and Web Technologies”, Tata McGraw-Hill.
2. Satinder Bal Gupta & Brij Mohan Goel, “Web Design”, Shree Mahavir Book Depot
(Publishers) , New Delhi
3. Ramesh Bangia, “Multimedia and Web Technology”, Firewall Media.
4. Thomas A. Powell, “Web Design: The Complete Reference” , 4/e, Tata McGraw-
Hill
5. Wendy Willard, “HTML Beginners Guide”, Tata McGraw-Hill.
6. Deitel and Goldberg, “Internet and World Wide Web, How to Program”, PHI.
 BCA – 207: DATA STRUCTURE – II

External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.
Course Objectives:
 To familiarize the students with data structures used for representing data in memory like
Arrays, Linked Lists, Graphs, Trees etc.
 To analyze the performance of algorithms.
 To learn how to apply algorithms of data structures on data.
 To gain knowledge of various methods used in data structures such as brute force, divide
and conquer, greedy, etc.

UNIT – I
Tree: Header nodes, Threads, Binary search trees, Searching, Insertion and deletion in a
Binary search tree, AVL search trees, Insertion and deletion in AVL search tree, m-way
search tree, Searching, Insertion and deletion in an m-way search tree, B-trees, Searching,
Insertion and deletion in a B-tree, B+tree, Huffman’s algorithm, General trees.

UNIT – II
Graphs: Warshall’s algorithm for shortest path, Dijkstra algorithm for shortest path,
Operations on graphs, Traversal of graph, Topological sorting.

UNIT – III
Sorting: Internal & external sorting, Radix sort, Quick sort, Heap sort, Merge sort,
Tournament sort, Searching: Liner search, binary search, merging, Comparison of various
sorting and searching algorithms on the basis of their complexity.

UNIT – IV
Files: Physical storage devices and their characteristics, Attributes of a file viz fields, records,
Fixed and variable length records, Primiry and secondary keys, Classification of files, File
operations, Comparison of various types of files, File organization: Serial, Sequential,
Indexed-sequential, Random-access/Direct, Inverted, Multilist file organization.
Hashing: Introduction, Hashing functions and Collision resolution methods .

Course Outcomes:
CO1: Understanding the linear and non-linear data structures, sorting and searching operations, File
structures.
CO2: Analyse the performance of - Stack, Queue, and Lists.
CO3: Analyse the performance of Trees, Graphs, Searching and Sorting techniques.
CO4: Implement all the applications of Data structures in a high-level language.
CO5: Design and apply appropriate data structures for solving computing problems
CO6:Ability to implement algorithms to perform various operations on data structures.
Mapping of Paper No. BCA-207

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S M S S S S M S S S M S S S S
CO2 S S S S S S S S S S S S S S M
CO3 M S S S M M S S S S S M S S S
CO4 S S M S S S S S M S S S S S S
CO5 S S S S S S S S S S S S S S M
CO6 M S S M S S S M S S S S M S S
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1. Seymour Lipschutz, “Data Structure”, Tata-McGraw-Hill
2. Horowitz, Sahni & Anderson-Freed, “Fundamentals of Data Structures in C”,
Orientlongman.
3. Trembley, J.P. And Sorenson P.G., “An Introduction to Data Structures With
Applications”, Mcgrraw- Hill International Student Edition, New York.
4. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Addison- Wesley,
(An Imprint Of Pearson Education), Mexico City.Prentice- Hall Of India Pvt. Ltd.,
New Delhi.
 BCA-208: Object Oriented Programming Using C++
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course Objectives:
 To give an overview of benefits of Object Oriented Programming (OOP) approach over the
Traditional Programming approach.
 To deliver comprehensive view of OOP concept.
 To impart detailed knowledge of a powerful object oriented programming language – C++.
UNIT-I
Object Oriented Programming Concepts : Procedural Language and Object Oriented
approach, Characteristics of OOP, user defined types, polymorphism and encapsulation.
Getting started with C++: syntax, data types, variables, string, function, namespace and
exception, operators, flow control, recursion, array and pointer, structure .

UNIT-II

Abstracting Mechanism: classes, private and public, Constructor and Destructor , member
function, static members, references;
Memory Management: new, delete, object copying, copy constructer, assignment operator,
this input/output

UNIT-III
Inheritance and Polymorphism: Derived Class and Base Class, Different types of
Inheritance,
Overriding member function, Abstract Class, Public and Private Inheritance, Ambiguity in
Multiple inheritance , Virtual function, Friend function, Static function.

UNIT-IV
Exception Handling: Exception and derived class, function exception declaration,
unexpected exception, exception when handling exception, resource capture and release.
Template and Standard Template Library: Template classes, declaration, template
functions, namespace, string, iterators, hashes, iostreams and other types.

Course Outcomes:
CO1: Understand the difference between the top-down and bottom-up approach.
CO2: Describe the object-oriented programming approach in connection with C++.
CO3: Apply the concepts of object-oriented programming.
CO4: Illustrate the process of data file manipulations using C++.
CO5: Apply virtual and pure virtual function & complex programming situations.
CO6: Ability to design and develop Object Oriented systems.
Mapping of Paper No. BCA-208

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 S M S S S S S S S S S S S S M
CO3 S S S S S M S S S S S S M S S
CO4 M S S S S S S S S S S M S S S
CO5 S S M S M S S S M S S S S S S
CO6 S S S S S S M S S S S S M S M
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1. Herbert Schildts : C++ - The Complete Reference, Tata McGraw Hill Publications.
2. Balaguru Swamy : C++, Tata McGraw Hill Publications.
3. Balaguruswamy : Object Oriented Programming and C++, TMH.
4. Shah & Thakker : Programming in C++, ISTE/EXCEL.
5. Johnston : C++ Programming Today, PHI.
6. Object Oriented Programming and C++, Rajaram, New Age International.
7. Samanta : Object Oriented Programming with C++ & JAVA, PHI.
BCA-209 : Software Engineering
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course Objectives :
 To introduce the students to a branch of study associated with the development of a software
product.
 To gain basic knowledge about the pre-requisites for planning a software project.
 To learn how to design of software.
 To enable the students to perform testing of a software.

UNIT – I
Introduction: Software Crisis, Software Processes & Characteristics, Software life cycle
models, Waterfall, Prototype, Evolutionary and Spiral Models.
Software Requirements Analysis & Specifications: Requirement engineering, requirement
elicitation techniques like FAST, QFD, requirements analysis using DFD, Data dictionaries
& ER Diagrams, Requirements documentation, Nature of SRS, Characteristics &
organization of SRS .
UNIT – II
Software Project Management Concepts: The Management spectrum, The People The
Problem, The Process, The Project.
Software Project Planning: Size Estimation like lines of Code & Function Count, Cost
Estimation Models, COCOMO, Risk Management.
UNIT - III
Software Design: Cohesion & Coupling, Classification of Cohesiveness & Coupling,
Function Oriented Design, Object Oriented Design, Software Metrics: Software
measurements: What & Why, Token Count, Halstead Software Science Measures, Design
Metrics, Data Structure Metrics
Software Implementation: Relationship between design and implementation,
Implementation issues and programming support environment, Coding the procedural design,
Good coding style.
UNIT - IV
Software Testing: Testing Process, Design of Test Cases, Types of Testing, Functional
Testing, Structural Testing, Test Activities, Unit Testing, Integration Testing and System
Testing, Debugging Activities.
Software Maintenance: Management of Maintenance, Maintenance Process, Reverse
Engineering, Software Re-engineering, Configuration Management, Documentation.

Course Outcomes :
CO1: Enables students to embrace problem solving and learning as a natural aspect of their
work.
CO2: Enhances value and is valued by their professional teammates.
CO3: Gain to have broad and deep knowledge of the technical issues that they face.
CO4: Basic knowledge and understanding of the analysis and design of complex systems.
CO5: To develop methods and procedures for software development that can scale up for large
systems and that can be used consistently to produce high-quality software at low cost and with
a small cycle of time.
CO6: Familiarization with the concept of software engineering and its relevance.
Mapping of Paper No. BCA-209

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S S M S S M S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S S S S S M S S S M S S S M
CO6 M S S S S S S S S S S S S S S
S = Strong, M = Medium, W = Weak

Suggested Readings
1. Satinder Bal Gupta,” Software Engineering”, Shree Mahavir Book Depot
(Publishers) , New Delhi.
2. Gill, Nasib Singh : Software Engineering, Khanna Book Publishing Co. (P) Ltd. N.
Delhi.
3. Pressman : Software Engineering, TMH.
4. Jalote, Pankaj : An Integrated Approach to Software Engineering, Narosa
Publications.
5. Chhillar Rajender Singh : Software Engineering : Testing, Faults, Metrics, Excel
Books, New Delhi.
6. Ghezzi, Carlo : Fundaments of Software Engineering, PHI.
7. Fairely, R.E. : Software Engineering Concepts, McGraw-Hill.
 BCA-210 : PRACTICAL- SOFTWARE LAB
PRACTICAL BASED ON PAPER BCA-206 & BCA-208 USING HTML AND C++
LANGUAGE
 BACHELOR OF COMPUTER APPLICATIONS (BCA) Regular
SYLLABUS AND SCHEME OF EXAMINATION – 3rd YEAR( Vth and VIth
SEMESTERS)
w.e.f. 2019-20
Period per week: 6 for each theory paper and 6 for each practical group in each semester.

Vth Semester
Paper No. Title of Paper Max. Marks Exam
Duration

External Internal 3 Hours

BCA-301 Management information system 80 20 3 Hours
BCA-302 Computer Graphics 80 20 3 Hours
BCA-303 Data Communication and 80 20 3 Hours
Networking
BCA-304 Visual Basic 80 20 3 Hours
BCA-305 Practical software Lab –Based 80 20 3 Hours
on paper BCA- 304 i.e. Visual
Basic

VIth Semester
Paper No. Title of Paper Max. Marks Exam
Duration

External Internal 3 Hours

BCA-306 E-Commerce 80 20 3 Hours
BCA-307 Object Technologies & 80 20 3 Hours
Programming using Java
BCA-308 Artificial Intelligence 80 20 3 Hours
BCA-309 Introduction to .net 80 20 3 Hours
BCA-310 Practical software Lab– Based 80 20 3 Hours
on paper-BCA-307 & 309
using java & .net
 BCA – 301: MANAGEMENT INFORMATION SYSTEM
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course Objective :
1. To describe the role of information technology and decision support systems in business and
record the current issues with those of the firm to solve business problems.
2. Tointroduce the fundamental principles of computer-based information systems analysis and
design and develop an understanding of the principles and techniques used.
3. To enable students understand the various knowledge representation methods and different
expert system structures as strategic weapons to counter the threats to business and make
business more competitive.
4. To enable the students to use information to assess the impact of the Internet and Internet
technology on electronic commerce and electronic business and understand the specific threats
and vulnerabilities of computer systems.
5. To provide the theoretical models used in database management systems to answer business
questions.
UNIT – I
Introduction to system and Basic System Concepts, Types of Systems, The Systems
Approach, Information System: Definition & Characteristics, Types of information, Role of
Information in Decision-Making, Sub-Systems of an Information system: EDP and MIS
management levels, EDP/MIS/DSS.
UNIT –II
An overview of Management Information System: Definition & Characteristics,
Components of MIS, Frame Work for Understanding MIS: Information requirements &
Levels of Management, Simon's Model of decision-Making, Structured Vs Un-structured
decisions, Formal vs. Informal systems.
UNIT – III
Developing Information Systems: Analysis & Design of Information Systems:
Implementation & Evaluation, Pitfalls in MIS Development.

UNIT – IV
Functional MIS: A Study of Personnel, Financial and production MIS, Introduction to e-
business systems, ecommerce – technologies, applications, Decision support systems –
support systems for planning, control and decision-making

Course Outcomes :
CO1: Relate the basic concepts and technologies used in the field of management information systems.
CO2:Compare the processes of developing and implementing information systems.
CO 3: Outline the role of the ethical, social, and security issues of information systems.
CO4: Translate the role of information systems in organizations, the strategic management processes, with the
implications for the management.
CO5: Apply the understanding of how various information systems like DBMS work together to accomplish
the information objectives of an organization.
CO6: Support the delivery, use, and management of information systems within an information systems
environment.
Mapping of Paper No. BCA-301

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S S S M S M S S S S M S S S S
CO4 S S S S S S S S M S S S S M S
CO5 M S S S S S S S S S S S S S S
CO6 S S S M S S S S M S S S M S S
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1. J. Kanter, “Management/Information Systems”, PHI.
2. Gordon B. Davis, M. H. Olson, “Management Information Systems – Conceptual
foundations, structure and Development”, McGraw Hill.
3. James A. O’Brien, “Management Information Systems”, Tata McGraw-Hill.
4. James A. Senn, “Analysis & Design of Information Systems”, Second edition,
McGraw Hill.
5. Robert G. Murdick & Joel E. Ross & James R. Claggett, “Information Systems for
Modern Management”, PHI.
6. Lucas, “Analysis, Design & Implementation of Information System”, McGraw Hill.
 BCA-302: Computer Graphics
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course Objective :
1.This Course provides an introduction to the principles of computer graphics. In particular, the
course will consider methods for modeling 2-D objects and how it generates photorealistic
renderings on color raster graphics devices. The emphasis of the course will be placed on
understanding how the various elements that like algebra, geometry, algorithms and data
structures interact in the design of graphics
2. This course provides an idea on hardware system architecture for computer graphics. This
includes, but it is not limited to: graphics pipeline, fame buffers, and graphic co – processors.
3. To give idea about basic building blocks of multimedia and a study about how these blocks
together with the current technology and tools

UNIT-I
Graphics Primitives: Introduction to computer graphics, Basics of Graphics systems,
Application areas of Computer Graphics, overview of graphics systems, video-display
devices, and raster-scan systems, random scan systems, graphics monitors and workstations
and input devices.
Output Primitives: Points and lines, line drawing algorithms, mid-point circle and ellipse
algorithms. Filled area primitives: Scan line polygon fill algorithm, boundary fill and flood-
fill algorithms .
UNIT-II
2-D Geometrical Transforms: Translation, scaling, rotation, reflection and shear
transformations, matrix representations and homogeneous coordinates, composite transforms,
transformations between coordinate systems.
2-D Viewing: The viewing pipeline, viewing coordinate reference frame, window to view-
port coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus-beck line
clipping algorithms, Sutherland –Hodgeman polygon clipping algorithm.
UNIT-III
3-D Object Representation: Polygon surfaces, quadric surfaces, spline representation,
Hermite curve, Bezier curve and B-Spline curves, Bezier and B-Spline surfaces. Basic
illumination models, polygon-rendering methods.
UNIT-IV
3-D Geometric Transformations: Translation, rotation, scaling, reflection and shear
transformations, composite transformations.
3-D Viewing: Viewing pipeline, viewing coordinates, view volume and general projection
transforms and clipping.

Course Outcomes :
CO1:Have a knowledge and understanding of the structure of an interactive computer graphics
system, and the separation of system components.
CO2:Have a knowledge and understanding of geometrical transformations and 3D viewing.
CO3:Have a knowledge and understanding of techniques for representing 3D geometrical
objects.
CO4:Have a knowledge and understanding of interaction techniques.
CO5:Students will be able to explain about the technology necessary for creating multimedia
content for the web, video, DVD, 2D and 3D graphics, Sound and programming.
CO6:Students can apply the knowledge, techniques, skills and modern tools to become
successful professionals in communication and media industries
Mapping of Paper No. BCA-302

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 S M S S S S S S S S M S S S M
CO6 S S S M S M S S S S S S M S S
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1. Donald Hearn and M. Pauline Baker : Computer Graphics, PHI Publications.
2. Plastock : Theory & Problem of Computer Gaphics, Schaum Series.
3. Foley & Van Dam : Fundamentals of Interactive Computer Graphics, Addison-Wesley.
4. Newman : Principles of Interactive Computer Graphics, McGraw Hill.
5. Tosijasu, L.K. : Computer Graphics, Springer-Verleg.
 BCA – 303 : Data Communication and Networking
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course Objectives :
1. To understand the basic concepts of data communication, layered model, protocols and
interworking between computer networks and switching components in telecommunication
systems.
2. Discuss the nature, uses and implications of internet technology.
3. To understand the functioning of Frame Relay, ATM.
4. An overview of security issues related to data communication in networks.

UNIT – I
Introduction to Computer Communications and Networking Technologies; Uses of
Computer Networks; Network Devices, Nodes, and Hosts; Types of Computer Networks
and their Topologies; Network Software: Network Design issues and Protocols;
Connection-Oriented and Connectionless Services; Network Applications and Application
Protocols; Computer Communications and Networking Models: Decentralized and
Centralized Systems, Distributed Systems, Client/Server Model, Peer-to-Peer Model, Web-
Based Model, Network Architecture and the OSI Reference Model, TCP/IP reference
model, Example Networks: The Internet, X.25, Frame Relay, ATM.
UNIT – II
Analog and Digital Communications Concepts: Concept of data, signal, channel, bid-rate ,
maximum data-rate of channel, Representing Data as Analog Signals, Representing Data as
Digital Signals, Data Rate and Bandwidth, Capacity, Baud Rate; Asynchrous and synchrous
transmission, data encoding techniques, Modulation techniques, Digital Carrier Systems;
Guided and Wireless Transmission Media; Communication Satellites; Switching and
Multiplexing; Dialup Networking; Analog Modem Concepts; DSL Service.
UNIT - III
Data Link Layer: Framing, Flow Control, Error Control; Error Detection and Correction;
Sliding Window Protocols; Media Access Control: Random Access Protocols, Token Passing
Protocols; Token Ring; Introduction to LAN technologies: Ethernet, switched Ethernet,
VLAN, fast Ethernet, gigabit Ethernet, token ring, FDDI, Wireless LANs; Bluetooth;
Network Hardware Components: Connectors, Transceivers, Repeaters, Hubs, Network
Interface Cards and PC Cards, Bridges, Switches, Routers, Gateways.
UNIT – IV
Network Layer and Routing Concepts: Virtual Circuits and Datagrams; Routing Algorithms:
Flooding, Shortest Path Routing, Distance Vector Routing; Link State Routing, Hierarchical
Routing; Congestion Control Algorithms; Internetworking;
Network Security Issues: Security threats; Encryption Methods; Authentication; Symmetric –
Key Algorithms; Public-Key Algorithms.

Course Outcomes :
CO1: Understand the basics of data communication, networking, internet and their
importance.
CO2: Analyze the services and features of various protocol layers in data networks.
CO3: Differentiate wired and wireless computer networks.
CO4: Analyse TCP/IP and their protocols.
CO5: Recognize the different internet devices and their functions.
 CO6: Identify the basic security threats of a network.
Mapping of Paper No. BCA-303

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S M M S S S S S S
CO5 S M S S M S S S S S S S S M S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1. Satinder Bal Gupta & Ashis Goel,” Data Communication and Networking”, Shree
Mahavir Book Depot (Publishers) , New Delhi.
2. Michael A. Gallo, William M. Hancock, “Computer Communications and
Networking Technologies”, CENGAGE Learning.
3. Andrew S. Tanenbaum, “Computer Networks”, Pearson Education.
4. James F. Kurose, Keith W. Ross, “Computer Networking”, Pearson Education.
5. Behrouz A Forouzan, “Data Communications and Networking”, McGraw Hill.
 BCA – 304 : Visual Basic
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Learning Objective:
1.The course is designed to guide the beginning programmer in developing applications using
the Java and Visual Basic.Net (VB.NET) programming languages.
2.The ability to program using object-oriented tools is beginning to be treated as fundamental
knowledge of the average MIS major.
3.Students will be introduced to object-oriented programming concepts along with the Java and
VB.NET syntax to implement them. Upon the completion of this course, students will know
how to create and modify simple Java and VB.NET language applications, and will have the
tools to create more complex examples.
4.Students will also have a fundamental knowledge of object-oriented concepts.

UNIT – I
Introduction to VB: Visual & non-visual programming, Procedural, Object-oriented and
eventdriven programming languages, The VB environment: Menu bar, Toolbar, Project
explorer, Toolbox, Properties window, Form designer, Form layout, Immediate window.
Visual Development and Event Driven programming.
UNIT – II
Basics of Programming: Variables: Declaring variables, Types of variables, Converting
variables types, User-defined data types, Forcing variable declaration, Scope & lifetime of
variables. Constants: Named & intrinsic. Operators: Arithmetic, Relational & Logical
operators. I/O in VB: Various controls for I/O in VB, Message box, Input Box, Print
statement.
UNIT – III
Programming with VB: Decisions and conditions: If statement, If-then-else, Select-case.
Looping statements: Do-loops, For-next, While-wend, Exit statement. Nested control
structures. Arrays: Declaring and using arrays, one-dimensional and multi-dimensional
arrays, Static & dynamic arrays, Arrays of array. Collections: Adding, Removing, Counting,
Returning items in a collection, Processing a collection.
UNIT – IV
Programming with VB: Procedures: General & event procedures, Subroutines, Functions,
Calling procedures, Arguments- passing mechanisms, Optional arguments, Named
arguments, Functions returning custom data types, Functions returning arrays.
Working with forms and menus : Adding multiple forms in VB, Hiding & showing forms,
Load & unload statements, creating menu, submenu, popup menus, Activate & deactivate
events, Form-load event, menu designing in VB Simple programs in VB.

Course Outcomes :
CO1.understand the programming algorithm, process, and structure.
CO2.understand and identify the fundamental concepts of object-oriented programming.
CO3.understand and use the concepts of objects, primitive value, message, method,
selection control structure, repetition control structures, object reference, container, and
method parameter.
CO4.know how to write and run a complete program.
CO5.understand and identify the importance of object-oriented programming for the
Internet based electronic commerce.
CO6.understand the impact of Java and VB.NET on business.
Mapping of Paper No. BCA-304

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 M S S S S S M S S S S S S S M
CO6 S S S M S S S S S M S S M S S
S = Strong, M = Medium, W = Weak

SUGGESTED READINGS
1. Steven Holzner, “Visual Basic 6 Programming: Black Book”, Dreamtech Press.
2. Evangelos Petroutsos. “Mastering Visual Baisc 6”, BPB Publications.
3. Julia Case Bradley & Anita C. Millspaugh, “Programming in Visual Basic 6.0”,
Tata McGraw-Hill Edition
4. Michael Halvorson, “Step by Step Microsoft Visual Basic 6.0 Professional”, PHI
5. “Visual basic 6 Complete”, BPB Publications.
6. Scott Warner, “Teach Yourself Visual basic 6”, Tata McGraw-Hill Edition
7. Brian Siler and Jeff Spotts, “Using Visual Basic 6”, Special Edition, PHI.
 BCA-305 : PRACTICAL- SOFTWARE LAB
PRACTICAL BASED ON PAPER BCA-304 (VB LANGUAGE) AND BCA-302
 BCA – 306: E-Commerce
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of total 8 parts
(short-answer type questions) covering the entire syllabus and will carry 16 marks. In addition to the compulsory
question there will be four units i.e. Unit-I to Unit-IV. Examiner will set two questions from each Unit of the
syllabus and each question will carry 16 marks. Student will be required to attempt FIVE questions in all.
Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four
more questions selecting one question from each Unit.

Course Objectives:
1. This course provides an introduction to information systems for business and management.
2. It is designed to familiarize students with organizational and managerial foundations of systems, the
technical foundation for understanding information systems.
Unit 1
E-commerce and Types of E-commerce: Introduction, Definition, Evolution of E-Commerce, Major areas, Major Issues
in Implementing, Comparison between Traditional Commerce and E-Commerce, Economic Potential, Driving Forces
behind E-Commerce, Advantages and Disadvantages to Customers, Businesses and Society, Reasons for the E-
Commerce Not Being Very Successful, Types of E-Commerce- B2B, B2C,C2B,C2C,B2G, Architectural Framework for E-
Commerce, Impact on Business, Importance and Uses of E- Commerce, Applications of E-Commerce
Business Models: Introduction, Definitions, Key Components of Business Models, Types of Business Models, e-Shops-
General Procedure, e-Procurement-Introduction, Definition, e-Auctions-Basic Operating Rules for e-Auction,
Participants, Advantages of e-Auction Advantages to Sellers, Buyers, Auctioneers, Value Chain, Value Chain Integrators,
Information Brokerage, Telecommunications, Telecommunication Methods in Business Communication, Collaboration
Platforms
Unit II
Electronic Payment Systems: Introduction, Limitations of Traditional Payment, Comparison of Conventional and
Electronic Payment System, Usage of E-Payment Systems, Critical Success Factors, Types of Electronic Payment
Systems, Credit Card, Electronic Cheque System, Electronic Cash System, Smart Card, their comparison, Other
Electronic Payments systems-P2P payment, Electronic wallets , E-Banking , Online Fund Transfer, ATM card, Security in
Electronic Payments-Encryption, Electronic Certificates, Payment protocols
Advertisements: Introduction, Web Based Advertising, Types of Web-Based Advertising, Search Engine
Advertisements, SEO, SEO Techniques, Advantages, Online share market operations, Online Marketing-Introduction,
Definition, Importance, types
Unit-III
Email Marketing- Introduction, Use of Email, , social networking-marketing tool, Social Media, Social Media Marketing-
objectives, risks, Viral Marketing-Introduction, The Viral Effect, working, E-Retailing: Introduction, Components,
Meaning, Customer Relationship Management (CRM)-Introduction, Purpose, Levels, Features, Importance, Goals,
relation with IT, e-CRM, difference from CRM, Tools for Online Research-Introduction, Secondary Market Research,
Factors, Primary Research-Types, Surveys, Focus Groups, Interviews, Observation, Experiments/Field Trials, Primary
vs. Secondary Research, Web survey-Design Guidelines, Online Focus Groups-When Appropriate, Limitations, Data
Mining, Social Media-Types of Social Networking Sites, Data Mining from Social Networking Sites,

Unit IV
Cloud Computing: Introduction, Characteristics, Models, Deployment Strategies, Benefits, Challenges, use by
Businesses, Applications, Enterprise Resource Planning (ERP): Introduction, Characteristics, Features, Need,
Implementation, Risk and Governance Issues, Relation with E-Commerce, E-Commerce Security and Privacy:
Introduction, Why an Issue, Security Issues, Types of Breaches, Security Measures, Online Fraud-Types, Privacy-
Privacy Issues, Cyber Laws: Introduction, Need, IT Act of India 2000, Two Sides of Indian Cyber Law, classification of
crimes under the IT Act, 2000

Course Outcomes:
CO1:Understand the basic concepts and technologies used in the field of management information systems.
CO2:Have the knowledge of the different types of management information systems.
CO3:Understand the processes of developing and implementing information systems.
CO4:Be aware of the ethical, social, and security issues of information systems.
CO5:Discuss security and ecommerce and the ramifications of neglecting it.
CO6:Create a marketing plan and promotional plan for an ecommerce site.
Mapping of Paper No. BCA-306

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 M S S S S S S S S S S S S S M
CO6 S S S M S S M S S S S S M S S
S = Strong, M = Medium, W = Weak

Suggested Readings:
1. Satinder Bal Gupta, “ IT and E-Commerce”, Mahavir Book Publications, Delhi
2. R.Kalakota and A.B.Whinston,Readings in Electronic Commerce, Addison Wesley,
3. Doing Business on the Internet E-COMMERCE S. Jaiswal;Galgotia Publications.
4. E-Commerce An Indian Perspective; P.T.Joseph; S.J.; PHI.
5. E-Commerce; S.Jaiswal – Galgotia.
BCA-307 : Object Technologies & Programming using Java
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course Objectives:
1. To understand the basic concepts and fundamentals of platform independent object oriented
language.
2. To demonstrate skills in writing programs using exception handling techniques and
multithreading.
3. To understand streams and efficient user interface design techniques.

UNIT-I
Object Oriented Methodology-1: Paradigms of Programming Languages, Evolution of OO
Methodology, Basic Concepts of OO Approach, Comparison of Object Oriented and
Procedure Oriented Approaches, Benefits of OOPs, Introduction to Common OO Language,
Applications of OOPs .
Object Oriented Methodology-2: Classes and Objects, Abstraction and Encapsulation,
Inheritance, Method Overriding and Polymorphism.
UNIT-II
Java Language Basics: Introduction To Java, Basic Features, Java Virtual Machine
Concepts, Primitive Data Type And Variables, Java Operators, Expressions, Statements and
Arrays.
Object Oriented Concepts: Class and Objects-- Class Fundamentals, Creating objects ,
Assigning object reference variables; Introducing Methods, Static methods, Constructors ,
Overloading constructors; This Keyword; Using Objects as Parameters, Argument passing,
Returning objects , Method overloading, Garbage Collection, The Finalize ( ) Method.
Inheritance and Polymorphism: Inheritance Basics, Access Control, Multilevel Inheritance,
Method Overriding, Abstract Classes, Polymorphism, Final Keyword.
UNIT-III
Packages : Defining Package, CLASSPATH, Package naming, Accessibility of Packages ,
using Package Members.
Interfaces: Implementing Interfaces, Interface and Abstract Classes, Extends and
Implements together .
Exceptions Handling : Exception , Handling of Exception, Using try-catch , Catching
Multiple Exceptions , Using finally clause , Types of Exceptions, Throwing Exceptions,
Writing Exception Subclasses.
UNIT-IV
Multithreading : Introduction , The Main Thread, Java Thread Model, Thread Priorities,
Synchronization in Java, Inter thread Communication.
I/O in Java : I/O Basics, Streams and Stream Classes ,The Predefined Streams, Reading
from, and Writing to, Console, Reading and Writing Files , The Transient and Volatile
Modifiers , Using Instance of Native Methods.
Strings and Characters : Fundamentals of Characters and Strings, The String Class , String
Operations , Data Conversion using Value Of ( ) Methods , String Buffer Class and
Methods.
 Course Outcomes:
CO1: Students will understand the need of object oriented programming, fundamental concepts and will be
able to solve computational problems using basic constructs like if-else, control structures, array, strings in
Java environment.
CO2: Student will understand how to model the real world scenario using class diagram and be able to exhibit
communication between objects using sequence diagram.
CO3: Students will be able to implement relationships between classes.
CO4: Students will be able to demonstrate various collection classes.
CO5: Students will be able to create and user interfaces and packages
CO6: The students will be able to demonstrate programs on exceptions, multithreading and applets.

Mapping of Paper No. BCA-307

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 S M S S S S M S S S S S S S S
CO6 S S S M S S S S S S M S M S S
S = Strong, M = Medium, W = Weak

Suggested Readings

1. Programming in Java, E Balagurusamy .

2. The Complete Reference JAVA, TMH Publication.
3. Begining JAVA, Ivor Horton, WROX Public.
4. JAVA 2 UNLEASHED, Tech Media Publications.
5. Patrick Naughton and Herbertz Schildt, “Java-2 The Complete reference”, 1999,TMH.
 BCA-308 :Artificial Intelligence
External Marks: 80
Internal Marks: 20
Time: 3 hours
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of
total 8 parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In
addition to the compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set
two questions from each Unit of the syllabus and each question will carry 16 marks. Student will be
required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to
compulsory question, student will have to attempt four more questions selecting one question from
each Unit.

Course Objectives:
1. Gain a historical perspective of AI and its foundations.
2. Become familiar with basic principles of AI toward problem solving, inference, perception,
knowledge representation, and learning.
3. Investigate applications of AI techniques in intelligent agents, expert systems, artificial
neural networks and other machine learning models.
4. Experience AI development tools such as an ‘AI language’, expert system shell, and/or data
mining tool.
5. Experiment with a machine learning model for simulation and analysis.
6. Explore the current scope, potential, limitations, and implications of intelligent systems.
UNIT – I
Overview of A.I: Introduction to AI, Importance of AI, AI and its related field, AI
techniques, Criteria for success.
Problems, problem space and search: Defining the problem as a state space search,
Production system and its characteristics, Issues in the design of the search problem
Heuristic search techniques : Generate and test, hill climbing, best first search technique,
problem reduction, constraint satisfaction

UNIT - II
Knowledge Representation: Definition and importance of knowledge, Knowledge
representation, Various approaches used in knowledge representation, Issues in knowledge
representation.
Using Predicate Logic : Represent ting Simple Facts in logic, Representing instances and
is_a relationship, Computable function and predicate.

UNIT - III
Natural language processing : Introduction syntactic processing, Semantic processing,
Discourse and pragmatic processing.
Learning: Introduction learning, Rote learning, Learning by taking advice, Learning in
problem solving, Learning from example-induction, Explanation based learning.

UNIT - IV
Expert System: Introduction, Representing using domain specific knowledge, Expert system
shells.

Course Outcomes:
CO1:Demonstrate fundamental understanding of the history of artificial intelligence (AI) and its
foundations.
CO2:Apply basic principles of AI in solutions that require problem solving, inference, perception,
knowledge representation, and learning.
CO3:Demonstrate awareness and a fundamental understanding of various applications of AI techniques in
intelligent agents, expert systems, artificial neural networks and other machine learning models.
CO4:Demonstrate profciency developing applications in an 'AI language', expert system shell, or data
mining tool.
CO5:Demonstrate profciency in applying scientifc method to models of machine learning.
CO6:Demonstrate an ability to share in discussions of AI, its current scope and limitations, and societal
implications.

Mapping of Paper No. BCA-308

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S M S S M S S S S S S S S S S
CO4 S S S S S S S S M S S M S S S
CO5 M S S S S S S S S S S S S S S
CO6 S S S M S S M S S S S S M S S
S = Strong, M = Medium, W = Weak

Suggested Readings:
1. Satinder Bal Gupta, “ Artificial Intelligence”, Mahavir Book Publications, Delhi
2. David W. Rolston : Principles of Artificial Intelligence and Expert System Development,
McGraw Hill Book Company.
3. Elaine Rich, Kevin Knight : Artificial Intelligence, Tata McGraw Hill.
4. D.W. Patterson, "Introduction to AI and Expert Systems", PHI, 1999 .
5. Nils J Nilsson ,"Artificial Intelligence -A new Synthesis" 2nd Edition (2000), Harcourt
Asia Ltd.
 BCA – 309: INTRODUCTION TO .NET

Time: 3 hours External Marks: 80

Internal Marks: 20
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of total 8
parts (short-answer type questions) covering the entire syllabus and will carry 16 marks. In addition to the
compulsory question there will be four units i.e. Unit-I to Unit-IV. Examiner will set two questions from
each Unit of the syllabus and each question will carry 16 marks. Student will be required to attempt FIVE
questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will
have to attempt four more questions selecting one question from each Unit.

Course Objectives:
1.To explore .NET technologies for designing and developing dynamic, interactive and responsive
web applications.
2. Provide a consistent, object-oriented programming environment whether object code is stored and
executed locally, executed locally but webdistributed, or executed remotely.
3. Make the developer experience consistent across widely varying types of apps, such as
Windowsbased apps and Web-based apps.

UNIT – I
The Framework of .Net: Building blocks of .Net Platform (the CLR, CTS and CLS),
Features of .Net, Deploying the .Net Runtime, Architecture of .Net platform, Introduction to
namespaces & type distinction. Types & Object in .Net, the evolution of Web development.
UNIT – II
Class Libraries in .Net, Introduction to Assemblies & Manifest in .Net, Metadata & attributes.
Introduction to C#: Characteristics of C#, Data types: Value types, reference types, default
value, constants, variables, scope of variables, boxing and unboxing.
UNIT – III
Operators and expressions: Arithmetic, relational, logical, bitwise, special operators, evolution
of expressions, operator precedence & associativity, Control constructs in C#: Decision
making, loops, Classes & methods: Class, methods, constructors, destructors, overloading of
operators & functions.
UNIT – IV
Inheritance & polymorphism: visibility control, overriding, abstract class & methods, sealed classes
& methods, interfaces.
Advanced features of C#: Exception handling & error handling, automatic memory
management, Input and output (Directories, Files, and streams).

Course Outcomes:
CO1:Understand the .NET framework.
CO2:Develop a proficiency in the C# programming language.
CO3:Proficiently develop ASP.NET web applications using C# .
CO4:Use ADO.NET for data persistence in a web application.
CO5:To understand the 3-tier software architecture (presentation/client tier, application tier, data tier) and
develop multi-tier applications to understand and experiment with the deployment of enterprise
applications.
CO6:To develop web applications using a combination of client-side (JavaScript, HTML, XML, WML)
and server-side technologies (ASP.NET, ADO.NET).
Mapping of Paper No. BCA-309

PSO1

PSO2
PSO3
PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 M S S S S S M S S S S S S S M
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak
SUGGESTED READINGS

1. Introduction to C# using .NET By Robert J. Oberg, PHI, 2002.

2. Programming in C# By E. Balaguruswamy, Tata McGraw Hill.
3. The Complete Guide to C# Programming by V. P. Jain.
4. C# : A Beginner's Guide, Herbert Schildt, Tata McGraw Hill.
5. C# and .NET Platform by Andrew Troelsen, Apress, 1st edition, 2001.
BCA-310 : PRACTICAL- SOFTWARE LAB
– Based on paper BCA-307
and BCA-309