Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
DEPARTMENT OF COMPUTER ENGINEERING &
APPLICATIONS
(SYLLABUS)
M
MA
AYY 77TTH
H,, 22001166
((U
UPPD
DA
ATTEED
DA
AFFTTEER
R 1100TTHH B
BO
OSS))
GLA UNIVERSITY,
MATHURA (U.P.) INDIA
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
COURSE STRUCTURE
BCA
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
First Semester
S.
NO.
CODE
TEACHING
SCHEME
L
T
P
SUBJECT
CREDITS
CONTACT
HR/WK
1.
BCA1001
Programming Logic Using 'C'
4
0
0
4
4
2.
BCA1002
Fundamentals of Computer and IT
4
0
0
4
4
3.
BCA1003
Introduction of Logical Circuit and Digital
Design
3
1
0
4
4
4.
AHE1002
Remedial English
4
0
4
4
5.
AHM1002
Mathematics –I
3
1
0
4
4
0
PRACTICALS
6.
BCA1181
‘C’ Programming Lab
0
0
6
3
6
7.
BCA1182
Hardware & Office Automation Lab
0
0
2
1
2
8.
BCA1099
General Proficiency
0
0
0
1
18
2
8
25
Total
28
Second Semester
S.
NO.
CODE
TEACHING
SCHEME
L
T
P
SUBJECT
CREDITS
CONTACT
HR/WK
1.
BCA2001
Data Structures using 'C'
3
1
0
4
4
2.
BCA2102
Database Management System
3
0
0
3
3
3.
BCA2003
Operating Systems
4
0
0
4
4
4.
BBA2001
Management Concepts & Practices
4
0
0
4
4
5.
AHM2002
Mathematics –II
3
1
0
4
4
PRACTICALS
6.
BCA2081
Data Structures using 'C' Lab
0
0
4
2
4
7.
BCA2082
Database Management System Lab
0
0
2
1
2
8.
AHE2083
English in Practice
0
0
4
2
4
9.
BCA2099
General Proficiency
0
0
0
1
17
2
10
25
Total
29
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
1
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
Third Semester
TEACHING
SCHEME
L
T
P
S.
NO.
CODE
CREDITS
CONTACT
HR/WK
1.
BCA3001
Object Oriented Programming using C++
4
0
0
4
4
2.
BCA3002
MIS & E-Commerce
4
0
0
4
4
3.
BCA3003
Computer Organization & Architecture
3
1
0
4
4
4.
BCA3004
Discrete Structure & Graph Theory
3
1
0
4
4
5.
AHS1001
Environmental Studies
4
0
0
4
4
SUBJECT
PRACTICALS
6.
BCA3081
C++ Programming Lab
0
0
4
2
4
7.
AHE3082
Soft Skills & Personality Development
0
0
4
2
4
8.
BCA3099
General Proficiency
0
0
0
1
18
2
8
25
Total
28
Fourth Semester
S.
NO.
CODE
TEACHING
SCHEME
L
T P
SUBJECT
CREDITS
CONTACT
HR/WK
1.
BCA4001
GUI based Programming Using Visual Basic
4
0
0
4
4
2.
BCA4002
System Design & Software Engineering
3
1
0
4
4
3.
BCA6101
Computer Networks & Communication
4
0
0
4
4
4.
BBA2002
Organizational Behavior
4
0
0
4
4
5.
AHM4002
Numerical & Statistical Techniques
3
1
0
4
4
PRACTICALS
6.
BCA4081
Visual Basic Programming Lab
0
0
4
2
4
7.
AHE4082
Professional Communication & Behavioral
Grooming
0
0
4
2
4
8.
BCA4099
General Proficiency
0
0
0
1
18
2
8
25
Total
28
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
2
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
Fifth Semester
1.
BCA5001
Core Java
4
0
0
4
CONTAC
T
HR/WK
4
2.
BCA5002
Web Technology
4
0
0
4
4
3.
BCA5003
Design and Analysis of
Algorithms
3
1
0
4
4
4.
AHM5002
Operations Research
3
1
0
4
4
Elective I
4
0
0
4
4
S.
NO.
CODE
5.
TEACHING SCHEME
SUBJECT
L
T
P
CREDITS
PRACTICALS
6.
BCA5081
JAVA Programming Lab
0
0
4
2
4
7.
BCA5082
Web Technology Lab
0
0
4
2
4
8.
BCA5099
General Proficiency
0
0
0
1
18
2
8
25
Total
28
Sixth Semester
TEACHING SCHEME
L
T
P
S.
NO.
CODE
1.
BCA4103
Computer Graphics & Multimedia
Techniques
4
0
2.
BCA6002
.Net Framework using VB .Net
3
Elective II
3.
SUBJECT
CREDITS
CONTACT
HR/WK
0
4
4
0
0
3
3
4
0
0
4
4
PRACTICALS
4.
BCA6081
VB .Net Programming Lab
0
0
2
1
2
5.
BCA6082
Project
0
0
0
12
-
6.
BCA6099
General Proficiency
0
0
0
1
11
0
2
25
Total
13
ELECTIVE - I (Fifth Semester)
1.
BCA5021
Artificial Intelligence
4
0
0
4
CONTAC
T
HR/WK
4
2.
BCA5022
Enterprise Resource Planning
4
0
0
4
4
S.
NO.
TEACHING SCHEME
CODE
SUBJECT
L
T
P
CREDITS
ELECTIVE – II (Sixth Semester)
S.
NO.
CODE
SUBJECT
1.
BCA6021
2.
BCA6022
Advanced Java
Advanced Database Management
System
TEACHING SCHEME
L
T
P
CREDIT
S
4
0
0
4
CONTAC
T
HR/WK
4
4
0
0
4
4
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
3
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
SYLLABUS
BCA
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
BCA1001: PROGRAMMING LOGIC USING 'C'
Objective: This course is designed to provide a comprehensive study of the C programming language. It
stresses the strengths of C, which provide students with the means of writing efficient, maintainable, and
portable code. The nature of C language is emphasized in the wide variety of examples and applications. To
learn and acquire art of computer programming. To know about some popular programming languages and
how to choose Programming language for solving a problem.
Credits: 04
Semester I
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Introduction: History, Facilities, Concepts, Uses; Basic Program Structure,
Header-Files, Comments; A Simple C program, Identifiers, Basic Data Types
and Sizes, Constants, Variables, Arithmetic, Relational and
Logical
Operators, Increment and Decrement Operators, Conditional Operator, Bitwise Operators, Assignment Operators, Expressions, Type Conversions,
Conditional Expressions, Precedence and Order of Evaluation.
Input-Output Functions: Data Input and Output getchar(), putchar(), scanf(),
printf(), functions.
18
Control Flow: If-Else, While, Do-while, Goto, For Statements, Nested Control
Structures, Switch, Break, Continue Statements, Comma Operator.
Arrays & Functions: Arrays Defining, Processing Array, Introduction to
Multidimensional Arrays; gets(), puts() functions, Functions Types,
Parameters, Prototypes, Passing Arrays to Functions, Recursion, Passing
Arguments to a Function by Value;
Storage Classes: Automatic, External, Static, Register Variables in Single File
Environment.
Pointer: Usage of Pointers, Addresses and Types, Pointer and Address
Arithmetic, Pointer Operations and Declarations, Using Pointers as Function
Arguments (Call By Reference, Call By Value), Pointer Array Duality Strings
Arrays of Pointers, Pointers to Functions, Concept of Dynamic Allocation of
Memory, Pre-Processor Directives.
Other Data Types: Structures, Member Accessing, Pointers to Structures,
Structures and Functions, Arrays of Structures, Unions, Enumerations and Bit
Fields, Typedef.
File Handling: Introduction of File Handling, Modes of File Handling Uses of
fopen(), fclose(), putc(), getc(), putw(), getw(), fscanf(), fprintf(), ferror()
Functions.
II
III
17
17
Text Book:

Yashavant P. Kanetkar, (2007), “Let us ‘C’ ”, BPB Publication, 8th ed.
Reference Books:



Peter Vander Linden, Schaum's, “Outline of theory and problems of programming with C ”, TMH.
Peter Vander Linden, “Expert C programming”, PHI.
Balagurusamy E., “Computing Fundamentals and C Programming”, TMH.
Outcome:: A student who successfully completes the course will have the ability to:
 Understand the basic terminology used in computer programming.
 Write, compile and debug programs in c language.
 Use different data types in a computer program.
 Design programs involving decision structures, loops and functions.
 Explain the difference between call by value and call by reference.
 Understand the dynamics of memory by the use of pointers.
 Use different data structures and create/update basic data files .
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
4
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
BCA1002: FUNDAMENTALS OF COMPUTER & IT
Objective: The objective of this course is that students will able to learn basic fundamentals and concepts
related to computer architecture.
Credits: 04
Semester I
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Computer Fundamentals: Block Structure of a Computer, Characteristics of
Computers, Generation of Computers and Classification of Computers.
Number System: Bit, Byte, Binary, Decimal, Hexadecimal and Octal Systems,
Conversion from One System to the Other; Binary Arithmetic Addition,
Subtraction and Multiplication; Representation of Information, Integer and
Floating Point Representation, Character Codes (ASCII, EBCDIC, BCD, Excess-3,
Grey).
Information Concepts & Processing System: Evolution of Information
Processing, Data, Information, Knowledge & Wisdom.
Elements of a Computer Processing System: Hardware - Input-Output
Devices, VDU, CPU Storage Devices and Media, Data Communication
Equipment/Devices.
18
II
Software Concepts: Type of Software, Translator, Compiler, Interpreter,
Assembler, Loader.
Application Software: Office Automation.
Programming Languages: Classification, Machine Code, Assembly Language,
Higher Level Language and Fourth Generation Languages.
Operating System: Concepts as Resource Manager, Batch Processing,
Multiprogramming, Multiprocessing, Time Sharing and Real Time System.
DOS: Command Interpreter, Booting Internal & External Commands, Batch
Files, exe, com, System Files, bin, txt, bmp Files.
17
III
Computer Network and Communication: Network Types, Network
Topologies; Data Communication – Mode, Channel, and Media; OSI Reference
Model, TCP/IP.
Internet and its Applications: E-Mail, TELNET, FTP, World Wide Web,
Internet and Applications.
17
Text Book:

P.K. Sinha, (2008), “Computer fundamentals”, BPB Publisher, New Delhi, 4th ed.
Reference Books:



Anita Goel, “Computer fundamentals”, Pearson Education.
Peter Nortron, “Inside PC”, TMH, New Delhi.
Alexis Leon, Methews Leon, (1999), “Fundamentals of Information Technology”, Vikas Publishing,
New Delhi.
Outcome:: After completion of course, student will be able to:
 Understand the basic concepts of computer hardware and software.
 Demonstrate problem solving skills.
 Understand the structure of operating system, its applications and commands.
 To be familiar with network tools, concepts of protocols and network interfaces.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
5
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
BCA1003: INTRODUCTION OF LOGICAL CIRCUIT AND DIGITAL DESIGN
Objective : The aim of the subject is to assist the student:
 To understand the fundamentals of digital electronic circuits.
 To develop the understanding regarding application of elementary ideas of digital electronics in
modern technology
Credits: 04
Semester I
L–T–P: 3–1–0
Module
No.
Content
Teaching
Hours
I
Introduction to Digital Computer, Digital and Analog Signal, Block Diagram of
Digital Computer.
Number Systems: Data Representation, Binary, Octal, Decimal, Hexadecimal,
Conversion from One to Another Number System; Representation of Positive,
Negative Numbers; r’s and r-1’s Complement, Uses of Complement, Arithmetic
Operation on Binary Numbers.
Binary Codes: BCD, ASCII, EBCDIC Coding, Gray Codes and Excess – 3 Codes,
Alphanumeric Representation in ASCII Codes, Error-Detection Codes, Even
and Odd Parity.
14
II
Boolean Algebra: Logic Gates, Truth Table, Logic Expression, Rules and Laws
of Boolean Algebra, Demorgan's Theorems, Boolean Axioms,
Minterms, Maxterms, Boolean Expression in SOP Form and POS Form,
Conversion of SOP/POS, Expression to its Standard SOP/POS Form; Universal
Gates, Simplifications of Logic Equations Using Laws of Boolean Algebra and
Karnaugh Map (Up to 5 Variables), Introduction of “Don’t Care” Conditions,
Logic Circuit Implementation of Boolean Expression, Multilevel NAND and
NOR Implementation.
Combinational Circuits: Adder, Subtractor, Comparator, Decoder, Encoder,
Code Conversion, Multiplexer, Demultiplexer, Parity Bit Checker and
Generators; Parallel Binary Adder/Subtractor, ROM and PLA.
13
III
Sequential Circuits
Flip Flops: Latch, Race Around Condition, Flip Flops - RS Flip Flop Using
NAND/NOR Gates, Clocked RS, JK Flip Flop, Master Slave JK,
D Flip Flop, T Flip Flop, Edge Triggered Flip-Flop, Conversion of Flip-Flops.
Register: Definition, Shift Register with Parallel Load.
Shift Registers: Shift Registers Function, Serial and Parallel Shift Registers,
Bi-Directional
Shift
Registers
with
Parallel
Load.
Counters: Asynchronous and Synchronous Counters, Up/Down Counters,
Modulo-n Counters, BCD Counters, a Procedure for Design of Sequential
Circuit.
13
Text Book:

Morris Mano, (2005), “Digital Logic and Computer Design”, PHI, New Delhi.
Reference Books:
 R.P.Jain, (2006), “Digital Electronics”, Tata McGraw Hill, New Delhi, 3rd ed.
 Anand Kumar, (2009), “Switching Theory”, PHI Publication, New Delhi.
Outcome :





Acquired knowledge about basics of digital electronics.
Acquired knowledge about solving problems related to number systems and Boolean algebra.
Ability to identify, analyze and design combinational circuits.
Ability to design various synchronous and asynchronous sequential circuits.
Acquired knowledge about internal circuitry and logic behind any digital system.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
6
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
AHE1002: REMEDIAL ENGLISH
Objective: The course will include intensive reading, writing, and listening practices. Special emphasis will
be given on finding out the most frequent mistakes committed by students. The effort is to enable them to
overcome these mistakes; and to boost their understanding of language. In writing section, the focus will be
on making correct sentences, guided writing, guessing word meaning in context. In reading and listening
sections, the focus will be on understanding long sentences, studying the complex sentence structures and
understanding main idea. The students will be given practice sheets on some of the grammar topics. The idea
is to bring grammar in their practice. The objective of the course is to help students attain a basic proficiency
in reading and writing skills.
Credits: 04
Semester I
Module
No.
L–T–P: 4–0–0
Content
Teaching
Hours
STRUCTURE
A.1.
Tense and Voice: Introducing the tenses; Use of tenses in
different situations; Usage of forms of verbs in tenses; Introduction of Voice;
Active and Passive Voice in tenses; Voice Change.
A.2.
I
Reading Comprehension
i. Analyzing a Text: Introducing the story ‘Monkey’s Paw’ by W. W.
Jacobs; Showing the video of the story ‘Monkey’s Paw’; Reading of the story
‘Monkey’s Paw’ by W.W. Jacobs; Analysis of the form of the text: sentence
structures & vocabulary; Analysis of the content of the text: interactive
session.
20
ii. Analyzing Unseen Passages: Reading a specimen text;
Contextualizing the text; Vocabulary and sentence structure
B.1
Parts of Speech: Noun: countable and uncountable; Pronoun:
Personal Pronoun; Adjective; Adverb; Preposition
B.2.
Reading Comprehension
i. Analyzing a Text
Introducing the story ‘The Last Leaf’ by O. Henry; Showing the video of the
story ‘The Last Leaf’; Reading of the story ‘The Last Leaf’ by O. Henry; Analysis
II
of the form of the text: sentence structures & vocab; Analysis of the content of
13
the text: interactive session.
ii. Analyzing Unseen Passages
(a) Reading a specimen text
(b) Contextualising the text
(c) Vocabulary and sentence structure
C.1. Narration: Introducing direct and indirect speech; Transformation:
direct and indirect, different types of sentences; Situation of ‘No change’ in
speech.
III
12
C.2. Reading Comprehension:
i. Reading an Essay: Reading of the essay ‘On Saying Please’ by A. G.
Gardiner; Textual Analysis of the essay; Discussion with the students:
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
7
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
interactive session; Sample question and answers.
ii. Analyzing Unseen Passages: Reading a specimen text;
Contextualising the text; Vocabulary and sentence structure
C. 3.THEME BASED WRITING
Adjectives for People, Adverbs of Time, Animals, Bank, Baseball, Body,
Buildings and Places, Car Parts , City, Classroom, Clothes, The Basic
Colors (American Spellings) (gray), The Basic Colours (British
Spellings) (grey), Cooking, Desserts, Dinner Table, Family Members,
Fruit, Geography, House,
Restaurant, Tools, Transportation,
Vegetables, Weather
Text Book:
 Murphy, Raymond, “Intermediate English Grammar”, Cambridge University Press.
 Robert J. Dixon, ”Complete Course in English”, A new revised edition.
Reference Books:
 Hornby, A.S., “Advanced Learners’ Dictionary of Current English”, OUP.
 Greenberg, Rondinone & Wiener, “The Advancing Writer Book”I, Harper Collins, College
Publishers.
 Liz and Soars “Headway Pre-Intermediate” OUP.
 Sharma S.D.,(2003), “A textbook of professional Communication Skills & ESP for Engineers and
Professionals”, Sarup & Sons, Delhi.
Outcome: After completing the course students will be able to:




Comprehend a text and answer the questions based on it clearly.
Express their ideas in writing according to time and tense.
Enrich their vocabulary in terms of contextual and situational conversation.
Enhance their listening skills through the video of the text.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
8
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
AHM1002: MATHEMATICS – I
Objective: The objective of this course is to enable the students to evaluate the differential calculus, integral
calculus and matrices.
Credits: 04
Semester I
L–T–P: 3–1–0
Module
No.
Content
Teaching
Hours
I
Differential Calculus: Successive Differentiation, Calculation of nth Derivative
Expansion of a Function of One Variable, Leibnitz Theorem, Taylor's and
Maclaurin's Series, Partial Differentiation, Homogeneous Function, Euler's
Theorem.
Multiple Integrals: Double and Triple Integrals (Cartesian and Polor Coordinates), Change of Order of Integration (Simple Cases).
14
II
Matrices: Inverse by Elementary Transformations, Rank, (Normal Form &
Echelon Form), Solution of System of Simulation Linear Algebraic Equations
(Homogeneous & Non-Homogeneous Both), Eigen Values and Eigen Vectors,
Cayley Hamilton Theorem (Without Proof).
Differential Equations: Introduction, Formation, Variables Separable and
Linear Form of Differential Equations of First Order and First Degree.
13
III
Differential Equations: Linear Differential Equation of nth Order with
Constant Coefficients, Complementary Functions and Particular Integrals.
Convergence and Divergence of Infinite Series: Leibnitz Test, Divergence
Test, Comparison Test, P-Test Cauchy's Root Test, D' Alembert's Ratio Test.
13
Text Book:

H.Kishan, (2005), “Sure Success in Convergence”, Atlantic Publishers and distributors, New Delhi.
Reference Books:




E. Kreyszig, “Higher Engg. Mathematics”, John Wiley & Sons.
B.V. Ramanna, “Higher Engg. Mathematics”, TMH.
B.S. Grewal, (2006), “Higher Engg. Mathematics”, Khanna publishers, New Delhi, 39th ed.
Chandrica Prasad, (1993), “Mathematics for Engineers”, Prasad Allhabad, 1st ed.
Outcome:: After completion of this course, student will be able to:
 Understand the concepts of elementary differentiation and integration.
 Evaluate derivatives of functions and integrals of functions.
 Evaluate matrices.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
9
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
BCA1181: ‘C’ PROGRAMMING LAB
Objective: The objective of this course is to make students:
 Understand the basic concept of C Programming, and its different modules that includes conditional
and looping expressions, Arrays, Strings, Functions, Pointers, Structures and File programming.
 Acquire knowledge about the basic concept of writing a program.
 Role of constants, variables, identifiers, operators, type conversion and other building blocks of C
Language.
Credits: 03
Module
No.
I/II/III
Semester I
Content
Introduction to C Programming and Linux Environment
Operators, their precedence and associativity
● Arithmetic Operators on Integers
● Arithmetic Operators on Floating point numbers
● Relational Operators
● Ternary Operators
Formatted Input and Output
Decision Control
● if statement , else statement , else if ladder , switch-Case statement
Programming based on loops
● for loop , while loop , do while loop , Nested loops
Use of special control statement
● break , continue
Programming based on Array
● One dimensional Array , Two dimensional Array
Programming based on function-call by value
● Call by Value , Recursion
Pointers
● Basics
● Problem based on One dimensional array
● Problem based on Two dimensional array
● Dynamic Memory Allocation
● Function call by reference
User Defined Data types
● Structure
● Union
● Enum
File handling
● Opening a file
● Reading, writing and appending a file
● Closing file
L–T–P : 0–0–6
Lab
Hours
72
Text Book:

Yashavant P. Kanetkar, (2008), “Let us ‘C’ ”, BPB Publication, New Delhi, 8th ed.
Reference Books:


Peter Vander Linden, “Schaum's Outline of theory and problems of programming with C”,
TMH.
Peter Vander Linden, “Expert C programming”, PHI.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
10
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)

Balagurusamy, “Computing Fundamentals and C Programming”, TMH.
Outcome:: At the end of this course students will be able to :
 Understand the basic terminology used in computer programming.
 Write, compile and debug programs in C language.
 Use different data types in a computer program.
 Design programs involving decision structures, loops and functions.
 Explain the difference between call by value and call by reference.
 Understand the dynamics of memory by the use of pointers.
 Use different data structures and create/update basic data files.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
11
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
BCA1182: HARDWARE & OFFICE AUTOMATION LAB
Objective:: The objective of this course would enable the students in crafting professional word documents,
excel spread sheets, power point presentations using the Microsoft suite of office tools as well as having basic
knowledge of hardware and operating system installation. To familiarize the students in preparation of
documents and presentations with office automation tools.
Credits: 01
Semester I
L–T–P: 0–0–2
Module
No.
Content
I
How A Computer System Works? Hardware Configuration, Introduction to
Basic Components of a Typical PC, Assembling a PC, Installing Operating
System, Basic Troubleshooting During the Assembling, Basic Troubleshooting
of PC, Introduction to Various Types of Cables and Connectors used in
Networking, Introduction to Networking and Networking Concepts, Repeaters,
Hubs, Switches, Bridges, Routers, Hubs vs Switches, Installing the NIC Card,
MAC Address.
II
Ms Office XP/2007
(A) Ms Word
Introduction to Ms Word: Menu Bar, Menus, Submenus, Tool Bar, Tools,
Customizing Toolbar, Hiding Toolbar etc., Creating and Saving a Documents,
Working with an Existing Document, Auto Text, Auto Complete and Auto
Correct.
Formatting a Document : Change the Appearance of Text & Paragraph, Copy,
Paste and Paste Special Functions, Creating and Modifying a List, Change the
Way Each Page Appears in the Document Giving Stress to Line and Page Break
Options and Orientation, Changing the Look of Documents with Styles.
Using Tables and Columns: Table Creation and Modification Giving Stress to
Auto-Fit, Auto-Format and Table Sort. Working with Data in Table Giving Stress
to Formulas, Presenting Text in Columns, Object Linking and Embedding,
Inserting and Sizing Graphics, Hyperlink Envelopes & Label Creation, Grammar
& Spell Check, Previewing and Printing Documents.
III
(B) MS Excel
Introduction to Electronic Spreadsheet and Microsoft Excel : Creating and
Formatting a Worksheet, Features of Excel, Inserting and Formatting Data in a
Worksheet, Working with an Existing Data List, Auto Fill, Fill Series and Autocomplete Options, Formatting Cells;
Sorting & Filtering Data, Conditional Formatting, Formulas and Functions
(Details Usage of Important Data Functions Like Sum, If, Average etc.);
Interlinking Worksheets and Files, Setting Filters and Performing Calculations
on Filtered Data etc.
(C) MS Power Point
Introduction to Power Point:
Creating A Presentation: Features of Power Point - Editing Master Slides,
Viewing and Editing a Presentation, Inserting, Sorting, Hiding and Deleting
Slides, Inserting Pictures.
Clip Art and Movies in a Slide: Creating and Enhancing a Table, Slide Layouts,
Modifying the Slides and Title Master, Adding Transition and Animation Effect,
Hyper Linking Slides & Files.
Lab
Hours
8
8
8
Text Book:
 Rajaraman V, (2006), “Computer fundamentals”, PHI Publisher, New Delhi, 4th ed.
Reference Books:
 Anita Goel, “Computer fundamentals”, Pearson Education
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
12
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)


Peter Nortron, “Inside the PC”, TMH, New Delhi
P.K. Sinha, (2008), “Computer fundamentals”, BPB Publisher, New Delhi, 4th ed.
Outcome:: After completion of course, student will be able:
 To understand thoroughly the principles of hardware design in the latest technology.
 To assemble a PC, installation of OS and NIC card.
 To perform documentation.
 To perform accounting operations.
 To perform presentation skills.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
13
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
BCA2001: DATA STRUCTURE USING 'C'
Objective: The objective of this course is that students will have the knowledge to:
 Impart the basic concepts of data structures, abstract data type and algorithms
 Understand the concept of time and space complexity
 Understand concepts about searching and sorting techniques

Understand basic concepts about array stacks, queues and trees .
Credits: 04
Semester II
L–T–P: 3–1–0
Module
No.
Content
Teaching
Hours
I
Introduction: Data, Information, Introduction to Data Structure, Classification
Data Structure, Primitive and Composite Data Structure, Time and Space
Complexity of Algorithms.
Arrays: Definition of an Array, Positional Value of a Member, Base Address of
Array, Representation of Array (Single & Multi Dimensional Arrays), Accessing
Array element, String Processing (String Operation, Pattern Matching
Algorithm), Address Calculation of Array, Insertion and Deletion on Array,
Advantages and Disadvantage of Arrays.
Linked List: Pointers, Dynamic Memory Allocation, Singly Linked Lists, and
Operations on Linked Lists, Insertion and Deletion of a Node, Introduction to
Circularly Linked Lists and Doubly Linked Lists.
14
II
Stack and Queue: The Concept of List, Introduction to Stack & Primitive
Operation on Stack;
Stacks Application: Infix, Post Fix, Prefix and Recursion;
Introduction to Queues: Primitive Operations on the Queues, Circular Queue,
Deque, Priority Queue, Applications of Queue.
13
III
Trees: Basic Terminology, Binary Trees, Tree Representations as Array &
Linked List, Basic Operation on Binary Tree, Binary Search Tree(BST), Insertion
and Deletion in BST.
Traversal of Binary Trees: Inorder, Preorder & Postorder; Application of
Binary Tree..
Searching Techniques: Linear and Binary Search;
Sorting: Internal and External sorting, Bubble, Insertion, Selection.
13
Text Book:

Lipschutz & Lipson, (2006), “Data Structure using ‘C’ ”, Tata McGraw-Hill, New Delhi.
Reference Books:





Tanenbaum, (2005), “Data Structures Using ‘C’ ”, Pearson education, New Delhi, 2nd ed.
Robert L. Kruse, (2005), “Data Structures and Program Design in ‘C’ ", Pearson education, New
Delhi, 2nd ed.
Esakov and Weises, (2007), “Data Structures: An Advanced Approach Using 'C' ”, PHI Publication,
New Delhi, 3rd ed.
D. Samantha, (2006), “Classical Data Structure”, PHI Publication, New Delhi.
G. S. Baluja, (2006), “Data Structure Through ‘C’ ”, DRP, New Delhi.
Outcome:: After completion of course, student will be able to:
 Understand the concepts of data structure, data type and array data structure.
 Analyze algorithms and determine their time complexity.
 Implement arrays and linked list data structure to solve various problems.
 Understand and construct various searching and sorting algorithms.
 Understand and construct various data structure such as stacks, queues and trees using Cprogramming language.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
14
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
BCA2102: DATABASE MANAGEMENT SYSTEM
Objective : The aim of the subject is to assist the student to:
 Understand the role of a database management system in an organization.
 Gain a good understanding of the architecture and functioning of database management systems as
well as associated tools and techniques, principles of data modeling using entity relationship and
develop a good database design and normalization techniques to normalize a database.
Credits: 03
Module
No.
Semester II
L–T–P: 3–0–0
Content
Basic Concepts: Database & Database users, Characteristics of the Database,
DBA, Data models, Schema & Instances, DBMS Architecture & Data
Independence, Data Base Languages, Data Modeling using the Entity
Relationship Approach. Data Models- Relational, Network, Hierarchical.
I
File Organization Techniques: Sequential file organization, Index File
Organization, Random file organization.
Relational Model concepts: Relational Data Model Concepts, Relational
Algebra,
Introduction on SQL: Data definition and Data manipulation command in
SQL, views and queries in SQL, Specifying Constraints & index in SQL.
Normalization: Functional dependencies, normal forms based on primary
keys (1NF, 2NF, 3NF & BCNF”), de-normalization, lossless join & dependency
preserving decomposition.
Transaction: Introduction, Properties (Atomicity, Consistency, Isolation,
Durability), Transaction State.
Concept of object oriented data base, distributed database and client server
database.
II
III
Teaching
Hours
14
13
13
Text Book:

Henry F. Korth Abraham silberschatz, (2006), Database system concepts - McGraw - Hill
International, New Delhi,5 th.ed.
Reference Books:



Bipin Desai, (2006), An Introduction to Database System, West Pub. Co.
Jeff Parkins and Bryan Morgan, Teach Yourself SQL in 14 days
Elmasri and Navathe (2010), “Fudamentals of Database Systems”, 6th Edition, Addision Wesley.
Outcome :
 Able to master the basic concepts and understand the applications of database systems.
 Able to construct an Entity-Relationship (E-R) model from specifications and to transform to
relational model.
 Understand and apply database normalization principles.
 Able to construct SQL queries to perform CRUD operations on database. (Create, Retrieve, Update,
Delete)
 Understand principles of database transaction management, database recovery, security.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
15
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
BCA2003: OPERATING SYSTEMS
Objective: The objective of this course is that students will able to know about facilities and services
provided by operating system and able to design applications.
Credits: 04
Semester II
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Introduction: Basic Elements, Functions and Types of Operating System,
Serial Processing, Multi- Programmed, Batch System, Time Sharing Systems,
System Components, Operating System Services, Interrupts, Interrupt
Processing,
Process: Concept of Process, Process Control Block, Performance Criteria of
Process, Schedulers, CPU Scheduling Algorithm.
18
II
Memory: Memory Hierarchy, Cache Memory, I/O Communication
Techniques, Memory Management, DMA, Command Interpreter, Shell Layer
Architecture of UNIX, Paging, Segmentation, Segmentation with Paging,
Virtual Memory, Demand Paging, Page Replacement and its Algorithms.
17
III
Inter Process Communication (IPC): Semaphores, Classical Problem of
Synchronization;
Deadlock: Characterizations, Method for Handling Deadlocks, Deadlock
Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from
Deadlock; Concept of File System, Function of File System, Access Methods,
Allocation Methods, Directory System and Protection.
Disk Management: Scheduling Algorithm.
17
Text Book:

Silberschatz & Galvin, (2006), “Operating System Concepts”, Addison Wesley Publication,
Singapore, 7th ed.
Reference Books:



W. Stallings, (2006), “Operating System”, Prentice Hall of India. New Delhi, 6th ed.
Harold Lorin, Harvey M. Deitel, (2005), “Operating systems ”, Addison Wesley, New Delhi, 2nd ed.
M. Naghibzadeh, “Operating System”, University Press.
Outcome: After completion of course, student will be able to:
 Understand the concepts related to functions and services of operating system.
 Describe ,contrast and compare different structures of operating system.
 Understand and analyze theory and implementation of processes, resource control, physical and
virtual memory concepts, scheduling, I/O and file management.
 Acquire a detailed understanding of aspects of different operating systems.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
16
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
BBA2001: MANAGEMENT CONCEPTS & PRACTICES
Objectives: The objective of this course is:
 To give insights into the basics of management to students and to
 help them in understanding the nuances of management.
 To assist/help them to develop some managerial skills.
Credits: 04
Semester II
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Introduction & Planning
Nature of Management: Concept, Nature & Importance.
Development of Management Thought: Contribution of Taylor and Fayol
and their Principles.
Management Process and Skills: Management Functions, Various Levels of
Management, SWOT Analysis.
Fundamentals of Planning: Concept, Nature, Importance, Steps in Planning.
Decision Making: Concept, Process of Decision Making, Techniques of
Decision Making.
18
II
Organizing & Staffing
Fundamentals of Organizing: Concept, Departmentation, Matrix
Organisation Structure.
Authority: Delegation of Authority, Centralization and Decentralisation.
Staffing: Concept, Importance, Factors affecting Staffing.
17
III
Directing & Controlling
Fundamentals of Directing: Concept, Importance, Principles.
Leadership: Concept, Importance and its theories.
Fundamentals of Controlling: Concept, Importance, Stages of Control,
Essentials of Effective Control System, Causes of Resistance to Control.
17
Text Book:

L M Prasad, (2008), “Principles and Practice of Management”, Sultan Chand & Sons., New Delhi, 7th
ed.
Reference Books:



C B Gupta, “Management Concept & Practices”, Sultan Chand & Sons.
Horold Koontz and Iteinz Weibrich, (2006), “Essential of Management”, McGraw hills
International, New Delhi, 6th ed.
Tripathi, Reddy, “Principles of Management”, Tata McGraw Hill.
Outcome:



On completion of the syllabi, the students will understand the basic concepts of management.
They will acquaint themselves with management process, functions and principles.
Student will also get the idea about new developments in management.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
17
Course Curriculum (w.e.f. Session 2016-17)
Bachelor of Computer Applications (BCA)
AHM2002: MATHEMATICS –II
Objective: The objective of this course is to get the knowledge about set theory and group theory, ring, field
and vector spaces.
Credits: 04
Semester II
L–T–P: 3–1–0
Module
No.
Content
Teaching
Hours
I
Set Theory, Relations, Order Relation, Binary Operation, Modulo System and
Functions. Groups, Abelian Groups, Semi-Groups and Monoids, Subgroups,
Permutation Group.
14
II
Cyclic Groups, Isomorphism, Homomorphism, Automorphism, Cosets and
Lagrange’s Theorem, Normal Subgroup, Cayley’s Theorem.
13
III
Definition and Examples of Rings, Integral Domain, Fields, Skew Fields, Vector
Space, Sub Space, Linear Dependence and Independence.
13
Text Book:
 G. C. Sharma, (2008), “Modern Algebra”, Shiv Lal & Sons., Agra.
Reference Books:
 J.A. Gallian, “Contemporary Abstract Algebra”, Narosa pup. House.
 Hoffman and Kunj, “Linear Algebra”, PHI.
 A.R Vashishtha, (2007), “Modern Algebra”, Krishna Publications, Meerut, 53rd ed.
 Sachaum’s Series, “Linear Algebra”.
Outcome: After completion of course, student will be able :
 To understand basic concept of set theory.
 To understand about the group theory.
 To understand about the ring, field and vector spaces.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
18
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA2081: DATA STRUCTURES USING 'C' LAB
Objective: The objective of this course is that students will have the knowledge to construct and application
of various data structures and abstract data types including arrays, stacks, queues and trees.
Credits: 02
Module
No.
Semester II
L–T–P : 0–0–4
Content
Array
● Introduction
● Operations
● String Operations
● Multidimensional Array
● Operations on multi dimensional array
Stack
● Push, pop and Traversing
● Infix to prefix
Queue
● Implementation using array (Insertion and Deletion)
● Circular Queue
● Deque
Linked List
● Implementation
● Operations on linked list
Implementation of Circular Linked List
Implementation of Doubly Linked List
Searching
● Linear Search
● Binary Search
Sorting
● Insertion Sort
● Bubble Sort
● Selection Sort
● Merge Sort
● Quick Sort
● Radix Sort
I/II/III
Lab
Hours
48
Text Book:

Lipschutz & Lipson, (2006), “Data Structure using ‘C’ ”, Tata McGraw-Hill, New Delhi.
Reference Books:





Tanenbaum, (2005), “Data Structures Using ‘C’ ”, Pearson education, New Delhi, 2nd ed.
Robert L. Kruse, (2005), “Data Structures and Program Design in ‘C’ ", Pearson education, New Delhi, 2nd ed.
Esakov and Weises, (2007), “Data Structures: An Advanced Approach Using 'C' ”, PHI Publication, New Delhi
, 3rd ed.
D. Samantha, (2006), “Classical Data Structure”, PHI Publication, New Delhi.
G. S. Baluja, (2006), “Data Structure Through ‘C’ ”, DRP, New Delhi.
Outcome:: After completion of course, student will be able to:
 Implement arrays and linked list data structure.
 Implement various sorting algorithms.
 Implement various data structure such as stacks, queues and trees and using C-programming
language.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
19
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA2082: DATABASE MANAGEMENT SYSTEM LAB
Objective: To educate students with fundamental concepts of Data Base Design, Data Models, Different Data
Base Languages (SQL/Oracle).
Credits: 01
Semester II
Module
No.
L–T–P: 0–0–2
Content




I/II/III




Introduction of Data Definition Language (DDL) and Its commands.(Create,
Alter, Drop, Rename).
Introduction of Data Manipulation Language (DML) and Its Commands
(Insert, Update, Delete).
Creation, altering and dropping of tables and inserting rows into a table (use
constraints while creating tables) examples using SELECT command.
Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN),
GROUP BY, HAVING.
Queries using Conversion functions (to_char, to_number and to_date), string
functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap,
length, substr and instr), date functions (Sysdate, next_day, add_months,
last_day, months_between, least, greatest, trunc, round, to_char, to_date)
To implement concept of Joins in SQL.
To implement the concept of sub-queries.
To implement the concept of views
Lab
Hours
24
Text Book:

Henry F. Korth Abraham silberschatz, (2006), Database system concepts - McGraw - Hill
International, New Delhi,5 th.ed.
Reference Books:



Bipin Desai, (2006), An Introduction to Database System, West Pub. Co.
Jeff Parkins and Bryan Morgan, Teach Yourself SQL in 14 days
Elmasri and Navathe (2010), “Fudamentals of Database Systems”, 6th Edition, Addision Wesley.
Outcome:: After undergoing this laboratory module, the participant should be able to:
 Understand, appreciate and effectively explain the underlying concepts of database technologies.
 Design and implement a database schema for a given problem-domain
 Populate and query a database using SQL DML/DDL commands.
 Declare and enforce integrity constraints on a database using a state-of-the-art RDBMS.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
20
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
AHE2083: ENGLISH IN PRACTICE
Objective: ‘English in Practice I’ focuses on communication activities in functional and situational contexts.
It encourages students to speak with fluency and accuracy as well as develop the four skills of reading,
writing, listening and speaking. The classes will be theme based to provide practice in a meaningful context
which can be extended outside the classroom.
Credits: 02
L–T–P: 0–0–4
Semester II
Module
No.
Lab
Hours
Content
Structural Input
 Use of Articles (written Drill) - Pp 49 & 50, Exercise 1,2,3,4






I
Singular & Plural
Gender
Nouns (Pp 61 Writing)
Tenses (Pp 62 to 63, all sections)
Adjectives & Adverbs (Pp 82 Adjective & Adverbs)
Prepositions (Place, Position, Instrument, Agent, Time) – Pp 158 Exercise
no.1, 2, Pp 159, Exercise no. 3)
18
*All the grammatical elements should be discussed in the light of the
exercises.
(A)
Speaking And Listening
(B)
Vocabulary of character description
Shopping, Holidays (A list of words related to the themes can be
provided as a supplement)
Activities: Pp 118, UNIT I, Listening exercise no. 1 (Track 002)
Pp 119, UNIT 1, Communication Exercise 4 (Track 003)
121, UNIT 3, Listening Exercise 1 (Track 009)
9, Communication Exercise 4 (Track 026)
Pp
Pp 132, UNIT
(Text to be used: Mani. P. English for Teaching.)
II
(C)
Reading and Writing
15
Vocabulary of character description
History, Homes and Houses (A list of words can be provided as a supplement)
ACTIVITIES
Pp 33, Describing a Process 1 & 2 [All the sections to be covered in the 2
sessions)
Pp 37 to 38, Study Skills 1.a, b, c
Pp 38, Writing 1 & 2
(Text to be used: English for Engineers by RIS, Bangalore.)
Structural Input

III


IV
Usage of Affixes in forming words belonging to different grammatical
categories e.g. –al, ness, -ed, un-, im-, -ish, -ism, etc. Identification of
grammatical categories of the word in sentences
Error correction with reference to subject & verb agreement (Pp 94 to
98 Exercise 26, K. R. Laxminarayanan, English for Technical
Communication, Vol. 1 & 2, Scitech Pub. Pvt Ltd)
Prepositions (Reason, Complement, Ingredient, Beneficiary)
A. Speaking & Listening
15
10
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
21
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
Vocabulary of character description
Education, Defence (A list of words related to the themes can be
provided as a supplement)
Activities
Pp 122, UNIT 3, Listening Exercise 2 (Track 010)
Pp
121, UNIT 2, Communication Exercise 4 (Track 007)
Pp 126 to
127, UNIT 6, Listening Exercise 1 (Track 018)
(Text to be used: Mani, P. English for Teaching.)
B. Reading & Writing
Activities
Pp 48 Writing
Text Book:

Mani .P & Deepthi. S, “English for Teaching”, CUP Regional Institute of English, ‘English for
Engineers’, Bangalore, Foundation Books Pvt. Ltd.
Reference Books:


Hornby, A.S., “An Advanced Learner’s Dictionary of Current English”, OUP.
Murphy, Raymond, “Intermediate English Grammar”, Cambridge University Press.
Material:
Audio-Video Material available in the language Lab and texts such as Newspapers etc.
Outcome: At the end of the course, the participant will be able to --




Impart a reading habit and improve their formal writing.
Listen and understand English news and documentaries.
Understand and communicate with Standard English speakers.
Understand and tell jokes and stories with different expression.
Narrate/describe an event in English.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
22
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA3001: OBJECT ORIENTED PROGRAMMING USING C++
Objective: The objective of this course is that the students will understand :
 Develop a greater understanding of the issues involved in programming language design and
implementation.
 Develop an in-depth understanding of functional, logic, and object-oriented programming
paradigms.

Implement several programs in languages other than the one emphasized in the core curriculum
(C++).

Understand design/implementation issues involved with variable allocation and binding, control
flow, types, subroutines, parameter passing.

Develop an understanding of the compilation process.
Credits: 04
Semester III
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Fundamentals of Object Oriented Programming: Procedure Oriented
Programming vs. Object Oriented Programming (OOP);
Basic Concepts of OOP: Classes, Objects, Encapsulation, Inheritance,
Polymorphism, Dynamic Binding, Message Passing and Abstraction; Benefits and
Applications of Object Oriented Programming.
Basic of C++: Applications, Structure, Tokens, Keywords, Identifiers, Basic Data
Types, User Defined Data Types, Type Compatibility, Declaration of Variables,
Dynamic Initialization of Variables, Reference Variables, Scope Resolution
Operators, Member Dereferencing Operators, Memory Management Operator,
Operator Precedence and Control Structures.
Functions In C++: Defining a Function, Return Statement, Types of Functions,
Actual and Formal Arguments, Local and Global Variables, Default Arguments,
Multifunction Program, Storage Class Specifies, Recursive Function,
Preprocessors Header Files, Standard Functions, Function Prototyping, Call By
Reference, Inline Function, Function Overloading.
18
II
Classes And Objects: Creation, Accessing Class Members, Private vs Public
Objects, Member Functions, Method Definition, Static Data Members, Static
Member Functions, Arrays of Objects, Constant Member Functions, Overloading
Member Functions, Friend Functions, this Pointer; Constructor and Destructor,
Copy Constructors, Dynamic Constructors; Need of Operator Overloading, Prefix
and Postfix, Overloading Binary Operators, Unary Operator Overloading,
Overloading Array Operators, New & Delete Operators, Comparison between
Structures and Classes.
Inheritance: Introduction, Derived Classes, Types of Inheritance (Single,
Multiple, Multilevel, Hierarchical, Hybrid), Visibility Modes, Virtual Base Classes,
Abstract Classes, Constructors to Derived Classes, Private, Protected Inheritance,
Container Classes.
17
III
Virtual Functions: Introduction, Pure Virtual Function, Virtual Function in
Derived Classes, Object Slicing. Polymorphism
I/O in C++: C++ Stream, Unformatted & Formatted Console I/O Operations,
Managing O/P with Manipulators.
Advanced Features: Friend Classes, Over Loading << and >> Operator,
Templates Function & Class Templates, Exception Handing, Over Riding; Output
and Input Class Streams, ostream, istream, File Handling.
17
Text Book:
 E. Balaguruswamy, (2006), “Object Oriented Programming in C++”, TMH Publishing Co. Ltd., New
Delhi, 4th ed.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
23
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
Reference Books:
 Jense Liberty Tim Keogh, C++, “An Introduction to Programming”, BPB Publications, New Delhi
 Robert Lafore, (2006), “OO Programming in C++”, Galgotia Publications Pvt. Ltd., Daryaganj, New
Delhi.
 Stephen Parata, (1996), “C++ Premier by”, TMH Publishing Co. Ltd., New Delhi 1st ed.
Outcome: After completion of course, student will be able to:

Apply C++ features to program design and implementation.

Explain object-oriented concepts and describe how they are supported by C++ including identifying
the features and peculiarities of the C++ programming language.

Use C++ to demonstrate practical experience in developing object-oriented solutions.

Design and implement programs using C++.

Analyse a problem description and design and build object-oriented software using good coding
practices and techniques.
 Implement an achievable practical application and analyse issues related to object-oriented
techniques in the C++ programming language.
 Use common software patterns in object-oriented design and recognise their applicability to other
software development contexts.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
24
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA3002: MIS & E-COMMERCE
Objective: The objective of this course is that to make students know how MIS assist managers in making
strategic, tactical and operational decisions in an efficient and productive manner.
Credits: 04
Semester III
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
MIS: Introduction, System Implementation, MIS Framework, Importance,
Concepts, Management, Information, System Definition; IT- Nature, Scope,
Characteristics and Function.
Structure & Classification: Physical Components, Processing Functions,
Decision Support, Classification of MIS, DSS, ESS, OAS, RES, Various Information
System.
Decision Making and MIS: Types, Level, Utility.
18
II
Management of Information System: Implementation, Planning,
Organization & Development, User Training, Testing, Changeover, Procedures,
Evaluation.
Information System Planning: Mission, Objectives, Strategies, Policies,
Resource Allocation, Project Planning.
17
III
Introduction: Elements of e-Commerce, Types, Advantages & Disadvantages of
e-Commerce.
e-Business: e-Business vs. e-Commerce, EDI.
Electronic Payment System: Overview, Electronic or Digital Cash, Electronic
Check & Benefits, Online Credit Card Based System, Debit Card, Smart Cards.
Security and Application: Need of Computer Security, Security Strategies,
Firewalls and Network Security, Types of Firewalls, Transaction Security,
Cryptography, Public Key Encryption, Private Key Encryption, Digital
Signatures, Digital Certificates, Secure Electronic Transaction (SET).
17
Text Book:

Ravi Kolkata & A.B. Whinstone, (2006), “Frontiers of Electronic Commerce”, Pearson Education,
New Delhi.
Reference Books:

W.S Jawadekar, (2007), “Management Information Systems”, TMGH, New Delhi.3rd.ed.

Bharat Bhaskar, (2007), “Electronic Commerce”, Framework Technologies and Applications, Tata
McGraw Hill, New Delhi, 2nd ed.

Agrawal Kamlesh, N and Agarwala Deeksha, “Introduction to the E-Com.”, Macmillan India
Outcome:: At the completion of this course students will be able to:
 Understand the role of computers in management and data processing.
 Students will have exposure of E commerce.
 Its basic foundations and their role in existing business fields.
 Types of security strategies laid down over world wide web.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
25
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA3003: COMPUTER ORGANIZATION AND ARCHITECTURE
Objective: The objective of this course is that the students will understand the conceptualize the basics of
organizational and architectural issues of a digital computer and to analyze performance issues in processor
and memory design of a digital computer. To understand various data transfer techniques in digital
computer.
Credits: 04
Semester III
L–T–P: 3–1–0
Module
No.
Content
Teaching
Hours
I
Introduction to Computer Organization and Computer Architecture:
Introduction, Von-Neumann and Harvard Architecture; Register Transfer
Language, Register Transfer, Bus and Memory Transfer; Micro operations:
Arithmetic, Logic Micro Operations and Shift Micro Operations, Macro
Operations; Instruction Code, Computer Registers.
Computer Instructions: Instruction Types, Memory Reference Instructions,
Input-Output, Instruction Cycle, Timing and Control; Interrupts, Types of
Interrupt, Interrupt Cycle.
14
II
Introduction to CPU: General Register Organization, Stack Organization,
Instruction Formats, Addressing Modes, RISC vs. CISC, Parallel Processing,
Applications,
Pipelining: Arithmetic Pipeline, Instruction Pipeline, Pipeline Difficulties and
Resolution, Vector Processing and its Applications; Flynn’s Classification,
Control Unit, Micro-Programmed Control, Data Path Design, Bus Organization.
13
III
Peripheral Devices, Input Output Interface, Asynchronous Data Transfer.
Modes of Transfer: Programmed I/O, Interrupt I/O, Direct Memory Access
(DMA); Memory Hierarchy;
Cache memory: Locality of References, Types of Cache, Characteristics,
Mapping of Cache, Cache Coherency Problem.
13
Text Book:

M. Morris Mano, (2007), “Computer System Architecture”, Publication- PHI, New Delhi, 3rd ed.
Reference Books:


Carl Hamacher, (2002), “Computer Organization”, McGraw Hill, New Delhi, 5th ed.
John P. Hayes, (1998), “Computer Architecture and Organization” McGraw-Hill. New Delhi, 3rd ed.
Outcome: After completion of course, student will be able :
 To understand basic structure of computer and to perform computer arithmetic operations.
 To understand control unit operations and to design memory organization that uses banks for
different word size operations.
 To understand the concept of cache mapping techniques and to understand the concept of I/O
organization.
 To conceptualize instruction level parallelism.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
26
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA3004: DISCRETE STRUCTURE & GRAPH THEORY
Objective: The objective of this course is that students will be able to explain and apply the basic methods of
discrete (non continuous) mathematics, these methods are used in subsequent courses in the design and
analysis of algorithms, computability theory, software engineering, and computer systems.
Credits: 04
Semester III
L–T–P: 3–1–0
Module
No.
Content
Teaching
Hours
I
Propositions – Logical connectives , Compound propositions , Conditional and
biconditional propositions, Truth tables , Tautologies and contradictions,
DeMorgan’s Laws ,
Rules of inference, Validity of arguments.
Predicates –Quantifiers, Universe of discourse, Logical equivalences and
implications for quantified statements, Theory of inference, the rules of
universal specification and generalization Validity of arguments.
14
II
Sets – Introduction and algebra of sets, venn digram, Principle of inclusion and
Exclusion.
Relation- Introduction, types and properties.
Introduction to Recurrence Relation, Linear recurrence relations with constant
coefficients, Homogeneous solutions, Particular solutions, Total solutions,
Generating functions, Solution of recurrence relation by the method of
generating functions
13
III
Graphs – Introduction, Sub graphs, Isomorphism, Walks, Paths, Circuits
Connectedness, Components, Euler Graphs, Hamiltonian Paths and Circuits
Trees – Properties of trees, Distance, Centers, radius and eccentricity in Tree,
Rooted and Binary Trees.
Incidence matrix Circuit Matrix, Path Matrix, Adjacency Matrix. Spanning tree –
Finding all Spanning Trees of a Graph, Set of Fundamental Circuits, Cut
Vertices, Dijkstra’s Algorithm, Prim’s Algorithm, Kruskal’s Algorithm
13
Text Book:

Satendra Bal Gupta, (2008), Discrete Mathematics 5th edition, Laxmi publication. New delhi.
Reference Books:



D.K. Gupta ,Discrete Mathematics , KNRN Publishing, Delhi.
Narsingh Deo Graph Theory, PHI, New Delhi.
Adesh K. Pandey, S.K. Kataria, (2007), Discrete structure, Sons Publishing, New Delhi.
Outcome: After completion of course, student will be able to:





Use logical notation to define and reason about fundamental mathematical.
Concepts such as sets, relations, functions, and integers.
Synthesize induction hypotheses and simple induction proofs.
Apply graph theory models of data structures and state machines to solve problems of
Connectivity and constraint satisfaction, for example, scheduling.
Calculate numbers of possible outcomes of elementary combinatorial processes such as
permutations and combinations.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
27
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
AHS1001: ENVIRONMENTAL STUDIES
Objective: To create awareness in every Graduating student about the importance of environment, the
effect of technology on the environment, ecobalance and make them sensitive towards environmental
concerns for their Professional Endeavours.
Credits: 04
Semester III
L–T–P : 4–0–0
Module
No.
Content
Teaching
Hours
I
Introduction & Concept of Ecosystem
Environment: Definition, Scope, Importance, Natural Resources
Forest Resources: Use & Over-Exploitation, Deforestation, Timber Extraction,
Mining, Dams & their Effects on Forest & Tribal People,
Water Resources, Mineral Resources, Food Resources, Energy, Land Resources.
Ecosystem: Concept, Structure & Function, Producers, Consumers &
Decomposers; Energy Flow in the Ecosystem, Ecological Succession, Food
Chains, Food Webs & Ecological Pyramids.
18
II
Types of Ecosystem & Environmental Pollution: Introduction, Types,
Characteristics, Features, Structure & Functions of - Forest Ecosystem,
Grassland Ecosystem, Desert Ecosystem & Aquatic Ecosystems- Ponds,
Streams, Lakes, Rivers, Oceans, Estuaries.
Definition, Causes, Effects & Control Measures of - Air Pollution, Water
Pollution, Land/ Soil Pollution, Marine Pollution, Noise Pollution, Thermal
Pollution, Nuclear Hazards.
Solid Waste Management: Causes, Effects & Control Measures of Urban &
Industrial Wastes.
Disaster Management: Floods, Earthquake, Cyclone & Landslides.
17
III
Human Population & the Environment, Social Issues & the Environment:
Population Growth, Variation Among Nations.
Population Explosion: Family Welfare Programme, Environment & Human
Health, Human Rights.
Value Education, HIV/AIDS, Women & Child Welfare, Role of Information
Technology in Environment & Human Health From Unsustainable to
Sustainable Development, Urban Problems Related to Energy.
Climate Change: Global Warming, Acid Rain, Ozone Layer Depletion, Nuclear
Accidents & Holocaust; Water Conservation, Rain Water Harvesting, Watershed
Management Environmental Protection Act, Air (Prevention & Control of
Pollution) Act, Water (Prevention & Control of Pollution) Act, Wildlife
Protection Act, Forest Conservation Act.
17
Text Book:

K.M. Gupta, (2009), “Environmental Studies”, Umesh Publications, New Delhi, 2nd ed.
Reference Books:



Prof. Devendra S. Bhargava, (2005), “Foundation of Environmental Studies”, Galgotia Publications
Pvt. New Delhi, 1st ed.
S. Deshwal & A. Deshwal, (2010), “Environmental Ecology”, Dhanpat Rai & co. New Delhi.
M. Anji Reddy, (2008), “Textbook of Environmental Science & Technology”, BS Publications,
Hyderabad.
Outcome: At the end of this course, the student is expected to understand about the constitution of
environment, precious resources in the environment and their conservation & role of human being in
maintaining eco-balance by promoting practices for sustainable development.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
28
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA3081: C++ PROGRAMMING LAB
Objective: As part of this course, students will be able to
 Introduced to programming concepts and techniques.
 Write computer programs to solve practical engineering problems.
 Design efficient computer programs to solve practical engineering problem.
 Introduced to C++ language syntax.
 Learn control statements, loops, functions, and arrays.
 Write programs for a wide variety problems in math, science, financials, and games.
 Analyze and design programs.
Credits: 02
Module
No.
I/II/III
Semester III
L–T–P: 0–0–4
Content
Basic of C++
• if statement
• if else statement
• switch case statement
• for loop
• while loop
• do while loop
Functions in C++
• Function declaration and definition
• Function Overloading
Introduction of Classes and Objects
• Program to create class and objects
Operator overloading and Friend function
• Overload Unary operator.
• Overload Binary operator.
• Friend Function: Program to access the member of one class
• Operator Overloading: Unary & Binary operator overloading with friend function
Inheritance
• Simple inheritance
• Hierarchical Inheritance
• Hybrid Inheritance.
Virtual Functions
• To use the same function name in Inheritance using virtual function
I/O in C++
• Use of various manipulators.
• Use of different IOS class Functions For formatting of output.
Advanced Features
• Template function & classes
• Try & Catch Function in Exception Handling
Lab
Hours
48
Text Book:
 E. Balaguruswamy, (2006), “Object Oriented Programming in C++”, TMH Publishing Co. Ltd., New
Delhi, 4th ed.
Reference Books:
 Jense Liberty Tim Keogh, C++, “An Introduction to Programming”, BPB Publications, New Delhi.
 Robert Lafore, (2006), “OO Programming in C++”, Galgotia Publications Pvt. Ltd., Daryaganj,
New Delhi.
Outcome: Upon completion of this course, students should be able to:


Explain how an existing C++ program works.
Discover errors in a C++ program and describe how to fix them.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
29
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)








Critique a C++ program and describe ways to improve it.
Analyze a problem and construct a C++ program that solves it
Analyze and design strategies for solving basic programming problems.
Use primitive data types, selection statements, loops, functions to write programs.
Develop programs to solve a variety of problems in math, science, business, and games.
Use the step-wise refinement approach.
Use arrays to store, process, and sort data.
Use an IDE to develop programs.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
30
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
AHE3082: SOFT SKILLS & PERSONALITY DEVELOPMENT
Objective: The course has been designed to help students know their inherent strengths & weaknesses, to
build confidence and belief in what they are doing and to prepare them to face the world at large
successfully.
Credits: 02
Semester III
L–T–P: 0–0–4
Module
No.
Content
Lab
Hours
I
Introduction: What are Soft Skills? What are Hard Skills? What is Preferred Over
the Other? Important Soft Skills: Leadership, Team Spirit, Group Organization,
Motivation, Attitude, Self Development, Self-Esteem, Interpersonal & Behavioral
Skills, Critical Thinking, Analytical Abilities, Positive Work Ethics, Cooperation &
Coordination, Awareness.
Effective Communication: Important Factors in Communication, Overcoming
the Tentative Barriers, Purpose Of Communication: Breaking the Ice, Face-toFace Conversation, Telephonic Conversation, Role Plays (Situational), Describing
Common People, Objects, Daily Incidents, Interpreting Pictures, Documentaries &
Cartoons, News Discussion. British & American Vocabulary.
20
II
Time Management: What is Time Management? Importance of Time in the
Professional World, Challenges, Identifying Priorities, Prioritizing Priorities,
Multitasking, Time Management and Pressure Handling.
Conflict Handling: What is Conflict?
Characteristics, Advantages and
Drawbacks, Perception and Prejudices; Understanding People, Facilitating
Effective Conflictive Resolution, Functional Strategies.
Problem Solving: Defining & Analyzing a Problem, Generating Solutions,
Choosing the Best Solution & Developing Action Plan.
20
III
The Art of Presentation: Meaning and Importance of Presentation, Analyzing
Different Types of Presentation, How to Make an Effective Presentation, Body
Language, Understanding Kinesics, Proxemics, Gestures, Eye Contact in a
Presentation, Extemporaneous Presentation, Analyzing the Importance of
Presentation Strategies in our Life through the Study of Various Case Studies.
Group Discussions: Concepts of a G.D., Confidence, Structured & Unstructured
G.D, Preparing for GD, Effective G.D Participation, How to give a Good Impact in a
G.D., Useful Phrases, Range of Topics
20
Text Book:

Poyatos, F. Non, “Verbal Communication across Disciplines”, University of New Brunswick.
Reference Books:





Rao, M.S. & Ramana, P.S.V., “Soft Skills for Better Employability”, ICFAI University Press.
Cook, S., “The Effective Manager (e-book)”, IT Governance Publishing
Bhatnagar, Nitin & Mamta Bhatnagar, “Effective Communication and Soft Skills”, Strategies for
Success, New Delhi, Pearson (Dorling Kindersley, India Ltd.)
Mohan, Krishan & NP Singh, “Speaking English Effectively”, New Delhi: Macmillan Publishers India
Ltd.
Rizvi, Ashraf, M., “Effective Technical Communication”, New Delhi, Tata McGraw Hill.
Outcome: At the end of the course, the participant will be able to





Listen and understand English news and documentaries.
Understand and communicate with Standard English speakers.
Make various presentations with different expression.
Narrate/describe an event in English.
Participate confidently and efficiently in various types of group discussions.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
31
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA4001: GUI BASED PROGRAMMING USING VISUAL BASIC
Objective: The objective of this course is to get a simple understanding about procedural and event driven
programming language. Emphasis on writing programs using ActiveX controls, loops, event-driven
programming, methods, arrays and connecting database so that students can develop windows based
applications using Visual Basic.
Credits: 04
Semester IV
L–T–P : 4–0–0
Module
No.
Content
Teaching
Hours
I
Visual Programming Overview and Environment: Graphical User Interface,
Need of Visual Programming, Event Driven Programming, Integrated
Development Environment (Menu Bar, Title Bar, Tool Bar, Tool Box and
Various Types of Windows), Understanding Properties, Methods and Events,
Types of Events, Customize Forms with its Events, Methods and Properties.
Basic Activex Controls: Command Button, Text Box, Label, Check Box and
Option Button and Frame.
18
II
Program Elements and Controls : Variables, Constant, Operators, Data Types,
Statements in VB, Procedures, User Defined Functions, In-Built Functions,
Customizing Focus; Array: Static and Dynamic; Image Control, Picture Box, List
Box, Combo Box, Hscrollbar, Vscrollbar, Drivelistbox, Dirlistbox, Filelistbox,
Timer, Shape, Line, OLE Control and Trapping Run Time Errors.
17
III
Database Controls and Connectivity
Dialog Boxes: Inputbox(), Msgbox() and Common Dialog Boxes, Modules, SDI,
MDI and EDI, Menu Editor, OLE Concepts, Usage of COM & DCOM, Accessing
Data Using Data Access Objects, Data Control, ADODC Control and Grid Control.
17
Text Book:

Evangelos & Petroutsos, (2005), “Mastering Visual Basic 6”, BPB Publication, New Delhi, 1st ed.
Reference Books:



Gary Cornell, (2005), “Visual Basic 6”, Tata McGraw Hill, New Delhi, 20th ed.
Noel Jerke, “Visual Basic 6 (The Complete Reference)”, Tata McGraw Hill, New Delhi.
Eric A. Smith, (1998), “Visual Basic 6 Programming Bible”, Wiley India, New Delhi.
Outcome: Upon completion of this course, the student will be able to:





Identify the differences between the procedural languages and event-driven languages.
Design, create, build, and debug Visual Basic applications.
Explore Visual Basic’s Integrated Development Environment (IDE).
Write Visual Basic programs using object-oriented programming techniques including classes,
objects, methods, instance variables, composition and inheritance and polymorphism.
Write Windows applications using forms, controls, and events.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
32
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA4002: SYSTEM DESIGN & SOFTWARE ENGINEERING
Objective: The aim of the subject is to assist the student in understanding the basic theory of software
engineering, and to apply these basic theoretical principles to a group software development project.
Credits: 04
Semester IV
L–T–P: 3–1–0
Module
No.
Content
Teaching
Hours
I
Introduction: System, Components, Characteristics, Types of Systems, SDLC;
Software characteristics, Software Crisis, Software engineering definition.
Software Life Cycle Models: Waterfall, Incremental, Iterative Enhancement,
Prototype, RAD and Spiral Models.
Software Requirements Analysis & Specifications: Requirement
Engineering, Requirement, Elicitation Techniques Like FAST, QFD,
Requirements Analysis Using DFD, Data Dictionaries & ER Diagrams, Decision
Tree, Decision Table, Requirements Documentation, SRS.
14
II
Software Project Planning: Size Estimation like Lines of Code & Function
Count, Cost.
Estimation Models: COCOMO (Basic, Intermediate and Detailed), Putnam
resource allocation model, Software Risk Management.
Software Design: Cohesion & Coupling, Classification of Cohesiveness &
Coupling, Function Oriented Design, Object Oriented Design, Structure chart.
Coding: Coding style, Correctness of Coding.
Software Metrics: Software Measurements, Token Count, Halstead Software,
Measures.
13
III
Software Reliability & Quality: Introduction of Mc Call’s & Boehm’s Quality
Model, Capability Maturity Models; Software Reliability Models: Basic
Execution Time Model and Logarithmic Poisson Execution Time Model.
Software Testing: Testing Process, Design of Test Cases, Types of Testing,
Functional Testing, Structural Testing, Test Activities, Unit Testing, Integration
Testing and System Testing.
Software Maintenance: Management of Maintenance, Maintenance Process;
Maintenance Cost Estimation: Belady and Lehman Model, Boehm Model;
Regression Testing, Software Configuration Management; Implementation,
Introduction to Reengineering and Reverse Engineering.
13
Text Book:
 P Jalote, (2006), “Integrated Approach to Software Engineering”, Narosa Book Distributors Pvt.
Ltd, New Delhi, 3rd ed.
Reference Books:






K. K. Aggarwal & Yogesh Singh, (2008), “Software Engineering”, New Age International, 3rd ed.
R. S. Pressman, (2001), “Software Engineering – A Practitioner’s Approach”, McGraw Hill Int., 5th
ed.
Stephen R. Schach, (1996), “Classical & Object Oriented Software Engineering”, IRWIN.
James Peter, W. Pedrycz, “Software Engineering: An Engineering Approach”, John Wiley & Sons.
I. Sommerville, (2004), “Software Engineering”, Addison Wesley, New Delhi, 7th ed.
Outcome: Upon successful completion of this course you should be able to:
 Explain and apply the main aspects of software engineering.
 Evaluate requirements for a software system.
 Apply the process of analysis and design using modern approach.
 Work effectively in a team to analyze the requirements of a complex software system, and solve
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
33
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)


problems by creating appropriate designs that satisfies these requirements.
Communicate effectively with others, especially regarding the progress of the system development
and the content of the design by means of reports and presentations.
Recognise and describe current trends in the area of software engineering.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
34
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA6101: COMPUTER NETWORKS AND COMMUNICATION
Objective: This course is to provide students with an overview of the concepts and fundamentals of data
communication and computer networks.
Credits: 04
Semester IV
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Introductory Concept: Data Communication, Concept, Advantages and
Disadvantages of Computer Network, Line Configuration, Topology,
Transmission Mode, Categories of Networks; OSI Reference Model and
Functions of Layers; Signals - Analog and Digital, Bandwidth, Periodic and
Aperiodic Signals; Transmission Media, Modem, Encoding and Modulation
Technique.
18
II
Multiplexing Techniques, Error Detection and Correction Method in Network,
Data Link Control, Switching Techniques, Integrated Service Digital Network,
Networking and Internetworking Device.
17
III
Routing Algorithm: Link State and Distance Vector Routing; Responsibilities
of Transport Layer, TCP/IP Protocol Suite, IP Addressing, Upper OSI
Layers(Session, Presentation And Application),Comparison of OSI & TCP/IP.
17
Text Book:

Behrouz A . Frouzan, (2007), “Data communication and network”, TMH, 6th ed.
Reference Books:


Tanenbaum A. S., (2007), “Computer Networks”, Edition, Pearson Education, 4th ed.
Stallings W., (2007), “Data and Computer Communication”, TMH 8th ed.
Outcome: After completion of this course the student will be able to:
 Understand basic computer network technology.
 Understand and explain Data Communications System and its components.
 Identify the different types of network topologies and protocols.
 Enumerate the layers of the OSI model and TCP/IP. Explain the function(s) of each layer.
 Identify the different types of network devices and their functions within a network.
 Understand and building the skills of subnetting and routing mechanisms.
 Familiarity with the basic protocols of computer networks, and how they can be used to assist in
network design and implementation.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
35
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BBA2002: ORGANIZATIONAL BEHAVIOR
Objective: The objective of this course is that the students will:
 Understand the basic concepts in organizational behavior.
 Gain an understanding about how to manage various issues related to managing employee
emotions inside the organization.
Credits: 04
1.
Semester
IV
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Introduction: Meaning & Nature of Organizational Behavior, Contributing
Disciplines, Organizational Models, Challenges & Opportunities of OB.
Personality: Meaning & Importance, Determinants of Personality.
Perception: Meaning, Perceptual Process, Factors Influencing Perception,
Perceptual Distortion.
Attitude: Meaning, Components, Factors in Attitude Formation.
18
II
Learning: Meaning, Factors Affecting Learning, Theories of Learning.
Motivation: Meaning & Concept, Primary & Secondary Motive, Theories,
Concept of Morale.
Group Dynamics: Formal & Informal Groups, Stages of Group Development,
Group v/s Team, Types of Team, Creating Effective Teams, Group Decision
Making.
17
III
Conflicts: Concept & Meaning, Different Levels of Conflict, Conflict Resolution.
Stress: Potential Sources, Consequences & Coping Strategies.
Organizational Change: Concept, Resistance to Change, Overcoming
Resistance to Change.
Organizational Development: Concept & Characteristics of OD, Benefits &
Limitations of OD.
17
Text Book:

Stephen P. Robbins, (2005), “Organizational Behaviour”, Pearson Education, New Delhi, 11th ed.
Reference Books:



L M Prasad, (2008), “Organizational Behaviour”, Sultan Chand & Sons, New Delhi, 4th ed.
Udai Pareek, (2009), “Understanding Organizational Behaviour”, Oxford, New Delhi, 2nd ed.
Fredrick Luthans, (2005), “Organizational Behaviour”, Tata McGraw Hill, New Delhi, 10th ed.
Outcome: After completion of course, student will be able to:





Understand the importance of various models of organizational behaviour.
Analyze how we perceive ourselves and others through social identity.
Practical implications of motivational theories relating to need, drives , motivation of employees.
Learn how to create effective teams for success of Organizations today.
Plan and implement individual coping strategies for stress during Organizational changes.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
36
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
AHM4002: NUMERICAL AND STATISTICAL TECHNIQUES
Objective: The objective of this course is that the students will understand some basic ideas and concepts,
that are important throughout the course ,such as the practical form of algorithms, the estimation of errors.
Credits: 04
Semester IV
L–T–P : 3–1–0
Module
No.
Content
Teaching
Hours
I
Numerical Techniques I
Solution of Algebraic & Transcendental Equations: Bisection, Regula–Falsi,
Newton–Raphson Methods and their Order of Convergence.
Interpolation: Finite Differences, Relation Between Operators, Missing Term
Technique, Newton Forward and Backward Difference Interpolation Formulae,
Lagrange’s Interpolation Formula, Newton’s Divided Difference Formula.
13
II
Numerical Techniques II
Numerical Integration: Newton–Cote’s Quadrature Formula, Trapezoidal
Rule, Simpson’s 1/3rd and 3/8th Rules, Boole’s,Weddle’s Rule.
Numerical Solution of Ordinary Differential Equations: Picard, Euler,
Improved Euler, Modified Euler and Runge–Kutta IV Order Method.
13
III
Statistical Techniques
Curve–Fitting: Method of Least Squares, Fitting of Straight Lines, Polynomials
and Exponential Curves etc.; Correlation, Linear Regression Analysis, Binomial,
Poisson and Normal Distributions.
Testing of Hypothesis: Sampling, Level of Significance, Type I and II Errors, t –
Test, 2 Test as a Goodness of Fit and as a Test of Independence.
14
(13)
Text Book:

Goyal M., “Numerical Methods and Statistical Techniques using C”, Laxmi Publications.
Reference Books:




Jain, Iyenger, Jain, “Numerical Methods for Sci. & Engg. Comput..”, New Age International.
Sastry S.S., “Introductory methods of Numerical Analysis”, PHI.
Conte, de Boor, “Elementary Numerical Analysis, an Algorithmic Approach”, TMH.
Gupta and Kapoor, “Fundamentals of Mathematical Statistics”, Sultan Ch. & Sons.
Outcome:: After completion of course, student will be able to:
 Understand the concepts of error estimation.
 Implement the knowledge to use the algorithm to write a corresponding program in a CAS, such as
Maple , Mathematica , Matlab , in Fortran , C ,
selecting suitable routines from a software.
 Design the computation.
 Interpreting the results in physical or other terms , also deciding to reruin if further results are
needed.
 Understand, appreciate and effectively explain the predictions, decisions , and actions , for instance
,in planning productions, buying equipment, investing in business projects, and so on.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
37
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA4081: VISUAL BASIC PROGRAMMING LAB
Objective: The objective of this course is to help the students in finding solutions to various real life
problems and converting the solutions into computer program using Visual Basic (Event Driven
programming).
Credits: 02
Semester IV
L–T–P : 0–0–4
Module
No.
Content
Lab
Hours
I/II/III
Basic of Visual Basic
• Tool Box, Tool Bar
• Project Window, Form Window, Property Window and Code Window
• Form Layout Window and Immediate Window
• Properties of Label, Text Box, Command Buttons, Option Buttons, Frame and
Check Box Controls
• Events
Programming based on conditional statements
• If statement , If… Else statement , If…Else Ladder , Switch Case statement
Programming based on loops
• For…Loop , While… Loop, Do…While Loop , While…Wend , Repeat…Until
Programming based on ActiveX Controls
• Label, Text Box, Command Buttons
• Option Buttons, Check Box and Frame
Programming based on user defined procedure and function
Programming based on function-call by value and call by reference
Programming based on In-Built functions
• String , Date
Programming based on Array
• Static array , dynamic array
Programming based on Controls
• Image Control , Picture Box , List Box and Combo Box
• Hscroll Bar and Vscroll Bar
• Drivet, DirList, FileListbox
• Timer and Shape , Line , OLE
Programming based on run time errors handling
Programming based on Dialog boxes
• Implementation of Msgbox( ) , Implementation of Inputbox( )
Programming based on Menu Editor
Programming on Data Control
Programming based on Data Access Object(DAO)
• Implementation of insertion, deletion, updation and searching operations
• Implementation of MoveFirst(), MoveLast(),MoveNext() methods
Programming based on ADODC
Programming based on Grid Control
48
Text Book:
 Evangelos & Petroutsos, (2005), “Mastering Visual Basic 6”, BPB Publication, New Delhi, 1st ed.
Reference Books:
 Gary Cornell, (2005), “Visual Basic 6”, Tata McGraw Hill, New Delhi, 20th ed.
 Noel Jerke, “Visual Basic 6 (The Complete Reference)”, Tata McGraw Hill, New Delhi.
Outcome:: Upon successful completion of this course, students will be able to:
 Design, create, build and debug Visual Basic applications.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
38
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)








Write and apply loop structures to perform repetitive tasks.
Create one and two dimensional arrays for sorting, calculating and displaying of data.
Know about procedures, sub-procedures, and functions to create manageable code.
Use the debugger in the Visual Basic environment to set breakpoints, program step, procedure step,
and display any program variable.
Implement form objects including control arrays, text boxes, message boxes, dialog boxes, labels
controls, menus, frames, picture boxes and combo boxes.
Students will learn about event driven programming and database access.
Identify and perform the steps necessary to convert Visual Basic programs to executable files that
will run in the Windows environment.
Create software with 2 tier or 3 tier architecture.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
39
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
AHE4082: PROFESSIONAL COMMUNICATION & BEHAVIOURAL
GROOMING
Objective: The course, being the last input in the series given to the student, is more placement-oriented
than its predecessors. It aims to inculcate the applications of English language in the students. It further
explores the ways to improve the ability of the students to present themselves in front of any group or an
individual confidently. The syllabus also tries to enhance the competitive abilities of the students by
providing them exposure to the content and exercises practiced in such exams.
Credits: 02
1.
Semester
IV
L–T–P : 0–0–4
Module
No.
Content
Lab
Hours
I
Applied Grammar
Tenses: Their Role and Correct Usage, Subject-Verb Agreement.
Voices: Active & Passive, Clauses, Conjunctions, Prepositional Phrases,
Transformation, Synthesis, Syntax, Conditional Sentences; Analyzing and
Correcting Errors in Sentences.
18
II
Reading & Writing Skills
Reading Comprehension, Letter Writing: Inquiries and their Replies, Placing
and Cancelling Orders, Adjustment Letters, Accepting and Rejecting Offers,
Resume & C.V. Writing, Business Report Writing, Application, Precise Writing,
e-Mail Writing.
Vocabulary: Extension Methods, Synonyms, Antonyms, One Word
Substitution, Words often Confused Idioms & Phrases.
17
III
Group Strategies & Group Discussion: GD Vs Debate, Practice of Abstract
Topics.
Interviews: What is an Interview?, Types of Interviews, Preparing for
Interviews, Drills Required for Interviews, Potential Interview Questions, Mock
Interview Activities.
Case Study: Requirement & Significance in Professional and Personal Spheres
of Life, Important Tips for Preparing a Case Study.
17
Text Book:

Martin, H. & Waren, P. C., (2006), “English Grammar & Composition”, S. Chand & Co. New Delhi.
Reference Books:




Sharma,S.D., “Text of professional Communication Skills and ESP for Engineers and Professionals”,
Sarup & Sons, New Delhi.
Hornby, A.S., “Advanced Learner’s Dictionary of Current English”, OUP.
Murphy, Raymond, “Intermediate English Grammar”, Cambridge University Press.
Rizvi, Ashraf, M., “Effective Technical Communication”, Tata McGraw Hill, New Delhi.
Outcome: At the end of the course, the participant will be able to --
Handle the challenges of competitive environment.

Impart a reading habit and improve their formal writing.

Listen and understand English news and documentaries.

Understand and communicate with Standard English speakers.

Understand and tell jokes and stories with different expression.

Narrate/describe an event in English.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
40
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA5001: CORE JAVA
Objective: The objective of this course is that the students will understand the foundation of good
programming skills by discussing key issues to the design of object-oriented programming. Cover issues
related to the definition, creation and usage of classes, objects and methods to understand and apply various
object oriented features like inheritance, data abstraction, encapsulation and polymorphism.
Credits: 04
Semester V
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Introduction: Introduction to Java, History of Java, Features of Java,
Importance of Java, Byte Code, JVM, JRE, JDK,JIT, Java Implementation,
Application of Java, Sample Program & Compilation, Lexical Issues (White
Space, Identifiers, Literals, Comments, Separators, Keyword).
Data Type, Operators, Control Structures: Variables, Constants, Declaration,
Literals, Scope of Variable, Type Casting, Arithmetic Operators, Relational
Operators, Logical Operators, Assignment Operator, Dot Operators, Control
Statements.
Array: Declaration, Creation, Initialization, Length, Two-Dimensional Arrays,
String-String Arrays, String Methods, Command-Line Arguments.
18
II
Introduction of Classes, Objects and Methods: Defining Class, Adding
Variables, Adding Methods, Creating Objects, Constructors, Keyword this &
static, Garbage Collection, finalize( ) Method, Accessing Class Members, final
Variables and Methods, finalizer Methods, Visibility Control Public Access,
Friendly Access, Protected Access, Private Protected Access, String Class,
Keyword final, Introduction to Object Class.
Inheritance: Inheritance, Member Access, Super Class, Creating Multilevel
Hierarchy, Method Over Loading & Overriding, Abstract Class.
Packages And Interfaces :
Defining Packages, Access Protection, Importing Packages, Defining Interfaces.
17
III
Exception Handling: Exception Types, Multiple Catch Clauses, Nested Try
Statements, Throw, Throws, Finally, Java’s Built-in Exceptions, Creating Your
Own Exception Subclasses.
Multithreaded Programming: Thread Life Cycle, Creating Threads, Thread
Methods, Thread Priority, Thread Synchronization.
Introduction to Applet Programming- Applet Life Cycle, Applet Methods.
17
Text Book:

Naughton Patrick,Schild Herbertz, (2011), “The Complete Reference –Java”, TMH Publication, 7th
ed.
Reference Books:



Naughton Patric, Morrision Michel, (2006), “Java Hand Book”, Osborne/McGraw-Hill, 5th ed.
Balaguruswami E., (2007), “Programming with Java”, TMH, 3rd ed.
Decker & Hirshfied, (2000), “Programming Java”, Vikas Publication 2nd ed.
Outcome: After completion of course, student will be able to:
 Understand the concept of OOP as well as the purpose and usage principles of inheritance,
polymorphism, encapsulation and method overloading.
 Identify classes, objects, members of a class and the relationships among them needed for a specific
problem.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
41
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA5002: WEB TECHNOLOGY
Objective: This course is designed to provide a comprehensive study of
 Understand the evolution of the Internet and the WWW and its underlying web technologies.
 Understand the design concepts of static and dynamic web pages.
 Understand the design concepts of web design. creative and effective web design.
 Apply a creative web design using client-side markup and scripting languages such as HTML, CSS
VBScript and JavaScript.
Credits: 04
Semester V
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Introduction to Web Designing: Web Page, Website, Web Browser, WWW,
Internet, e-Mail
Overview of HTML: HTML Markup Tags, Linking, Tables and Form.
Form Controls: Text Field, Password Field, Multiline Text Area, Drop Down
List, Check Box, Radio Buttons, Scrolled List, Reset Button, Submit Button, File
Field etc.
Overview of DHTML: Introduction, Document Object Model (DOM),
Introduction to Cascading Style Sheets (CSS).
18
II
VB Script: Introduction, Adding Script to Documents, Data types, Operators.
Variables: Global & Local Variables, Input and Output Statements, Built in
Functions, Arrays.
Control Statements: if statement, if-then-else, Nested if, Select case Statement.
Looping Statements: for…next, do-while, do-until Statements.
Events in VB Script
17
III
JAVA Script: Introduction, Adding Script to Documents, Data Types,
Operators, Variables, Input and Output Statements, Built in Functions, Arrays, if
Statement, switch Statement.
Looping statements: while, do-while, for Statement.
Events in JavaScript.
17
Text Book:

Bates, Chris, (2006), “Web Programming – Building Internet Application”, Wiley-Dream tech, 3rd
ed.
Reference Books:




Holzener, Steven, (2001), “Inside XML”, Tech-media publication, 1st ed.
Bergstan, Hans, (2004), “Java Server Page”, O’Reilly Publication, 3rd ed.
Burdman, Jessica, (2000), “Collaborative Web Development”, Addison Wesley.
Stalling, William, (2011), “Cryptography and networks security: Principles and Practice” Prentice
Hal, 5th ed.
Outcome: After completion of course, student will be able to:
 Understand the concepts of www, evolution of www and internet and various client server
architecture.
 Understand the concept of HTML and various tags of html.
 Understand the concept of adding style in html document.
 Understand the design of web site using JavaScript.
 Understand the design of web site using JavaScript.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
42
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA5003: DESIGN & ANALYSIS OF ALGORITHMS
Objective : The objective of this course is to study paradigms and approaches used to analyze and design
algorithms and to appreciate the impact of algorithm design in practice. It also ensures that students
understand how the worst-case time complexity of an algorithm is defined, how asymptotic notation is used
to provide a rough classification of algorithms, how a number of algorithms for fundamental problems in
computer science and engineering work and compare with one another, and how there are still some
problems for which it is unknown whether there exist efficient algorithms, and how to design efficient
algorithms.
Credits: 04
Semester V
L–T–P: 3–1–0
Module
No.
Content
Teaching
Hours
I
Basic of Algorithm Analysis: Analyzing Algorithms, Worst Case and Average
Case Analysis, Asymptotic Notations (Omega, Theta, Big "Oh", Little "Oh", Little
Omega).
Recurrences: Substitution Method, Recursion Tree Method, Master Method.
Divide and Conquer Method: Binary Search, Merge Sort and Quick Sort.
Sorting in Linear Time: Radix Sort and Insertion Sort.
13
II
Graph Algorithms: Elementary Graph Algorithms, Breadth First Search, Depth
First Search.
Minimum Spanning Tree: Kruskal’s Algorithm, Prim’s Algorithm,
Single Source Shortest Path: Dijkstra’s Algorithm.
All Pair Shortest Path: Floyd-Warshall Algorithm, Traveling Salesman
Problem.
Advanced Data Structures: B–Trees.
13
III
Dynamic Programming: Elements of Dynamic Programming, Matrix Chain
Multiplication, Longest Common Subsequence.
Greedy Method: Knapsack Problem, Huffman Coding.
Advanced Data Structures: AVL Tree, 2-3 Tree,2-3-4 Tree
14
Text Book:

Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, (2010), “Introduction to
Algorithms”, Printice Hall of India, 5th ed.
Reference Books:




RCT Lee, SS Tseng, RC Chang and YT Tsai, (2006), “Introduction to the Design and Analysis of
Algorithms”, Mc Graw Hill.
E. Horowitz & S. Sahni, (2007), "Fundamentals of Computer Algorithms", Galgotia Publication Pvt.
Ltd.
Aho, Hopcraft, Ullman, (2008), “The Design and Analysis of Computer Algorithms”, Pearson
Education.
D. E. Knuth, (1998), “The Art of Computer Programming”, Addison Wesley, 3rd ed.
Outcome :
 Learn good principles of algorithm design.
 Learn how to analyse algorithms and estimate their worst-case and average-case behaviour .
 Become familiar with fundamental data structures and with the manner in which these data
structures can best be implemented; become accustomed to the description of algorithms in both
functional and procedural styles.
 Learn how to apply their theoretical knowledge in practice (via the practical component of the
course).
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
43
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
AHM5002: OPERATIONS RESEARCH
Objective: This subject aims to introduce students to use quantitative methods and techniques for effective
decisions–making; model formulation and applications that are used in solving business decision problems.
Credits: 04
Module
No.
Semester V
L–T–P: 3–1–0
Contents
Teaching
Hours
I
Linear Programming :
Introduction, Problem Formulation, Graphical Method.
Transportation Problem :
Formulation and Solution, Transshipment Problem, Formulation and Solution.
Assignment Problem.
13
II
Sequencing :
Introduction, Problems with n Jobs and k Machines, Problems with 2 Jobs and k
Machines (Graphical Solution).
Network Analysis: Floats, CPM and PERT.
13
III
Inventory Control :
Introduction, Types of Inventory, Inventory Decisions, Economic Order
Quantity, Deterministic Inventory Problems, Eoq Problems with Price Breaks.
14
Text Book:
 Gupta P.K. and Hira D.S. (2008), “Operations Research”, S. Chand & Co. Ltd., Delhi, Ist ed.
Reference Books:




Kapoor V.K., (2011), “Operations Research”, Sultan Chand & Sons, Delhi, 8th ed.
Taha H.A., (2008), “Operations Research: An Introduction”, Pearson Education, 6th ed.
Sharma S.D., (2012), “Operations Research”, Kedar Nath Ram Nath Publications, 16th ed.
Col. Cheema G.S. (2005), “Operations Research”, Laxmi Publications (Pvt.) Ltd.
Outcome: Upon successful completion of this course, students will be able to:
 Describe at an intuitive level the process of artificial intelligence and operations research: a realtime cycle of problem understanding, formulation, solution and implementation.
 Formulate simple reasoning, learning and optimization problems, in terms of the representations
and methods presented.
 Understand the theoretical workings of the simplex method for linear programming and perform
iterations of it by hand.
 Understand the relationship between a linear program and its dual, including strong duality and
complementary slackness.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
44
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA5021: ARTIFICIAL INTELLIGENCE
(Elective I)
Objective: The objective of this course is to study the concepts of Artificial Intelligence and methods of solving
problems. It also introduce the concepts of Expert Systems and machine learning.
Credits: 04
Semester V
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Introduction: Introduction to AI, Task Domains of AI, AI Techniques, Search
and Knowledge, Abstraction, Intelligent Agents and its Types.
Problem Solving: State Space Search, Production System, Depth First Search,
Breadth First Search, Heuristic Search (Hill Climbing, Best First Search and
Problem Reduction).
18
II
Knowledge Representation: Approaches, Types and Properties of Knowledge,
Propositional Logic, Properties of Statements, Equivalence Law, Inference
Laws, First Order Predicate Logic, Properties of Wffs, Representation of Facts
in First Order Predicate Logic, Conversion to Clausal Forms, Unification and
Resolution, Scripts and Conceptual Dependency.
17
III
Structural Knowledge Representation: Semantic Network, Partitioned
Semantic Net, Semantic Net for Wffs and Predicate Logic, Property Inheritance
Algorithm, Frame Structures and Concepts of Regular and Meta Classes With
Instance & Isa Relationship.
Expert System: Need and Justification of Expert System, Knowledge
Acquisition, Inference Engine, Learning Procedure and Case Study of MYCIN.
17
Text Book:

Rich & Knight, (2010), “Artificial Intelligence”, TMH, 3rd ed.
Reference Books:



DAN W. Patterson, (2006), “Introduction to AI & Expert Systems”, PHI.
Stuart Russell and Peter Norvig, (2011), “Artificial Intelligence-A Modern Approach”, PHI, 2nd ed.
George F. Luger, (2006), “Artificial Intelligence-Structures and Strategies for Complex Problem
Solving”, Pearson Education / PHI, 4th ed.
Outcome: Upon successful completion of this course, students will be able to:
 Get overview of Artificial Intelligence.
 Know various AI search algorithms (uninformed, informed and heuristic algorithms).
 Understand different types of Artificial Intelligence agents.
 Understand the fundamentals of knowledge representation (logic-based, frame-based, semantic nets)
 Know how to build simple knowledge-based systems.
 Get exposure about Expert system Models.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
45
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA5022: ENTERPRISE RESOURCE PLANNING
(Elective I)
Objective: The objective of this course is to make students:



Understand the business process of an enterprise.
Grasp the activities of ERP project management cycle.
Understand the emerging trends in ERP developments.
Credits: 04
Semester V
L–T–P: 4–0–0
Teaching
Hours
Module
No.
Content
I
ERP: Evolution and Overview of ERP, Features of ERP, Benefits of ERP, Business
Modules in ERP Packages for Large and Medium Sized Manufacturing
Organizations, Business Process Re-engineering (BPR), Relationship Between
ERP & BPR, ERP Vender, ERP Consultants.
18
II
ERP Implementation:
ERP Implementation Lifecycle, Implementation
Methodology, ERP Selection, ERP Implementation Teams, ERP Implementation
Cost, Hidden Cost, Strategies for Successful Implementation, Critical Success
and Failure Factors.
17
III
ERP & Related Technologies, ERP and Internet, ERP and CRM, CRM- Advantages,
Benefits, Challenges, ERP and SCM, Integration of ERP, CRM & SCM, Data
Warehouse & Data Mining, Case Studies.
17
Text Book:

Alexis Leon, (2011), ERP Demystified, Tata McGraw–Hill Publishing Company limited, New Delhi,
2nd ed.
Reference Books:





Brady, (2005), “Enterprise Resource Planning”, Thomson Learning.
Rahul V. Altekar, (2005), “Enterprise wide Resource Planning”, Tata McGraw Hill.
Vinod Kumar Garg and Venkitakrishnan N K, (2007), “Enterprise Resource Planning –Concepts and
Practice”, PHI, 2nd ed.
Imhoff, C. Loftis Lisa & Geiger, G. Jonathan, (2001), “Building the Customer Centric Enterprise, John
Wiley & Sons”, 1st ed.
Shankar, Ravi & Jaiswal, S., (1999), “Enterprise Resource Planning”, Galgotia Publications, 1st ed.
Outcome: Students may able to understand the scope of resource planning and implementation.


Knowledge of ERP implementation cycle.
Awareness of core and extended modules of ERP.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
46
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA5081: JAVA PROGRAMMING LAB
Objective: The objective of this course is that the students will understand fundamentals of programming
such as variables, conditional and iterative execution, methods, etc. It will also provide the foundation of
good programming skills by discussing key issues to the design of object-oriented programming.
Credits: 02
Module
No.
I/II/III
Semester V
L–T–P: 0–0–4
Content
Lab
Hours
Sample java -program execution
Programming based on conditional statements by using java
• if statement
• if else statement
• switch case statement
Programming based on loops by using java
• for loop
• while loop
• do while loop
Programming based on Operators in java
Programming based on Array by using java
Programming based on String and String Buffer
Programming based Command Line argument
Program related to java class and object
Programming based on constructor and method in java
• default
• parameterized
Programming related to java. lang Package
Programming based on polymorphism
• runtime polymorphism
• compile time polymorphism
Programming based on keywords by using java
• static
• final
• super
• this
• abstract
Programming based on Inheritance
• single
• multilevel
• hybrid
Programming based on Interface and Package
Programming based on Exception handling
Programming based on Multithreading
Programming based on Applet
48
Text Book:

Naughton Patrick, Schild Herbertz, (2011), “The Complete Reference –Java”, TMH Publication, 7th
ed.
Reference Books:
 Naughton Patric, Morrision Michel, (2006), “Java Hand Book”, Osborne/McGraw-Hill, 5th ed.
 Balaguruswami E., (2007), “Programming with Java”, TMH, 3rd ed.
 Decker & Hirshfied, (2000), “Programming Java”, Vikas Publication, 2nd ed.
Outcome: After completion of course, student will be able to:
 Use the Java SDK environment to create, debug and run simple Java programs.
 Create Java application programs using sound OOP practices (e.g., interfaces and APIs)
 Able to develop and deploy Applet in java.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
47
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA5082: WEB TECHNOLOGY LAB
Objective: The objective of this course is that students will have the knowledge to
 Design webpage using basic html – formatting tag, linking and image tags.
 Design web document using table creation.
 Design web document using frame creation and form creation.
 Design web document using CSS.
 Design interactive web document using VBScript and JavaScript.
Credits: 02
Semester V
L–T–P: 0–0–4
Module
No.
Content
I/II/III
Basisc of HTML
• HTML head and body
• Markup Tags
• Linking Tags
• Table creation
Form Controls
• Form Creation
• Frame Creation
• Form Controls- Text Field, Password Field, Multiline Text Area, Drop Down List,
Check Box, Radio Buttons, Scrolled List, Reset Button and Submit Button
CSS
• Internal CSS , External CSS
Basic of VBScript
• Adding Script to HTML
• VBScript Variable declaration- Global and Local Variable
• VBScript Operators
• Array Implementation
• User defined Functions , Built in Functions
Control Statements
• If statement , If-then-else , Nested if , Select case Statement
Looping Statements
• For…Next , Do…While , Do…Until Statements
Events
• Events handling
Basic of JavaScript
• Adding Script to HTML
• VBScript Variable declaration- Global and Local Variable
• VBScript Operators
• Array Implementation
• User defined Functions , Built in Functions
Control Statements
• if statement , Switch Statement
Looping Statements
• For statement , While , Do…while
Events
• Events handling
Lab
Hours
48
Text Book:

Bergstan, Hans, (2004), “Java Server Pages”, O’Reilly Publication, 3rd ed.
Reference Books:



Bates, Chris, (2006), “Web Programming – Building Internet Application”, Wiley-Dream tech.
Holzener, Steven, (2001), “Inside XML”, Tech-media publication, 1st ed.
Burdman, Jessica, (2000), “Collaborative Web Development”, Addison Wesley
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
48
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)

Stalling, William, (2011), “Cryptography and networks security: Principles and Practice”, Prentice Hal,
5th ed.
Outcome: After completion of course, student will be able to:
 Design webpage using basic html –formatting tag, linking and image tags.
 Design web document using table.
 Design web document using frame creation and form creation.
 Design web document using html and adding style using CSS.
 Design interactive web document using VBScript.
 Design interactive web document using JavaScript..
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
49
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA4103: COMPUTER GRAPHICS & MULTIMEDIA TECHNIQUES
Objective: The objective of this course is that the students will understand the need of developing graphics
applications and learn the hardware involved in building graphics applications. To learn algorithmic
development of graphics primitives like: line, circle, ellipse, polygon etc. Learn the representation and
transformation of graphical images and pictures. Learn the concept of Color Generation. To understand the
different Multimedia applications.
Credits: 04
Semester VI
L–T–P: 4–0–0
Module
No.
Content
Teaching
Hours
I
Introduction to Computer Graphics : Types of Computer Graphics,
Application Area, Graphics Display Devices-CRT, Raster-Scan Device, Random
Scan Device, Color CRT Monitors-Beam Penetration and Shadow-Masking,
Direct View Storage Tubes, Flat-Panel Displays-Emissive and Non-Emissive,
Character-Generation Method, Frame-Buffer, Color-Lookup Table.
18
II
Interactive Input and Output Devices, Logical Classification of Input Devices;
Interactive Techniques: Echoing, Point-Plotting, Inking, Rubber-Band,
Dragging, Painting and Drawing.
Line-Drawing Algorithms: DDA and Brasenham’s Line Drawing Algorithms,
Mid-Point Circle Algorithm.
Transformation: Translation, Rotation, Scaling, and Reflection.
Polygon: Inside and Outside Test of Polygon.
17
III
Windowing and Clipping: Window, Viewport, Viewing Transformation;
Line Clipping: Cohen-Sutherland Algorithm, Polygon Clipping-Sutherland and
Hodgeman Algorithm, Curve Clipping, Text and Exterior Clipping.
Introduction to Multimedia: Multimedia Information, Multimedia Objects,
Multimedia Application, Multimedia Hardware, Memory & Storage Devices,
Presentation Tools, Video, Sound, Image Capturing, Authoring Tools, Card and
Page Based Authoring Tools; Introduction about Digital Representation of
Sound, Musical Instrument and Digital Interface (MIDI), Digital Video and
Image Compression, JPEG Image Compression, DVD Technology.
17
Text Book:

M. Pauline Baker and Donald Hearn, (2006), “Computer Graphics”, Pearson, New Delhi, 2nd ed.
Reference Books:



Tay Vaughan, (2005), “Multimedia-Making it works”, McGraw-Hill, New Delhi, 7th ed.
Steven Harrington, (1987), “Computer Graphics”, McGraw Hill, New Delhi, 2nd ed.
David F. Rogers, (1997), “Procedural Elements for Computer Graphics”, Tata McGraw Hill, New Delhi,
2nd ed.
Outcome: After completion of course, student will be able:
 To apply the transformation principles, segmentation algorithm and windowing and clipping to
design the effective graphical system.
 To apply the 2D, 3D graphics, projections to evaluate the graphical system.
 To apply animation methods and surface and line removal procedures for effective display of an
image.
 To apply the sound, data streams and MIDI s/w’s to analyze the speech system for effective
multimedia application.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
50
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA6002: .NET FRAMEWORK USING VB .NET
Objective: The course objective is to get familiarize with Microsoft VB.Net technologies. The VB.Net course is
designed to understand the different concepts and features of .NET coding, debugging and developing of
Console, Windows and web applications in terms of Single and Multi-Tier architecture. This course emphasis
on the fundamentals like language syntax, data and file structures, input/output devices, and files as well as
advance feature such asWindows, Webservices, Exception Management, Component Programming etc.
which helps the students of design applications with rapid development approach.
Credits: 03
Semester VI
L–T–P: 3–0–0
Module
No.
Content
Teaching
Hours
I
Introduction to .Net Framework: Architecture of .Net Framework, Features
of .Net, Advantages of .Net, Common Language Runtime, Common Type
System, Common Language Specification, MSIL.
Introduction to Visual Basic.Net IDE: Creating a project, Types of project in
.Net, Exploring and coding a project, Solution explorer, toolbox, properties
window, Output window, Object Browser.
VB.Net Programming Language: Similarities and Differences with Visual
Basic, Variables, Comments, Data Types, Working with Data Structures –
Arrays, Array Lists, Enumerations, Constants, Structures.
14
II
Object Oriented Features: Classes and Objects, Access Specifiers: Private,
Public and Protected, Building Classes, Reusability, Constructors, Inheritance,
Overloading, Overriding, Creating and Using Namespaces.
VB.Net Programming Language: Introduction to procedures, calling
procedures, argument passing mechanisms, scope of variable, conditional
statement, Loops, Nesting of Loops, MsgBox and Input Box.
13
III
GUI Programming: Introduction to Window Applications, Using Form –
Common Controls, Properties, Methods and Events. Interacting with controls Textbox, Label, Button, Listbox, Combobox, Checkbox, Picture Box, Radio
Button, Panel, scroll bar, Timer, ListView, TreeView, toolbar, Status Bar. Dialog
Controls, Creating and Using MDI applications, Toolbar, Status Bar, Creating
custom controls, Creating Menus.
Introduction to ADO: ADO vs ADO.Net, ADO.Net data namespaces, ADO.Net
Object Model, Accessing data from Server Explorer, Creating Connection,
Command, Data Adapter, Data Reader and Data Set with OLEDB and SQLDB,
Data Binding.
13
Text Book:


Visual Basic 2010 programming Black Book, by Kogent Learning Solutions, Wiley India
Visual Basic 2010 Step By Step, Michael Halvorson, PHI.
Reference Books:
 Mastering Microsoft Visual Basic 2010, Evangelos Petroutsos, Wiley Publications
 Beginning Visual Basic 2010 (Wrox).
Outcome: After completion of course, student will be able to:
 Gain an understanding of the Microsoft .NET architecture.
 Gain a working knowledge of the VB.Net programming language and Learn how to build objectoriented applications using VB.Net.
 Gain a comprehensive understanding of the philosophy and architecture of VB.Net programming
 Attain a detailed working knowledge of VB.Net implicit types, object initializers, delegates,
anonymous types &amp; methods, extension methods and many more.
 Acquire a working knowledge of creating and rich console, windows and web aplications using the
.NET Framework 4.0 and Visual Studio 2010.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
51
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
 Configure and deploy a Microsoft Console and Windows application.
 Work with data from multi sources like objects, different form of databases using Language
Integrated Query (LINQ).
 Create flexible views for user interaction with view helpers.
 Learn to manage data access tasks.
 Learn to manage data by windows and web services.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
52
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA6021: ADVANCE JAVA
(Elective II)
Objective: The objective of this course is to cover the basics of creating APIs as well as allow students to
explore the Java Abstract Programming Interface (API) and Java Collection Frame work through
programming assignments.
Credits: 04
Semester VI
L–T–P: 4–0–0
Teaching
Hours
Module
No.
Content
I
String Handling: Predefined Function in String.
Collection Frame Work: List Interface, Set Interface, Stored Set Interface.
Collection Classes: Array List Class, Linked List Class, Hash Set Class, Linked
Hash Set Class, Linked Hash Set Class, Tree Set Class, Accessing a Collection Vis
Iterator, Working with Maps
I/O Files in Java: Concept of Streams, Difference between Character Streams
and Byte Streams.
Applet: Introduction to Applet, Applet Architecture, Applet Lifecycle, Applet
Class, The HTML Applet Tag, Applet Context Class, Passing Parameters to
Applet, Use of Java, awt Graphics Class and its various Methods in an Applet.
18
II
Graphical User Interface: Layout Managers (Flow Layout, Border Layout, Card
Layout, Gridbag Layout, Grid Layout), awt Controls (Labels, Buttons, S Canvases,
Checkboxes, Checkbox Group, Choices, Text Fields, Text Areas, Lists, Scrollbars,
Panels, Windows, Frames, Menus, Menubars).
17
III
Introduction to Servlets: Need for Servlets, Introduction to Servlets, The
Javax, Servlet Package, Life Cycle of a Servlet, Http Servlet Request, Http Servlet
Response, Uploading Files, Concurrency, Deploying Servlets and Servlet
Contexts, Accessing a Servlet Using an HTML Page.
Introduction to JSP: Need for JSP, The JSP Request Response Class;
Connectivity JSP Pages to Data Base.
17
Text Book:
 Naughton Patrick,Schild Herbertz, (2011), “The Complete Reference –Java”, TMH Publication, 7th
ed.
Reference Books:
 Naughton Patric, Morrision Michel, (2006), “Java Hand Book”, Osborne/McGraw-Hill, 5th ed.
 Balaguruswami E, (2001), “Programming with Java”, TMH, 3rd ed.
 Decker & Hirshfied, (2000), “Programming Java”, Vikas Publication 2nd ed.
Outcome: After completion of course, student will be able to:
 Able to use graphical user interface and Event Handling in java.
 Develop programs using the Java Collection API
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
53
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA6022: ADVANCED DATABASE MANAGEMENT SYSTEM
(ELECTIVE II)
Objective: The objective of this course is that the students will understand relational and advanced
database technology for building applications for the current trend & evaluate a business situation and
designing & building database applications.
Credits: 04
Semester VI
L–T–P: 4–0–0
Teaching
Hours
Module
No.
Content
I
Introduction of RDBMS: Relational Algebra, Relational Calculus, Multi-valued
Dependencies and Fourth Normal Form, Join Dependencies and Fifth Normal
Form.
Query Optimization: General Transformation Rules for Relational Algebra
Operations, Heuristic Algebraic Optimization Algorithm, and Cost Optimization
for Query Execution.
18
II
Introduction of Transaction Processing Concepts: Transactions, Properties
& States of Transactions, Read and Write Operations, System Log, Commit Point
of a Transaction, Desirable Properties of Transactions, Need of Concurrency
Control.
Schedule: Serial, Non-Serial and Conflict Serializable Schedules, Uses of
Serializabilty, View Equivalence and View Serializability.
PL/SQL: Function, Procedure, Cursor, Triggers.
17
III
Concurrency Control Techniques: Two Phase Locking Techniques for
Concurrency Control, Concurrency Control Based on Timestamp Ordering.
Deadlock: Deadlock Handling, Deadlock Prevention, Deadlock Detection and
Deadlock Recovery Techniques.
Recovery System: Failure Classification, Storage Structure, Data Access.
17
Text Book:
 Henry F. Korth Abraham Silberschatz, (2006), “Database System Concepts”, McGraw-Hill
International, New Delhi, 5th.ed.
Reference Books:
 Bipin Desai, (2006), “An Introduction to Database System”, West Pub. Co.
 Jeff Parkins and Bryan Morgan, “Teach Yourself SQL in 14 days”.
Outcome: After completion of course, student will be able to:
 Understand the concepts of database structure, data type.
 Implement the knowledge to use this System to manage their own data requirement.
 Be familiar with the relational database theory, and be able to write relational algebra expressions
for queries.
 Be familiar with the basic issues of transaction processing and concurrency control.
 Understand, appreciate and effectively explain the underlying concepts of database technologies
 Normalize a database.
 Declare and enforce integrity constraints on a database using a state-of-the-art RDBMS
 Programming PL/SQL including stored procedures, stored functions, cursors, packages.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
54
Course Curriculum (w.e.f. Session 2015-16)
Bachelor of Computer Applications (BCA)
BCA6081: VB .NET PROGRAMMING LAB
Objective: The student will use Visual Basic.Net to build Windows applications using structured and objectbased programming techniques. Students will be exposed to the following concepts and/or skills at
an introductory concepts level:
 Analyze program requirements
 Design/develop programs with GUI interfaces
 Code programs and develop interface using Visual Basic .Net
 Perform tests, resolve defects and revise existing code.
Credits: 01
Semester VI
Module
No.
L–T–P: 0–0–2
Content

Understanding about VB .NET Integrated Development Environment: How to
create a project, Various types of project developed in VB .NET, Exploring and
Coding a project, Solution explorer, Toolbox, Properties window, Output
window, Object Browser.

Programming in VB .NET: Develop programs related to Data Structures –
Arrays, Array Lists, Enumerations, Constants, and Structures.

Develop programs related to Procedures, Calling procedures, Argument
passing mechanisms, Scope of variable, Conditional statement, Loops, Nesting
of Loops, MsgBox and Input Box.

GUI Programming: Develop various VB .NET Window Applications Using
Windows Form – Common Controls, Properties, Methods and Events,Textbox,
Label, Button, Listbox, Combobox, Checkbox, Picture Box, Radio Button, Panel,
scroll bar, Timer, ListView, TreeView, toolbar, Status Bar. Dialog Controls,
Creating and Using MDI applications, Toolbar, Status Bar, Creating custom
controls, Creating Menus.

Programming using ADO .NET:
Develop various Database Windows
applications using Connection, Command, Data Adapter, Data Reader and Data
Set.
I
Lab
Hours
24
Text Book:


Visual Basic 2010 programming Black Book, by Kogent Learning Solutions, Wiley India
Visual Basic 2010 Step By Step, Michael Halvorson, PHI.
Reference Books:


Mastering Microsoft Visual Basic 2010, Evangelos Petroutsos, Wiley Publications
Beginning Visual Basic 2010 (Wrox).
Outcomes:








Logic Development to analyze the problem and design optimized solution using VB.Net.
Create programs using Visual Basic (VB) code and .NET Framework classes.
Be aware of the latest developments in VB and .NET.
Recognize, describe and use the .NET Framework and its various classes.
Develop applications of various categories like console, windows and web including the designing of
windows and web services in the .NET.
Apply data access technologies from within VB.NET.
Develop simple to intermediate application using .NET, individually and as a team member.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
55