BCA Syllabus

First Semester
Course Name: Programming Concepts Using C Language Subject Code: TBC 101

Program BCA
Name:

1 Contact Hours: 42 L 2 T 1 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Knowledge of Algorithm and Flowchart

7 Subject Area: Programming

8 Objective: To familiarize students with the Methodology of Programming and C

language

9 Course Outcome: A student who successfully fulfills the course requirements will be
able to
CO1 Understand the basic terminology used in computer programming
CO2 Understand efficient use of datatypes, control statements and operators.
CO3 Design solution of computation problems using algorithms, flowcharts
and develop C programs.
CO4 Identify and locate various errors in C programs.
CO5 Organize a complex problem into less complex sub problems and develop
modular application.
CO6 Implement the concept of pointers, string, arrays, structure, derived data
types and other basic construct of C language
10 Details of the Course:
Unit CONTENT CONTACT
No. HOURS
1 Problem Solving Tools: Algorithms: Definition, Flowcharts: Symbols, A 9
sequential flowchart, Conditional and iterative flowchart, Control Flow
Statements: Sequential, Selection – If-else, Switch-Case; Iteration, Program
Design Methodologies: Top-down and bottom-up design approaches, Modular
approach, History, Importance of C, Structure of C program, Data Types,
primitive type and user defined type: typedef and enum, Variables and
Constants, String Constant, Numeric Constant, Declaration of variables
 Modifiers, Identifiers and keywords, Symbolic constants; Statements &
Expressions.
2 Operators & Expression: Unary operators, Arithmetic & logical operators, 8
Bitwise operators, Assignment operators; Conditional operator, precedence and
order of evaluation. Basic Input-Output Statements: formatted & unformatted
input and output statements, Storage classes: automatic, external, register and
static, Decision Making, Branching and Looping Decision making with if
statement, The switch statement, the ?: operator, goto statement.
Loops: while, do-while, for, Break and continue statements.
3 Arrays: One-dimensional Arrays, Declaration of one-dimensional Arrays, 9
Initialization of one-dimensional Arrays, Two-dimensional Arrays, Initializing
two dimensional Arrays. Character Arrays and Strings: Declaring, writing
strings to screen and reading strings from Terminal, String handling functions.
Functions: Definition, User Defined function, Library function, Function calls:
by reference and by value, Category of functions: Nesting of functions,
Recursion, Passing arrays to functions, Passing strings to functions.
Preprocessor directives, Macros, macro vs. function and conditional
compilation, Variable number of arguments. Command line arguments.
4 Pointers: Declaring and Initialization of Pointer variables, accessing a variable 8
through its pointer; Pointer arithmetic.
Structure: Definition, declaration, accessing structure members, structure
initialization, copying and comparing structure variables. Array’s of structures,
Array’s within structures, nested structures, structures and functions.
Union: definition, comparing union with a structure, Bit-Fields
5 File Handling And System Calls File Introduction, File types – Binary, Text 8
files; Access mode, Opening and Closing files; Formatted –Unformatted
input/output to files; Errors in opening files; File navigation operation-
functions, System Calls Introduction: open(), close(), system(), System calls vs.
library calls

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICATI
ON
1 E. Balagurusamy, “Programming in ANSI C”, 8th Edition, Tata McGraw Hill. 2019
2 Yashwant Kanetkar ,“Let Us C”, 15th Edition, BPB Publication. 2018

3 S.K. Srivastava, “C in Depth”, 2nd Edition, BPB Publication. 2012

4 B. W. Kernighan and D. M. Ritchie, “ANSI C: The C Programming Language”, 2015
2nd Edition, Pearson Publication.
Course Name: Computer Fundamentals and Information Course Code: TBC 102
Technology
Program Name: Bachelor of Computer Applications (BCA)
1 Contact Hours: 42 L 2 T1 P 2
2 Examination Duration(Hrs): Theory 0 3 Practical 0 0
3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50
4 Credits: 0 3
5 Semester: 
Autumn Spring Both
6 Pre-Requisite: Basic knowledge of Computers
7 Subject Area: Computer Applications
8 Objective: To familiarize the students with the basics of computer and information
technology.

9 Course Outcome: A student who successfully fulfills the course requirements will be able to
CO1: Bridge the fundamental concepts of computers with the present
level of knowledge of the students.
CO2: Explain the needs of hardware and software required
for a computation task.
CO3: Understand number systems and Implement various arithmetic
operations on them.
CO4: Demonstrate the use of Operating system and its various
components.
CO5: Develop working skills with productivity tools, graphics designing
and Internet.
CO6: State typical provisions of cyber law that govern the proper
usage of Internet and computing resources.
10 Details of the Course:
Unit CONTENT CONTACT
No. HOURS
1 Evolution of Computers: 8
Introduction to computer and information technology: Introduction to
information technology, Computer definition, functions, characteristics,
capabilities and limitations, changed scenario of computing, applications in
today’s world.
Components of Computer: Hardware-(Input devices & Output devices)
Software with its types, Humanware; Functional Block diagram of a computer.
Categories of Computers: Analog, digital, hybrid, general purpose and special
purpose computers, microcomputers, mini computers and super computers.
Generation of Computers: First, Second, Third, Fourth and Fifth with
advantages and disadvantages of each generation.
Hardware Organization of a Computer: Central Processing Unit (CPU); CPU
Subunits- Arithmetic Logic Unit (ALU),Registers, Control Unit (CU).
2 Number Systems: Decimal, Binary, Octal and Hexadecimal; r’s, (r-1)’s 08
complements, Conversions of One number system to another, BCD numbers,
 GRAY code, Conversion from binary to grey code.
Data Representation: Integer Representation: Signed Magnitude
Representation, Signed 1’s Compliment Representation, Signed 2’s compliment,
Floating Point representation.
Main Memories: Cache, RAM - Static, Dynamic; ROM – PROM, EPROM
and EEPROM with its uses, capacity and features.
Secondary Storage Devices: Introduction to Magnetic Tapes; Magnetic Disks -
Hard Disk Drives, Floppy Disks; Optical Disks - CD, DVD, Magneto-Optical
Disks, Zip Drive and Flash drives.
3 Basic Operating System Concepts: MS-DOS with its basic Commands 9
(internal and external), Managing File and Directories in various operating
Systems,, WINDOWS, Functional knowledge of these operating systems, role
and function of operating system, Types of Operating Systems (general Purpose,
Single user, Multi – User, Multi-tasking, Multi-Threading, Batch operating,
Time Sharing, Real Time)
DOS Kingdom OF DOS- ROM Software, ROM Startup routines, ROM-BIOS
Routines, BOOT TIME process.
4 Introduction to Internet: Introduction, History of internet with its uses, 9
advantages and applications; How to Connect to Internet (Dial Up, BroadBand,
Lease Line, wi-fi, hot-spot) Devices: Modems, Repeater, Computer network :
LAN, WAN, MAN, Network Connecting Devices: Bridges, Routers, Gateways;
Internet Services: World Wide Web, EMAIL, USENET, WAIS etc.
Concept of Security: Introduction to Firewalls, Cyber Laws, Cookies, Hackers
and Crackers, Terms of security (Secrecy, Privacy, Authentication,
Authorization, Password protection, File Permissions) only Introduction
5 Programming Models: 8
Computer Languages, Classification of Computer Languages: Machine Level,
Assembly Language, High Level Language, Advantages and Disadvantages of
Procedural programming languages.
Introduction to Object Oriented Programming,4GL and 5GL languages with
features and advantages.
TOTAL 42

11 Suggested Books:
Sl. NO. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
PUBLICATION
1 Norton, Peter, “Introduction to Computers”, McGraw-Hill. 2011
2 Leon, Alexis & Leon, Mathews, “Introduction to Computers”, Leon Tech World. 2012
3 P.K.Sinha and PreetiSinha, “Computer Fundamentals”,BPB. 2010
4 Rajaraman, V., “Fundamentals of Computers”,PHI. 2011
5 ReemaThareja , ”Computer Fundamentals and Programming in C” 2014
Course Name: Bachelor of Computer Applications
Subject Name: Mathematical Foundation of Computer Science Subject Code: TBC-103
1 Contact Hours: 42 L 3 T0 P 0
2 Examination Duration(Hrs): Theory 0 3 Practical 0 0
3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50
4 Credits: 0 3
5 Semester: 
Autumn Spring Both
6 Pre-Requisite: Basic knowledge of mathematics
7 Subject Area: Mathematics and Computer Science
8 Objective: To familiarize students with the logics used in the field of computer science
along with the relations and functions.
9 Course Outcome: A student who successfully fulfills the course requirements will be able to-
a. Understand the concept of relations, Posets and Hasse Diagram.
b. Implement the concept of Functions and their types.
c. Analyze and implement the concept of mathematical induction and generating functions.
d. Implement the concept of linear recurrence relation with coefficients.
e. Understand and implement the concept of algebraic structure.
f. Understand and apply the basics of prepositional logic.
10 Details of the Course:
Unit CONTENT CONTACT
No. HOURS
1 Relation: Type and compositions of relations, Pictorial representation of relations, 8
Equivalence relations, Partial ordering relation, Posets, Hasse Diagram.
2 Function: Types, Composition of functions, Recursively defined functions. 8

3 Mathematical Induction: Mathematical Induction, Discrete Numeric Functions, 9

Asymptotic Behavior of functions and Generating functions, Linear recurrence relation
with constant coefficients (homogeneous and non-homogeneous forms)
4 Algebraic Structures: Semi group, monoid, Group, Abelian group, properties of group, 9
subgroup and their properties, Cyclic group, Cosets, lagrange’s theorem, Permutation
groups. Homomorphism, Isomorphism and Automorphism of groups (Definition and
examples)
5 Prepositional Logic: Preposition, Basic logical operations, Tautologies, Contradictions, 8
Algebra of Proposition, Logical implication, Logical equivalence, Normal forms,
Inference Theory, Predicates and quantifiers.
TOTAL 42

11 Suggested Books:
Sl. NO. YEAR OF
NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICATION
1 J. K. Sharma, “Discrete Mathematics”, Macmillan 2005
2 S.A.Sarkar, "Discrete Mathematics",S.Chand Publication 2003
3 Discrete Mathematical Structure with Application to Computer Science”, TMH 2007
4 Kenneth H. Rosen, ” Discrete Mathematics and its applications”, TMH 2008
5 Doerr Alan & Levasseur Kenneth, “Applied Discrete Structures for Computer Science”, 2009
Galgotia Pub. Pvt. Ltd
6 Gersting,“Mathematical Structure for Computer Science”,WH Freeman & Macmillan 2008
7 Kumar Rajendra, “Theory of Automata: Languages and Computation”, PPM 2007
8 Hopcroft J.E, Ullman J.D., “Introduction to Automata theory, Languages and 2003
Computation”, Narosa Publishing House, New Delhi
Course Name: Bachelor of Computer Applications
Subject Name: Communication and Soft Skills Subject Code: TBC-104
1 Contact Hours: 30 L 2 T0 P 0
2 Examination Duration(Hrs): Theory 0 2 Practical 0 0
3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50
4 Credits: 0 2
5 Semester: 
Autumn Spring Both
6 Pre-Requisite: Basic understanding of the human nature and skills.
7 Subject Area: Management
8 Objective: To familiarize students with the human traits and their interpersonal skills.
9 Course Outcome: A student who successfully fulfills the course requirements will be able to-
a. Use theories of interpersonal communication to explain and evaluate their own behavior in
interpersonal relationships.
b. Synthesize and apply appropriate and effective conflict management strategies.
c. Understand the ways of effective writing.
d. Understand and to develop skills of effective technical communication;
e. To Develop the Cross culture Communication Skill.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Introduction of Communication 6
Meaning, Importance & objectives - Principles of Communication, downward and
upward communication, other forms of communication. Communication,
Communication Process, Barriers of effective communication, Techniques of effective
Communication.
2 Oral Communication Skills 6
Essentials of Oral Communication Skills- Basics of oral communication ,Power of
Speech, Characteristics of Good Speech , Traits of a Good Speaker, Advantages of Oral
Communication, Styles of Oral Communication , Communication Grid ,
Delivering a Persuasive Speech- Strategies for Persuasive Speeches, Involvement for
Effective Persuasive Speeches, Guidelines for Power-point Presentation , Creating
Power-point Presentation , Interacting Skills with Audience,
Successful Meeting Skills and Listening Skills
3 Strategic Relevance Of Communication 6
Becoming a Powerful Communicator , Crafting Effective Communication , Creating
and Delivering the Message , Minimizing Noise during Transmission , Facilitating
Feedback, Strategic Relevance of Communication , Strategic Framework of
Communication in an Enterprise , Communication and Society
4 Written Communication Skills 6
Writing Skills,Writing style, Writing Business letters: Inquiries, Circulars, Quotations,
Agency correspondence, Bad news and persuading letters, Sales letters, Job application
 letters - Bio-data, Covering Letter, Interview Letters, Letter of Reference. Memos,
minutes, Circulars & notices. Reports: Types of Business Reports - Format, Choice of
vocabulary, coherence and cohesion, paragraph writing,
5 Technical Communication - 6
Fundamentals of Technical Communications, Public Speaking, negotiations,
Presentation skills, Role of communication in IT. Cross culture Communication Skill.

TOTAL 30

11 Suggested Books:
Sl. NO. YEAR OF
NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICATION
1 K.K.Sinha ,”Business Communication”,Galgotia 2005
2 Elias M. Awad ,”System analysis & Design” 2006
3 Lessical & prath ,”B.C. Theory & Application” 2007
4 K. Aswathappa,” Organisational Behavior” 2003
Course Name: Bachelor of Computer Applications
Subject Name: Principles of Management Subject Code: TBC-105
1 Contact Hours: 42 L 3 T0 P 0
2 Examination Duration(Hrs): Theory 0 3 Practical 0 0
3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50
4 Credits: 0 3
5 Semester: 
Autumn Spring Both
6 Pre-Requisite: Basic functioning of the organization
7 Subject Area: Management
8 Objective: To familiarize students with the knowledge of management studies.
9 Course Outcome: A student who successfully fulfills the course requirements will be able to-
a. Understand managers manage business organizations in the dynamic global environment.
b. Evaluate how organizations develop and maintain competitive advantage.
c. Analyze Business decisions made using various tools and techniques to remain competitive.
d. To understand and apply of recent management techniques.
e. To Understand the and evaluate Strategic Management in India
10 Details of the Course:
Unit CONTENT CONTACT
No. HOURS
1 Nature of Management: 8
Meaning, Definition, it's nature purpose, importance & Functions, Management
as Art, Science & Profession- Management as social System Concepts of
management-Administration-Organization
Evolution of Management Thought: Contribution of F.W.Taylor, Henri Fayol
,Elton Mayo, Chester Barhard & Peter Drucker to the management thought.
2 Functions of Management: 9
Planning - Meaning - Need & Importance, types levels – advantages &
limitations. Forecasting - Need & Techniques. Decision making steps and
Process, Organizing - Elements of organizing & processes: Types of
organizations, Delegation of authority - Need, difficulties in delegation –
Decentralization.
3 Functions of Management: 8
Staffing - Meaning & Importance,Direction-Nature–Principles Communication-
Types & Importance, Motivation - Importance – theories Leadership - Meaning -
styles, qualities & functions of leaders
Controlling - Need, Nature, importance, Process & Techniques Coordination -
Need – Importance
4 Strategic Management: 8
Definition of strategy and strategic management, various levels of strategies –
corporate, business and functional level,
 Relevance of Strategic Management and its Benefits, Strategic Management in
India
5 Recent Trends in Management: 9
Social Responsibility of Management – Management of Crisis, Total Quality
Management, Stress Management, Management of Change.
TOTAL 42

11 Suggested Books:
Sl. NO. YEAR OF
NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICATION
1 Dr. L.M.Parasad ,”Principles & practice of management “, Sultan Chand & Sons - New Delhi 2005
2 Horold Koontz and Iteinz Weibrich ,”Essential of Management “,McGrawhills International 2003
3 Dr. Y.K. Bhushan ,”Business Organization & Management “, 2002
4 J. S. Chandan ,”Management: Concept and Strategies “, Vikas Publishing 2001
5 Principles of Management, By Tripathi, Reddy Tata McGraw Hill 2007
6 Business organization and Management by Talloo by Tata McGraw Hill 2004
7 Management Theory & Practice - J.N.Chandan 2005
8 K.Aswathapa ,”Essential of Business Administration”, Himalaya Publishing House 2006
 Second Semester
Subject Name: Data Structures and File Organization Subject Code: TBC-201
1 Contact Hours: 42 L 2 T1 P 2
2 Examination Duration(Hrs): Theory 0 3 Practical 0 2
3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50
4 Credits: 0 3
5 Semester: 
Autumn Spring Both
6 Pre-Requisite: Basic knowledge of the C programming Concepts
7 Subject Area: Programming
8 Objective: To familiarize students with the basic knowledge of the data structures
which are applied at the various levels of the computer science.
9 Course Outcome: A student who successfully fulfills the course requirements will be able to-
a. Have a comprehensive knowledge of the data structures and algorithms on which file structures
and data bases are based.
b. Understand the importance of data and be able to identify the data requirements for an
application.
c. Have a solid understanding and practical experience of algorithmic design and implementation.
d. Understand the basics of searching and sorting algorithms.
e. Understand the concepts of trees in data structure.
10 Details of the Course:
Unit CONTENT CONTACT
No. HOURS
1 Algorithm Basics: Basic Terminology, types and characteristics, Algorithm 8
Complexity and Time-Space trade-off.
Introduction to Data Structure: Elementary Data Organization, Data Structure
operations,
Pointers Review; Static and Dynamic Memory Allocation;
Arrays: Definition, Representation and Analysis, Single and Multidimensional
Arrays, address calculation, application of arrays, Character, Array as
Parameters, Ordered list, Sparse Matrices, and Vector.
2 Stacks: Array Representation and Implementation of stack, Operations and 9
Stacks: Push and POP, Array Representation of Stack, Linked Representation of
stack, Operations Associated with Stacks, Application of stack, Conversion of
Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using
stack.
Queues: Array and linked representation and implementation of queues,
Operations on Queue; Create, Add, Delete, Full and Empty, Circular queue, De-
que, and Priority Queue.
3 Link List (s): Representation and implementation of Singly linked lists, Header 8
 Linked List, Insertion and deletion to from Linked Lists Traversing and
Searching of Linked List, Overflow and Underflow, , Insertion and deletion
Algorithms, Doubly linked list, Polynomial representation and addition,
Generalized linked list, Garbage Collection and Compaction.

4 Searching : Linear and Binary searching, Hashing ,Hash table, Hash collisions 8
removal techniques.
Sorting: Bubble sort technique, Selection sort technique, Insertion sort
technique, Merge sort technique, quick sort technique.
Recursion: definition, types of recursion, call stack, iteration – recursion
difference.
5 Trees: Basic terminology, types; 9
Binary Trees : Binary Tree, Binary tree representation algebraic Expressions,
Complete Binary Tree, Extended Binary Tree, Array and Linked Representation
of Binary trees, Traversing Binary trees;
Binary Search Trees: insertion, traversing, search, deletion operations
Threaded binary tree, AVL tree(Height balance tree),
Huffman algorithm : Huffman tree and Codes;
Multi-way Search trees: B –Trees, B+ Tree;
File organizations :Introduction to file system ,Sequential file organization,
Index sequential organization, Relative file organization, Multi-key file
organization.
TOTAL 42

11 Suggested Books:
Sl. NO. YEAR OF
NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICATION
1 G.S.Baluja ,”Data Structure through C”,Dhanpat Rai 2007
2 Lipschutz ,”Data Structure”,TMH 2002
3 Data Structure and Program Design in C-Tanenbaum 1998
Subject Name: Object Oriented Programming Using C++ Subject Code: TBC 202

Course Name: Bachelor of Computer Applications

1 Contact Hours: 42 L 2 T 1 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Knowledge of C language

7 Subject Area: Programming

8 Objective: To familiarize students with the Object-Oriented Concepts and its

implementation through the C ++ Language.
9 Course Outcomes: A student who successfully fulfills the course requirements will be able
to:

a) Describe the differences between procedure-oriented programming and object-oriented

programming.
b) To implement basis concepts of the object-oriented programming language like encapsulation,
abstraction, inheritance, polymorphism etc.
c) Understand and define the object-oriented approach by implementing various streams, classes,
member functions and objects.
d) Apply inheritance at various levels incorporating virtual and pure virtual functions.
e) Analyse exception handling techniques and provide solutions to storage related problems using
STL and implement the concepts like generic programming.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Beginning with OOP: Introduction of object-oriented programming 8
(OOP) with real examples, Difference b/w POP and OOP. Basic concepts
of OOP like polymorphism, inheritance, encapsulation, abstraction etc.
Applications and benefits of OOPs.
Moving from C to C++: Scope resolution operator with its uses, variable
definition, Inline function, function overloading and overriding, default
arguments, structure, runtime memory management.
2 Classes and Object: Defining Classes and Objects in C++, Encapsulation, 8
Member Functions, Instantiating using Classes. Constructors with its
types, Destructors, Static data members, Friend functions,Friend
 class,passing objects as arguments, Returning objects, Arrays of objects,
Dynamic objects, Pointers to objects, This Pointer.
Initialization and Assignment: Initialization vs. Assignment, The Copy
Constructor, Assigning Values, Specialized Constructors and Methods,
3 Operator overloading: Operator overloading, Unary operator 9
overloading, limitations of increment/decrement operators, binary
operator overloading, overloading using friend functions, Data
Conversion.
Inheritance: Base Class, Inheritance and protected members, Protected
base class inheritance, Inheriting multiple base classes; Constructors,
Destructors and Inheritance, Passing parameters to base class
constructors, Granting access, Virtual base classes.
4 Virtual Functions: Virtual function, Calling a Virtual function through a 9
base class reference, Pure virtual functions, Abstract classes, Using
virtual functions, Early and late binding.
Generic Programming with template: Function template, overloading
function templates, class template, inheritance of class templates.
5 I/O System Basics, File I/O: C++ stream classes, Formatted I/O, I/O 8
manipulators, fstream and the File classes, File operations
Exception Handling, STL: Exception handling fundamentals, Exception
handling options STL: An overview, containers, vectors, lists, maps.
TOTAL 42

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICAT
ION
1 E. Balagurusamy, Object oriented Programming with C++, 7/ed, TMH. 2017
2 Lippman. S. B. et al.,“C++ Primer” Fifth Edition, Addition Wesley. 2013
3 B. Stroustrup, The C++ Programming Language, Fourth Edition, 2013
Addison-Wesley.
4 P.M. Chilean: Programming in C++ Merril Pub. 2008
5 Deitel H. M. & Deitel P. J., “How to Program C+”, Fifth Edition PHI. 2006
Subject Name: Operating Systems Subject Code: TBC 203

Course Name: Bachelor of Computer Applications

1 Contact Hours: 42 L 3 T 0 P 0

2 Examination Duration (Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: *
Autumn Spring Both

6 Pre-Requisite: Fundamental knowledge of computers and information technologies

7 Subject Area: Computer Science

8 Objective: To familiarize students with the Concept of Operating Systems that are used
to manage various system components including files and processes.

9 Course Outcome:
A student who successfully fulfills the course requirements will be able to:
CO 1 Classify operating systems as per user or process requirements
CO 2 Evaluate and Implement an appropriate CPU scheduling algorithm to improve overall
system throughput along with improved average turnaround time, waiting and
response time.
CO 3 Identify and Design a suitable solution for different issues, such as process
synchronization and deadlock, that are associated with simultaneous execution of
multiple processes.
CO 4 Analyze and compare different algorithms given for management of the primary
memory (RAM).
CO 5 Evaluate and select an appropriate mechanism for improved management of files and
directories.
CO 6 Analyze and select a suitable security solution for protection of his/her system’s
resources.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Introduction: Operating systems and its definition. History of i
Operating system. Types of operating system. Single-User, Multi-User,
Multiprogramming, Multiprocessing, Batch Systems, Parallel,
Distributed and Real-time systems. Operating system structure and its
services, System calls.
2 Operating system components:Process Management,Program and 9
 Process concept, Process scheduling, CPU scheduling criteria, Types of
Schedulers, Scheduling algorithms, Multiple-processor scheduling,
Threads. Introduction to multi-threading.
3 Process Synchronization and Deadlocks: Independent and cooperative 8
process, Inter process communication, Critical regions, The Critical-
Section problem, Two process & multiple process solution, Peterson
Algorithm, Bakery Algorithm, Semaphores, Deadlocks-System model,
Characterization, Deadlock prevention, Avoidance and Detection,
Recovery from deadlock
4 Memory and Storage management: Memory Management-Logical 8
and Physical Address Space, Contiguous and non-contiguous allocation,
Paging, Virtual Memory, Demand paging and its performance, Page
replacement algorithms,
File systems, secondary Storage Structure, File concept, access methods,
directory implementation.
Disk structure, Disk scheduling methods, Disk management,
Recovery,Protection and Security.
5 LINUX Case Study: Historical development of LINUX and its 8
variants. Types of files in LINUX. Directory handling and Navigation.
Absolute and Relative pathnames. File handling commands. Changing
file permission. Shell Programming, command line arguments, Meta-
characters. Shell variables, Test Command, The Logical and relational
Operators, String handling and computation.
TOTAL 42

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICATION
1 Silberschatz, Galvin: Operating System Concept, 7th Edition, John 2005
Wiley and Sons.
2 William Stallings: Operating Systems: Internals and Design Principles, 2012
7th Edition PHI.
3 Sumitabha Das: UNIX Concepts and Application, 4th Edition, McGraw 2008
Hill
Subject Name: Digital Electronics Subject Code: TBC 204

Course Name: Bachelor of Computer Application(BCA)

1 Contact Hours: 42 L 3 T 0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Knowledge of computer fundamentals

7 Subject Area: Computer Application

8 Objective: To familiarize students with the Digital Electronics

9 Course Outcomes: A student who successfully fulfills the course requirements will be able to:
CO 1: Illustrate the Binary, Octal, Hexadecimal number system, conversion, complements
and various types of codes.
CO 2: Cognize and describe the various logic gates and simplification of the Boolean
expressions using K map.
CO 3: Describe the design procedure of various combinational circuits.
CO 4:Analyze the design procedure of various sequential circuits and conversion process of
flip flops.
CO 5: Differentiate between registers and counters and the functionality of counters.
CO 6: Review the basic working/design principles of combinational and sequential circuits
and their usefulness and applications in real life.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 NUMBER SYSTEMS : Data Representation, Binary number system, 9
Octal & Hexa-decimal number system, Conversion between number
system, Arithmetic operation on Binary numbers, r’s and r-1’s
complement, Overflow & underflow, Fixed and Floating Point
Representation, Codes, ASCII, EBCDIC codes, Gray code, Excess-3 &
BCD, Error detection & correcting codes.

2 LOGIC GATES 9
Logic Gates, AND, OR, NOT GATES and their Truth tables, NOR,
NAND, XOR and XNOR gates, Universal Gates and their
implementation. Boolean Algebra, Basic Boolean Law's, Demorgan's
theorem, Minterms and Maxterms, K-MAP Simplification, Minimization
 techniques, Sum of Product & Product of Sum. Canonical forms.
3 COMBINATIONAL CIRCUITS: 8
Design procedure – Adders-Subtractors – Serial adder/ Subtractor -
Parallel adder/ Subtractor. Multiplexer/Demultiplexer, Encoder /
Decoder. Implementation of combinational logic circuits.
4 SEQUENTIAL CIRUITS: 8
Flip-flops- Types of flip-flops,SR, JK, T, D and Master slave –
Characteristic table and equation. Realization of one flip flop using other
flip-flops. Definition of registers, types of registers.Basic Shift Registers
Applications of registers
5 COUNTERS: 8
Definition of counters, types of counters, asynchronous counters,
synchronous counters, Ring counters, up/down counters etc. Applications
of counters.
TOTAL 42

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICAT
ION/REPRI
NT
1 M. Morris Mano, Digital Design, 3.ed., Prentice Hall of India Pvt. Ltd., 2009
New Delhi, 2003/Pearson
2 R.P.Jain, Modern Digital Electronics, 3 ed., Tata McGraw–Hill publishing 2008
company limited, New Delhi
3 Donald P.Leach and Albert Paul Malvino, Digital Principles and 2010
Applications, 5 ed., Tata McGraw Hill
4 Thomas L. Floyd, Digital Fundamentals, Pearson Education, Inc, New 2011
Delhi, 2003
Course Name: Bachelor of Computer Applications

Subject Name: Discrete Mathematical Structures and Graph Theory Subject Code: TBC-205

1 Contact Hours: 42 L 3 T0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic knowledge of logic gates and Graphs

7 Subject Area: Mathematics

8 Objective: To familiarize students with the working of the Graphs used in computer
science.

9 Course Outcome: A student who successfully fulfills the course requirements will be able to-
a. Understand the theory and techniques of logic, graphs and trees, and algebraic systems.
b. Apply the knowledge and skills obtained to investigate and solve a variety of discrete
mathematical problems.
c. Communicate mathematical ideas.
d. Make effective use of appropriate technology.
e. Understand the concept of Paths, Cycles , cut vertex, cut set and bridges.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Matrices: Notation and Definition, Types of Matrices, Algebra of Matrices, 8
Transopose of a Matrix, Solution of linear Equations by Matrix method, Rank of
matrix, Eigen values and Eigen vectors, Cayley Hamilton theorem.

2 Boolean algebra: Basic operations, Boolean functions, Boolean expression, De- 8

Morgan’s theorem, Logic gates, SOP and POS forms, Normal forms,
Simplification of Boolean expression, Logic and switching networks, Karnaugh
map method for simplification of Boolean expression
3 Graph theory: Definition and application of graphs, Konigsberg bridge problem, 9
Simple graph, multi graph and pseudo graph, directed and undirected graphs,
degree of a vertex, handshaking theorem, Types of graphs, sub graphs and
isomorphic graphs, bipartite graphs, operations of graphs, representation of
graphs.
4 Paths, Cycles ,cut vertex, cut set and bridge, Connectedness in directed and 8
undirected graphs, Connectivity, Eulerian graph, Hamiltonian graph, Dijkstra’s
 algorithm for shortest path, planar graphs, Euler’s formula, Graph coloring,
Wetch Powell algorithm, Chromatic polynomial, Decomposition theorem.
5 TREES: Trees and their properties, Rooted tree, Spanning tree, minimal 9
spanning tree, fundamental circuits, rank and nullity, Kruskal’s algorithm,
Binary tree.
TOTAL 42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 J. K. Sharma, “Discrete Mathematics”, Macmillan 2006
2 Liptschutz, Seymour, “Discrete Mathematics”, TMH 2007
3 Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application 2004
to Computer Science”, TMH
4 Kenneth H. Rosen, ” Discrete Mathematics and its applications”, TMH 2002
5 Doerr Alan & Levasseur Kenneth, “Applied Discrete Structures for Computer 2001
Science”, Galgotia Pub. Pvt. Ltd
6 Gersting,“Mathematical Structure for Computer Science”,WH Freeman & 1998
Macmillan
7 Kumar Rajendra, “Theory of Automata: Languages and Computation”, PPM 2009
8 Hopcroft J.E, Ullman J.D., “Introduction to Automata theory, Languages and 2007
Computation”, Narosa Publishing House, New Delhi
Subject Name: Environmental Studies Subject Code: TEV-211

1 Contact Hours: 30 L 2 T0 P 0

2 Examination Duration(Hrs): Theory 0 2 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 2

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic knowledge of Environment

7 Subject Area: Environmental Studies

8 Objective: To familiarize students with the Environmental issues.

9 Course Outcome: A student who successfully fulfills the course requirements will be able to-
a. Understand the natural environment and its relationships with human activities.
b. Characterize and analyze human impacts on the environment.
c. Integrate facts, concepts, and methods from multiple disciplines and apply to environmental
problems.
d. Understand the Important Environmental Issues, Management and legislation.
e. Project work/Assignment on recent environmental issues and reporting/ Review writing.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Ecology and ecosystem: General Introduction (Scopes and Importance, 6
Components and Segments), Ecosystem (components and structure, energy and
nutrient flow, food chain, food web), UNCED (1972), Earth Summit (1992),
Rio+20 (2012), UNFCC, CBD
2 Natural Resources and Biodiversity: Energy Resources (Renewable/Non- 6
renewable; Traditional/Alternative) and types (Hydel, Solar, Wind, Geothermal).
Forest Resources: types and benefits from forest and Sustainable Forest
Management, Forest (Conservation) Act, 1980.
Water resources: Water resources in Himalayan region, Dams and their impacts,
Rain water harvesting and Watershed development, Law and Policy.
Biodiversity: Definition and Types, importance, threats and Hotspots,
Biodiversity conservation (in situ, ex situ) threatened categories as per IUCN,
Law and Policy.
Remote sensing and Geographical Information System (GIS) and applications in
environmental management.
3 Environmental Pollution: Air Pollution: Definition, sources, classification and 6
its effects, control strategies and devices, Law and Policy.
Water Pollution: Definition, sources, Impacts and toxic effects of some specific
 pollutants, measurement of DO/BOD/COD, Bio-accumulation and Bio-
magnification, Law and Policy.
Waste water treatment (Aerobic and anaerobic) and Sewage Treatment Plant.
Thermal Pollution and Radioactive pollution and its hazards, Noise
pollution.Soil pollution: Definition, sources and solid waste management.
4 Important Environmental Issues, Management and legislation: Climate 6
change, global warming, smog, ozone layer depletion, acid rain, floods, river
blockades, cloud bursting, landslides and earthquakes effects and mitigation.
Environmental Impact Assessment (Aims, objectives, constraints in EIA),
Environment Assessment Process , EIS, Environment Audit (Introduction and
methodology) and Environmental Certification
Sustainable Development, Environment and human health.
Environmental Management System (EMS), Environmental (Protection) Act
1986, ISO norms

5 Field /Project Work: Visit and documentation of protected habitats/ Sites/ 6

Research Institutions/ Industries.
Project work/Assignment on recent environmental issues and reporting/ Review
writing.
TOTAL 30

1. Suggested Books:

Sl.NO NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF

PUBLICATION/
REPRINT

1. Odum E. P. Fundamentals of Ecology; W. B. Sanders Co. & Natraj 2009

(Indian publication).

2. Santra S. C., Environmental Science; Central Book Agency. 2008

3. Dhameja, S. K.:Environmental Studies; Katson books. 2010

4. Joseph K. & Nagendran R.: Essentials of Environmental studies; 2011

Pearson Edition.

5. Srivastava Smrti: Environmental Studies; Katson books. 2012

 Third Semester
Course Name: Bachelor of Computer Applications

Subject Name: Data Communication and Computer Networks Subject Code: TBC-301

1 Contact Hours: 42 L 1 T 1 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic idea of the network

7 Subject Area: Networking

8 Objective: To familiarize students with the networking concepts and protocols.

9 Course Outcome: A student who successfully fulfills the course requirements will be
able to-
CO1 Describe the basis and structure of an abstract layered protocol model
CO2 Describe, analyse and compare a number of datalink, network, and transport layer
protocols.
CO3 Design and implement datalink or network layer protocols within a simulated
networking environment.
CO4 Describe and analyse various related technical, administrative and social aspects of
specific computer network protocols from standards documents and other primary
materials found through research.
CO5 Identify and apply basic theorems and formulae for the information-theoretic basis of
communication and the performance of physical, datalink and network protocols
.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Basics of Computer Networks: Computer Network, Definition, Goals, 9
Applications, Components, Topology and its types, Types of Networks,
(LAN, MAN, WAN, Internet), Broadcast & Point-To-Point Networks,
Modes of transmission (Serial, Parallel, Synchronous, Asynchronous and
Isochronous).
Modes of Communication: Simplex, Half Duplex, Full Duplex,
Protocols and Standards.
Network Models: Design issues of the layer, Protocol Hierarchy, ISO-
 OSI Reference Model: Internet Model, TCP/IP Protocol Suite, Ports,
and Comparison of ISO-OSI and Internet Model. Multiplexing (FDM,
WDM and TDM), and switching (Circuit switching, Packet Switching
and Comparison of both)
2 Encodingandmodulation:PhysicallayerIntroduction,Functionsandservic 9
esofphysicallayer,Signalsandtheircharacteristics,Analog&DigitalSignals,
Bandwidth,Bitrate,Baudrate,BinarytoDigitalEncoding(Unipolar,Polar,Bip
olar),AnalogtoDigital(PCM),DigitaltoAnalogConversion(ASK,FSK,PSK,
QAM),AnalogtoAnalogModulation(AM,FM,PM).
TransmissionMedia:TypesofTransmissionMedia,GuidedMedia(Wired):
CoaxialCable,TwistedPair:UTP,STP,Connectors.FiberOpticsCable,Adva
ntages&disadvantages,UnguidedMedia(Wireless),WirelessTransmission,
RadioWaves,Infra-Red,Micro-Wave.
3 Data Link Layer: Datalink Layer Introduction & Design issues, 8
Functions of DLL & Services provide to network layer, Framing, Error
control.
LAN protocols: Ethernet Basic Features, Types, IEEE802.3, IEEE802.4,
IEEE 802.5 Frame format, Medium Access Methods: Random access
protocols, Collision free protocols, Token passing protocols, Flow
Control: Stop-n-wait protocol, Sliding window protocol.
4 Network Layer: Network layer services and functions, IPv4 frame 8
format, IP addressing, Introduction to Routing, Concept of Intranet &
Extranet.
Internet working Devices: Categories of Connectivity Devices, Hubs,
Repeaters, Bridges, Switches, Gateways.
5 Transport Layer: TCP protocol and its frame format, User Datagram 8
Protocol, Services of TCP and UD Pprotocol.
Application Layer: Domain Name System, Simple Network
Management Protocol, Electronic mail (SMTP, POP3 and IMAP4), File
Transfer Protocol, Hyper Text Transfer Protocol, Telnet.
TOTAL 42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 Forouzan, “Data Communication and Networking”, TMH 2007
2 A.S Tanenbaum, “Computer Networks, 3rdEdition”, PHI 2005
3 W. Stallings, “Data and Computer Communication”, Macmillan Press 2005
4 Comer, “Computer Networks & Internet”, PHI 2003
5 Forouzan, “TCP/IP Networking”, TMH 2007
6 Peter Norton, “Complete Guide to Networking”.,Techmedia 2006
Subject Name: Database Management System Subject Code: TBC 302

Course Name: Bachelor of Computer Applications (BCA)

1 Contact Hours: 42 L 2 T 1 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic knowledge of computer fundamentals.

7 Subject Area: Computer Applications

8 Objective: To familiarize students with the Data Base Management System

9 Course Outcomes: A student who successfully fulfills the course requirements will be
able to:
CO 1 Understand the concepts of database management and can differentiate the database
approach with the file system approach.
CO 2 Sketch and develop Entity Relationship Diagrams for real world problems and design
databases.
CO 3 Apply and analyze Relational database queries with the help of Structured Query
Language (SQL) and construct simple and moderately advanced database queries in
SQL.
CO 4 Evaluate and Apply logical database design principles, including keys, constraints and
database normalization and design normalized databases.
CO 5 Understand and defend the importance of concurrency control in Transaction Processing
Systems.
CO 6 Examine the importance of recovery management in databases and solve deadlock
related problems.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Introduction: An overview of database management system, Database 9
System Vs File System, Database system concepts, data models. Advantages
of DBMS, Schema and instances, Three schema architecture, data
independence. Data base languages and interfaces, Disadvantages of DBMS.
Data modeling using the Entity Relationship Model: ER model concepts,
notation for ER diagram, mapping constraints, keys, Concepts of Super Key,
candidate key, primary key, Generalization, specialization and aggregation,
reduction of an ER diagrams to tables, extended ER model, relationships of
 higher degree.
2 Relational Data Model and Relational Algebra: Relational data model 9
concepts, integrity constraints: entity integrity, referential integrity, Key
constraints, Domain constraints. Relational algebra, Operations of relational
algebra, queries in relational algebra.
3 Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data 8
types and literals, Types of SQL commands, SQL operators and their
procedure, Tables, views and indexes, Insert, update and delete operations,
Queries and sub queries, Scalar and Aggregate functions, Joins, Unions,
Intersection, Minus.
4 High Level Data Base Design & Normalization: Functional dependencies, 8
normal forms, first, second, third normal forms, BCNF, inclusion
dependencies, loss less join decompositions, normalization using FD, MVD,
and JDs.
5 Transaction Processing Concepts: Transaction system, Testing of 8
serializability, Serializability of schedules, conflict and view serializable
schedule, recoverability, Recovery form transaction failures, deadlock
handling.
Concurrency Control Techniques: Concurrency control, locking Techniques
for concurrency control.
TOTAL 42

11 Suggested Books:
Sl.N NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
O PUBLICAT
ION/REPRI
NT
1 Elmasri and Navathe: Fundamentals of Database Systems, 5th Edition, Pearson 2007
Education.
2 Silberschatz, Korth and Sudharshan: Data base System Concepts,5th Edition, 2006
Mc-GrawHill.
3 C.J. Date, A. Kannan, S. Swamynatham: A Introduction to Database Systems, 1996
8th Edition, Pearson education.
4 Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 2003
3rd Edition, McGraw-Hill.
Subject Name: JAVA Programming Subject Code: TBC 303
Course Name: Bachelor of Computer Applications (BCA)

1 Contact Hours: 42 L 3 T 0 P 0
2 Examination Duration (Hrs): Theory 0 3 Practical 0 0
3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50
4 Credits: 0 3
5 Semester: *
Autumn Spring Both
6 Pre-Requisite: Knowledge of programming
7 Subject Area: Java 16 or JDK 16 released on March, 16th 2021

8 Objective: To familiarize students with object-oriented concepts and the power of Java
language , enrich them with robust tools of Java language.
9 Course Outcome:

CO 1 Apply and characterize the Java programming features to develop programs for
demonstrate the same.
CO 2 Make use of object oriented concepts to develop applications using servlets.
CO 3 Classify exceptions and demonstrate applications for file handling and multithreading.
CO 4 Evaluate and select the most reliable approaches for developing applications using
proper exception handling techniques using several networking classes.
CO 5 Compare and utilize collection framework to create programming applications by
describing and developing applications for GUI.

CO 6 Design and describe applications by deploying for event handling and accessing
databases using Java features.
10 Details of the Course:
Unit CONTENT CONTACT
No. HOURS
1 Introduction to Java :Importance and features of Java, Concepts of Java 9
Virtual machine (JVM) Keywords, Constants, Variables and data types,
operators and expressions, Control statements, Conditional statements,
loops and iterations.
Object Oriented Programming concepts: Inheritance, super classes,
multilevel hierarchy, abstract and final classes, overloading and
overriding. .

String and Arrays:Defining arrays, Object Array,2-D arrays, String , String

Buffer ,Command Line arguments ,Wrapper classes, Upcasting and
Downcasting

2 Packages and interfaces: Packages, Defining Packages, Using Packages, 8

 import and static import, Access protection.
Interface: Defining Interfaces, abstract methods declarations, implementing
interfaces, extended interfaces.
Exception handling: Exception Types, Exception class, RuntimeException
Class, Error Class, Checked and uncheced Exceptions, Defining new
exceptions; Handling: try, catch and finally; throw statement, throws clause.

3 Multithreaded programming: Java thread model, Thread synchronization, 8

messaging, thread class, Runnable interface, inter thread communication.
Object Lifetime: Garbage Collection, Reachable Objects.
I/O: File, Character and Byte Stream, Object Serialization
Collection and Generic Framework: Introduction to Collection and
Generic Framework: Interfaces Iterator, List, Set, ArrayList .Jar Utilities.
4 Applet and Swings : Applet basics, Applet Architecture, Applet Life cycle; 8
Event Handling: Event handling mechanisms, the Delegation Event Model,
Event classes, sources of events, Event Listener Interfaces, Adapter classes

Event Handling:Event delegation model, classes, Event Listener Interfaces,

Adapter classes.

Networking: Networking Basics, Java and the Net, TCP/IP Client sockets,
URL, URLConnection, TCP/IP Server sockets, Datagram.
5 JDBC: Concept of JDBC, JDBC Driver Types, JDBC Packages, Database 9
Connection, Associating the JDBC/ODBC Bridge with the Database, JDBC
URL, Statement Objects, ResultSet, Transaction Processing, commit,
savepoint, rollback, ResultSet Metadata, Database Metadata, Data Types,
SQL Exception, Prepared Statement, Callable Statement, Batch updates.
Storing and Retrieving images via JDBC.

Java Servlets: Servlet basics, Servlet API basic, Life cycle of a Servlet,
Running Servlet, HTTP Redirects, Cookies, Session Management,
Introduction to Java Server pages (JSP), Use of Bean in JSP.
. 42

11 Suggested Books:

1. Patrick Naughton and Herbert Schildt,“Java 2 The Complete Reference”, 9th edition, McGraw
Hill Education, 2017.
2. Bruce Eckel, “Thinking in Java”, 4th edition,Pearson Education India, 2008
3. E. Balaguruswamy, “Programming with Java a Primer”, 4thedition, Tata McGraw Hill, 2009.
Reference Books:
1. Cay S Horstmann and Gary Cornell, “Core Java Volume –I and II”, Standard edition, Sun
Microsystems, 2001
2. Harvey Deitel and Paul Deitel, “Java How to Program” , 4thedition, PHI Learning, 2004.
Course Name: Bachelor of Computer Application

Subject Name: Computer Organization and Architecture Subject Code: TBC 304

1 Contact Hours: 42 L 3 T0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic Digital Electronics

7 Subject Area: Electronics

8 Objective: To familiarize students with the organization of the computer.

9 Course Outcome: After completion of course a student must be able to

a) Understand the behavior and basic working principle of a computer system.
b) Exhibit a good understanding of the assembly language programming and basic
instructions used.
c) Assess the central processing unit, register organization and various types of addressing
modes. Understand the importance and benefits of parallel processing.
d) Cognizeand describe the input output organization and data transfer techniques.
e) Appraise the various types of memories used in a computer system. Analyze the
importance and functionality of cache and virtual memory organization.
f) Review the various aspects of computer organization and summarize the working
principles of computer system

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Register transfer & Micro-operations, Register transfer language, Bus and 8
memory transfers, Arithmetic logic micro operation, shift micro-operations.
Basic computer organization and design: computer instructions. instruction
cycle, memory-reference instruction, input-output and interrupts.
2 Programming the basic computer: Machine language, Assembly language, 9
The assembler, Program loops, programming arithmetic & logic, subroutines,
input-output programming. Micro-programmed control: Control memory,
address sequencing, micro-program example and design of control unit.
3 Central processing unit: General register organization, stacks organization, 8
addressing modes, data transfer and manipulation, program control, parallel
processing, pipelining, arithmetic pipeline.
4 Input-output organization: Peripherals devices, input-output interface, 8
asynchronous data transfer, modes of transfer, priority interrupt, direct
memory access (DMA), input-output processor, serial communication.
5 Classification of memories –RAM organization, Static RAM, Dynamic 9
RAM. ROM organization – PROM, EPROM, EEPROM, EAPROM,
Memory Hierarchy, Cache Memory, Mapping, locality of references, Virtual
Memory, demand paging, Page fault, Page replacement.
TOTAL 42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 Mano Morris, “Computer System Architecture”, PHI 2005
2 William Stalling, “Computer Organization & Architecture”, Pearson 2006
education Asia
3 Zaky&Hamacher, “Computer Organization”, McGraw Hill 2002
4 B. Ram, “Computer Fundamental Architecture & Organization”, New Age. 2005
5 Tannenbaum, “Structured Computer Organization”, PHI. 2007
Course Name: Bachelor of Computer Applications

Subject Name: Software Engineering Subject Code: TBC-305

1 Contact Hours: 42 L 2 T1 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basics of Information Technology

7 Subject Area: Software Development and Engineering

8 Objective: To familiarize students with the procedures and methods of software

development and how to manage and produce efficient & cost-
effective software systems.

9 Course Outcome: A student who successfully fulfills the course requirements will be
able to-
CO1 Understand and apply software engineering principles and development life cycle
models in real life projects.
CO2 Develop software requirement specification and design documents for software projects.
CO3 Understand and apply design and coding principles in software projects.
CO4 Create and develop test cases using black box and white testing techniques.
CO5 Evaluate software in terms of size, cost and schedule using project management
principles.
CO6 Understand and analyze the importance of quality and reliability in software projects

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Introduction: Introduction to software engineering, Importance of software, 8
The evolving role of software, Software Characteristics, Software
Components, Software Applications, Software Crisis, Software engineering
problems.
Software Development Life Cycle Models: Water Fall Model, Incremental
Model, RAD, Prototyping, Spiral Model, comparisons, advantages and
disadvantages of models.
2 Software Requirement Engineering: Requirements elicitation, Problem 8
Analysis, Requirement specifications characteristics, Components of SRS,
SRS Document.
Software-Design: Design principles, problem partitioning, abstraction, top
 down and bottom up-design, Structured approach, functional versus object
oriented approach, design specifications and verification, Monitoring and
Control, Cohesiveness, coupling, Fourth generation techniques, Functional
independence.
3 Coding: Top-Down and Bottom –Up programming, Structured 8
Programming, Information hiding, programming style and internal
documentation.
Testing: Testing principles, Levels of testing, functional testing, structural
testing, test plane, test case specification, reliability assessment, software
testing strategies, Verification & validation, Unit testing, Integration
Testing, Alpha & Beta testing, system testing and debugging, Software
Maintenance.
4 Software Reliability & Quality Assurance: Reliability issues, Reliability 9
metrics, Role of matrices and measurement, Reliability growth modeling,
Software quality, ISO 9000 certification for software industry, SEI
capability maturity model, and comparison between ISO & SEI CMM.
5 Software Project Management: The Management spectrum- (The people, 9
the product, the process, the project), cost estimation, project scheduling,
staffing, software configuration management, quality assurance, project
monitoring, risk management, Role of management in software
development.
CASE (Computer Aided Software Engineering): CASE and its Scope,
CASE support in software life cycle, Documentation, Project Management,
internal interface, Reverse Software Engineering, Architecture of CASE
environment.
TOTAL 42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 Pressman, Roger S., “Software Engineering: A Practitioner’s Approach Ed. 2004
Boston: McGraw Hill, 2001
2 Jalote, Pankaj, “Software Engineering Ed.2”, New Delhi: Narosa 2002 2002
3 Schaum’s Series, “Software Engineering”, TMH 1999
4 Ghezzi, Carlo and Others, “Fundamentals of Software Engineering”, PHI 1998
5 Alexis, Leon and Mathews Leon, “Fundamental of Software Engineering”, 2001
Vikas
6 Sommerville, Ian, “Software Engineering”, AWL, 2000 Fairly, “Software 2000
Engineering”, New Delhi: TMH
Subject Name: Career Skills - I Subject Code: TBC 306

Course Name: Bachelor of Computer Application

1 Contact Hours: 30 L 2 T 0 P 0

2 Examination Duration(Hrs): Theory 0 2 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic concepts of Logic and application

7 Subject Area: Logical Reasoning

8 Objective: Prepare the students for the logical and analytical reasoning part for campus
placement and competitive exams

9 Course Outcomes: A student who successfully fulfills the course requirements will be

able to:

1) Apply logic to the different types of arrangement based questions and

arrive at solutions to deterministic and non deterministic question sets.
2) Apply the concept of blood relations and learn to draw a family tree
using the different notations.
3) Solve the different types of questions based on orientation of direction
and understanding of distances and turns.
4) Learn to construct a Venn diagram using multiple statements and
arrive at conclusions or possibilities based on logic.
5) Comprehend different types of data sets used in Data Interpretation
and use quick calculation techniques for solving different types of
questions.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Introduction to reasoning, basic concepts and practice of deterministic and non 7
deterministic arrangement based questions (linear, vertical, circular and
rectangular).
Concepts and understanding of deterministic and non deterministic tabular or
grid based questions including understanding of variables and their entries in the
solution table. Practice of tabular or grid based question sets.
2 Blood relation concepts including basic introduction, making a family tree, 6
standard notations and names for gender and relations. Discussion of different
types of questions asked in blood relations, their solutions and practice.
 Concepts and practice of grouping/team formation or condition based questions
including the understanding and application of different conditions used in
grouping sets.
3 Basic concept and understanding of directions including the orientation of the 4 6
basic directions of east, west, north and south. Understanding turns of different
degrees towards right, left, clockwise and anticlockwise.
Basic concept of coding-decoding using alphabets, digits, words and their
combinations. Understanding and practice of different questions in coding
decoding.
Basic concept of series completion using numbers, alphabets, and their
combinations thereof. Understanding of different types of series (based on
differences, based on products, based on exponentials). Practice of different
questions in coding decoding.
4 Understanding the concepts of Syllogism using Venn diagram, types of 5
problems in syllogism (2 statements, 3 statements and 6 statement problems).
Mathematical reasoning including puzzle based questions. Concept and types of
questions in Cubes.
5 Introduction to Data Interpretation (DI), understanding different methods of data 6
representation including tabular, bar graph, pie chart, line graph and caselet.
Techniques of quick arithmetic calculations, concepts of percentage as
applicable in DI, growth and growth rate and practice of various DI sets.
TOTAL 30

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICAT
ION
1 Lalit Singh and P.A.Anand, Verbal Ability and Reasoning for Competitive 2016
Exams, Wiley, First Edition, January 2016.
2 R.S.Aggarwal, A Modern approach to Verbal and Non-Verbal Reasoning for 2018
Competitive Exams, S Chand Publication, January 2018
3 Shakuntala Devi, Puzzles to Puzzle you, Orient Paperbacks, June 1976. 1976
4 George Summers, The great book of Puzzles and Teasers, Jaico Publishing, 1989
September 1989.
5. P.A.Anand, reasoning book, Savera publication.
 Fourth Semester
Program Name: Bachelor of Computer Applications

Course Name: Data Analytics Using Python Course Code: TBC 401

1 Contact Hours: 42 L 2 T 1 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic fundamentals of computer science

7 Subject Area: Computer Science

8 Objective: To teach data science concepts and applications of Python programming.

9 Course Outcome: A student who successfully fulfills the course requirements will be able
to-
a. Define and describe the fundamental aspects of analytics and data science.
b. Implement and examine statistical concepts on real world problems.
c. Describe and implement the fundamental concept of python programming.
d. Examine the data stored in files and evaluate it.
e. Defend and design approach for data analysis using python.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Introduction to DataScience: Introduction to data science, Knowledge 9
domains of Data Analysis, Understanding structured and unstructured data,
Data Analysis process, State of the Practice in Analytics, The Data Scientist,
Data Analytics Lifecycle Challenges of Conventional Systems
2 Statistical Concepts: Sampling Distributions, Re-Sampling, Statistical 9
Inference, Prediction Error, Regression Modelling, Multivariate Analysis,
Bayesian Modelling.
3 Introduction to Python: Installation of Python in Windows, Linux and Osx, 8
Using Interactive shell. Creating, Saving and Running a Python Script. Intro to
Python's data types: String, Lists, Dictionaries, Tuples, Variables,
Assignments; Immutable variables, Numerical types, operators and expressions
4 Functional Programming: Understanding If-Else, While, For, Iterations. 8
Functions Basics, Scopes and Argument Passing. Advanced Functions.
Modules creation and Managing Code with modules.File handling in python.
5 Processing and Visualizing Data : NumPy Basics: Understanding and creating 8
N-dimensional arrays, Basic indexing and slicing, Data processing using
arrays.
Pandas: Importing files and creating data frames, Introductory Data analysis
Visualization using Matplotlib.
42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 David Dietrich, Barry Heller and Beibei Yang, “Data Science and Big Data 2015
Analytics: Discovering, Analyzing, Visualizing and Presenting Data”, EMC
Education Services, Reprint 2015, Wiley, ISBN: 9788126556533.
2 Wesley J. Chun, ―Core Python Applications Programming, 3rd Edition , 2016
Pearson Education, 2016
3 Downey, A. et al., "How to think like a Computer Scientist: Learning with 2015
Python", John Wiley, 2015
4 John Zelle, ―Python Programming: An Introduction to Computer Science‖, 2013
Second edition, Course Technology Cengage Learning Publications, 2013
Course Name: Bachelor of Computer Applications

Subject Name: Microprocessor Subject Code: TBC-402

1 Contact Hours: 42 L 3 T0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basics of the computer architecture

7 Subject Area: Electronics

8 Objective: To familiarize students with the architecture of microprocessor.

9 Course Outcome: A student who successfully fulfills the course requirements will be
able to-
a. The student will be able to analyse, specify, design, write and test assembly language
programs of moderate complexity.
b. The student will be able to select an appropriate ‘architecture’ or program design to
apply to a particular situation; e.g. an interrupt-driven I/O handler for a responsive real-
time machine.
c. Following on from this, the student will be able to design and build the necessary
programs.
d. The student will be able to calculate the worst-case execution time of programs or parts
of programs, and to design and build, or to modify, software to maximise its run time
memory or execution-time behavior.
e. The student will be able to characterize and predict the effects of the properties of the
bus on the overall performance of a system.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Introduction to Microprocessor: Overview of Intel 8085 to Intel pro- 9
Pentium, Motorola 6800 series. Architecture of 8085 Microprocessor: Pin
Diagram, Internal architecture, external system bus architecture.
2 Programming Model (8085): General-purpose register, flags, segment 9
registers, Memory Interfacing, memory addressing. Peripheral I/O,
memory mapped I/O.
3 Basic Input/ Output Interface: Basic I/O and handshaking, I/O port 8
address decoding; 8255 programmable peripheral interface; 8279
programmable keyboard and display interface; 8254 programmable timer;
 8251 programmable communication interface; interrupts, hardware &
software interrupts, 8259 programmable interrupt controller, direct
memory access, 8237 DMA controller.

4 Assembly Language Programming (8085): Instruction and data format, 8

how to write and execute a simple program, writing simple assembly
language programs, Debugging a program, data transfer instructions and
operations. Arithmetic instructions and operations, Logic operations,
stacks and subroutines.

5 Introduction to Micro controller: 8051 architecture, Applications, 8

hardware, input/output pins, ports, interrupts.
TOTAL 42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 R.S Goankar, “Microprocessor architecture, programming and application 2012
with the 8085” , Pen Ram International.
2 Daniel Tabak, “Advanced Microprocessor”, McGraw Hill 2010
3 Kenneth J. Ayala - 8051 Micro controller - Thomson 2010
 Subject Name: Software Project Management and Information Systems

Subject Code: TBC- 403

2. Contact Hours: 42 L: 2 T: 1 P: 0

3. Examination Duration(Hrs): Theory Practical

0 3 0 0
4. Relative Weightage: CWE 25 MTE 25 ETE 50

5. Credits: 0 3

6. Semester: 

Autumn Spring Both

7. Pre-Requisite: Basics of the Software Engineering concepts

8. Subject Area: Software Engineering and Information Systems

9. Objective: To familiarize students with the how the software project are handled

10. Learning Outcomes:

A student who successfully fulfills the course requirements will be able to:
a) Understand and apply software project planning strategies.

b) Analyze and implement the scheduling techniques of software projects in terms of

cost and size.

c) Understand the process of software configuration management.

d) Identify and analyze requirements for information systems

e) Understand and apply design principles in Information Systems and planning and
control.

f) Identify and define Manufacturing and Service Systems.

11. Details of the Course:

Sl.NO CONTENT CONTACT

HOURS
1. Overview of Software Project Planning: Software Project, Categorization of 8
software Project, Introduction to Stepwise Project Planning, Project Scope,
Infrastructure, Resource Allocation, Project Plan Execution. Estimation:
Software Project Estimation, Decomposition Techniques- Software Sizing,
Problem Based estimation, LOC based estimation, Function Point based
estimation, Process Based estimation, Cost Benefit analysis, Cost Estimation
Models, Selection of Technologies.
 2. Project Scheduling: Basic Concepts, Project Scheduling- Basic Principles, 8
Relationship between People and Effort, Task Network, Scheduling, Gantt and
PERT charts, Staffing, Project monitoring and control.
Software configuration management: Concepts and definitions, Need and
importance of SCM, Benefits of SCM, The SCM Process, Plan preparation with
case study, Infrastructure setup, Team Training, System Operation, System
Maintenance, System Retirement. Configuration Baselines, Interface Control,
Metrics change control –Submitting Change Request, Request Analysis,
Request Disapproval and Request Approval Configuration Control Tool.
3. Information and information systems: Concept of Information system, 10
Components of information system,Transaction Processing System (TPS) -
Office Automation System (OAS), Management Information System (MIS) -
Decision Support System (DSS) and Group Decision Support System (GDSS)-
Expert System(ES) Executive Support System (EIS or ESS).
4. Concepts of Planning & Control: Concept of organizational planning, The 10
Planning Process, Computational support for planning, Characteristics of control
process, The nature of control in an organization.Information System
Planning: Information System Development, Analysis, Design, Testing,
Evaluation & Implementation.
5. Manufacturing and Service Systems, Information systems for Accounting, 10
Finance, Production and Manufacturing, Marketing and HRM functions - IS in
hospital, hotel, bank ,Enterprise Resources Planning (ERP): Features,
selection criteria, merits, issues and challenges in Implementation, ERP related
Technologies:Supply Chain Management (SCM): Features, Modules in SCM,
Customer Relation Management(CRM), E-Commerce applications.
TOTAL 42

13. Suggested Books:

Sl.NO NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF

PUBLICATION/
REPRINT
1. Pressman, Roger S., “Software Engineering: A Practitioner’s Approach Ed. 2002
Boston: McGraw Hill, 6th edition, 2001
2. Shtub, Bard, and Globerson,“Project Management: Engineering, 2001
Technology, & Implementation”, Prentice Hall
3. Bob Hughes, Mike Cotterell, “Software Project Management”, 3rd Edition, 2005
McGrawHill
4. ”, Kenneth J Laudon, Jane P.Laudon ,“Management Information Systems”, 2002
Pearson/PHI,10/e, 2007
5. W. S. Jawadekar ,“Management Information Systems”, , Tata McGraw Hill 2001
Edition, 3/e, 2004
Course Name: Web Technologies Course Code: TBC 404

Program Name: BCA

1 Contact Hours: 42 L 2 T1 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 

Autumn Spring Both

6 Pre-Requisite: Basic knowledge of Internet Protocols.

7 Subject Area: Web Programming

8 Objective: To familiarize the students with the basics of web development.

9 Course Outcome: After completion of the course students will be able to

CO 1 Analyze the knowledge of Protocols, Websites and Web Applications.

CO 2 Create a web page and analyze its elements and attributes.

CO 3 Design a basic web site using HTML and CSS to demonstrate responsive web design.

CO 4 Design well-formed XML Document.

CO 5 Implement Client Side Scripting i.e. JavaScript to design dynamic web pages.

CO 6 Create simple web application using server side PHP programming and implement Database
Connectivity using MySQL.

10 Details of the Course:

Unit CONTENT CONTACT

No. HOURS

1 History of the Internet and World Wide Web, Gopher, HTML Protocols – 8
HTTP, SMTP, POP3, MIME, IMAP. FTP, Telnet, Load Balancing, Web server
and Application server, Email, ISP, URL address, DNS. Static VS Dynamic
 Websites, and Website VS Web Applications.

2 HTML/DHTML Basic Tags of HTML, Creating Links, Tables, Frames, forms 8

etc.
Style sheet - Cascading Style Sheets: Introduction to Cascading Style
Sheet (CSS), three ways of introducing the style sheets to your document.
Basic Syntax; Creating and saving cascading style sheets. <STYLE> tag.
3 Extensible Markup Language (XML) Introduction of XML, Features of XML, 8
Advantages and Disadvantages of XML, HTML VS XML, XML Tree, XML DTD,
and XML DOM.
4 Client Side Scripting Introduction to JavaScript, Advantage and disadvantages 9
of JavaScript, Datatype - Variable - Array - Operator and Expression - Looping
Constructor – Function, - Dialog box, DOM, Date and Time, Event Handling,
External JavaScript, Form Validation, and cookies.
5 Introduction to PHP , Install PHP, A First PHP Web Page , Variables, Data 9
Type, Expressions ,Control Statements , Functions , Arrays, String
Handling in PHP, PHP Form, Cookie and Session, PHP MYSQLi.
TOTAL 42

11 Suggested Books:
Sl. NO. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
PUBLICATION

1. Ivan Bayross, “Web Technologies Part II”, BPB Publications. 2001

2. Welling & Thomson's PHP and MySQL Web Development 2002
3. Complete reference HTML 2004
4. JavaScript Bible 1998
5. HTML, DHTML, JavaScript, Perl & CGI Ivan Bayross 2003
Course Name: Bachelor of Computer Applications

Subject Name: Computer Based Numerical & Statistical Subject Code: TBC-405
Techniques

1 Contact Hours: 42 L 3 T0 P 2

2 Examination Duration(Hrs): Theory 0 3 Practical 0 2

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 

Autumn Spring Both

6 Pre-Requisite: Basics of C Programming, Integration, Differentiation

7 Subject Area: Mathematics and Computer Programming

8 Objective: To familiarize students with the practical implementation of the

mathematics functions.

9 Course Outcome: A student who successfully fulfills the course requirements will be
able to-

a. Understand floating point representation in computer system.

b. Understand, analyze and use iterative method of problem solving.

c. Find solutions to complicated mathematical business applications.

d. Understand, analyze and use different algorithmic approach to problem solving.

e. Understand, analyze and use interpolation and extrapolation.

10 Details of the Course:

Unit CONTENT CONTACT

No. HOURS

1 Floating point Arithmetic: Representation of floating point numbers, 9

Operations, Normalization, Pitfalls of floating point representation, Errors
in numerical computation Iterative Methods: Solution of Algebric and
Transcendental Equation using Bisection Method, Iteration Method,
Regula-Falsi method, Newton Raphson method, Secant method
 (Only Solutions to be included no proofs are required)

2 Simultaneous Linear Algebric Equations: Matrix Inversion Method 9

Gauss Elimination method , ILL Conditioned system of equations. Finite
Differences , Interpolation and approximation: Finite Differences,
Difference tables(Forward and Backward),Shift Operator E Polynomial
Interpolation: Newton’s forward and backward formula Central
Difference Formulae: Gauss forward and backward formula, Stirling’s,
Bessel’s, Everett’s formula. Interpolation with unequal Intervals:
Langrange’s Interpolation, Newton Divided difference formula.
(Only Solutions to be included no proofs are required)
3 Numerical Differentiation and Integration: Introduction, Numerical 8
Differentiation using Newton Forward and Newton Backward Formula.
Numerical Integration: Trapezoidal rule, Simpson’s rules, Boole’s Rule,
Weddle’s Rule.
Solution of differential equations: Picard’s Method, Euler’s Method,
Modified Euler’s Method Taylor’s Method, Runge-Kutta methods
(Only Solutions to be included no proofs are required)

4 Curve fitting, Cubic Spline and Approximation: Method of least 8

squares, fitting of straight lines, polynomials, Exponential curves,
Statistical Computation : Frequency Distribution, Cumulative, Relative
Frequency distribution, Graphical Representation of Frequency
Distribution
Regression analysis: Linear and Non-linear regression, Multiple
regression,Correlation Analysis: Karl Pearson, Rank Correlation,
Spearman Coefficent.

5 Time series and forecasting: Measurement of secular trend methods, 8

forecasting models and methods.

TOTAL 42

11 Suggested Books:

Sl. YEAR OF
NO. PUBLICAT
NAME OF AUTHERS/BOOKS/PUBLISHERS ION

1 Manish Goel,”Computer Based Numeriacal and Statistical 2002

Techniques”,Lakshmi Publication
2 Rajaraman V., “Computer Oriented Numerical Methods”, PHI 2003

3 Gerald & Wheatley, “Applied Numerical Analyses”, AW 2004

4 Jain, Iyengar and Jain, “Numerical Methods for Scientific and 2001
Engineering Computations”, New Age Int
5 Grewal B. S., “Numerical methods in Engineering and Science”, Khanna 1998
Publishers, Delhi
6 T. Veerarajan, T Ramachandran, “Theory and Problems in Numerical 1999
Methods”, TMH
7 Pradip Niyogi, “Numerical Analysis and Algorithms”, TMH 2001

8 Francis Scheld, “Numerical Analysis”, TMH 2002

9 Gupta S. P., “Statistical Methods”, Sultan and Sons 2003

Subject Name: Career Skills - II Subject Code: TBC 406

Course Name: Bachelor of Computer Application

1 Contact Hours: 30 L 2 T 0 P 0

2 Examination Duration(Hrs): Theory 0 2 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 2

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic concepts of Logic and application

7 Subject Area: Quantitative Aptitude

8 Objective: Prepare the students for the quantitative aptitude part for campus placement and
competitive exams

9 Course Outcomes: A student who successfully fulfills the course requirements will be

able to:

CO 1. Apply the properties of numbers and the other concepts to solve

different problems on number theory.
CO 2. Understand the concepts of profit loss and simple interest and
compound interest to solve different types of problems.
CO 3. Apply the concepts of Ratio and Proportion to solve the different
types of questions in mixtures and solutions.
CO 4. Analyze the relation between speed, distance and time to effectively
solve the problems of relative speed, boats and streams and trains.
CO 5. Understand the concept of Permutation, Combination and
Probability to apply and practice the different types of questions.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Classification of numbers, rules of divisibility, properties of remainders, LCM- 7
HCF and their applications, concept of the last digit, concept of alpha numerals.
Practice of questions based on number system concepts.
Concept of percentage and percentage equivalent of fractions, multiplication
factor, importance and understanding of the base in calculations, concept and
application of the successive percentage change rule
2 Concept of profit, loss and discount and its application. Understanding and 6
practice of questions based on addition of impurity and unequal quantity buying
 and selling concept.
Concept and understanding of simple and compound interest and their
difference, understanding CI as an application of the successive percentage
change rule, concept of effective rate of interest and practice of all the types of
problems in SI and CI.
3 Concept of ratio proportion and its application. Concept, understanding and 5
practice of mixtures and solutions including alligation and replacement of part
of a solution.
Concept and understanding of average, weighted average and its application.
Practice of problem based on age related concepts.
4 Concepts of time, speed and distance, understanding the direct and inverse 6
relations in the topic, average speed and its application. Understanding the
concept and application of relative speed and practice of problems based on
trains and boats and streams.
Concepts of time and work and its application based problems using the LCM
method for individual efficiencies and practice of problems based on group
efficiencies.
5 Concept, understanding and practice of questions based on permutation and 6
combination, difference in the approach for different things and identical things.
Concept, understanding and practice of questions based on probability.
TOTAL 30

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICAT
ION
1 R.S.Aggarwal, Quantitative Aptitude for Competitive Exams, S.Chand, 20th 2013
Edition.
2 P.A.Anand, Quantitative Aptitude for Competitive Exams, Wiley Publication, 2015
First Edition.
 Fifth Semester
Subject Name: Android Programming Subject Code: TBC 501

Course Name: BCA

1 Contact Hours: 42 L 2 T 1 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 2

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Object oriented programming using Java Language is expected for the
course.

7 Subject Area: Mobile Development

8 Objective: To provide the students with the knowledge and skills needed to develop
Mobile Applications by using Android Programming.

9 Course Outcomes: After completion of the course students will be able to

CO1. Analyze the components of Android to design applications.

CO2. Apply the development tools in the Android development environment.
CO3. Create applications using all the major UI components and analyze the life cycles of
Activities, Fragments and Intent.
CO4. Design applications using all the widgets and layouts that will show the power of
Android Programming.
CO5. Design applications to implement the concept of files and SQLite Database.
CO6. Analyze and implement the concept of Telephony, and messaging.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Unit I: Introduction to Android: Introduction of Android, OHA, 9
Features of Android, History, versions, Android Architecture, Android
core building blocks, Android Emulator, Configuring Android
Development Environment: Downloading and installing JDK and Net
beans, Downloading and installing Android Studio. Creating First
Android App: Creating new Android Project, Creating AVD. Android
 project files: Android Manifest.xml, MainActivity.java, R.java,
activity_main.xml etc. Android Tools: DVM, AVD Manager, Android
SDK Manager, Android Emulator, DDMS, resource folder.
2 Unit II: App Components: Activity, Service, Broadcast Receiver, and 9
Content Provider. Activity: Creating an Activity, Starting an Activity,
Lifecycle of an Activity. Views: Button, Text View, Edit Text, Radio
Button, Image View, Toast, Adapter, Spinner, List View, Grid View,
ToggleButton, AutocompleteTextview.
3 Unit III: Intent: What is Intent, Why Intent? Types of Intent, Intent 8
Filters. Android Menu. User Interface: layout types and attributes, UI
controls, Event handling. Widgets: CheckBox, RadioButton, Alert
Dialog, List View, Date Picker, Time Picker, Progress Bar.
4 Unit IV: SQLite database: Introduction to SQLite Database and 8
SQLiteOpenHelper class.
Querying a database: Inserting, searching, updating and deleting a
record.
5 Unit V: Telephony: Understanding TelephonyManager class, display 8
phone information, phone call state.
SMS: Introduction of SmsManager Class, Sending and receiving sms.
Introduction of Sensor devices.
TOTAL 42

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICAT
ION
1 Android Application Development Cookbook, by Wei-Meng Lee, John 2013
Wiley and Sons, 2013
2 Professional Android 4 Development by Reto Meier, John Wiley and 2012
Sons, 2012
3 Android in Action, Third Edition, by W. Frank Ableson, RobiSen, Chris 2012
King, C. Enrique Ortiz, 2012
4 Beginning Android 4, by Grant Allen, Apress, 2011 2011
Course Name: Bachelor of Computer Applications

Subject Name: Programming with .NET C# Subject Code: TBC-502

1 Contact Hours: 42 L 2 T1 P 2

2 Examination Duration(Hrs): Theory 0 3 Practical 0 2

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Object oriented programming overview is expected for the course.

7 Subject Area: Computer Applications with Dot Net.

8 Objective: To provide the students with the knowledge and skills needed to
develop web based Microsoft .NET products by using C#.

9 Course Outcome: A student who successfully fulfills the course requirements will be
able to-
a. Design and implement applications and distributed systems on the .NET platform.
b. Describe and apply the advanced techniques of object-oriented programming in web
application development.
c. Investigate and create solutions to programming problems using the C# programming
language that contain an analysis, solution design and documented code.
d. Development of web applications using .Net Technology.
e. Programming Web Applications with ASP.NET.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Overview of the Microsoft .NET Platform: 8
Future of computing and the Microsoft’s vision, Understanding the
motivation behind the .NET platform, Constituents of the .NET platform,
CLR, Forces behind the fame, CTS, CLS, Know the role of CIL,
Platform independence in .NET, .NET [R]Evolution, advantages, &
prospects, Understanding the core: Assemblies (DLL HELL, Metadata,
Namespace & Versioning), Deploying the .NET runtime.
2 C# Language Syntax: 9
Working with data types & conversions: Strings, Dates & Time,
Integers, Performing calculations with mathematical operators,
Converting between data types
Controlling program execution: IF statements, CASE (SWITCH)
 statements, FOR, FOREACH Loops, WHILE, DO-WHILE Loops,
Storing multiple values with arrays.
3 C# .NET Object Oriented Programming: 9
Coding object oriented applications: Dividing code into classes, Adding
fields, method properties, events and constructors to classes, Defining
scope & visibility, Garbage collector, Inheritance & polymorphism,
Overloading methods, Handling errors: Throwing exceptions,
Try…..Catch…..Finally, Simplifying maintenance through inheritance:
Implementing a base class, Defining virtual and abstract methods,
Overriding methods in derived classes,
Building applications with Visual Studio: Managing projects with the
solution explorer, Setting project properties and adding references,
Adding files, folders and code, Compiling, debugging and testing
programs,
Automating testing with Visual Studio: Creating Visual Studio test
projects, Writing Unit tests, Testing classes, properties, method and
exceptions.
4 Programming Web Applications with ASP.NET: 8
Constructing ASP.NET Web Sites with Visual Studio: Writing HTML
pages and forms, Maintaining consistency with Master pages, Designing
pages with ASP.NET controls, Styling sites with ASP.NET themes.
Processing ASP.NET Web Forms: Initializing Web Forms controls,
Activating Web Forms with events, ASP.NET AJAX, Working with
XML, ASP.NET MVC
5 Incorporating Relational Databases: 8
Relational database concepts: Selecting, inserting, updating and
deleting query syntax.
Creating a SQL Server Database: Defining primary & foreign key
relationships.
Accessing the database with ADO.NET: Connecting to the database
and running SQL commands, Storing user information, Retrieving
existing records.
Deploying .NET Applications: Installing the .NET Framework, Moving
ASP.NET applications to the Web.
TOTAL 42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 ASP.NET MVC 4 Jamie Kurtz, Apress 2013
2 Pro C# 5.0 and the .NET 4.5 Framework Sixth Edition, Andrew Troelsen 2012
3 C# Programming Language (C# 4.0), 4th Edition, Anders Hejlsberg, 2010
Mads Torgersen, Scott Wiltamuth, and Peter Golde
4 C# 4.0 in a Nutshell: The Definitive Reference by Joseph Albahari and 2010
Ben Albahari
5 Designing Microsoft ASP.NET Applications Microsoft Press, Douglas J. 2010
 Reilly
6 Head First C#, 2E: A Learner’s Guide to Real-World Programming with 2009
Visual C# and .NET (Head First Guides) by Andrew Stallman and
Jennifer Greene
Course Name: Bachelor of Computer Applications

Subject Name: Optimization Techniques Subject Code: TBC-503

1 Contact Hours: 42 L 3 T P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Knowledge of graphs and algorithms.

7 Subject Area: Mathematics

8 Objective: To familiarize students with the Optimization of the resources

through mathematical models.

9 Course Outcome: A student who successfully fulfills the course requirements will be
able to-
a. Ability to formulate a wide range of management problems that can be solved to
optimality by classical combinatorial optimization techniques.
b. The knowledge of alternative solution approaches such as metaheuristics that can find
nearly optimal solutions.
c. Understand the concept of game theory
d. Understand the concept of PERT and CPM
e. Understand the time Estimation in critical path analysis.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Meaning, Significance and scope of Operation Research, Management 8
Applications of Operations research, Features of Operation Research,
Quantitative technique of Operation Research, Role of Computers in
Operation Research.
2 Formulation of Linear programming problems, Graphical Solution of LP 8
problems, Simplex Method, Two phase method, Big M method,
Transportation, Assignment, and Travelling-Salesman problems.
3 Theory Of Games: Types of games, Pure Strategy and mixed strategy. 9
4 Sequencing: Processing n jobs through 2 machines, Processing n jobs 9
through 3 machines, Processing 2 jobs through n machines, Processing n
jobs through m machines.
5 PERT and CPM: Application of PERT/CPM Techniques, Basic steps in 8
 PERT/CPM techniques, Network diagram representation, Time Estimates
in critical path analysis, Project time cost trade off, Updating of project,
resource allocation, project monitoring.
TOTAL 42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 S.D. Sharma, Operation Research, Kedar Nath Ram Nath 2001
2 Ravinder Philips and solberg, Operation Research Principles and Practice 2003
John Willy & Sons.
3 H.A. Taha, Operation Research, prentice Hall of India 2004
4 Rounetran , Phillips,solberg: Operation Research: Willy DreamTech India 2002
Pvt Ltd.
Course Name: Bachelor of Computer Applications

Subject Name: Cryptography Subject Code: TBC-504

1 Contact Hours: 42 L 3 T0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basics of the Networking

7 Subject Area: Cryptography and Security

8 Objective: To familiarize students with the Security algorithms regarding the

networking issue

9 Course Outcome: A student who successfully fulfills the course requirements will be
able to-
a. Identify some of the factors driving the need for security and cryptography.
b. Identify and classify particular examples of attacks.
c. Understand the basics of symmetric key cryptography.
d. Understand the basics of Asymmetric key cryptography.
e. Understand the concept of Hash functions and their use.
f. Understand the basics Digital Signatures.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Introduction to Cryptography: Introduction To Cryptography,Security 9
Goals, Cryptographic Attacks. Mathematics of Cryptography: Modular
Arithmetic, Congruence and Matrices. Conventional Encryption
Model,Symmetric Key Ciphers, Categories of Symmetric Key Ciphers.
Stream and Block Ciphers,
2 Modern Block Ciphers: Components of Modern Block Ciphers, Thoughts 9
of Feistel Design, Block Cipher Principles,Product Ciphers. Simplified
DES, DES Structure, DES Standard, DES Strength, Differential & Linear
Cryptanalysis, Block Cipher Design Principles, Block Cipher Modes Of
Operation.
Multiple DES: Double DES, Triples DES. Introduction to AES.
3 Advanced Encryption Algorithms: Blowfish Algorithm, International 8
Data Encryption Algorithm, RC-5, Symmetric Key Distribution, Random
Number Generators, Placement of Encryption Function.
4 Public Key Encryption:Difference between Symmetric and Asymmetric 8
key Cryptosystems, Public-Key Cryptography: Principles of Public-Key
Cryptosystems, RSA Algorithm, Rabin Cryptosystem, ElGamal
Cryptosystem, Key Management, Public Key Distribution, Fermat’s &
Euler’s Theorem.
5 Hash Functions: Message Authentication & Hash Functions: 8
Authentication Requirements, Authentication Functions, Message
Authentication Codes, Hash Functions, Security Of Hash Function &
MACS, MD-5 Message Digest Algorithm, Secure Hash Algorithm (SHA-
512), Digital Signatures: Digital Signature Standard, Authentication
Protocol, Digital Signature Algorithm (DSA).
TOTAL 42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 William Stallings, “Cryptography and Network Security: Principles and 2002
Practice”, Prentice Hall, New Jersey.
2 Johannes A. Buchmann, “Introduction to cryptography”, Springer- 2004
Verlag.
3 Atul Kahate, “Cryptography and Network Security”, TMH 2008
4 Behrouz A Forouzan, “Cryptography and Network Security”, McGraw 2016
Hill, 3rd ED.
 Subject Name: Distributed Systems Subject Code: TBC 505 (1)

1. Contact Hours: 42 L: 3 T: 0 P: 0

0 0
2. Examination Duration(Hrs): Theory 0 3 Practical
3
25 3 25 50
3. Relative Weightage: CWE 3 MTE ETE
3
0 3 3
4. Credits:

5. Semester: √

Autumn Spring Both

6. Pre-Requisite: Knowledge of Operating System and Computer Network.

7. Subject Area: Computer Science

8. Objective: How to optimize the various resource available in distributed network

environment.

9. Course Outcomes: The student, on successful completion, will be able to:

a) Define and understand a distributed system and its structure.

b) Identify the goals, challenges and pitfalls of a distributed system.
c) Understand and analyze the concept of physical,logical and vector clocks.
d) Understand the concept of mutual exclusion and deadlock wrt a distributed
system
e) Understand the concept of agreement protocols.
f) Define the components and basics of distributed scheduling.

10. Details of the Course:

Sl.NO CONTENT CONTACT

HOURS
1. Characterization of Distributed Systems: Introduction, Goals and 9
Challenges of Distributed System, Pitfalls of Distributed Systems,
Examples of distributed Systems.
Architectural models of distributed systems, Limitation of
Distributed system, absence of global clock and shared memory,
Logical clocks, Lamport’s & vectors logical clocks, Causal ordering
of messages.
 2. Distributed Mutual Exclusion: Classification of distributed mutual 9
exclusion, requirement of mutual exclusion algorithms, Token
based and non-token based algorithms, performance metric for
distributed mutual exclusion algorithms.
Huang Ho termination detection algorithm.
3. Distributed Deadlock Detection: System model, Resource Vs 8
Communication deadlocks, deadlock prevention, avoidance,
detection & resolution, centralized dead lock detection,
distributed dead lock detection, path pushing algorithms, edge
chasing algorithms.
4. Agreement Protocols: Introduction, System models, classification 8
of Agreement Problem, Byzantine agreement problem, Consensus
problem, Interactive consistency Problem, Solution to Byzantine
Agreement problem, Application of Agreement problem.
5. Distributed Scheduling: Issues in Load Distributing, load Balancing 8
vs Load Sharing. Preemptive Vs Non Preemptive Transfers
Components of Load Distributing Algorithms: Transfer Policy,
Selection Policy, Location Policy, Information Policy.
Load Distributing Algorithms: Sender Initiated Algorithm, Receiver
Initiated Algorithm, Symmetrically Initiated Algorithm, Adaptive
Algorithm
TOTAL 42

12. Suggested Books:

Sl.NO NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF

PUBLICATION/
REPRINT
1. Singhal & Shivaratri, "Advanced Concept in Operating Systems", 2001
McGraw Hill
2. Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and 2001
Design”, Pearson Ed.
3. Gerald Tel, "Distributed Algorithms", Cambridge University Press 2005
Course Name: Fundamentals of Cloud Computing Course Code: TBC 505(2)

Course Name: Bachelor of Computer Application

1 Contact Hours: 42 L 3 T0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Introductory knowledge of networking and distributed systems.

7 Subject Area: Computer Application

8 Objective: To introduce the students with the idea of cloud computing and its
application

9 Course Outcome: A student who successfully fulfills the course requirements will be
able to
a. Defineand differentiate between various Cloud deployment
models.
b. Classify and demonstrate the use of various service models.
c. Describe and demonstrate the functionalities of various storage
architectures.
d. Classify and interpret the concepts of virtualization.
e. Select vendors of a secure Cloud model based on requirements.
f. Define and examine the security concerns for cloud.
10 Details of the Course:
Unit CONTENT CONTACT
No. HOURS
1 Cloud computing Fundamentals – Short history of cloud computing, 9
CloudStorage, Pros and Cons of cloud computing, Benefits from
cloudcomputing.Basic and Essential characteristic of cloud computing
model.Use and application of Cloud computing.
2 Cloud Platform Architecture: NIST cloud reference architecture, Cloud 8
Computing and service Models: IAAS, PAAS, SAAS, Cloud Deployment
models, public, private, hybrid and community models and their
comparative study.
3 Storage Architectures: Evolution of storage technology, storage models, 8
file systems and database, distributed file systems, general parallel file
systems. Google file system. Prevalent Storage technologies like DAS,
RAID, NAS and SAN architectures, Data centers for Cloud Computing.

4 Virtual Machines and Virtualization : Introduction, brief history of 8

virtualization, Need for virtualization, Concept of hypervisor and its
types, Virtualization architecture, pros and cons of virtualization, Types
of Virtualization, Hardware Virtualization, Software Virtualization,
Memory Virtualization, Storage Virtualization Network Virtualization
5 Security Recommendations and Software Environments: Cloud 8
Security Recommendations ,Virtualization Security Recommendations,
Introduction to AWS, Key Amazon offerings, Google App Engine
TOTAL 42

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICAT
ION
1 J. W. Rittenhouse and J. F. Ransome “Cloud Computing, 2010
Implementation, Management, and Security”, CRC Press.
2 A. S. Tanenbaum,"Modern Operating Systems, 3rd Edition", by Andrew 2007
S. Tanenbaum, Prentice Hall.

3 G. Reese, “Cloud Application Architectures", O.Reilly 2009

4 D.S. Linthicum "Cloud Computing and SOA Convergence in Your 2009

Enterprise: A Step-by-Step Guide", Addison Wesley
Course Name: Soft Computing Subject Code: TBC 505(3)

Program BCA
Name:

1 Contact Hours: 42 L 3 T 0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 

Autumn Spring Both

6 Pre-Requisite: Nothing

7 Subject Area: Computer Science

8 Objective: To familiarize students with the Computer design and organization and
architecture of computer. This course also includes functional units of the
PC, basic working of CPU, memory organization and I/O device etc.

9 Course Outcome: After completion of course a student must be able to

CO 1 Understand different soft computing techniques like Genetic Algorithms, Fuzzy Logic,
Neural Networks and their applications

CO 2 Analyze various neural network architectures.

CO 3 Understand perceptrons and counter propagation networks.

CO 4 Apply soft computing techniques to solve engineering or real life problems. Define the
fuzzy systems

CO 5 Analyze the genetic algorithms and their applications.

10 Details of the Course:

Unit CONTENT CONTACT

No. HOURS

1 Introduction: What is Soft Computing? Difference between Hard and Soft 8

computing, Requirement of Soft computing, Major Areas of Soft
Computing, Applications of Soft Computing.
 Fundamentals of ANN: The Biological Neural Network, Artificial Neural
Networks -Building Blocks of ANN and ANN terminologies:
architecture, setting of weights, activation functions - McCulloch-pitts
Neuron Model, Hebbian Learning rule, Perception learning rule, Delta
learning rule.
2 Models of ANN: Single layer perception, Architecture, Algorithm, 8
application procedure- Feedback Networks: Hopfield Net and BAM -
Feed Forward Networks: Back Propogation Network (BPN) and Radial
Basis Function Network (RBFN) – Self Organizing Feature Maps: SOM
and LVQ.

3 Fuzzy Sets, properties and operations - Fuzzy relations, cardinality, 8

operations and properties of fuzzy relations, fuzzy composition.

4 Fuzzy variables - Types of membership functions - fuzzy rules: Takagi 8

and Mamdani –fuzzy inference systems: fuzzification, inference,
rulebase, defuzzification.

5 Genetic Algorithm (GA): Biological terminology – elements of GA: 10

encoding, types of selection, types of crossover, mutation, reinsertion – a
simple genetic algorithm –Theoretical foundation: schema, fundamental
theorem of GA, building block hypothesis.

TOTAL 42

11 Suggested Books:
Sl. NO. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
PUBLICATION

1 S. N. Sivanandam, S. Sumathi, S.N. Deepa, Introduction to Neural 2008

Networks using MATLAB 6.0 , Tata McGraw-Hill, New Delhi.

2 S. N. Sivanandam, S. Sumathi, S.N. Deepa, Introduction to Neural 2006

Networks using MATLAB 6.0 , Tata McGraw-Hill, New Delhi.

3 D.E. Goldberg, Genetic algorithms, optimization and machine learning, Addison 2000
Wesley.

4 Martin T. Hagan, Howard B. Demuth, Mark Beale, Neural Network Design, 2002
Thomson Learning, India.
Subject Name: Agile Software Development Subject Code: TBI 505
(4)
Course Name: Bachelor of Computer Application

1 Contact Hours: 42 L 3 T 0 P 0
2 Examination Duration(Hrs): Theory 0 3 Practical 0 0
3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50
4 Credits: 0 3
5 Semester: 
Autumn Spring Both
6 Pre-Requisite: 12. Basic knowledge of Computer Fundamentals

7 Subject Area: Computer Applications

8 Objective: Understand the concepts of Software Engineering & Project Management

9 Learning Outcome: A student who successfully fulfills the course requirements will be
able to:

CO 1 Describe and compare two or more agile software development methodologies.

CO 2 Identify the benefits and pitfalls of transitioning to agile.
CO 3 Compare agile software development to traditional software development models.
CO 4 Apply agile practices such as test-driven development, standup meetings, and pair
programming to their software engineering practices.
CO 5 Apply the agile software testing.
CO 6 Understand and Describe the agile in current market scenario.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Fundamentals of Agile: The Genesis of Agile, Introduction and 8
background, Agile Manifesto and Principles, Overview of Agile
Methodologies – Scrum methodology, Extreme Programming, Feature
Driven development, Design and development practices in an Agile
projects, Test Driven Development, Continuous Integration, Refactoring,
Pair Programming, Simple Design, User Stories, Agile Testing, Agile
Tools.
2 Agile Project Management: Agile Scrum Methodology, Project phases, 9
Agile Estimation, Planning game, Product backlog, Sprint backlog,
Iteration planning, User story definition, Characteristics and content of
user stories, Acceptance tests and Verifying stories, Agile project
velocity, Burn down chart, Sprint planning and retrospective, Daily
scrum, Scrum roles – Product Owner, Scrum Master, Scrum Developer,
Scrum case study, Tools for Agile project management.
3 Agile Software Design and Programming: Agile Design Principles 9
 with UML examples, Single Responsibility Principle, Open Closed
Principle, Liskov Substitution Principle, Interface Segregation Principles,
Dependency Inversion Principle, Need and significance of Refactoring,
Refactoring Techniques, Continuous Integration, Automated build tools,
Version control, Test-Driven Development (TDD), xUnit framework and
tools for TDD.
4 Agile Testing: The Agile lifecycle and its impact on testing Testing 8
user stories acceptance tests and scenarios, Planning and managing
Agile testing, Exploratory testing, Risk based testing, Regression tests,
Test Automation, Tools to support the Agile tester.
5 Agile in Market: Market scenario and adoption of Agile, Roles in an 8
Agile project, Agile applicability, Agile in Distributed teams, Business
benefits, Challenges in Agile, Risks and Mitigation, Agile projects on
Cloud, Balancing Agility with Discipline, Agile rapid development
technologies.
TOTAL 42

11 Suggested Books:
Sl. NO. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
PUBLICATION
1 Ken Schawber, Mike Beedle ,“Agile Software Development with Scrum”, 2008
Pearson
2 R. S. Pressman, “Software Engineering – A Practitioner’s Approach”, 2007
McGraw Hill Int. , 7th Ed.
3 Mike Cohn, “User Stories Applied: For Agile Software Development”, 2004
Addison-Wesley
4 Robert C. Martin, “Agile Software Development, Principles, Patterns, and 2002
Practices”, PHI; 1st edition
Subject Name: Career Skills - III Subject Code: TBC 506

Course Name: Bachelor of Computer Applications

1 Contact Hours: 30 L 2 T 0 P 0

2 Examination Duration(Hrs): Theory 0 2 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 2

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic understanding of the English language

7 Subject Area: Verbal Ability

8 Objective: Prepare the students for the verbal ability part for campus placement and
competitive exams

9 Course Outcomes: A student who successfully fulfills the course requirements will be

able to:

CO 1. Discern an understanding of complex grammatical structures

through the Concept of Tenses, Subject and Verb Agreement etc.
CO 2. Enrich the vocabulary and apply vocabulary building strategies to
improve the analysis of readings.
CO 3. Exhibit proficiency in drafting a professional resume by using
appropriate style structure etc.
CO 4. Demonstrate a literal, inferential and evaluative comprehension of
readings, through identification and analysis of main ideas and supporting
details both implied and inferred.
CO 5. Acquire, develop and challenge ideas by using group discussion as
a tool. And also demonstrate the skills needed to participate in an
effective oral communication like interviews by voicing his thoughts and
ideas in a constructive and coherent manner.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Applied Grammar and Usage III 8
a. Error Detection based on SVA, Tense, Conditionals and Active & Passive
Voice.
b. Indianism
2 Vocabulary Building II 4
 a. Synonyms and Antonyms
b. Idioms and Phrases
c. Common Proverbs
3 Writing Skills 5
a. Cover Letter: Objective and Importance
b. Types of Resume: Chronological, Combination and Functional
c. Resume Writing Practice
4 Reading Skills and Parajumbles 6
a. Reading Comprehension: Types and Strategies to Solve, Central Idea, Tones
and Drawing Inference.
b. Parajumbles (4 and 6 statement types)
5 Group Discussion and Interviews 7
a. An Introduction to concept: Dos and Don’ts
b. Types
Interviews:
a.An Introduction to concept: Dos and Don’ts
b. Types of interviews
c. FAQs during an interview
Note: Mock GDs and Interviews to be conducted.

TOTAL 30

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICAT
ION
1 Martin Hewings- Advanced English grammar, Cambridge University Press, 1999
November 1999.
2 Raymond Murphy- English grammar in use (Intermediate level), Cambridge 1999
University Press, November 1999.
3 Norman Lewis-Word Power Made Easy, Distributed Art Publishers, June 2011. 2011
4 Any other reading as suggested by the faculty.
 Sixth Semester

Subject Name: Computer Graphics Subject Code: TBC 601

Course Name: BCA

1 Contact Hours: 42 L 2 T1 P 2

2 Examination Duration (Hrs): Theory 0 3 Practical 0 2

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 

Autumn Spring Both

6 Pre-Requisite: 1. Knowledge of Computers

7 Subject Area: Computer Application

8 Objective: 2. To familiarize students with Computer Graphics

9 Course Outcome:

CO1 Understanding of the structure of an interactive computer graphics system, and the

separation of system components.

CO2 Apply the algorithms to draw graphic objects.

CO3 Design and apply two dimensional and three dimensional graphics and transformations.

CO4 Analyze the vector and matrices representation of graphics objects.

CO5 Apply and implements the clipping and filling techniques on graphics objects.

CO6 Analyze the importance of projections and animations.

10 Details of the Course:

Unit CONTENT CONTACT

No. HOURS

1 Introduction to Computer Graphics: Definition, Applications, Graphics 8

Hardware, Display Devices: Refresh Cathode Ray Tube, Raster Scan Display,
Plasma display, Liquid Crystal display, Plotters, Printers. Dithering, Half-toning,
Aliasing, Anti-aliasing.
2 Mathematics for Computer Graphics: Point representation, Vector 9
representation, Matrices and operations related to matrices, Vector addition and
vector multiplication, Scalar product of two vectors, Vector product of two
vectors. Parametric equations of lines and conics.

3 Line Drawing Algorithms: DDA algorithms, Bresenham’s Line algorithm. Circle 9

and ellipse generation algorithm.

Clipping: Point Clipping, Line Clipping. Polygon Clipping.

Filling: Inside Tests, Flood fill algorithm, Boundary-Fill Algorithm and scan-line
polygon fill algorithm.

4 2D Transformation: 2D transformation, Basic Transformations, Composite 8

transformations: Reflection, Shearing, Transformations between coordinate
systems.

3D Transformation: 3D transformations, Parallel projection, Perspective

projection, Visible lines and surfaces identification, Hidden surface removal
algorithms.

5 Animation: Introduction to Animation, Principles of Animation, Types of 8

Animation, Types of Animation Systems: Scripting, Procedural,
Representational, Stochastic, etc.

GKS Standards, GKS Primitives – Polyline, Polymarker, and Fill area, Text,
GKS Workstation and Metafiles.

TOTAL 42

11 Suggested Books:
Sl. NO. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
PUBLICATI
ON/REPRI
NT
1 Donald Hearn and M. Pauline Baker, “Computer Graphics”, PHI 2008

2 Steven Harrington, “Computer Graphics: A Programming Approach”, TMH 2000

3 V.K.Pachghare, “Computer Graphics”, Second Edition, Laxmi Publications 2011

4 P. K. Singh, Rajendra Kumar, ”Computer Graphics (GBTU)”, First Edition, Vikas 2010
Publishing House Pvt. Ltd.

5 Newman and Sproul, “Principle of to Interactive Computer Graphics”, McGraw Hill 2005
Course Name: Bachelor of Computer Applications

Subject Name: Network Security and Cyber Law Subject Code: TBC-602

1 Contact Hours: 42 L 3 T0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 

Autumn Spring Both

6 Pre-Requisite: Basic Knowledge of Networking and Cryptography

7 Subject Area: Network Security

8 Objective: To familiarize students with the techniques used in network security,

cyber security and Cyber law.

9 Course Outcome: A student who successfully fulfills the course requirements will be
able to-

a. Understand and analyze the Importance of Network security.

b. Define and differentiate methods and protocols used in Network Security.
c. Demonstrate and define the concept of ISO security architecture.
d. Understand and analyze the Concept of Cyber Law and Cyber Security.
e. Understand the Scope and Object of the IT Act.
e. Understand the basic and advanced concepts of distributes attacks.

10 Details of the Course:

Unit CONTENT CONTACT

No. HOURS

1 Introduction to Network security: Introduction to Network Security, 8

Goals of Network Security, ISO security Architecture: Attacks,
Categories of Attacks, Network Security Services & Mechanisms.
Authentication Applications: Kerberos, X.509 Directory Authentication
Service.
2 Application Layer Security: Security threats and countermeasures SET 9
protocol, Electronic Mail Security, Pretty Good Privacy (PGP), S / Mime.
 Transport Layer Security: Secure Socket Layer & Transport Layer
Security, Wireless Transport layer security.
3 IP Security: Authentication Header, Encapsulating Security Payloads. 8
System Security: Intruders, Intrusion Detection System, Viruses,
Firewall Design Principles, Trusted Systems, OS Security, Program
Security.
4 Introduction to Cyber Law: Cyber, Cyber Crime, Cyber criminals, 8
Cyber Law.
Object and Scope of the IT Act: Genesis, Object, Scope of the Act, E-
Governance and IT Act 2000, Legal recognition of electronic records,
Legal recognition of digital signature, Use of electronic records and
digital Signatures in Government and its agencies. IT Act in detail.
Basics of Network Security: IP Addresses, Port numbers and sockets,
Hiding and Tracing IP Addresses. Scanning: Traceroute, Ping sweeping,
Port Scanning, ICMP scanning, Fingerprinting: active and passive email.

5 Different kinds of buffer overflow attacks: Stack overflows, string 9

overflows, Heap and Integer overflows. Internal Attacks: Emails,
Mobile Phones, Instant Messengers, FTP Uploads, Dumpster Diving,
Shoulder Surfing.
DOS Attacks: Ping of Death, Teardrop, SYN flooding, Land Attacks,
Smurf Attacks, UDP flooding, Hybrid DOS Attacks, Application
Specific, Distributed Dos Attacks.

TOTAL 42

11 Suggested Books:

Sl. YEAR OF
NO. PUBLICAT
NAME OF AUTHERS/BOOKS/PUBLISHERS
ION

1 William Stallings, “Cryptography and Network Security: Principles and 2002

Practice”, Prentice Hall, New Jersey.
2 Atul Kahate, “Cryptography and Network Security”, TMH 2008

1 Zeinab Karake Shalhoub, Sheikha Lubna Al Qasimi Cyber Law And 2010
Cyber Security In Developing And Emerging Economies.
2 Sunit Belapure and Nina Godbole,Cyber Security: Understanding Cyber 2010
Crimes, Computer Forensics And Legal Perspectives.
3 Gerald R Ferrera, Margo E K Reder, Stephen D Lichtenstein,Cyber Law: 2011
Text and Cases.
Subject Name: Fundamentals of Machine Learning Subject Code: TBC- 603

Course Name: Bachelor of Computer Applications (BCA)

1 Contact Hours: 42 L 2 T 1 P 2

2 Examination Duration(Hrs): Theory 0 3 Practical 0 2

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: *
Autumn Spring Both

6 Pre-Requisite: Understanding of programming language and fundamentals of statistics

7 Subject Area: Computer Science

8 Objective: To enable student to learn and understand the concepts of Machine Learning
and its implementation in Python.

9 Course Outcome: After completion of the course students will be able to

CO 1 Have a good understanding of the fundamental issues and challenges of machine learning:
data, model selection, model complexity,etc.
CO 2 Have an understanding of the strengths and weaknesses of many popular machine learning
approaches
CO 3 Appreciate the underlying relationships within and across Machine Learning algorithms and
the paradigms of supervised and un-supervised learning.
CO 4 Utilize the structure and design concepts of neural networks applications to solve real life
problems
CO 5 Implementation of real world examples of machine learning using python
CO 6 Understand the issues raised by current research in the field of machine learning

10 Details of the Course:

Unit CONTENT CONTACT
HOURS
No.
1 Review of Statistical Concepts: Mean, Median, Mode, Outliers, Range,
Average Deviation, Absolute Deviation, Squared Deviation, Standard 8
Deviation, Probability theory.
Review of Linear Algebra:Vectors and Matrices, Matrix operations,
Properties, Inverse and Transpose.
Introduction to Machine Learning: What is Machine Learning,
Introduction to ML's three approaches: Supervised, Unsupervised and
Reinforcement Learning?
2 Introduction to Python: • Data types and variables, Operators and operator 8
precedence • Data type conversions, Command line argument, Data input,
Comments, Import modules, Control statements.
Functions and modules in python Python built in functions, Python
Modules, File Handling.
3 UnSupervised Learning Algorithms Clustering: K-means, Silhoutte Scores, 9
Hierarchical Clustering, Fuzzy c- means, DBScan
Dimensionality Reduction: Low Variance Filter, High Correlation Filter,
Backward Feature Elimination, Forward Feature Selection, Principle
Component Analysis, Projection Methods.

4 Data Analysis and Machine Learning with Python NumPy, SciPy 8

Matplotlib, Pandas Scikit-Learn.
NumPy Basics. A Multidimensional Array Object (ndarrays ) Creating
ndarrays Data Types for ndarrays Basic Indexing and Slicing,
Getting Started with pandas Series, Data Frame and Index Objects Re
indexing Indexing, Selection and Filtering Sorting and Ranking, Loading
from CSV and other structured text formats, Normalizing data, Dealing with
missing data, Data manipulation (alignment, aggregation, and
summarization), Group-based operations: split-apply-combine Statistical
analysis, Date and time series analysis with Pandas, Visualizing data

5 Validation Techniques: Hold out, K-Fold Cross Validation, Leave one out, 9
Bootstrapping.
Supervised Learning Algorithms:Linear Regression, Logistic Regression,
Decision Trees, Support Vector Machine, K-Nearest Neighbours, CN2
Algorithm, Naive Bayes, Artificial Neural Networks.

TOTAL 42

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICATION
1 John Paul Mueller and Luca Massaron ,"Machine Learning 2017
ForDummies"
2 Machine Learning using Python by U Dinesh Kumar Manaranjan 2019
Pradhan , Wiley
3 Introduction to Machine Learning with Python: A Guide for Data 2016
Scientists by Andreas Muller
4 Python Machine Learning by Sebastian Raschka, Vahid Mirjalili 2017
5 Introduction to Machine Learning by Alpaydin Ethem, PHI 2015
Subject Name: Data Warehousing and Data Mining Subject Code: TBC-604(1)

1 Contact Hours: 42 L 3 T0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Knowledge of the internet

7 Subject Area: Data Mining

8 Objective: To familiarize students with the concepts of the ecommerce and its models.

9 Course Outcome: A student who successfully fulfills the course requirements will be able to-
a. Discuss the role of data warehousing and enterprise intelligence in industry and government.
b. Summarize the dominant data warehousing architectures and their support for quality attributes.
c. Recognize and describe at least three computational approaches to data clustering, taking
cognizance of the contribution of paradigms from the fields of Artificial Intelligence and
Machine learning.
d. Compare and contrast the dominant data mining algorithms.
e. Understand the Advanced Features of Data Mining.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Introduction to Data Warehousing 8
Concept of Data Warehouse, DBMS verses data warehouse, Data Marts,
Metadata, Multidimensional data model, Multidimensional database, Data
warehouse Measures, their categorization and computation, Multi-dimensional
database hierarchies.

2 Data Warehouse Architecture 8

Operations in OLAP,Advantages of OLAP over OLTP,Three-Tier Data
Warehouse architecture, OLAP Guidelines, Multidimensional versus
Multirelational OLAP , Categories of Tools, OLAP Tools and the Internet.

3 Introduction to Data Mining 9

Basic Concepts of Data Mining; Data Mining primitives: Task-relevant data,
mining objective, measures and identification of patterns, KDD versus data
mining, data mining tools and applications.
Data Mining Query Languages: Data specification, specifying kind of
knowledge, hierarchy specification, pattern presentation & visualization
 specification, data mining languages and standardization of data mining,
Architectures of Data Mining Systems.

4 Data Mining Techniques 9

Association rules: Association rules from transaction database & relational
database, correlation analysis; Classification and predication using decision tree
induction. Introduction to Clustering techniques, partition method, and
Hierarchical method.

5 Overview of Advanced Features of Data Mining 8

Mining complex data objects, Spatial databases, Multimedia databases, Time
series and Sequence data; mining Text Databases and mining Word Wide Web.

TOTAL 42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 Alex Berson and Stephen J. Smith, “ Data Warehousing, Data Mining & OLAP”, 2007
TataMcGraw – Hill Edition, Tenth Reprint
2 Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, 2007
Second Edition, Elsevier
Subject Name: Mobile Computing Subject Code: TBC-604(2)

1 Contact Hours: 42 L 3 T0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Networking Principles

7 Subject Area: Mobile Computing

8 Objective: To familiarize students with the understanding of working of mobile systems

and its issues.

9 Course Outcome: A student who successfully fulfills the course requirements will be able to-
a. A working understanding of the characteristics and limitations of mobile hardware devices
including their user-interface modalities.
b. The ability to develop applications that are mobile-device specific and demonstrate current
practice in mobile computing contexts.
c. A comprehension and appreciation of the design and development of context-aware solutions
for mobile devices.
d. An awareness of professional and ethical issues, in particular those relating to security and
privacy of user data and user behavior.
e. Understand the Ad-hoc Network and Routing in Ad-hoc Mobile Networks.

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 Issues in Mobile Computing, Fundamentals of cellular systems, Cellular system 9
infrastructure, Bluetooth Technology, Wireless Multiple Access Protocols,
Channel Allocation in Cellular Systems.
2 Data Management Issues: Mobility, Wireless Communication and Portability, 9
Data Replication and Replication Schemes, Basic Concept of Multihopping,
Multicluster Architecture.
3 Location Management, Location Based Services, Automatically Locating 8
Mobile Uses, Locating and Organizing Services, Issues and Future Directions,
Mobile IP, Comparison of TCP and Wireless.
4 Transaction Management, Data Dissemination, Cache Consistency, Mobile 8
Transaction Processing, Mobile Database Research Directions, Security Fault
Tolerance for Mobile N/W.
5 Ad-hoc Network, Routing in Ad-hoc Mobile Networks, Dynamic State Routing 8
(DSR), Route Maintenance and Routing error, Fisheye Routing (FSR), Ad-hoc
 on Demand Distance Vector (ADDV).
TOTAL 42

11 Suggested Books:
Sl. YEAR OF
NO. NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICAT
ION
1 Shambhu Upadhyaya, Abhijeet Chaudhary, Kevin Kwiat, Mark Weises, “Mobile 2002
Computing”, Kluwer Academic Publishers
2 UWE Hansmann, Lothar Merk, Martin-S-Nickious, Thomas Stohe, “Principles 2003
of Mobile Computing”, Springer International Edition
Course Name: Fundamentals of Artificial Intelligence Subject Code: TBC 604(3)
Program BCA
Name:
1 Contact Hours: 42 L 3 T 0 P 0
2 Examination Duration(Hrs): Theory 0 3 Practical 0 0
3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50
4 Credits: 0 3
5 Semester: 
Autumn Spring Both
6 Pre-Requisite: 13. knowledge of Data structures, and discrete mathematics
7 Subject Area: Computer Applications
8 Objective: To enable the student to apply the artificial intelligence techniques in applications
which involve perception, reasoning and learning.

9 Learning Outcome: A student who successfully fulfills the course requirements will be
able to

1 Identify problems that are amenable to solution by AI methods

2 Understand and implement solutions for pattern recognition.
3 Implement basic AI algorithms (e.g. , standard search algorithms or dynamic
programming)
4 Understand and define solutions for searching problem
5 Define supervised and unsupervised learning
10 Details of the Course:
Unit CONTENT CONTACT
No. HOURS
1 Introduction: Introduction to Artificial Intelligence, Foundations and 8
History of Artificial Intelligence, Applications of Artificial Intelligence,
Intelligent Agents, Structure of Intelligent ,Agents. Computer vision,
Natural Language Possessing.

2 Introduction to Search: Searching for solutions, Uniformed search 8

strategies, Informed search, strategies, Local search algorithms and
optimistic problems, Adversarial Search, Search for games, Alpha - Beta
pruning.
3 Knowledge Representation & Reasoning: Propositional logic, Theory of 9
first order logic,
Inference in First order logic, Forward & Backward chaining, Resolution,
Probabilisticreasoning, Utility theory, Hidden Markov Models (HMM),
Bayesian Networks.
4 Machine Learning: Supervised and unsupervised learning, Decision trees, 8
Statistical learning models, Learning with complete data - Naive Bayes
models, Learning with hidden data – EM algorithm, Reinforcement
learning,
5 Pattern Recognition: Introduction, Design principles of pattern 9
recognition system, Statistical Pattern recognition, Parameter estimation
methods - Principle Component Analysis (PCA) and Linear Discriminant
Analysis (LDA), Classification Techniques – Nearest Neighbor (NN)
Rule, Bayes Classifier, Support Vector Machine (SVM), K – means
clustering.
TOTAL 42

11 Suggested Books:
Sl. NO. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
PUBLICATION
1 Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt. 2007
Ltd.
2 Elaine Rich and Kevin Knight, “Artificial Intelligence”, 2nd Edition, Tata 2009
McGraw-Hill.
3 George F. Luger, “Artificial Intelligence-Structures And Strategies For Complex 2007
Problem Solving”, Pearson Education / PHI.
Subject Name: Multimedia Technologies Subject Code: TBC 604(4)

Course Name: BCA

1 Contact Hours: 42 L 3 T 0 P 0

2 Examination Duration(Hrs): Theory 0 3 Practical 0 0

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic Knowledge of Computers

7 Subject Area: Computer Application

8 Objective: To teach various multimedia concepts and skills

9 Course Outcomes: A student who successfully fulfills the course requirements will be able
to:
a) Define what is multimedia.
b) Discuss the effects of multimedia in your daily life.
c) Identify five multimedia components.
d) Explain why multimedia is so powerful to increase human-
computer interaction.
e) Examine multimedia applications in several areas

10 Details of the Course:

Unit CONTENT CONTACT
No. HOURS
1 What is Multimedia? Multimedia systems, Characteristics, and 8
Applications; Delivering Multimedia – Storage media or Networks;
Text in Multimedia - Character Sets and Alphabets;Fonts and Faces;
Using Text in Multimedia; Computers and Text; Font Editing and Design
Tools; Hypermedia and Hypertext
2 Images: Making Still Images- Bitmap, Bitmap Sources; Bitmap Software, 8
Bitmap Software; Vector Drawing - How Vector Drawing Works,
Vector-Drawn Objects vs. Bitmaps; 3-D Drawing and Rendering –
modelling, Shading, Rendering;Image File Formats;
Colors:Understanding Natural Light and Color, Computerized Color -
Additive Color, Subtractive Color, Computer Color Models, Color
Palettes;
3 Sound - Power of Sound; Digital Audio;Making Digital Audio Files- 9
Audio Recording; File Size vs. Quality:MIDI Audio – MIDI notation,
 sequencer software, sound Synthesizer; MIDI vs. Digital Audio;Audio
File Formats;
Video - Video Working and display;Analog Video- NTSC, PAL,
SECAM; Digital Video – HDTV;Displays - Interlacing and Progressive
Scan; Digital Video Containers – Codecs, MPEG, Video Format
Converters;Obtaining Video Clips; Shooting and Editing Video- The
Shooting Platform, Storyboarding, Lighting, Nonlinear Editing (NLE);
4 Animation - Principles of Animation; Animation by Computer- 9
Animation Techniques - Cel Animation, Computer Animation,
Animation File Formats; Making Animations- Creating an Animated
Scene;
5 Developing Multimedia Applications: Stages of a Multimedia 8
Project;Multimedia skills; Multimedia requirements – Hardware,
Software, Authoring Systems, Choosing an Authoring Tool; Multimedia
team;Multimedia Planning and Costing, Designing and Producing;
Delivering Multimedia;
TOTAL 42

11 Suggested Books:
Sl. NAME OF AUTHERS/BOOKS/PUBLISHERS YEAR OF
NO. PUBLICATIO
N
1 Tay Vaughan, “Multimedia: Making It Work,” The McGraw-Hill 2015
Companies, Inc.
2 Ze-Nian Li and Mark S. Drew, “Fundamentals of Multimedia”, Pearson 2016
Education.
3 Rosch, “Multimedia Bible”, Sams Publishing. 2016