REGULATIONS

&
SYLLABUS

BACHELOR IN COMPUTER APPLICATION

(DISTANCE MODE)

DIRECTORATE OF DISTANCE & CONTINUING

EDUCATION
FAKIR MOHAN UNIVERSITY
VYASA VIHAR, BALASORE – 756019

Phone: 06782-241840
Web: www. fmuddce.org
 BCA COURSE STRUCTURE

SEMESTER I

MARKS
PAPER
PAPER NAME By Internal CREDIT
NO.
University Assessment
BCA-101 Foundation Course in English for Computing 80 20 04
BCA-102 Foundation Course in Humanities and Social 80 20 04
Sciences
BCA-103 Fundamentals of Information and 80 20 04
Communication Technology
BCA-104 Problem Solving and Programming through C 80 20 04
Non -
MTE-03 Mathematical Methods-03 100
Credit
BCAL-105 Computer Fundamental Lab 100 04
BCAL-106 C Programming Lab 100 04
TOTAL 600 24

* A candidate who has not studied Mathematics as a distinct subject at 10+2 level or its
equivalent level need to register for MTE-03 along with first semester of BCA and
successfully complete within the programme of BCA. No assignments/ internal exam need to
be submitted for MTE-03. Also no counseling sessions are offered for MTE-03 by
University. Students need to appear only in Term End Theory Examination for MTE-03.

SEMESTER II

MARKS
PAPER
PAPER NAME By Internal CREDIT
NO.
University Assessment
BCA-201 Digital Logic 80 20 04
BCA-202 Foundation Course in Mathematics in Computing 80 20 04
BCA-203 Object Oriented Programming using C++ 80 20 04
BCA-204 Data Structures 80 20 04
BCAL-205 Object Oriented Programming using C++ LAB 100 04
BCAL-206 Data Structures LAB 100 04
TOTAL 600 24
 SEMESTER III

MARKS
PAPER
PAPER NAME By Internal CREDIT
NO.
University Assessment
BCA-301 Foundation Course in Science and Technology 80 20 04
BCA-302 Computer Organization 80 20 04
BCA-303 Operating Systems 80 20 04
BCA-304 Computer Oriented Numerical Techniques 80 20 04
BCAL-305 Operating Systems LAB 100 04
BCAL-306 Computer Oriented Numerical Techniques LAB 100 04
TOTAL 600 24

SEMESTER IV

MARKS
PAPER NO. PAPER NAME By Internal CREDIT
University Assessment
BCA-401 JAVA Programming 80 20 04
BCA-402 Database Systems 80 20 04
BCA-403 Computer Networks 80 20 04
BCA-404 Web Technology 80 20 04
BCAL-405 JAVA Programming LAB 100 04
BCAL-406 Database Systems LAB 100 04
TOTAL 600 24

SEMESTER V

PAPER NO. PAPER NAME MARKS CREDIT

By Internal
University Assessment
BCA-501 Software Engineering 80 20 04
BCA-502 Data Mining 80 20 04
BCA-503 Discrete Mathematical Structure 80 20 04
BCA-504 Computer Graphics 80 20 04
BCAL-505 Computer Graphics LAB 100 04
BCAL-506 Data Mining LAB 100 04
TOTAL 600 24
 SEMESTER VI

PAPER
PAPER NAME MARKS CREDIT
NO.
BCAP-601 Thesis / Project Report & Viva-voce 200 08
BCAP-602 Seminar/Grand Viva 100 04
TOTAL 300 12

.
1st Semester
BCA
Syllabus

=================================================
BCA-101 Foundation Course in English for Computing
BCA-102 Foundation Course in Humanities and Social Sciences
BCA-103 Fundamentals of Information and Communication Technology
BCA-104 Problem Solving and Programming through C
MTE-03 Mathematical Methods-03
BCAL-105 Computer Fundamental Lab
BCAL-106 C Programming Lab
=================================================
BCA-101 Foundation Course in English for Computing

(Reading, Writing, Listening, Speaking Skills)

Unit -1
Reading Comprehension
Passage for Reading; Animal Farm by George Orwell; A page from the Book of Memory by
Indira Gandhi; A World of Four Sense by Ved Mehta; Science and Human Life by Bertrand
Russell; The Voice of India by Jawahar Lal Nehru. (Note on the Author; Glossary,
Comprehension Questions, Vocabulary, Words Having Related Meanings, Multiple
Meanings, Word-Formation, Grammar and Usage) Concord of Number and Person, Tenses,
Conversation, Pronunciation,
Unit- 2
Functional Grammar and Pronunciation
Parts of Speech, Tenses and Concord, Conditionals, Phrasal/Modal Verbs, Voice Change,
Reported Speech, Preposition, Articles and Tag Questions, Gerunds and Participles.
Pronunciation, English Consonants, Vowels, Letters and Sounds, Word Stress, Distribution
of /r/, /r/ /w/ /s/ /z/, and Rhythm Pronunciation, Tone Groups, The nucleus, Tones,
Comparison and Contrast.
Unit- 3
Effective Writing Skills
Note-Taking: How to Read, Specimen Notes, Reduction Devices, Passage for Note-taking,
Headings and Subordinate Points, Two Types of Subordinates Points, Organization of Notes
into Tables, A passage giving information in the form of figures, A passage giving a
Contrastive Description, Organization of Notes into Diagrams, Flow-charts, Tree Diagrams.
Techniques of Summarizing: The Technique of Summarizing, Some More Techniques of
Summarizing, Writing a Summary from a particular point of view.
Visual Aids: The Function of Visual Aids, Using Visual Aids, Tables, Charts and Graphs,
Line Graphs, Bar Charts, Flow Charts.
Unit-4
Reading Skill
Composition & Study Skills: Development Of Paragraphs: The Topic Sentence, Illustration,
Cause and Effect, Definition, Comparison and Contrast. Topic Sentence, Writing your Topic,
Gathering and Ordering Your Data, Construct Your Outline, Writing the First Draft, the
Beginning, The Body, and The Ending.
Listening and Soft Skills
English For Computers: Reading Comprehensions Passage and Answering Questions,
Writing Conversations/ Dialogues, Skit writing, Developing story/Plot, Role Play, Soft
Skills/Interactive Skills, Listening Skills (Active/Passive Listening), Presentation Skill,
Power-point Presentation Technique (PPT)
BCA-102 Foundation Course in Humanities and Social Sciences

UNIT 1

HUMAN BEINGS AND SOCIAL DEVELOPMENT: AN APPROACH

Scientific Approach to the Study of Human Beings: Human Being at the Centre of Social
Processes, Social Science as Reflective Critique, Human Being as a Creative Agent, Science
as Empathic and Critical Reflection, Social Science Procedure, Understanding Human Beings
in their Social Setting, Science as Critique of Human Conditions, Racial Differentiation and
the Unity of Human Beings, Social Roots and Forms of Prejudice, Prejudice in Science,
Region Prejudice Knowledge and Society,
Evolution of Humankind : Tool Making/Using-An Evolutionary Perspective, the Old Stone
Age, the New Stone Age, The Bronze Age, The iron Age, Tool Making /Using and March of
Culture, Social institutions and interactions, Specialization and Division of Labour, Urban
Revolution, Rise of Great Religions, Nature and Human Beings: Adaptationand interaction,
Patterns of Adaptation, Tribes and their Patterns of Adaptation, Interaction: Dependence,
Conquest and Harmony, Evolution of Human Being as a Thinking Animal, Unique
Capabilities of Thinking Human Beings, Specific Characteristics,
Social Change and Evolution:Concepts of Change: Evolution, Development and Growth,
Social Change, Development,Development and the New World Order , Differentiation in
Social Forms, Simple to Complex Society, Regional Cultures: Technological Advance and
Social Differentiation , Emergence of Class Divisions, Process of Human Settlement.

UNIT-2

STAGES OF AN EVOLUTION

Domestication of Animals and Origins of Agriculture:Man as Hunter/Gatherer,

Archaeological Evidence for Domestication, the First Farmers of Western Asia, The
Development of Farming and Herding in India, The Consequences of Agriculture and
Herding,
The River-Valley Civilizations: Factors for the Growth of Early Civilizations, Three
Distinct River-Valley Landscapes,City Dwellers of Lower Mesopotamia, The Harappan
Cities' Civilization.

UNIT-3

Feudal Societies:
Slavery: Slavery in the Indian Context, Slavery, Serfdom and the Peasant Societies,Transition
to Feudalism, Henry Pirenne's views on Feudalism, Thesis of Marc Bloch, Perry Anderson on
Feudalism, Growth of Feudal System, Form or Labour under Feudalism, Feudal Production
System.
Renaissance and Reformation: Social and Economic Background, Renaissance, Humanism,
Secularism, Renaissance Literature, Art and Architecture, Philosophy, Beginning of the
Scientific Revolution, Political Theory, Reformation, Doctrinal Debates in the Church, The
Protestant Revolution, Industrial Revolution, Merchant Capitalism, Emergence of wage
Labour, Putting-Out system, The Enclosure Movement,Market and Commodity Production in
Agriculture, Agricultural Revolution, Capitalist Relations in Agriculture, Factory and
Machine, The New Technology, Factory system, Labour and Legislation.

UNIT-4

EMERGENCE OF INDEPENDENT INDIA

Characteristics of Indian Economy: Pre-Colonial and Colonial: Characteristics of Pre-
colonial Economy, Agriculture, Trade, Handicraft Industries, Aspects of Colonial Rule
Evolution of Colonial Rule, and Impact of the Colonial Rule: Western View-point, Impact of
the Colonial Rule: Indian View-point, The Drain theory, De- industrialization, Phases of the
Colonial Rule, Agriculture under the Colonial Rule, The New Land Settlement,
Commercialization of Agriculture,Impact on Agriculture, Role of the Colonial State.
Indian National Movement-1: 1857: The First War of Independence, Causes, Extent and
intensity, Defeat, Early Phase of Nationalism ,Role of the Intellectuals , Role of Colonial
state , Emergence of the Indian.
Indian National Movement-2: The Emergence of Gandhi, Official Response, Non
Cooperation and Khilafat, Aftermath, Civil Disobedience Movement, The Revolutionary
Movement, The Socio-Economic Content of Swaraj, Emergence of Communist and Socialist
Groups, Role of Nehru, Impact on Congress, Peasants, Working Class and State People's
Movements, Peasant Movements, Working Class Struggles,
Values of the Indian National Movement: Secularism, What is Secularism?, Practice of
Secularism, Gandhi and Nehru, Socialism and Planned ,Economic Development, Democracy
and Civil Liberties, Nature of the Colonial state, Nationalist struggle for Democratic Rights,
Humanism, Sources of Humanism, Struggle for Humanism.

BCA-103 Fundamentals of Information and Communication Technology

Unit I

Data, Information, and Computer Organization: – Introduction, Types of Data, A Simple

Model of a Computer, Data Processing Using a Computer.
Data Storage: Introduction, Memory organization, Physical Devices used as Memory Cells,
Random access Memory, Read only Memory, Secondary Memory, Compact Disk Read only
Memory (CDROM), Flash Memory.
Central Processing Unit: Introduction, The Structure of a Central Processing Unit,
Interconnection of CPU with Memory and I/O Units.

Unit II

Data Organization and Software:

Data Organization: Introduction, Organizing a Database, Structure of a Database, Database
Management System, Example of Database Design, Non-text Databases, Archiving
Databases.
Processing Numerical and Text Data: Introduction, Use of Spreadsheets, Numerical
Computation Examples, Microsoft Word, Notepad, Learning Power point Presentation.
Software: Introduction, Operating System, Flowcharts, Algorithms, Programming Languages,
Classification of Programming Languages.
Unit III:

Internet Technology:
Computer Networks: Introduction, Local Area Network (LAN), Applications of LAN, Wide
Area Network (WAN), Internet, Naming Computers Connected to Internet, The Future of
Internet Technology.
Some Internet Applications: Introduction, E-mail, Information Browsing Service, The World
Wide Web, Information Retrieval from the World Wide Web, Other Facilities Provided by
Browsers, Audio on the Internet, Pictures, Animation and Video via Internet
Unit IV:

Societal Impacts and Ethics of Information Technology: Introduction, Privacy, Security, and
Integrity of Information, Disaster Recovery, Intellectual Property Rights, Careers in
Information Technology and other relevant applications in business, science, Judicial System,
Health Care System, and engineering.
Text Books:
1. V. Rajaraman, Introduction to Information Technology, Prentice Hall of India, New Delhi.
2. P. K. Sinha and P. Sinha, Computer Fundamentals, BPB Publication.
Reference Books:
1. V. Rajaraman, Fundamentals of computers, Prentice Hall of India, New Delhi.
2. M. M. Mano, Computer System Architecture, Prentice Hall of India, New Delhi, 1995
3. Efraime Turban, R. Kelly Rainer, and Richard E. Potter, Introduction to Information
Technology, Wiley.
4. Raj Kamal, Internet and Web Technology, Tata McGraw Hill Education.
5. J. P. Glaser and CloudiaSalzberg, The Strategic Application of Information Technology in
Health Care Organization, Jossey- Bass.
6. R. Elmasri and S. B. Navathe, Fundamentals of Database System, Addison Wisley.

BCA-104 Problem Solving and Programming through C

Unit-1

Introduction: Introduction to Programming Language, Introduction to C Programming,

Keywords & Identifiers, Constants, Variables, Input and Output Operations, Compilation
and pre-processing, Data types: Different data types, Data types qualifier, modifiers,
Memory representation, size and range, Operators: Operators (Arithmetic, Relational,
Logical, Bitwise, Assignment & compound assignment, Increment & Decrement,
Conditional), Operator types (unary, binary, ternary). Expressions, Order of expression
(Precedence and associativity)
Control structures: Decision Making and Branching (Simple IF Statement, IF…ELSE
Statement, Nesting IF… ELSE Statement, ELSE IF Ladder), Selection control structure
(Switch Statement).
Unit-2

Loops: The WHILE Statement, The DO…WHILE Statement, The FOR Statement, Jumps
in Loops, Array: Concept of Array, Array Declaration, types of array (one and multiple
dimension), Character Arrays and Strings, Subscript and pointer representation of array,
Array of Pointers, Limitation of array, Pointers: Concept of Pointer (null pointer, wild
pointer, dangling pointer, generic pointer), Pointer Expressions, Accessing the Address of a
Variable, Declaring Pointer Variables, Initializations of Pointer Variable, Accessing a
Variable through its Pointer, Pointer arithmetic.

Unit-3

Storage class: Types (auto, register, static, extern), scope rules, declaration and definition.
Function: Function & types (User defined function, library function) Function Definition,
Declaration, Function Calls, Header file and library, Function Arguments, string handling
function (strlen, strcmp, strcpy, strncpy, strcat, strstr), Function recursion, Functions
Returning Pointers, Pointers to Functions, Command line arguments, Application of pointer
(dynamic memory allocation).

Unit-4

Structure and Union: Defining, Declaring, Accessing, Initialization Structure, nested

structure, self-referential structure, bit-field, Arrays of Structures, Structures and
Functions, Unions, difference between structure and union, active data member, structure
within union, Self-referential Structure.
File: File Management in C, Defining and Opening a File, File opening modes
(read, write, append), Closing a File, File operations, file and stream, Error
Handling During I/O Operations, sequential and random access file, low level
and high level file.

Text Books:
1. E. Balagurusamy, “Programming in ANSI C”, 4/e, (TMH)

Reference Books:
1. B. Kernighan & Dennis Ritchie, “The C Programming Language”, 2/e PHI
2. Paul Deitel, Harvey Deitel, “C: How to Program”, 8/e, Prentice Hall.
3. P.C. Sethi, P.K. Behera, “Programming using C”, Kalyani Publisher, Ludhiana
MTE-03 Mathematical Methods-03 (Ancillary Paper-FOR Non Math
Students)

UNIT-1

ALGEBRA AND GEOMETRY

Sets and Functions

Graphs and functions
Elementary Algebra
Coordinate Geometry
Vectors

UNIT-2

CALCULUS

Differential Calculus
Applications of Differential Calculus
The Integral
Integration of Elementary Functions
Differential Equations

UNIT-3

PROBABILITY DISTRIBUTIONS

Statistics
Probability

UNIT-4

DISCRETE DISTRIBUTIONS

Discrete Probability Distributions

Continuous Probability Distributions

UNIT-5

STATISTICAL INFERENCE

Statistical Data Sampling, Hypothesis Tests.

Correlation and Regression.
BCAL-105 Computer Fundamental Lab

 Introduction to OS: DOS, Windows, and Linux/Unix- vi editor basics, common

commands, Shell Programming.
 Recognition of various components of Personal Computer (PC), dismantling and
assembling a PC.
 MS-Office packages

 MS- Word
 MS- Excel
 MS- Powerpoint

BCAL-106 C Programming Lab

1. Write a Program to find greatest among three numbers.
2. Write a Program to all arithmetic operation using switch case.
3. Write a Program to print the sum and product of digits of an integer.
4. Write a Program to reverse a number.
5. Write a Program to compute the sum of the first n terms of the
following series S = 1+1/2+1/3+1/4+……
6. Write a Program to compute the sum of the first n terms of the
following series S =1-2+3-4+5…………….
7. Write a function that checks whether a given string is Palindrome or not. Use
this function to find whether the string entered by user is Palindrome or not.
8. Write a function to find whether a given no. is prime or not. Use the same to
generate the prime numbers less than 100.
9. Write a Program to compute the factors of a given number.
10. Write a program to swap two numbers using macro.
11. Write a Program to print a triangle of stars as follows (take number of lines from user):
*
***
*****
*******
12. Write a Program to perform following actions on an array entered by the user:
a) Print the even-valued elements.
b) Print the odd-valued elements.
c) Calculate and print the sum and average of the elements of array.
d) Print the maximum and minimum element of array.
e) Remove the duplicates from the array.
f) Print the array in reverse order.
The program should present a menu to the user and ask for one of the
options. The menu should also include options to re-enter array and to quit
the program.
13. Write a Program that prints a table indicating the number of occurrences of
each alphabet in the text entered as command line arguments.
14. Write a program that swaps two numbers using pointers.
 2nd Semester
BCA
Syllabus

=================================================
BCA-201 Digital Logic
BCA-202 Foundation Course in Mathematics in Computing
BCA-203 Object Oriented Programming using C++
BCA-204 Data Structures
BCAL-205 Object Oriented Programming using C++ LAB
BCAL-206 Data Structures LAB
=================================================
BCA-201 Digital Logic
Unit-1

Character Codes, Decimal System, Binary System, Decimal to Binary Conversion,

Hexadecimal Notation, Boolean Algebra, Basic Logic Functions: Electronic Logic Gates,
Synthesis of Logic Functions, Minimization of Logic Expressions, Minimization using
Karnaugh Maps, Synthesis with NAND and NOR Gates, Tri-State Buffers.

Unit-2

Arithmetic: Addition and Subtraction of Signed Numbers, Addition/ Subtraction Logic Unit,
Design of Fast Adders: Carry-Lookahead Addition, Multiplication of Positive Numbers,
Signed-Operand Multiplication: Booth Algorithm, Fast Multiplication: Bit-Pair Recoding
Multipliers, Carry-Save Addition of Summands, Integer Division, Floating-Point Numbers
and Operations: IEEE Standard for Floating-Point Numbers, Arithmetic Operations on
Floating-Point Numbers, Guard Bits and Truncation, Implementing Floating Point
Operations.

Unit-3

Flip-Flops, Gated Latches, Master-Slave Flip-Flops, Edge-Triggering, T Flip-Flops, JK Flip-

Flops. Registers and Shift Registers, Counters, Decoders, Multiplexers, Programmable Logic
Devices (PLDs), Programmable Array Logic (PAL), Complex Programmable Logic Devices
(CPLDs), Field-Programmable Gate Array (FPGA), Sequential Circuits, UP/ DOWN
Counters, Timing Diagrams, The Finite State Machine Model, Synthesis of Finite State
Machines.

Unit-4

Memory System: Semiconductor RAM Memories, Internal Organization of Memory Chips,

Static Memories, Asynchronous DRAMS, Synchronous DRAMS, Structure of Large
Memories, Memory System Considerations, RAMBUS Memory. Read-Only Memories:
ROM, PROM, EPROM, EEPROM, Flash Memory, Speed, Size, and Cost of Memory.
Secondary Storage: Magnetic Hard Disks, Optical Disks, Magnetic Tape Systems.

Text Books:

1. Carl Hamacher, Z. Vranesic, S. Zaky: Computer Organization, 5/e (TMH)

Reference Books:

1. M. Morris Mano: Digital Logic and Computer Design, Pearson

BCA-202 Foundation Course in Mathematics in Computing

UNIT-1

Elements of Differential Calculus:

Real Numbers and Functions, Limits and Continuity, Differentiation, Derivatives of
Trigonometric,Derivatives of Some Standard Functions.

UNIT-2

Integral Calculus
Definite Integral, Methods of Integration, Reduction Formulas, Integration of Rational and
Irrational Functions

UNIT-3

Application of Calculus: Applications of Differential Calculus, Area under a Curve, Further

Application of Integral Calculus
UNIT-4

Solutions of Polynomial Equations: Sets, Complex Numbers, System of Linear Equations,

Cramer’s Rule, Inequalities Preliminaries in Plane Geometry, The Standard Conics,
Preliminaries in Three-Dimensional, the Sphere.

BCA-203 Object Oriented Programming using C++

Unit-1

Principles of Object-Oriented Programming: Object-Oriented Programming (OOP)

Paradigm, Basic Concepts of OOP, Benefits of OOP, Characteristics of OOPS, Object
Oriented Languages, Applications of OOP.
Introduction to C++, Difference between C & C++, Tokens, Data types, Operators, Structure
of C++ Program, C++ statements, Expressions and Control Structures.
Functions in C++: Argument passing in function, Inline Functions, Default Arguments,
Const. Arguments, Friend function.

Unit-2

Classes and Objects: Defining Member Functions, Making an outside Function Inline,
Nested Member Functions, Private Member Functions, Arrays within a Class, Memory
Allocation for Objects, Static Data Members, Static Member Functions, Arrays of Objects,
Objects as Function Arguments, Friend Functions.
Constructors & Destructors: Constructors, Parameterized Constructors, Constructors with
Default Arguments, Dynamic Initialization of Objects, Copy Constructor, Dynamic
Constructors, Destructors.

Unit-3

Inheritance: Basics of Inheritance, Type of Inheritance, Virtual Base Classes, Abstract

Classes, Member Classes, Nesting of Classes. Polymorphism: Pointers, Pointers to Objects,
this Pointer, Pointers to Derived Classes, Virtual Functions, Pure Virtual Functions, Function
Overloading, Operator Overloading.

Unit-4

Managing Console I/O Operations: C++ Streams, C++ Stream Classes, Unformatted
I/O Operations, Formatted Console I/O Operations, Managing Output with Manipulators.

Files: Classes for File Stream Operations, Opening and Closing a File, Detecting end- of-file,
File Modes, File Pointers and their Manipulations, Sequential Input and Output Operations,
Updating a File: Random Access, Error Handling during File Operations, Command-line
Arguments.
Text Books
1. E. Balgurusawmy, Object Oriented Programming with C++, 4/e (TMH).
2. Paul Deitel, Harvey Deitel, "C++: How to Program", 9/e. Prentice Hall.

Reference Books:
1. Bjarne Stroustroup, Programming - Principles and Practice using C++, 2/e,
Addison- Wesley 2014
2. Herbtz Schildt, C++: The Complete reference, MGH, 4/ed.
3. P. C. Sethi, P. K. Behera, “Programming in C++”- Kalyani Publisher, Ludhiana

BCA-204 Data Structures

Unit-1

Introduction: Basic Terminology, Data structure, Time and space complexity, Review of
Array, Structures, Pointers.
Linked Lists: Dynamic memory allocation, representation, Linked list insertion and deletion,
Searching, Traversing in a list, Doubly linked list, Sparse matrices.

Unit-2

Stack: Definition, Representation, Stack operations, Applications (Infix–Prefix–Postfix

Conversion & Evaluation, Recursion).
Queues: Definition, Representation, Types of queue, Queue operations, Applications.

Unit-3

Trees: Tree Terminologies, General Tree, Binary Tree, Representations, Traversing, BST,
Operations on BST, Heap tree, AVL Search Trees, M-way search tree, Applications of all
trees.

Unit-4

Sorting: Exchange sorts, Selection Sort, Bubble sort, Insertion Sorts, Merge Sort, Quick Sort,
Radix Sort, Heap sort.
Searching: Linear search, Binary search.

Text book:
1. Classic Data Structure, P. Samanta , PHI , 2/ed.
Reference Books:

1. Ellis Horowitz, Sartaj Sahni, “Fundamentals of Data Structures”, Galgotia

Publications, 2000.
2. Sastry C.V., Nayak R, Ch. Rajaramesh, Data Structure & Algorithms, I. K.
International Publishing House Pvt. Ltd, New Delhi.

BCAL-205 Object Oriented Programming using C++ LAB

1. Write a Program to find greatest among three numbers using nested
if…else statement.
2. Write a Program to check a number is prime or not.
3. Write a Program to find the GCD and LCM of two numbers.
4. Write a program to print the result for following series: 1! + 2! + 3! + …………
5. Write a program to print multiplication table from 1 to 10.
6. Write a Program for Swapping of two numbers using pass by value.
7. Write a Program for Swapping of two numbers using pass by address.
8. Write a Program for Swapping of two numbers using pass by reference.
9. Write a Program to find sum of four numbers using default argument passing.
10. Write a Program to find square and cube of a number using inline function.
11. Write a Program to find the factorial of a number.
12. Write a Program to find reverse of a number.
13. Write a program to find sum of four numbers using default argument
passing in member function.
14. Write a Program to find area of circle, triangle and rectangle using
function overloading.
15. Write a program to distinguish the properties of static and non-static ata members.
16. Write a program to show the method of accessing static private member function.
17. Write a program to show the ways of calling constructors and destructors.
18. Write a program to perform ++ operator overloading using member function.
19. Write a program to perform ++ operator overloading using friend function.
20. Write a program to perform + operator overloading for two complex number
addition.
21. Write a program to perform + operator overloading for string concatenation.
22. Write a program to perform single inheritance.
23. Write a program to perform multiple inheritance.
24. Write a program to create an integer array using new operator and find
the sum and average of array elements.
25. Write a program to implement virtual destructor.
26. Create the Person class. Create some objects of this class (by taking
information from the user). Inherit the class Person to create two classes
Teacher and Student class. Maintain the respective information in the
classes and create, display and delete objects of these two classes (Use
Runtime Polymorphism).
27. Write a program to Copy the contents of one file to other.
BCAL-206 Data Structures LAB

Write a C/ C++ Program for the followings.

1. To insert and delete elements from appropriate position in an array.

2. To search an element and print the total time of occurrence in the array.
3. To delete all occurrence of an element in an array.
4. Array implementation of Stack.
5. Array implementation of Linear Queue.
6. Array implementation of Circular Queue.
7. To implement linear linked list and perform different operation such as
node insert and delete, search of an item, reverse the list.
8. To implement circular linked list and perform different operation such as
node insert and delete.
9. To implement double linked list and perform different operation such as
node insert and delete.
10. Linked list implementation of Stack.
11. Linked list implementation of Queue.
12. Polynomial representation using linked list.
13. To implement a Binary Search Tree.
14. To represent a Sparse Matrix.
15. To perform binary search operation.
16. To perform Bubble sort.
17. To perform Selection sort.
18. To perform Insertion sort.
19. To perform Quick sort.
20. To perform Merge sort.
 3rd Semester
BCA
Syllabus

=================================================
BCA-301 Foundation Course in Science and Technology
BCA-302 Computer Organization
BCA-303 Operating Systems
BCA-304 Computer Oriented Numerical Techniques
BCAL-305 Operating Systems LAB
BCAL-306 Computer Oriented Numerical Techniques LAB
=================================================

BCA-301 Foundation Course in Science and Technology

UNIT –I

HISTORY OF SCIENCE
SCIENCE AS A HUMAN ENDEAVOUR- Linking past with Present, some aspect of
science. Science in the ancient world- Primitive Human Society, Agriculture and Civilization.
IRON AGE- Science in Iron Age India, Science in Iron Age Greece, Atomic Theory in
Antiquity, and Decline of European Science.
THE GOLDEN AGE OF SCIENCE IN INDIA- Second Urban Civilization in India, The
Gupta Period, Age of Conflict.

UNIT-II

EMERGENCE OF MODERN SCIENCE

Science in the Medieval Times-The Arab Renaissance, Science and Technology in Medieval
India. Impediments to the growth of Science in India
RENAISSANCE, THE INDUSTRIAL REVOLUTION AND AFTER- Science and
Technology in Medieval Europe, The renaissance (1440-1540), Science in the Post
Renaissance Period (1540-1760), The Industrial Revolution (1760-1830) and after.
SCIENCE IN COLONIAL AND MODERN INDIA-Science in Colonial India, Science in
Post- Independence India, What we have Learnt.
THE METHOD OF SCIENCE AND THE NATURE OF SCIENTFIC KNOWLEDGE-
Science- its Many Facets, The Method of Science, The nature of Scientific Knowledge,
Scientific approach to Problem Solving, A Reflection about Science.
UNIT-III

UNIVERSE AS A SYSTEM Historical Perspective, the Physical Universe.

EXPLORING THE UNIVERSE Probing the Universe, Understanding the Universe.
THE SOLAR SYSTEM : The Solar System: A General Survey, the Sun, a Model Star, the
Planet, Asteroids and Comets. The Earth-The Most familiar Planet, Some Myths and
Misconceptions.
ORIGIN AND EVOLUTION OF LIFE Origin of Life on the Earth, Biological Evolution,
Systems View of Life, Extra-terrestrial Life.
EVOLUTION OF MAN Theories of Evolution Evidences of Evolution.

UNIT-IV

ENVIRONMENT AND RESOUCES

ECOSYSTEM Ecology and Environment, Ecosystem, Cycling of Materials in the
Ecosystem, Interaction in the Earth Ecosystem.
COMPONENTS OF ENVIRONMENT The Oceans, the Atmosphere, the Forests
THE CHANGING ENVIRONMENT Pollution, Impact of technology on Environment,
Impact of Population increase on Environment.
NATURAL RESOUCES Natural resources, Energy: A non-Conventional Renewable e
Resources. Exploration of Resources.
RESOURCE UTILISATION, PLANNING AND MANAGEMENT. Use of Natural
Resources, Recycling of Used Resources and Waste, Resource Planning and Management,
conservation of mineral Resources.

BCA-302 Computer Organization

Unit-1

Basic Structure of Computers: Computer Types, Functional Units, Input Unit, Memory Unit,
Arithmetic and Logic Unit, Output Unit, Control Unit, Basic Operational Concepts, Bus
Structures, Software. Machine Instructions and Programs: Numbers, Arithmetic Operations,
and Characters: Number Representation, Addition of Positive Numbers, Addition and
Subtraction of Signed Numbers, Overflow of Integer Arithmetic, Floating-Point Numbers &
Operations, Characters, Memory Locations and Addresses, Byte Addressability, Word
Alignment, Accessing Numbers, Characters, and Character Strings, Memory Operations,
Instructions and Instruction Sequencing, Register Transfer Notation, Basic Instruction Types,
Instruction Execution and Straight-Line Sequencing, Branching, Condition Codes,
Generating Memory Addresses, Addressing Modes, Implementation of Variables and
Constants, Indirection and Pointers, Indexing and Arrays, Relative Addressing.

Unit-2

Basic Processing Unit: Register Transfers, Performance on Arithmetic or Logic Operation,

fetching a Word from Memory, Storing a Word in Memory. Execution of a Complete
Instruction, Branch Instruction, Multiple Bus Organization Hardwired Control, A Complete
Processor. Microprogrammed Control: Microinstructions, Microprogram Sequencing, Wide-
Branch Addressing, Microinstructions with Next-Address Field, Prefetching
Microinstructions, Emulation. Cache Memories: Mapping Functions, Replacement
Algorithms, Example of Mapping Technique. Performance Considerations: Interleaving, Hit
Rate and Miss Penalty, Caches on Processor Chip, Other Enhancements, Virtual Memories:
Address Translation.

Unit-3

Input/ Output Organization: Accessing I/O Devices, Interrupts, Interrupt Hardware, Enabling
& Disabling Interrupts, Handling Multiple Devices, Controlling Device Requests,
Exceptions. Direct Memory Access, Bus Arbitration, Buses, Synchronous Bus,
Asynchronous Bus, Interface Circuits: Parallel Port, Serial Port, Standard I/O Interfaces,
Peripheral Component Interconnect (PCI) Bus, SCSI Bus, Universal Serial Bus (USB)

Unit-4

Pipelining: Role of Cache Memory, Pipeline Performance, Data Hazards: Operand

Forwarding, Handling Data Hazards in Software, Side Effects. Instruction Hazards:
Unconditional Branches, Conditional Branches and Branch Prediction. Influence on
Instruction Sets: Addressing Modes, Condition Codes, Data path and Control Considerations.
Superscalar Operation: Out-of-Order Execution, Execution Completion, Dispatch Operation,
RISC & CISC Processors.

Text Books:
1. Carl Hamacher, Z. Vranesic, S. Zaky: Computer Organization, 5/Ed (TMH)

Reference Books:
1. William Stallings: Computer Organization and Architecture (Design for
Performance), 9/Ed
2. S. Brown, & Z. Vranesic, “Fundamentals of Digital Logic Design with VHDL”, 2/Ed,
McGraw-Hill

BCA-303 Operating Systems

Unit–1

Introduction to Operating System, System Structures: Operating system

services, system calls, system programs, Operating system design and
implementation, Operating system structure.

Unit–2

Process Management: Process Concept, Operations on processes, Process

scheduling and algorithms, Inter-process Communication, Concepts on Thread
and Process, Deadlocks: Deadlock detection, deadlock prevention, and deadlock
avoidance fundamentals.
 Unit-3

Memory Management Strategies: Swapping, Contiguous Memory Allocation,

Paging, Segmentation, Virtual Memory Management: Concepts,
implementation (Demand Paging), Page Replacement, Thrashing.
Unit–4

Storage Management: File System concept, Access Methods, File System

Mounting, File Sharing and File Protection, Implementing File Systems, Kernel
I/O Systems.

Text book:
1. Operating System Concepts, Abraham Silberschatz, Peter B. Galvin, and Greg
Gagne, Eighth Edition, Wiley Student Edition 2009.
Reference books:
1. Modern Operating System, Tanenbaum, Pearson, 4/Ed. 2014
2. Richard F Ashley, Linux with Operating System Concepts, Chapman and
Hall/CRC Published August 26, 2014
3. Richard Blum, Linux Command Line and Shell Scripting Bible, O’ Reilly

BCA-304 Computer Oriented Numerical Techniques

Unit-1

Floating point representation and computer arithmetic, Significant digits, Errors: Round-off
error, Local truncation error, Global truncation error, Order of a method, Convergence and
terminal conditions, Efficient computations.

Unit-2

Bisection method, Secant method, Regula−Falsi method Newton−Raphson method,

Newton’s method for solving nonlinear systems.

Unit-3

Interpolation: Lagrange’s form and Newton’s form Finite difference operators, Gregory
Newton forward and backward differences Interpolation Piecewise polynomial interpolation:
Linear interpolation.

Unit-4

Numerical integration: Trapezoid rule, Simpson’s rule (only method), Newton−Cotes

formulas, Gaussian quadrature, Ordinary differential equation: Euler’s method Modified
Euler’s methods, Runge- Kutta second methods.
 Text books:
1. S.S. Sastry, “Introductory Methods of Numerical Analysis”, EEE , 5/ed.
2. M.K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific and
Engineering Computation, New Age International Publisher, 6/e (2012).

Reference books:
1. Numerical Analysis: J. K. Mantri & S. Prahan, Laxmi Publication.
2. Introduction to Numerical Analysis, Josef Stoer and Roland Bulirsch, Springer.

BCAL-305 Operating Systems LAB

1. Write a program (using fork( ) and/or exec( ) commands) where parent and child execute:
a) Same program, same code.
b) Same program, different code.
c) before terminating, the parent waits for the child to finish its task.
2. Write a program to report behavior of Linux kernel including kernel version, CPU type
and model. (CPU information)
3. Write a program to report behavior of Linux kernel including information on configured
memory, amount of free and used memory. (memory information)
4. Write a program to print file details including owner access permissions, file access
time, where file name is given as argument.
5. Write a program to copy files using system calls.
6. Write a program using C to implement FCFS scheduling algorithm.
7. Write a program using C to implement Round Robin scheduling algorithm.
8. Write a program using C to implement SJF scheduling algorithm.
9. Write a program using C to implement non-preemptive priority based scheduling
algorithm.
10. Write a program using C to implement preemptive priority based scheduling algorithm.
11. Write a program using C to implement SRTF scheduling algorithm.
12. Write a program using C to implement first-fit, best-fit and worst-fit allocation
strategies.

BCAL-306 Computer Oriented Numerical Techniques LAB

Implement using C/ C++ or MATLAB/ Scilab

1. Find the roots of the equation by bisection method.

2. Find the roots of the equation by secant/ Regula−Falsi method.
3. Find the roots of the equation by Newton‘s method.
4. Find the solution of a system of nonlinear equation using Newton’s method.
5. Find the solution of tri-diagonal system using Gauss Thomas method.
6. Find the solution of system of equations using Jacobi/Gauss-Seidel method.
 7. Find the cubic spline interpolating function.
8. Evaluate the approximate value of finite integrals using Gaussian/Romberg
integration.
9. Solve the boundary value problem using finite difference method.

4th Semester
BCA
Syllabus

=================================================
BCA-401 JAVA Programming
BCA-402 Database Systems
BCA-403 Computer Networks
BCA-404 Web Technology
BCAL-405 JAVA Programming LAB
BCAL-406 Database Systems LAB
=================================================
BCA-401 JAVA Programming

Unit-1

Introduction to Java: Java History, Architecture and Features, Understanding the semantic
and syntax differences between C++ and Java, Compiling and Executing a Java Program,
Variables, Constants, Keywords (super, this, final, abstract, static, extends, implements,
interface) , Data Types, Wrapper class, Operators (Arithmetic, Logical and Bitwise) and
Expressions, Comments, Doing Basic Program Output, Decision Making Constructs
(conditional statements and loops) and Nesting, Java Methods (Defining, Scope, Passing and
Returning Arguments, Type Conversion and Type and Checking, Built-in Java Class
Methods). Input through keyboard using Command line Argument, the Scanner class,
Buffered Reader class.

Unit-2

Object-Oriented Programming Overview: Principles of Object-Oriented

Programming, Defining & Using Classes, Class Variables & Methods, Objects, Object
reference, Objects as parameters, final classes, Garbage Collection.
Constructor- types of constructor, this keyword, super keyword. Method overloading and
Constructor overloading. Aggregation vs Inheritance, Inheritance: extends vs implements,
types of Inheritance, Interface, Up-Casting, Down-Casting, Auto-Boxing, Enumerations,
Polymorphism, Method Overriding and restrictions. Package: Pre-defined packages and
Custom packages.

Unit-3

Arrays: Creating & Using Arrays ( 1D, 2D, 3D and Jagged Array), Array of Object,
Referencing Arrays Dynamically. Strings and I/O: Java Strings: The Java String class,
Creating & Using String Objects, Manipulating Strings, String Immutability& Equality,
Passing Strings To & From Methods, String Buffer Classes and StringBuilder Classes. IO
package: Understanding Streams File class and its methods, Creating, Reading, Writing using
classes: Byte and Character streams, File Output Stream, File Input Stream, File Writer, File
Reader, Input Stream Reader, Print Stream, Print Writer. Compressing and Uncompressing
File.

Unit-4

Exception Handling, Threading, Networking and Database Connectivity: Exception types,

uncaught exceptions, throw, built-in exceptions, Creating your own exceptions; Multi-
threading: The Thread class and Runnable interface, creating single and multiple threads,
Thread prioritization, synchronization and communication, suspending/resuming threads.
Using java.net package, Overview of TCP/IP and Datagram programming. Accessing and
manipulating databases using JDBC.

Text Books:
1. E. Balagurusamy, “Programming with Java”, TMH, 4/Ed,

Reference books:
1. Herbert Schildt, “The Complete Reference to Java”, TMH, 10/Ed.

BCA-402 Database Systems

Unit-1

Introduction to Database and Database Users, Database System Concepts and Architecture:
data Models, schema, and instances, Conceptual Modeling and Database Design: Entity
Relationship (ER) Model: Entity Types, Entity Sets, Attributes, Keys, Relationship Types,
Relationship Sets, Roles and Structural Constraints, Weak Entity Types, ER Naming
Conventions. Enhanced Entity-Relationship (EER) Model.

Unit-2

Database Design Theory and Normalization: Functional Dependencies, Normal Forms based
on Primary Keys, Second and third Normal Forms, Boyce-Codd Normal Form, Multivalued
Dependency and Fourth Normal Form, Join Dependencies and Fifth Normal Form.

Unit-3

Relational data Model and SQL: Relational Model Concepts, Basic SQLs, SQL Data
Definition and Data types, Constraints in SQL, Retrieval Queries in SQL, INSERT,
DELETE, UPDATE Statements in SQL, Relational Algebra and Relational Calculus: Unary
Relational Operations: SELECT and PROJECT, Binary Relation: JOIN and DIVISION.

Unit-4

Introduction to Transaction Processing Concepts and Theory: Introduction to Transaction

Processing, Transaction and System Concepts, Properties of Transactions, Recoverability,
Serializability, Concurrency Control Techniques, Locking techniques for Concurrency
Control, Concurrency Control based on Time-Stamp Ordering.
Text Book:
1. Fundamentals of Database Systems, 6th edition, RamezElmasri, Shamkant B.
Navathe, Pearson Education

Reference Book:
1. An Introduction to Database System, Date C. J. - Pearson Education, New Delhi -
2005

BCA-403 Computer Networks

Unit-1

Introduction to Data Communications and Network Models: Protocols and Standards, Layers
in OSI Models, Analog and Digital Signals, Transmission Modes, Transmission Impairment,
Data Rate Limits, Performance, Digital Transmission, Network Devices & Drivers: Router,
Modem, Repeater, Hub, Switch, Bridge (fundamental concepts only).

Unit-2

Signal Conversion: Digital-to-Digital Conversion, Analog-to-Digital Conversion, Digital-to

analog Conversion, and Analog-to-analog Conversion. Transmission Media: Guided Media,
Unguided Media, Switching Techniques: Packet Switching, Circuit Switching, Datagram
Networks, Virtual-Circuit Networks, and Structure of a Switch.
Unit-3

Error Detection and Correction: Checksum, CRC, Data Link Control: Framing, Flow and
Error Control, Noiseless Channels, Noisy channels, (Stop and Wait ARQ, Sliding Window
Protocol , Go Back N, Selective Repeat) HDLC, Point-to-Point Protocol. Access Control:
TDM, CSMA/CD, and Channelization (FDMA, TDMA, and CDMA).

Unit-4

Network Layer: Logical Addressing, IPv4 Addresses, IPv6 Addresses, Virtual-Circuit

Networks: Frame Relay and ATM, Transport Layer: Process-Process Delivery: UDP, TCP.
Application layers: DNS, SMTP, POP, FTP, HTTP, Basics of WiFi (Fundamental concepts
only), Network Security: Authentication, Basics of Public Key and Private Key, Digital
Signatures and Certificates (Fundamental concepts only).
Text Books:
1. Data Communications and Networking, Fourth Edition by Behrouza A.
Forouzan,TMH.

Reference Books:
1. Computer Networks, A. S. Tanenbaum, 4th edition, Pearson Education.

BCA-404 Web Technology

Unit-1

Web Essentials: Clients, Servers and Communication:

The Internet – Basic Internet protocols – The WWW, HTTP request message – response
message, web clients web servers – case study.

Introduction to HTML: HTML, HTML domains, basic structure of an HTML document –

creating an HTML document, mark up tags, heading, paragraphs, line breaks, HTML tags.
Elements of HTML, working with text, lists, tables and frames, working with hyperlink,
images and multimedia, forms and controls

Unit-2

Introduction to cascading style sheets: Concepts of CSS, creating style sheet, CSS properties,
CSS styling (background, text format, controlling fonts), working with the block elements
and objects. Working who lists and tables, CSS ID and class. Box model (introduction,
border properties, padding properties, margin properties), CSS colour, groping, Dimensions,
display, positioning, floating, align, pseudo class, Navigation bar, image sprites.
Unit-3

Java scripts: Client side scripting, what is java script, simple java script, variables, functions,
conditions, loops and repetitions. Java scripts and objects, java script own objects, the DOM
and web browser environment, forms and validations.
DHTML: Combining HTML, CSS, java scripts, events and buttons, controlling your browser.

Unit-4

PHP: Starting to script on server side, PHP basics, variables, data types, operators,
expressions, constants, decisions and loop making decisions. Strings – creating, accessing
strings, searching, replacing and formatting strings. Arrays: Creation, accessing array,
multidimensional arrays, PHP with Database.

Text Book:
1. Web Technologies – Black Book – DreamTech Press
2. Matt Doyle, Beginning PHP 5.3 (wrox-Willey publishing)
3. John Duckett, Beginning HTML, XHTML, CSS and Java script.

Reference Book:
1. HTML, XHTML and CSS Bible, 5ed, Willey India-Steven M. Schafer

BCAL-405 JAVA Programming LAB

1. To find the sum of any number of integers entered as command line arguments.
2. To find the factorial of a given number.
3. To convert a decimal to binary number.
4. To check if a number is prime or not, by taking the number as input from the keyboard.
5. To find the sum of any number of integers interactively, i.e., entering every number
from the keyboard, whereas the total number of integers is given as a command line
argument.
6. Write a program that show working of different functions of String and String Buffer
classs like set Char At( ), set Length( ), append( ), insert( ), concat( )and equals( ).
7. Write a program to create a – “distance” class with methods where distance is
computed in terms of feet and inches, how to create objects of a class and to see the use
of this pointer.
8. Modify the – “distance” class by creating constructor for assigning values (feet and
inches) to the distance object. Create another object and assign second object as
reference variable to another object reference variable. Further create a third object
which is a clone of the first object.
9. Write a program to show that during function overloading, if no matching argument is
found, then Java will apply automatic type conversions (from lower to higher data
type).
10. Write a program to show the difference between public and private access specifiers.
 The program should also show that primitive data types are passed by value and objects
are passed by reference and to learn use of final keyword.
11. Write a program to show the use of static functions and to pass variable length
arguments in a function.
14. Write a program to demonstrate the concept of boxing and unboxing.
15. Create a multi-file program where in one file a string message is taken as input from the
user and the function to display the message on the screen is given in another file (make
use of Scanner package in this program).
16. Write a program to create a multilevel package and also creates a reusable class to
generate Fibonacci series, where the function to generate Fibonacci series is given in a
different file belonging to the same package.
17. Write a program that creates illustrates different levels of
protection in classes/subclasses belonging to same package or different packages
18. Write a program – “Divide By Zero” that takes two numbers a and b as input, computes
a/b, and invokes Arithmetic Exception to generate a message when the denominator is
zero.
19. Write a program to show the use of nested try statements that emphasizes
the sequence of checking for catch handler statements.
20. Write a program to create your own exception types to handle situation
specific to your application (Hint: Define a subclass of Exception which
itself is a subclass of Throwable).
21. Write a program to demonstrate priorities among multiple threads.
22. Write a program to demonstrate different mouse handling events like
mouse Clicked( ), mouse Entered ( ), mouse Exited ( ), mouse Pressed( ),
mouse Released( ) & mouse Dragged( ).
23. Write a program to demonstrate different keyboard handling events.

BCAL-406 Database Systems LAB

Create and use the following database schema to answer the given
queries.

EMPLOYEE Schema

Field Type NULL KEY DEFAULT

Eno Char(3) NO PRI NIL

Ename Varchar(50) NO NIL
Job_type Varchar(50) NO NIL
Manager Char(3) Yes FK NIL
Hire_date Date NO NIL
Dno Integer YES FK NIL
Commission Decimal(10,2) YES NIL
Salary Decimal(7,2) NO NIL
DEPARTMENT Schema

Field Type NULL KEY DEFAULT

Dno Integer No PRI NULL
Dname Varchar(50) Yes NULL
Location Varchar(50) Yes New Delhi
Query List

1. Query to display Employee Name, Job, Hire Date, Employee Number; for
each employee with the Employee Number appearing first.
2. Query to display unique Jobs from the Employee Table.
3. Query to display the Employee Name concatenated by a Job separated by a comma.
4. Query to display all the data from the Employee Table. Separate each
Column by a comma and name the said column as THE_OUTPUT.
5. Query to display the Employee Name and Salary of all the employees earning more
than
$2850.
6. Query to display Employee Name and Department Number for the Employee No=
7900.
7. Query to display Employee Name and Salary for all employees whose
salary is not in the range of Rs.1500 and Rs.2850.
8. Query to display Employee Name and Department No. of all the employees
in Dept 10 and Dept 30 in the alphabetical order by name.
9. Query to display Name and Hire Date of every Employee who was hired in 1981.
10. Query to display Name and Job of all employees who don’t have a current Manager.
11. Query to display the Name, Salary and Commission for all the employees
who earn commission.
12. Sort the data in descending order of Salary and Commission.
13. Query to display Name of all the employees where the third letter of their name is ‘A’.
14. Query to display Name of all employees either have two ‘R’s or have
two ‘A’s in their name and are either in Dept No = 30 or their Mangers
Employee No = 7788.
15. Query to display Name, Salary and Commission for all employees whose
Commission Amount is 14 greater than their Salary increased by 5%.
16. Query to display the Current Date.
17. Query to display Name, Hire Date and Salary Review Date which is the 1st
Monday after six months of employment.
18. Query to display Name and calculate the number of months between today
and the date each employee was hired.
19. Query to display the following for each employee <E-Name> earns
<Salary> monthly but wants <3*Current Salary>. Label the Column as
Dream Salary.
20. Query to display Name with the 1st letter capitalized and all other letter
 lower case and length of their name of all the employees whose name starts
with ‘J’, ‘A’ and ‘M’.
21. Query to display Name, Hire Date and Day of the week on which the employee started.
22. Query to display Name, Department Name and Department No for all the employees.
23. Query to display Unique Listing of all Jobs that are in Department # 30.
24. Query to display Name, Department Name of all employees who have an
‘A’ in their name.
25. Query to display Name, Job, Department No. and Department Name for all
the employees working at the Dallas location.
26. Query to display Name and Employee no. Along with their Manger’s Name
and the Manager’s employee no; along with the Employees Name who do
not have a Manager.
27. Query to display Name, Department No. And Salary of any employee
whose department No. and salary matches both the department no. And the
salary of any employee who earns a commission.
28. Query to display Name and Salaries represented by asterisks, where each
asterisk (*) signifies $100.
29. Query to display the Highest, Lowest, Sum and Average Salaries of all the employees.
30. Query to display the number of employees performing the same Job type functions.
31. Query to display the no. of managers without listing their names.
32. Query to display the Department Name, Location Name, No. of Employees
and the average salary for all employees in that department.
33. Query to display Name and Hire Date for all employees in the same dept. as Blake.
34. Query to display the Employee No. And Name for all employees who earn
more than the average salary.
35. Query to display Employee Number and Name for all employees who
work in a department with any employee whose name contains a ‘T’.
36. Query to display the names and salaries of all employees who report to King.
37. Query to display the department no, name and job for all employees in the
Sales department.
 5th Semester
BCA
Syllabus

=================================================
BCA-501 Software Engineering
BCA-502 Data Mining
BCA-503 Discrete Mathematical Structure
BCA-504 Computer Graphics
BCAL-505 Computer Graphics LAB
BCAL-506 Data Mining LAB
=================================================

BCA-501 Software Engineering

Unit-1

Introduction: Evolution of Software to an Engineering Discipline, Software Development

Projects, Exploratory Style of Software Development, Emergence of Software Engineering,
Changes in Software Development Practices, Computer Systems Engineering.

Software Lifecycle Models: Waterfall Model and its Extensions, Rapid Application
Development (RAD), Agile Development Models, Spiral Model.

Unit-2

Software Project Management: Software Project Management Complexities, Responsibilities

of a Software Project Manager, Project Planning, Metrics for Project Size Estimation, Project
Estimation Techniques, Empirical Estimation Techniques, COCOMO, Halstead’s Software
Science, Staffing Level Estimation, Scheduling, Organization and Team Structures, Staffing,
Risk Management, Software Configuration Management.

Unit-3

Requirement Analysis and Specification: Requirements Gathering and Analysis, Software

Requirement Specifications, Formal System Specification Axiomatic Specification,
Algebraic Specification, Executable Specification and 4GL. Software Design: Design
Process, Characterize a Good Software Design, Cohesion and Coupling, Layered
Arrangements of Modules, Approaches to Software Design (Function Oriented & Object-
Oriented).
Unit-4

Coding and Testing: Coding: Code Review, Software Documentation, Testing, Unit Testing,
Black Box and White Box Testing, Debugging, Program Analysis Tools, Integration Testing,
System Testing, Software Maintenance.

Text Book:
1. Fundamental of Software Engineering, Rajib Mall, Fifth Edition, PHI Publication,
India.

Reference Books:
1. Software Engineering– Ian Sommerville, 10/Ed, Pearson.
2. Software Engineering Concepts and Practice – Ugrasen Suman, Cengage
Learning India Pvt, Ltd.
3. R. Misra, C. Panigrahi, B. Panda: Principles of Software Engineering &
System Design, YesDee Publication

BCA-502 Data Mining

Unit-1

Data Warehouse Fundamentals: Introduction to Data Warehouse, OLTP Systems,

OLAP, Differences between OLTP and OLAP, Characteristics of Data Warehouse,
Functionality of Data Warehouse, Advantages and Applications of Data Warehouse,
Advantages, Applications, Top- Down and Bottom-Up Development Methodology, Tools for
Data warehouse development, Data Warehouse Types, Data cubes.

Unit-2

Introduction to Data Mining: Data mining, Functionalities, Data Preprocessing:

Preprocessing the Data, Data cleaning, Data Integration and Transformation, Data reduction,
Discretization and Concept hierarchies.

Unit-3

Mining Association Rules: Basics Concepts – Single Dimensional Boolean Association

Rules from Transaction Databases, Multilevel Association Rules from transaction
databases, Multi dimension Association Rules from Relational Database and Data
Warehouses. Apriori Algorithm, FP-Tree algorithm.

Unit-4

Classification and Prediction: Introduction, Issues, Decision Tree Induction, Naive

Bayesian Classification, Classification based on Concepts from Association Rule Mining,
Classifier Accuracy.

Text Books:

1. J. Han and M. Kamber, Data Mining Concepts and Techniques, Elsevier, 2011.
 Reference Books:

1. K.P. Soman ,Shyam Diwakar, V.Ajay ,2006, Insight into Data Mining Theory and
Practice, Prentice Hall of India Pvt. Ltd - New Delhi.
2. Data Mining Techniques, Arun K. Pujari, Universities Press, 2006
3. Modern Approaches of Data Mining: Theory & Practice, M. Panda, S. Dehuri, M. R.
Patra, Narosa Publishing House, 2018.

4. K.P. Soman ,Shyam Diwakar, V.Ajay ,2006, Insight into Data Mining Theory and
Practice, Prentice Hall of India Pvt. Ltd - New Delhi.
5. Data Mining Techniques, Arun K. Pujari, Universities Press, 2006
6. Modern Approaches of Data Mining: Theory & Practice, M. Panda, S. Dehuri, M. R.
Patra, Narosa Publishing House, 2018.

BCA-503 Discrete Mathematical Structure

Unit-1

Logics and Proof: Propositional Logic, Propositional Equivalences, Predicates and

Quantifiers Nested Quantifiers, Rules inference, Mathematical Induction.
Sets and Functions: Sets, Relations, Functions, Closures of Equivalence Relations, Partial
ordering well ordering, Lattice, Sum of products and product of sums principle of
Inclusions and Exclusions.

Unit-2

Combinatory: Permutations, Combinations, Pigeonhole principle

Recurrence Relation: Linear and Non-linear Recurrence Relations, Solving Recurrence
Relation using Generating Functions.

Unit-3

Graphs: Introduction to graphs, graphs terminologies, Representation of graphs,

Isomorphism.
Connectivity & Paths: Connectivity, Euler and Hamiltonian Paths, Introduction to tree,
tree traversals, spanning tree and tree search: Breadth first search, Depth first search, cut-
set, cut- vertex.
 Unit-4

Modeling Computation: Finite State Machine, Deterministic Finite Automata (DFA),

Non- Deterministic Finite Automata (NFA), Grammars and Language, Application of
Pumping Lemma for Regular Language.

Text Books:
1. “Discrete Mathematics and its Applications with Combinatory and Graph Theory” 7 th
edition by Kenneth H. Rosen.

Reference Books:
1. Elements of Discrete Mathematics by C. L. Liu and D.P. Mohapatra, TMH, 2012
2. J. P Tremblay, R. Manohar, “Discrete Mathematical Structures with
Applications to Computer Science”, TMH, 1997.
3. A Modern Approach to Discrete Mathematics and Structure by J. K.
Mantri & T. K Tripathy, Laxmi Publication

BCA-504 Computer Graphics

Unit-1

Computer Graphics: A Survey of Computer graphics, Overview of Graphics System: Video

Display Devices, Raster-Scan Systems, Input Devices, Hard-Copy Devices, Graphics
Software.

Unit-2

Graphics Output Primitives: Point and Lines, Algorithms for line, circle & ellipse generation,
Filled-Area Primitives. Attributes of Graphics Primitives: Point, line, curve attributes, fill
area attributes, Fill methods for areas with irregular boundaries.

Unit-3

Geometric Transformations (both 2-D & 3-D): Basic Geometric Transformations,

Transformation Matrix, Types of transformation in 2-D and 3-D Graphics: Scaling,
Reflection, shear transformation, rotation, translation. 2-D, 3-D transformation using
homogeneous coordinates.

Unit-4

Two Dimensional Viewing: Introduction to viewing and clipping, Viewing transformation in

2-D, Viewing pipeline, Clipping Window, Clipping Algorithms: Point clipping, Line clipping
and Polygon clipping.

Text books:
 1. Mathematical Elements for Computer Graphics, D. F. Rogers & J. A.
Adams, MGH, 2/ed.
2. Donald Hearn & M. Pauline Baker, “Computer Graphics with OpenGL”,
Pearson Education.

Reference books:
1. D. Hearn and M. Baker, “Computer Graphics with Open GL”, Pearson, 2/ed.
2. D. F. Rogers, “Procedural Elements for Computer Graphics”, MGH

BCAL-505 Computer Graphics LAB

Develop the programs using
C/C++ or Java

1. Write a program to implement Bresenham’s line drawing algorithm.

2. Write a program to implement mid-point circle drawing algorithm.
3. Write a program to clip a line using Cohen and Sutherland line clipping algorithm.
4. Write a program to clip a polygon using Sutherland Hodgeman algorithm.
5. Write a program to fill a polygon using Scan line fill algorithm.
6. Write a program to apply various 2D transformations on a 2D object
(use homogenous coordinates).
7. Write a program to apply various 3D transformations on a 3D object and
then apply parallel and perspective projection on it.

BCAL-506 Data Mining LAB

Using Scilab/ MATLAB/

C/ Python/ R

1. Build a Data Warehouse and perform its operations.

2. Perform data preprocessing tasks and Demonstrate performing
association rule mining on data sets.
3. Demonstrate performing classification on data sets.
4. Demonstrate performing clustering on data sets.
5. Demonstrate performing Regression on data sets.
6. Credit Risk Assessment. Sample Programs using German Credit Data.
7. Sample Programs using Hospital Management System.
 6th Semester
BCA
Syllabus

=================================================
BCAP-601 Thesis / Project Report & Viva-voce
BCAP-602 Seminar/Grand Viva
=================================================