BCA-101 : COMPUTER & PROGRAMMING FUNDAMENTALS

External Marks: 80
Time: 3 hours 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.
Topic Covered No of Lectures

Computer Fundamentals: Generations of Computers, Definition,

Block Diagram along with its components, characteristics &
UNIT-I classification of computers, Limitations of Computers, Human-
Being VS Computer, Applications of computers in various 25
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
Computer hardware & software: I/O devices, definition of
UNIT-II software, relationship between hardware and software, types of
software.Overview of operating system: Definition, functions of
operating system, concept of multiprogramming, multitasking, 20
multithreading, multiprocessing, time-sharing, real time, single-
user & multi-user operating system. Computer Virus: Definition,
types of viruses, Characteristics of viruses, anti-virus software.
Computer Languages: Analogy with natural language, machine
UNIT-III language, assembly language,high-level languages, forth
generation languages, compiler, interpreter, assembler,
Linker,Loader , characteristics of a good programming language,
25
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
bottomup 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 20
transmission, Transmission channels(media), Introduction to
internet and its uses, Applications of internet, Hardware and
Software requirements for internet, Intranet, Applications of
intranet.
SUGGESTED READINGS
1. Gill Nasib Singh: Computing Fundamentals and Programming in C, Khanna Books
Publishing Co., New Delhi.
2. Balagurusamy E, Computing Fundamentals and C Programming, Tata McGraw Hill.
3. Norton, Peter, Introduction to Computer, McGraw-Hill
4. Leon, Alexis & Leon, Mathews, Introduction to Computers, Leon Tech World
5. Rajaraman, V., Fundamentals of Computers, PHI
6. Ram, B., Computer Fundamentals, Architecture & Organization, New Age International
(P) Ltd.
7. Chhillar, Rajender Singh: Application of IT to Business, Ramesh Publishers, Jaipur.
8. Gill, Nasib Singh: Essentials of Computer and Network Technology, Khanna Books
Publishing Co., New Delhi
Note: Latest and additional good books may be suggested and added from time to time
BCA-102: PC SOFTWARE

External Marks: 80
Time: 3 hours 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.
Topic Covered No of Lectures

MS-Windows: Operating system-Definition & functions, basics

of Windows. Basic components of windows, icons, types of
UNIT-I icons, taskbar, activating windows, using desktop title bar,
running applications, exploring computer, managing files and 20
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.
Documentation Using MS-Word - Introduction to word
UNIT-II 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, 25
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.
Electronic Spread Sheet using MS-Excel - Introduction to MS-
UNIT-III 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 30
referencing, Pagesetup, 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.
Presentation using MS-PowerPoint: Presentations, Creating,
UNIT-IV Manipulating & Enhancing Slides, Organizational Charts, Excel
Charts, Word Art, Layering art Objects, Animations and Sounds, 15
Inserting Animated Pictures or Accessing through Object,
Inserting Recorded Sound Effect or In-Built Sound Effect.
SUGGESTED READINGS
1. Microsoft Office – Complete Reference – BPB Publication
2. Learn Microsoft Office – Russell A. Stultz – BPB Publication
3. Courter, G Marquis (1999). Microsoft Office 2000: Professional Edition. BPB.
4. Koers, D (2001). Microsoft Office XP Fast and Easy. PHI.
5. Nelson, S L and Kelly, J (2002). Office XP: The Complete Reference. Tata McGraw-
Hill.
Note: Latest and additional good books may be suggested and added from time to time.
BCA-103 : MATHEMATICS

External Marks: 80
Time: 3 hours 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.
Topic Covered No of Lectures

SETS: Sets, Subsets, Equal Sets Universal Sets, Finite and

Infinite Sets, Operation on Sets,Union, Intersection and
UNIT-I Complements of Sets, Cartesian Product, Cardinality of Set,
Simple Applications.
DETERMINANTS: Definition, Minors, Cofactors, Properties of 25
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,
djoint,Inverse, solving system of linear equation Cramer‟s Rule.
RELATIONS AND FUNCTIONS: Properties of Relations,
UNIT-II 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 25
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.
DIFFERENTIATION: Derivative of a function, Derivatives of
UNIT-III Sum, Differences, Product & Quotient of functions, Derivatives
of polynomial, trigonometric, exponential, logarithmic, inverse
trigonometric and implicit functions, Logarithmic Differentiation, 20
Chain Rule and differentiation by substitution.

INTEGRATION: Indefinite Integrals, Methods of Integration by

UNIT-IV Substitution, By Parts, Partial Fractions, Integration of Algebraic
and Transcendental Functions, Reduction Formulae for simple 20
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.
SUGGESTED READINGS
1. C.L.Liu: Elements of Discrete Mathematics, McGraw Hill.
2. Lipschutz, Seymour: Discrete Mathematics, Schaum‟s Series
3. Babu Ram: Discrete Mathematics, Vinayek Publishers, New Delhi.
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.
7. Gersting: Mathematical Structure for Computer Science, WH Freeman &
Macmillan.
8. Hopcroft J.E, Ullman J.D.: Introduction to Automata theory, Languages and
Computation, Narosa Publishing House, New Delhi.
Note: Latest and additional good books may be suggested and added from time to
time
 BCA-104 : LOGICAL ORGANIZATION OF COMPUTER-I

External Marks: 80
Time: 3 hours 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.

Topic Covered No of Lectures

Information Representation: Number Systems, Binary Arithmetic,

UNIT-I Fixed-point and Floatingpoint representation of numbers, BCD
Codes, Error detecting and correcting codes, Character 20
Representation – ASCII, EBCDIC, Unicode.

Binary Logic: Boolean Algebra, Boolean Theorems, Boolean Functions

UNIT-II and Truth Tables, Canonical and Standard forms of Boolean functions,
Simplification of Boolean Functions – Venn Diagram, Karnaugh Maps. 25

.
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 25
circuits, Combinational Logic – Characteristics, Design
Procedures, analysis procedures, Multilevel NAND and NOR
circuits.

Combinational Circuits: Half-Adder, Full-Adder, Half-Subtractor,

UNIT-IV Full-Subtractor, Parallel binary adder/subtractor, Encoders,
Decoders, Multiplexers, Demultiplexers, Comparators, Code 20
Converters, BCD to Seven-Segment Decoder.
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

Note: Latest and additional good books may be suggested and added from time to time.

BCA-105 : Practical- Software lab

(Based on paper BCA-102, PC Software)
 BCA-106 : ‘C’ PROGRAMMING

External Marks: 80
Time: 3 hours 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.

Topic Covered No of Lectures

Overview of C: History of C, Importance of C, Elements of C: C

character set, identifiers and keywords, Data types, Constants and
UNIT-I Variables, Assignment statement, Symbolic constant, Structure of
a C Program, printf(), scanf() Functions, Operators & Expression:
Arithmetic,relational,logical,bitwise, unary, assignment,shorthand 30
assignment operators, conditional operators and increment and
decrement operators, Arithmetic expressions, evaluation of
arithmetic expression, type casting and conversion, operator
hierarchy & associativity.

Decision making & branching: Decision making with IF

UNIT-II statement, IF-ELSE statement, Nested IF statement, ELSE-IF
ladder, switch statement, goto statement. Decision making & 22
looping: For, while, and do-while loop, jumps in loops, break,
continue statement, Nested loops.

Functions: Standard Mathematical functions, Input/output:

UNIT-III formatted & formatted I/O function in C, Input functions viz.
getch(), getche(), getchar(), gets(), output functions viz., putch(),
putchar(), puts(), string manipulation functions. User defined 15
functions: Introduction/Definition, prototype, Local and global
variables, passing parameters, recursion.

Arrays, strings and pointers: Definition, types, initialization,

UNIT-IV 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. 23
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.
SUGGESTED READINGS
1. Gottfried, Byron S., Programming with C, Tata McGraw Hill
2. Gill Nasib Singh: Computing Fundamentals and Programming in C, Khanna Books
Publishing Co., New Delhi.
3. Balagurusamy, E., Programming in ANSI C, 4E, Tata McGraw-Hill
4. Jeri R. Hanly & Elliot P. Koffman, Problem Solving and Program Design in C,
Addison Wesley.
5. Yashwant Kanetker, Let us C, BPB.
6. Rajaraman, V., Computer Programming in C, PHI.
7. Yashwant Kanetker, Working with C, BPB.
Note: Latest and additional good books may be suggested and added from time to time
 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.

Topic Covered No of Lectures

Sequential Logic: Characteristics, Flip-Flops, Clocked RS, D

type, JK, T type and Master- Slave flip-flops. State table, state 28
UNIT-I diagram and state equations. Flip-flop excitation tables.

Sequential Circuits: Designing registers – Serial Input Serial

UNIT-II Output (SISO), Serial Input Parallel Output (SIPO), Parallel Input
Serial Output (PISO), Parallel Input Parallel Output(PIPO) and
shift registers. Designing counters – Asynchronous and 27
Synchronous Binary Counters, Modulo-N Counters and Up-
Down Counters.
Memory & I/O Devices: Memory Parameters, Semiconductor
UNIT-III RAM, ROM, Magnetic and Optical Storage devices, Flash 15
memory, I/O Devices and their controllers.
Instruction Design & I/O Organization: Machine instruction,
UNIT-IV Instruction set selection, Instruction cycle, Instruction Format and
Addressing Modes. I/O Interface, Interrupt structure, Program- 20
controlled, Interrupt-controlled & DMA transfer, I/O Channels,
IOP.

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
Note: Latest and additional good books may be suggested and added from time to time.
 BCA -108 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

External Marks: 80
Time: 3 hours 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 thecompulsory 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.

No of
Topic Covered
Lectures
Basic Statistics: Measure of Central Tendency, Preparing frequency
distribution table,Mean, Mode, Median, Measure of Dispersion: Range, 20
UNIT-I
Variance and Standard Deviations, Correlation and Regression.
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
UNIT-II
algorithms, complexity.
30
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.

Tree: Trees, Minimum distance trees, Minimum weight and Minimum

UNIT-III
distance spanning trees.
20
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, 20
Euclidean algorithm, Fibonacci numbers, congruences and equivalence
relations, public key encryption schemes.

SUGGESTED READINGS
1. Gupta S.P. and Kapoor, V.K., Fundamentals of Applied statistics, Sultan Chand Sons, 1996.
2. Gupta S.P. and Kapoor, V.K., Fundamentals of Mathematical statistics, Sultan Chand and
Sons, 1995.
3. Graybill, Introduction to Statistics, McGraw.
4. Anderson, Statistical Modelling, McGraw.
5. Babu Ram : Discrete Mathematics
Note: Latest and additional good books may be suggested and added from time to time.
 BCA-109 : Structured Systems Analysis and Design
External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
Introduction to system, Definition and characteristics of a system,
Elements of system, Types of system, System development life cycle,
UNIT-I Role of system analyst, Analyst/user interface, System planning and
initial investigation: Introduction, Bases for planning in system 20
analysis, Sources of project requests, Initial investigation, Fact
finding, Information gathering, information gathering tools, Fact
analysis, Determination of feasibility.
Structured analysis, Tools of structured analysis: DFD, Data
dictionary, Flow charts, Gantt charts, decision tree, decision table,
UNIT-II structured English, Pros and cons of each tool, Feasibility study:
Introduction, Objective, Types, Steps in feasibility analysis,
25
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.

System Design: System design objective, Logical and physical design,

UNIT-III
Design Methodologies, structured design, Form-Driven
methodology(IPO charts), structured walkthrough, Input/output and
form design: Input design, Objectives of input design, Output design, 25
Objectives of output design, Form design, Classification of forms,
requirements of form design, Types of forms, Layout considerations,
Form control.

System testing: Introduction, Objectives of testing, Test plan, testing

UNIT-IV
techniques/Types of system tests, Quality assurance goals in system
life cycle, System implementation, Process of implementation, 20
System evaluation, System maintenance and its types, System
documentation, Forms of documentation.
SUGGESTED READINGS
1. Systems Analysis and design BY e.m. aWAD Galgotia Pub.(P) Ltd.
2. Data Management and Data Structures by Loomis (PHI)
3. System Analysis and Design by Elias Awad.
4. Introductory System analysis and Design by Lee Vol. I & II
Note: Latest and additional good books may be suggested and added from time to time.

BCA-110: Practical- Software lab

(Based on paper BCA-106, C Programming)
SYLLABUS OF B.C.A. III & IV SEMESTER effective from 2013-14
 BCA-201 : Introduction to Operating System
External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
Fundamentals of Operating system: Introduction to Operating
System, its need and operating System services, Early systems,
UNIT-I
Structures - Simple Batch, Multi programmed timeshared, Personal
18
Computer, Parallel, Distributed Systems, and 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.
30
Deadlocks: Deadlock characterization, Methods for handling
deadlocks, Banker‟s Algorithm.

UNIT-III
Memory Management: Logical versus Physical address space,
Swapping, Contiguous allocation, Paging, Segmentation.
28
Virtual Memory: Demand paging, Performance of demand paging,
Page replacement, Page replacement algorithms, Thrashing.

File management: File system Structure, Allocation methods:

UNIT-IV Contiguous allocation, Linked allocation, Indexed allocation, Free
space management: Bit vector, Linked list, Grouping, Counting.
14
Device Management: Disk structure, Disk scheduling: FCFS, SSTF,
SCAN, C-SCAN, LOOK, C-LOOK.
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.
Note: Latest and additional good books may be suggested and added from time to time
 BCA – 202 : DATA STRUCTURES – I

External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
Introduction: Elementary data organization, Data Structure definition,
Data type vs. data structure, Categories of data structures, Data
UNIT-I
structure operations, Applications of data structures, Algorithms
15
complexity and time-space tradeoff, Big-O notation. Strings:
Introduction, Storing strings, String operations, Pattern matching
algorithms

Arrays: Introduction, Linear arrays, Representation of linear array in

memory, address calculations, Traversal, Insertions, Deletion in an
UNIT-II array, Multidimensional arrays, Parallel arrays, Sparse arrays.
Linked List: Introduction, Array vs. linked list, Representation of
35
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.

Stack: Introduction, Array and linked representation of stacks,

UNIT-III
Operations on stacks, Applications of stacks: Polish notation,
Recursion.
Queues: Introduction, Array and linked representation of queues, 25
Operations on queues, Deques, Priority Queues, Applications of
queues.

Tree: Introduction, Definition, Representing Binary tree in memory,

UNIT-IV
Traversing binary trees, Traversal algorithms using stacks.
Graph: Introduction, Graph theory terminology, Sequential and 15
linked representation of graphs.
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.
Note: Latest and additional good books may be suggested and added from time to time.
 BCA – 203 : INTRODUCTION TO DATABASE SYSTEM

External Marks: 80
Time: 3 hours 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 fromeach 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.

No of
Topic Covered
Lectures
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),
UNIT-I
Components of DBMS Environment, DBMS Functions and
20
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.

Database System Architecture – Three Levels of Architecture,

External, Conceptual and Internal Levels, Schemas, Mappings and
Instances.
UNIT-II
Data Independence – Logical and Physical Data Independence.
Classification of Database Management System, Centralized and 25
Client Server architecture to DBMS.
Data Models: Records- based Data Models, Object-based Data
Models, Physical Data Models and Conceptual Modeling.

Entity-Relationship Model – Entity Types, Entity Sets, Attributes

UNIT-III
Relationship Types, Relationship Instances and ER Diagrams,
abstraction and integration. Basic Concepts of Hierarchical and
Network Data Model, Relational Data Model:-Brief History, 20
Relational Model Terminology-Relational Data Structure, Database
Relations, Properties of Relations, Keys, Domains, Integrity
Constraints over Relations.
Relational algebra, Relational calculus, Relational database design:
UNIT-IV Functional dependencies, Modification anomalies, Ist to 3rd NFs, 25
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

SUGGESTED READINGS
1. Elmasri & Navathe, “Fundamentals of Database Systems”, 5th edition, Pearson
Education.
2. Thomas Connolly Carolyn Begg, “Database Systems”, 3/e, Pearson Education
3. C. J. Date, “An Introduction to Database Systems”, 8th edition, Addison Wesley N.
Delhi.
Note: Latest and additional good books may be suggested and added from time to time.
 BCA-204 : COMMUNICATION SKILLS (ENGLISH)

External Marks: 80
Time: 3 hours 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.
No of
Topic Covered
Lectures
Introduction to Basics of Communication: Communication and its
various definition, features/characteristics of the communication,
UNIT-I 20
process of communication, communication model and theories,
barrier to effective communication
Improving LSRW: introduction, verbal and nonverbal
UNIT-II communication, listening process, group discussion, forms of oral
presentation, self-presentation, dyadic communication, 5C‟s of 25
communication, Developing dialogues, soft skill.

Basic vocabulary: how to improve vocabulary, prefix/suffix,

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

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
Note: Latest and additional good books may be suggested and added from time to time
BCA-205 : PRACTICAL- SOFTWARE LAB
PRACTICAL BASED ON PAPER BCA-202 & 203 USING C LANGUAGE AND
SQLSYLLABUS OF BCA IVTH SEMESTER
 BCA – 206 : WEB DESIGNING

External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
Introduction to Internet and World Wide Web; Evolution and History
of World Wide Web; Basic features; Web Browsers; Web Servers;
UNIT-I
Hypertext Transfer Protocol, Overview of TCP/IP and its services;
15
URLs; Searching and Web-Casting Techniques; Search Engines and
Search Tools.

Web Publishing: Hosting your Site; Internet Service Provider; Web

terminologies, Phases of Planning and designing your Web Site;
UNIT-II
Steps for developing your Site; Choosing the contents; Home Page;
Domain Names, Front page views, Adding pictures, Links, 20
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;
25
Headers; Text styles Text Structuring; Text colors and Background;
Formatting text; Page layouts.

Images; Ordered and Unordered lists; Inserting Graphics; Table

Creation and Layouts; Frame Creation and Layouts; Working with
UNIT-IV
Forms and Menus; Working with Radio Buttons; Check Boxes; Text
Boxes; DHTML: Dynamic HTML, Features of 30
DHTML,CSSP(cascading style sheet positioning) and
JSSS(JavaScript assisted style sheet), Layers of netscape, The ID
attributes, DHTML events.
SUGGESTED READINGS
1. Raj Kamal, “Internet and Web Technologies”, Tata McGraw-Hill.
2. Ramesh Bangia, “Multimedia and Web Technology”, Firewall Media.
3. Thomas A. Powell, “Web Design: The Complete Reference” , 4/e, Tata McGraw-
Hill
4. Wendy Willard, “HTML Beginners Guide”, Tata McGraw-Hill.
5. Deitel and Goldberg, “Internet and World Wide Web, How to Program”, PHI.
Note: Latest and additional good books may be suggested and added from time to time.
 BCA – 207: DATA STRUCTURE – II
External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
Tree: Header nodes, Threads, Binary search trees, Searching, Insertion
and deletion in a Binary search tree, AVL search trees, Insertion and
UNIT-I
deletion in AVL search tree, m-way search tree, Searching, Insertion
30
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
17
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 23
the basis of their complexity.

Files: Physical storage devices and their characteristics, Attributes of a

file viz fields, records, Fixed and variable length records, Primary and
UNIT-IV secondary keys, Classification of files, File operations, Comparison of
various types of files, File organization: Serial, Sequential, Indexed-
20
sequential, Random-access/Direct, Inverted, Multilist file organization.
Hashing: Introduction, Hashing functions and Collision resolution
methods .
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.
Note: Latest and additional good books may be suggested and added from time to time.
 BCA-208: Object Oriented Programming Using C++

External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
Object Oriented Programming Concepts : Procedural Language and
Object Oriented approach, Characteristics of OOP, user defined types,
UNIT-I
polymorphism and encapsulation. Getting started with C++: syntax,
20
data types, variables, string, function, namespace and exception,
operators, flow control, recursion, array and pointer, structure .

Abstracting Mechanism: classes, private and public, Constructor and

UNIT-II
Destructor, member function, static members, references; Memory
Management: new, delete, object copying, copy constructer, assignment 20
operator, this input/output.

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

Exception Handling: Exception and derived class, function exception

UNIT-IV declaration, unexpected exception, and exception when handling
exception, resource capture and release. Template and Standard
25
Template Library: Template classes, declaration, template functions,
namespace, string, iterations, hashes, iostreams and other types.
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
Time: 3 hours 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.
No of
Topic Covered
Lectures
Introduction: Software Crisis, Software Processes & Characteristics,
Software life cycle models, Waterfall, Prototype, Evolutionary and
Spiral Models.
UNIT-I Software Requirements Analysis & Specifications: Requirement
engineering, requirement elicitation techniques like FAST, QFD, 20
requirements analysis using DFD, Data dictionaries & ER Diagrams,
Requirements documentation, Nature of SRS, Characteristics &
organization of SRS .

Software Project Management Concepts: The Management spectrum,

UNIT-II
The People The Problem, The Process, The Project.
Software Project Planning: Size Estimation like lines of Code & 25
Function Count, Cost Estimation Models, COCOMO, Risk
Management
Software Design: Cohesion & Coupling, Classification of
Cohesiveness & Coupling, Function Oriented Design, Object Oriented
UNIT-III
Design, Software Metrics: Software measurements: What & Why,
Token Count, Halstead Software Science Measures, Design Metrics,
Data Structure Metrics 25
Software Implementation: Relationship between design and
implementation, Implementation issues and programming support
environment, Coding the procedural design, Good coding style.

Software Testing: Testing Process, Design of Test Cases, Types of

UNIT-IV Testing, Functional Testing, Structural Testing, Test Activities, Unit
Testing, Integration Testing and System Testing, Debugging Activities.
20
Software Maintenance: Management of Maintenance, Maintenance
Process, Reverse Engineering, Software Re-engineering, Configuration
Management, Documentation.
SUGGESTED READINGS
1. Gill, Nasib Singh : Software Engineering, Khanna Book Publishing Co. (P) Ltd. N. Delhi.
2. Pressman : Software Engineering, TMH.
3. Jalote, Pankaj : An Integrated Approach to Software Engineering, Narosa Publications.
4. Chhillar Rajender Singh : Software Engineering : Testing, Faults, Metrics, Excel Books, New
Delhi.
5. Ghezzi, Carlo : Fundaments of Software Engineering, PHI.
6. 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
 w.e.f. 2014-15
BCA – 301: MANAGEMENT INFORMATION SYSTEM
External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
Introduction to system and Basic System Concepts, Types of Systems,
The Systems Approach, Information System: Definition &
UNIT-I
Characteristics, Types of information, Role of Information in Decision-
15
Making, Sub-Systems of an Information system: EDP and MIS
management levels, EDP/MIS/DSS.

An overview of Management Information System: Definition &

UNIT-II Characteristics, Components of MIS, Frame Work for Understanding
MIS: Information requirements & Levels of Management, Simon's
25
Model of decision-Making, Structured Vs Un-structured decisions,
Formal vs. Informal systems.

Developing Information Systems: Analysis & Design of Information

UNIT-III 20
Systems: Implementation & Evaluation, Pitfalls in MIS Development.

Functional MIS: A Study of Personnel, Financial and production MIS,

Introduction to e-business
UNIT-IV systems, ecommerce – technologies, applications, Decision support
systems – support systems for planning, control and decision-making
25
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.
Note: Latest and additional good books may be suggested and added from time to
time.
 BCA-302: Computer Graphics
External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
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,
UNIT-I
random scan systems, graphics monitors and workstations and input
25
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 .

2-D Geometrical Transforms: Translation, scaling, rotation, reflection

and shear transformations, matrix representations and homogeneous
UNIT-II coordinates, composite transforms, transformations between coordinate
systems.
25
2-D Viewing: The viewing pipeline, viewing coordinate reference
frame, window to viewport 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
20
and B-Spline surfaces. Basic illumination models, polygon-rendering
methods.

3-D Geometric Transformations: Translation, rotation, scaling,

UNIT-IV reflection and shear transformations, composite transformations.
20
3-D Viewing: Viewing pipeline, viewing coordinates, view volume and
general projection transforms and clipping.
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.
Note : Latest and additional good books may be suggested and added from time to time
 BCA – 303 : Data Communication and Networking

External Marks: 80
Time: 3 hours 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.
No of
Topic Covered
Lectures
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
UNIT-I issues and Protocols; Connection-Oriented and Connectionless Services;
Network Applications and Application Protocols; Computer Communications 25
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.

Analog and Digital Communications Concepts: Concept of data, signal,

channel, bid-rate , maximum data-rate of channel, Representing Data as Analog
UNIT-II
Signals, Representing Data as Digital Signals, Data Rate and Bandwidth,
Capacity, Baud Rate; Asynchrous and synchrous transmission, data encoding 25
techniques, Modulation techniques, Digital Carrier Systems; Guided and
Wireless Transmission Media; Communication Satellites; Switching and
Multiplexing; Dialup Networking; Analog Modem Concepts; DSL Service.

Data Link Layer: Framing, Flow Control, Error Control; Error Detection and
UNIT-III Correction; Sliding Window Protocols; Media Access Control: Random Access
Protocols, Token Passing Protocols; Token Ring; Introduction to LAN
technologies: Ethernet, switched Ethernet,
25
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.
Network Layer and Routing Concepts: Virtual Circuits and Datagram; Routing
UNIT-IV Algorithms: Flooding, Shortest Path Routing, Distance Vector Routing; Link
State Routing, Hierarchical Routing; Congestion Control Algorithms;
15
Internetworking; Network Security Issues: Security threats; Encryption
Methods; Authentication; Symmetric – Key Algorithms; Public-Key
Algorithms
SUGGESTED READINGS
1. Michael A. Gallo, William M. Hancock, “Computer Communications and
Networking Technologies”, CENGAGE Learning.
2. Andrew S. Tanenbaum, “Computer Networks”, Pearson Education.
3. James F. Kurose, Keith W. Ross, “Computer Networking”, Pearson Education.
4. Behrouz A Forouzan, “Data Communications and Networking”, McGraw Hill.
Note: Latest and additional good books may be suggested and added from time to time.
 BCA – 304 : Visual Basic

External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
Introduction to VB: Visual & non-visual programming, Procedural,
Object-oriented and event driven programming languages, The VB
UNIT-I
environment: Menu bar, Toolbar, Project explorer, Toolbox, Properties 25
window, Form designer, Form layout, Immediate window. Visual
Development and Event Driven programming.

Basics of Programming: Variables: Declaring variables, Types of

UNIT-
variables, Converting variables types, User-defined data types, Forcing
II
variable declaration, Scope & lifetime of variables. Constants: Named
20
& intrinsic. Operators: Arithmetic, Relational & Logical operators. I/O
in VB: Various controls for I/O in VB, Message box, Input Box, Print
Statement.

Programming with VB: Decisions and conditions: If statement, If-then-

UNIT-
else, Select-case. Looping statements: Do-loops, For-next, While-wend,
III
Exit statement. Nested control structures. Arrays: Declaring and using
20
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.

Programming with VB: Procedures: General & event procedures,

Subroutines, Functions, Calling procedures, Arguments- passing
UNIT- mechanisms, Optional arguments, Named arguments, Functions
IV returning custom data types, Functions returning arrays. Working with
forms and menus: Adding multiple forms in VB, Hiding & showing 25
forms, Load & unload statements, creating menu, submenu, popup
menus, Activate & deactivate events, Form-load event, menu designing
in VB Simple programs in VB.
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.
Note: Latest and additional good books may be suggested and added from time to time

BCA-305 : PRACTICAL- SOFTWARE LAB

PRACTICAL BASED ON PAPER BCA-304 (VB LANGUAGE) AND BCA-302
 BCA – 306: E-Commerce

External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
Electronic Commerce: Overview of Electronic Commerce, Scope of
Electronic Commerce, Traditional Commerce vs. Electronic Commerce,
UNIT-I Impact of E-Commerce, Electronic Markets, Internet Commerce, e-
commerce in perspective, Application of E Commerce in Direct 20
Marketing and Selling, Obstacles in adopting E-Commerce
Applications; Future of Ecommerce.

Value Chains in electronic Commerce, Supply chain, Porter‟s value

chain Model, Inter Organizational value chains, Strategic Business unit
UNIT-II chains, Industry value chains.
Security Threats to E-commerce: Security Overview, Computer
25
Security Classification, Copyright and Intellectual Property, security
Policy and Integrated Security, Intellectual Property Threats, electronic
Commerce Threats, Clients Threats, Communication Channel Threats,
server Threats.

UNIT-III Implementing security for E-Commerce: Protecting E-Commerce

Assets, Protecting Intellectual Property, Protecting Client Computers,
Protecting E-commerce Channels, Insuring Transaction Integrity,
25
Protecting the Commerce Server. Electronic Payment System:
Electronic Cash, Electronic Wallets, Smart Card, Credit and Change
Card.

Business to Business E-Commerce: Inter-organizational Transitions,

Credit Transaction Trade Cycle, a variety of transactions. Electronic
UNIT-IV
Data Interchange (EDI): Introduction to EDI, Benefits of EDI, EDI
Technology, EDI standards, EDI Communication, EDI Implementation, 20
EDI agreement, EDI security.
SUGGESTED READINGS
1. R.Kalakota and A.B.Whinston,Readings in Electronic Commerce, Addison Wesley,
2 David Kosiur, Understanding E- Commerce, Microsoft Press, 1997. 3) Soka,
From EDI to Electronic Commerce , McGraw Hill, 1995.
3 David whitely, E-commerce Strategy, Technology and application, Tata McGraw Hill.
4 Gary P. Schneider and Jame Perry, Electronic Commerce Thomson Publication.
5 Doing Business on the Internet E-COMMERCE S. Jaiswal;Galgotia Publications.
6 E-Commerce An Ind
7 E-Commerce; S.Jaiswal – Glgotia.
8 E-Commerce; Efrain Turbon; Jae Lee; David King; H.Michael Chang.
Note: Latest and additional good books may be suggested and added from time to time.
 BCA-307 : Object Technologies & Programming using Java

External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures
Object Oriented Methodology-1: Paradigms of Programming
Languages, Evolution of OO Methodology, Basic Concepts of OO
Approach, Comparison of Object Oriented and Procedure Oriented
UNIT-I
Approaches, Benefits of OOPs, Introduction to Common OO Language,
20
Applications of OOPs.
Object Oriented Methodology-2: Classes and Objects, Abstraction and
Encapsulation, Inheritance, Method Overriding and Polymorphism.

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,
UNIT-II Creating objects , Assigning object reference variables; Introducing
Methods, Static methods, Constructors , Overloading constructors; This 25
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.

Packages: Defining Package, CLASSPATH, Package naming,

UNIT-III
Accessibility of Packages, using Package Members.
Interfaces: Implementing Interfaces, Interface and Abstract Classes,
Extends and Implements together. 25
Exceptions Handling: Exception, Handling of Exception, Using try-
catch, Catching Multiple Exceptions , Using finally clause , Types of
Exceptions, Throwing Exceptions, Writing Exception Subclasses.
Multithreading: Introduction, The Main Thread, Java Thread Model,
UNIT-IV Thread Priorities, Synchronization in Java, Inter threads
20
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.

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.
Note: Latest and additional good books may be suggested and added from time to time.
 BCA-308 : Artificial Intelligence

External Marks: 80
Time: 3 hours 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.
No of
Topic Covered
Lectures
Overview of A.I: Introduction to AI, Importance of AI, AI and its
related field, AI techniques, Criteria for success.
UNIT-I Problems, problem space and search: Defining the problem as a state
space search, Production system and its characteristics, Issues in the 30
design of the search problem
Heuristic search techniques : Generate and test, hill climbing, best first
search technique, problem reduction, constraint satisfaction

Knowledge Representation: Definition and importance of knowledge,

UNIT-II Knowledge representation, Various approaches used in knowledge
representation, Issues in knowledge representation.
20
Using Predicate Logic : Represent ting Simple Facts in logic,
Representing instances and is a relationship, Computable function and
predicate

Natural language processing : Introduction syntactic processing,

Semantic processing, Discourse and pragmatic processing.
UNIT-III
Learning: Introduction learning, Rote learning, Learning by taking 25
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. 15
SUGGESTED READINGS
1. David W. Rolston : Principles of Artificial Intelligence and Expert System Development,
McGraw Hill Book Company.
2. Elaine Rich, Kevin Knight : Artificial Intelligence, Tata McGraw Hill.
3. D.W. Patterson, "Introduction to AI and Expert Systems", PHI, 1999 .
4. Nils J Nilsson ,"Artificial Intelligence -A new Synthesis" 2nd Edition (2000), Harcourt
Asia Ltd.
Note: Latest and additional good books may be suggested and added from time to time
 BCA – 309 : INTRODUCTION TO .NET

External Marks: 80
Time: 3 hours 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.

No of
Topic Covered
Lectures

Class Libraries in .Net, Introduction to Assemblies & Manifest in .Net,

UNIT-I
Metadata & attributes. Introduction to C#: Characteristics of C#, Data
15
types: Value types, reference types, default value, constants, variables,
scope of variables, boxing and unboxing.

UNIT-II Class Libraries in .Net, Introduction to Assemblies & Manifest in .Net,

Metadata & attributes. Introduction to C#: Characteristics of C#, Data
25
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 25
& methods: Class, methods, constructors, destructors, overloading of
operators & functions.

Inheritance & polymorphism: visibility control, overriding, abstract

UNIT-IV
class & methods, sealed classes & methods, interfaces. Advanced
features of C#: Exception handling & error handling, automatic memory 25
management, Input and output (Directories, Files, and streams).
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.
Note: Latest and additional good books may be suggested and added from time to time

BCA-310 : PRACTICAL- SOFTWARE LAB

– Based on paper
BCA-307 and BCA-309