shri guru ram rai university - sgrru

Patel Nagar, Dehradun, Uttarakhand

SHRI GURU RAM RAI UNIVERSITY (Estd. By Govt. of Uttarakhand, vide Shri Guru Ram Rai University Act No. 3 of 2017)

PATEL NAGAR, DEHRADUN-248001, UTTARAKHAND, INDIA

Syllabus of Bachelor of Computer Application (BCA)

Effective from Academic Session

2018-2019

SHRI GURU RAM RAI UNIVERSITY BCA - Syllabus

1

Program Structure

Bachelor of Computer Application (BCA)

FIRST SEMESTER:

S.N

o

Course No. Subject Evaluation – Scheme Credit

Period Sessional Examination

L T P TA CT INT ES Sub.

Total

Theory

1. BCA-AEC1 General English 2 - - 10 20 30 70 100 2

2. BCA-101 Computer Fundamental &

Information Technology

4 1 - 10 20 30 70 100 5

3. BCA-102 Programming in ‘C’ 4 - - 10 20 30 70 100 4

4. BCA-103 Mathematical Foundation of

Computer Science

4 1 - 10 20 30 70 100 5

Practical

1. BCA-P11 Lab- Computer Fundamental - - 4 30 - 30 70 100 2

2. BCA-P12 Lab- Programming in ‘C’ - - 4 30 - 30 70 100 2

Total 14 2 8 100 80 180 420 600 20

TA : Teacher Assessment CT : Class Test ES : End Semester Examination SUB TOT. : Subject Total INT : Internal Examinations Total


2

SECOND SEMESTER:

S.

No



L T P TA CT INT ES Sub.

Total

Theory

1. BCA-AEC2 Environmental Science 2 - - 10 20 30 70 100 2

2. BCA-201 Data Structure & File

Organization

4 1 - 10 20 30 70 100 5

3. BCA-202 Object Oriented Programming in

C++

4 - - 10 20 30 70 100 4

4. BCA-203 Digital Electronics 4 1 - 10 20 30 70 100 5

Practical

1. BCA-P21 Lab- Data Structure & File

Organization

- - 4 30 - 30 70 100 2

2. BCA-P22 Lab- Programming in C++ - - 4 30 - 30 70 100 2

Total 14 2 8 100 80 180 420 600 20



3

THIRD SEMESTER:

S.

No



L T P TA CT TOT ESE Sub.

Total

Theory

1. BCA-301 Computer Networks 4 1 - 10 20 30 70 100 5

2. BCA-302 Core Java 4 - - 10 20 30 70 100 4

3. BCA-303 Computer Organization &

Architecture

4 1 - 10 20 30 70 100 5

4. BCA-SEC1

SEC1 4 - - 10 20 30 70 100 4

Practical

1. BCA-P31 Lab- Computer Networks - - 4 30 - 30 70 100 2

2. BCA-P32 Lab-Core Java - - 4 30 - 30 70 100 2

Total 16 2 8 100 80 180 420 600 22



4

FOURTH SEMESTER:

S.

No




Total

Theory

1. BCA-401 Database Management System 4 1 - 10 20 30 70 100 5

2. BCA-402 Operating System Organization-

UNIX

4 - - 10 20 30 70 100 4

3. BCA-403 Software Engineering 4 1 - 10 20 30 70 100 5

4. BCA-SEC2 SEC2A 4 - - 10 20 30 70 100 4

Practical

1. BCA-P41 Lab- Database Management

Systems

- - 4 30 - 30 70 100 2

2. BCA-P42 Lab- Operating System

Organization & UNIX

- - 4 30 - 30 70 100 2

Total 16 2 8 100 80 180 420 600 22

TA : Teacher Assessment CT : Class Test ESE : End Semester Examination SUB TOT. : Subject Total TOT. : Total


5

FIFTH SEMESTER:

S.

No




Total

Theory

1. BCA-DSE1 DSE1 4 - - 10 20 30 70 100 4

2. BCA-DSE2 DSE2 4 - - 10 20 30 70 100 4

4. BCA-DSE3 DSE3 3 1 - 10 20 30 70 100 4

3. BCA-SEC3 SEC3 4 - - 10 20 30 70 100 4

Practical

1. BCA-P51 DSE1 Lab - - 4 30 - 30 70 100 2

2. BCA-P52 DSE2 Lab - - 4 30 - 30 70 100 2

3. BCA-P53 Minor Project - - 4 50 - 50 150 200 2

Total 15 1 12 150 80 230 570 800 22



6

SIXTH SEMESTER:

S.

No




Total

Theory

1. BCA-DSE4 DSE4 4 1 - 10 20 30 70 100 5

2. BCA-DSE5 DSE5 4 1 - 10 20 30 70 100 5

3. BCA-SEC4 SEC 4 4 - - 10 20 30 70 100 4

Practical

1. BCA-P61 DSE4 Lab - - 4 30 - 30 70 100 2

2. BCA-P62 DSE5 Lab - - 4 30 - 30 70 100 2

3. BCA-P63 Project - - 4 50 - 50 150 200 2

4. BCA-SM Seminar - - 4 100 - 100 - 100 2

Total 12 2 16 240 60 300 500 800 22

TA : Teacher Assessment CT : Class Test ESE : End Semester Examination SUB TOT. : Subject Total TOT. : Total


7

Skill Enhancement Courses

SEC1 (Choose One) SEC1.1 System Analysis & Design

SEC1.2 E-Commerce

SEC1.3 Cyber Laws

SEC3 (Choose One)

SEC3.1 Data Ware Housing&Data Mining

SEC3.2 Management Information System

SEC3.3 Multimedia and Applications

SEC3.4 Advance RDBMS

SEC2 (Choose One)

SEC2.1 Graph Theory

SEC2.2 Boolean Algebra

SEC2.3 Software Testing

SEC4 (Choose One)

SEC4.1E-Governance

SEC4.2Cloud Computing

SEC4.3Software Project Management

SEC4.4Network Security& Cryptography

Discipline Specific Elective Papers

DSE 1 (Choose One)

DSE 1.1 Python Programming

DSE 1.2 Android Programming

DSE 1.3 Web Programming using HTML &

CSS

DSE 4 (Choose One)

DSE 4.1 Advance Java Programming

DSE 4.2 Unix & Shell Programming

DSE 4.3 Microprocessor

DSE 2 (Choose One)

DSE 2.1 C# Programming with .Net

framework

DSE 2.2 Functional Programming using

Haskell

DSE 2.3 SQL/PL-SQL

DSE 5 (Choose One)

DSE 5.1 Advance Software Engineering

DSE 5.2 Computer Graphics

DSE 5.3 Computer Based Numerical

Techniques

DSE 3 (Choose One)

DSE 3.1 Fuzzy Logic & Neural Network

DSE 3.2 Distributed and Parallel

Computing

DSE 3.3 Artificial Intelligence

DSE3.4 Automata and Formal Languages


8

FIRST SEMESTER

S.

No



L T P TA CT TOT ES

E

Sub.

Total

Theory

1. BCA-AEC1 General English 2 - - 10 20 30 70 100 2

BCA-AEC1: General English

Unit 1: Elementary English: Grammar: Parts of Speech, Tenses, Short responses, Active and Passive Voice Vocabulary: Idioms and Phrases, Antonyms, Synonyms, One word substitution Writing skills: Formal and Informal Letters Unit 2: Employability skills Communication: Types, Objectives, Formal and Informal Communication, Barriers to communication, Selection of appropriate communication medium, Verbal and Non- verbal Communication Soft Skills: Public Speaking, Presentation Skills, Speech, Debates, Role play, Emotion Management Unit 3: Career Skills Interviews, CV Preparation, Group discussion, Personality Development

References :

1. Fluency in English - Part II, Oxford University Press, 2006.

2. Business English, Pearson, 2008.

3. Language, Literature and Creativity, Orient Blackswan, 2013.

4. Bussiness Communication: Rajender Paul


9

S.

No

Course No. Subject Evaluation – Scheme Theory/

Practic

al

Credit


L T P TA CT TOT ES

E

Sub.

Total

Theory

2. BCA-101 Computer Fundamental&

Information Technology

4 1 4 10 20 30 70 100 5/2

BCA-101: Fundamentals of Computer & Information Technology

UNIT I Introduction to Computers Generation of Computer, Hardware Components, Memory Devices, Magnetic Disk, Floppy Disk, Compact Disc/ DVD; Input Devices- Keyboard, Mouse, Scanner, OCR, OMR, MICR. Output Devices- Printer, Types of Printer, Plotter, Monitor: CRT; Central Processing Unit, CPU- Arithmetic Logic Unit, Control Unit, Instruction Set, Registers, Processor Speed, Type Of Processors; Memory- Main Memory Organization, Main Memory Capacity, RAM, ROM, EPROM, PROM, Cache Memory, OCR, OMR, MICR. Number Systems: Binary, Decimal, Octal, Hexadecimal, Binary Arithmetic, Character Codes (BCD), Excess-3, Gray Code, ASCII

UNIT II –System Software and Application Software System software, utility packages, compilers, interpreters, Operating Systems, Elementary commands of DOS, Booting. Application softwares– word-processing, spreadsheet, presentation graphics, Data Base Management Software, Characteristics, Virus- working, features, types of viruses, virus detection prevention and cure.

UNIT III - Programming Languages and Algorithms Generation of Languages: Machine language, Assembly languages, High level languages, Language translators (Compiler, Interpreter, Assembler) , Syntax error, Logical error, runtime error, General concepts of OOPS (Object oriented programming), Structured Query Language Algorithm development, techniques of problem solving- Flowchart, Pseudo-code, Decision trees, Programming paradigms: Top-down, bottom-up etc.

UNIT IV – Computer Network & Communication Technologies Communication system elements, communication modes ( simplex, half duplex and full duplex analog and digital, synchronous and Asynchronous, Communication media: wired and wireless, LAN WAN, MAN, network topologies, Text & Reference books: 1. Pradeep K. Sinha, PritiSinha, “Computer Fundamentals”. BPB Publications. 2. Rajaraman, V., “Fundamental of Computers”. Prentice Hall India,New Delhi 3. Sanders D.H, Computers Today


10

S.

No


Practic

al

Credit


L T P TA CT TOT ES

E

Sub.

Total

Theory

3. BCA-102 Programming in ‘C’ 4 - 4 10 20 30 70 100 4/2

BCA-102: Programming in ‘C’

UNIT-I History of ‘C’ Programming, Types of Programming Languages. Introduction to C and structure of ‘C’ Program, some simple C programs, Desirable program characteristics. C Fundamentals- C character Set, Identifiers and keywords, datatypes, constants, variables and arrays, Declarations, expressions, statements, Symbolic constants. UNIT –II Operators and expressions- Arithmetic operators, unary operator, Relational and logical operators, assignment operators, conditional operators, Library Functions. Data Input and Output- Preliminaries, singe character input, singe character output, Entering input data, writing output data, the gets and puts function. Precedence and Associatively of operators, Side effects, Type conversion, Managing input and output. UNIT-III Control Statements- Preliminaries, Branching, Looping, Nested control statements, switch statement, break statement, The continue statement. Arrays: Defining an array, processing an array, passing arrays to functions, Multidimensional arrays, Arrays and strings. Functions: A brief overview, Defining a function, accessing a function, function prototypes, passing arguments to a function, recursion. Storage classes. UNIT-IV Pointers- Fundamentals, Pointer declarations, Passing pointers to the functions, pointers and one dimensional array, dynamic memory allocation, Operations on pointers, arrays of pointers. Pointer to Pointer, call by value call by reference, pointer to function.

UNIT-V Structure &Union: Declaration & Initialization of Structure & Union, Array of Structure, passing structure to a function, union and array as member, of union, concept of memory saving and union Data files- Opening and closing a data file, creating a data file, processing a data file, unformatted data files. Command line argument in ‘C’.

References:

1. V. Rajaraman, "Fundamentals of Computers", PHI 2. Pater Norton's "Introduction to Computer", TMH 3. Hahn, "The Internet complete reference", TMH 4. Peter Nortton's, "DOS Guide", Prentice Hall of India 5. Gottfried, "Programming in C, Schaum's Series Tata McGraw Hill


11

S.

No



L T P TA CT TOT ES

E

Sub.

Total

Theory

4. BCA-103 Mathematical Foundation of

Computer Science

4 1 - 10 20 30 70 100 5

BCA-103: Mathematical foundation of Computer Science

UNIT I Set Theory: Set, Subset, Operation on sets, DeMorgan’s Law, Power set of set.Matrices: Matrices operations, Transpose, Inverse and power of Matrices. UNIT II Relation: Type and compositions of relations, Pictorial representation of relations, Equivalence relations, Partial ordering relation. Function: Types, Composition of function, Recursively defined function. UNIT III Mathematical Induction: Piano's axioms, Mathematical Induction, Discrete Numeric Functions and Generating functions, Simple Recurrence relation with constant coefficients, Linear recurrence relation without constant coefficients, Asymptotic Behaviour of functions UNIT IV Algebric Structures: Properties, Semi group, monoid, Group, Abelian group, properties of group, Subgroup, Cyclic group, Cosets, Permutation groups. UNIT V Prepositional Logic: Preposition, First order logic, Basic logical operations, Tautologies, Contradictions, Algebra of Proposition, Logical implication, Logical equivalence, Normal forms, Inference Theory, Predicates and quantifiers, Posets, Hasse Diagram.

References:

1. Liptschutz, Seymour, "Discrete Mathematics", TMH. 2. Trembley, J.P. & R. Manohar, "Discrete mathematical Structure with Application to

Computer Science", TMH. 3. Kenneth H. Rosen, "Discrete Mathematics and its applications', TMH. 4. Doerr Alan and Levasseur Kenneth, "Applied Discrete Structure for Computer Science,

Galgotia Pub. Pvt. Ltd. 5. Gersting "Mathematical Structure for Computer Science", WH freeman and Macmillan. 6. Kumar Rajendra, "Theory of Automata: Languages and Computation", PPM 7. Hopcroft J.E. Uliman J.D., "Introduction to Automata Theory, Language and Computation"

Narosa Pub. House, New Delhi. 8. C.L.Liu "Elements of Discrete Mathematics", McGraw Hill. 9. Peter Grossman, "Discrete Mathematics for Computer", Palgrave Macmillian.


12

SECOND SEMESTER S.

No




Total

Theory

1. BCA-AEC2 Environment science 2 - - 10 20 30 70 100 2

BCA/AEC2: Environment Studies

UNIT I: Introduction to environmental studies and Ecosystems Definition of environment Multidisciplinary nature of environmental studies;, Scope and importance; Concept of sustainability and sustainable development. What is an ecosystem? Structure and function of ecosystem; Energy flow in an ecosystem: food chains, food webs and ecological succession. Unit II: Natural Resources Natural resources and their type Land resources and land use change; Land degradation, soil erosion and desertification, Deforestation: Causes and impacts due to mining, dam building on environment Water : Use and over-exploitation of surface and ground water, floods, droughts, conflicts over water (international & inter-state)., Energy resources : Renewable and non-renewable energy sources, use of alternate energy sources, growing energy needs, case studies. UNIT III: Environmental Pollution and Environmental Laws Environmental pollution: types, causes, effects and controls; Nuclear hazards and human health risks, Solid waste management: Control measures of urban and industrial waste, Pollution case studies. Climate change, global warming, greenhouse effect ozone layer depletion, acid rain and impacts on human communities and agriculture Environment Laws: Environment Protection Act; Air (Prevention & Control of Pollution) Act; Water (Prevention and control of Pollution) Act; Wildlife Protection Act; Forest Conservation Act. International agreements: Montreal and Kyoto protocols and Convention on Biological Diversity (CBD) UNIT IV: Biodiversity and Conservation & Human Communities and the Environment Definition of biodiversity Levels of biological diversity : genetic, species and ecosystem diversity; Biogeographic zones of India; Conservation of biodiversity : In-situ and Ex-situ conservation of biodiversity. Human population growth: Impacts on environment, human health and welfare, Resettlement and rehabilitation of project affected persons;Disaster management: floods, earthquake, cyclones and landslides, Environmental movements:Chipko, Silent valley, Bishnois of Rajasthan., Environmental ethics: Role of Indian and other religions and cultures in environmental conservation.Case studies (e.g., CNG vehicles in Delhi). Field work, Visit to an area to document environmental assets: river/ forest/ flora/fauna, etc., Visit to a local polluted site-Urban/Rural/Industrial/Agricultural., Study of common plants, insects, birds and basic principles of identification., Study of simple ecosystems-pond, river, Delhi Ridge, etc.


13

References:

1. Carson, R. 2002. Silent Spring.Houghton Mifflin Harcourt. 2. Gadgil, M., &Guha, R. 1993. This Fissured Land: An Ecological History of India. Univ. of

California Press. 3. Gleeson, B. and Low, N. (eds.) 1999. Global Ethics and Environment, London, Routledge.


14

S.

No


Practic

al

Credit



Total

Theory

2. BCA-201 Data Structure & File

Organization

4 1 4 10 20 30 70 100 5/2

BCA-201: Data Structure & File Organization

UNIT I

Introduction: Basic Terminology, Elementary Data Organization, Data Structure operations, Algorithm Complexity and Time-Space trade-off. Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, address calculation, application of arrays, Character String in C, Character string operation, Array as Parameters, Ordered list, Sparse Matrices, and Vector. UNIT II

Link List: Representation and implementation of Singly linked lists, Two-way Header List, Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion to from Linked Lists, Insertion and deletion Algorithms, Doubly linked list, Linked List of Array, Polynomial representation and addition, Generalized linked list, Garbage Collection and Compaction. UNIT III

Stacks: Array Representation and Implementation of stack, Operations and 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. Recursion: Recursive definition and processes. Queues: Array and linked representation and implementation of queues, Operations on Queue; Create, Add, Delete, Full and Empty, Circular queue, Dequeue and Priority Queue. UNIT IV

Trees: Basic terminology, Binary Tree, Binary tree representation algebraic Expressions, Complete Binary Tree, Extended Binary Tree, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees. Tree traversing, Threaded Binary tree, Huffman algorithm. Searching and Hashing: Sequential search, comparison and analysis, Hash Table, Hash Function, Collection Resolution Strategies, Hash Table Implementation. UNIT V

Sorting: Insertion Sort, Bubble sorting, Quick Sort, Two way Merge Sort, Trees: Binary Search (BST), Insertion and Deletion in BST.

References:

1. Horowitz and Sahani, "Fundamentals of data Structures" Galgotia 2. R. Kruse etal, "Data Structures and Program Design in C" Person Education 3. A.M. Tenenbaumetal, "Data Structures and Program Design in C" Person Education 4. Lipschutz, "Data Structure", TMH 5. K Loudon, "Mastering Algorithms With C", Shroff Publishers and Distributors 6. Bruno R Preiss, "Data Structure and Algorithms with Object Oriented Design Pattern in C++, Jhon Wiley & Sons, Inc.


15

S.

No


Practic

al

Credit



Total

Theory

3. BCAC202 Object Oriented Programming in

C++

4 - 4 10 20 30 70 100 4/2

BCA-202: Object Oriented Programming in C++

UNIT I

Introduction: Introduction to OOP, Basic Concepts of OOP, Applications of OOP. Introduction to C++, Introduction to C++ stream I/O, declarations in C++, Creating New data types in C++, Function Prototypes, Inline functions, Reference Parameters, Const Qualifier, Dynamic memory allocation, default arguments, Unary Scope resolution operator, Linkage specifications.

UNIT II

Class, Constructors, Friend Class : Introduction, Comparing class with Structure, Class Scope, Accessing Members of a class, Constructor, Destructor, Const objects, Const member functions, Friend class, Friend function, This pointer, Data abstraction and Information hiding, container classes and Iterators

UNIT III

Overloading & Inheritance: Operator Overloading, Fundamentals, Restrictions, Overloading stream, Insertion and stream extraction operators, Overloading unary & binary operators, Converting between types, Overloading ++ and --. Inheritance, Introduction, Protected members, Casting base _class pointers to derived _class pointers Overloading Base class members in a Derived class, Public, Protocols and Private inheritance, Direct base classes and Indirect Base Classes, Using Constructors and Destructors in Derived classes, Implicit Derived class object to base class object conversion.

UNIT IV

Virtual Function: Introduction, Type fields and switch statements, Virtual functions, Abstract base classes and concrete classes, Polymorphism, Dynamic binding, Virtual destructors.

UNIT V

C++ Stream I/O: Streams, Stream Input, Stream Output, Unformatted I/O, Stream manipulators, Stream format states, Stream error, States.

References:

1. Deitel H.M. &Deitel P.J. – “How to Program C++” – PHI – 2003 2. Al stevenes – “C++ Programming” – Wiley dreamtech – 2003. 3. Herbert Scheldt, “Complete Reference”. 4. E. Balagurusamy “Object Oriented Programming with C++”. 5. YashwantKanetkar, “Let Us C++”. 6. C++ Programming by Herbert Scheldt – 2004.


16

S.

No




Total

Theory

4. BCA-203 Digital Electronics 4 1 - 10 20 30 70 100 5

BCA-203: Digital Electronics UNIT I Binary Systems and Logic Circuits: The Advantage of Binary, Number Systems- Binary, Octal, Decimal and Hexadecimal. Conversions between number systems. Use of Binary in Digital Systems, Logic Gates, Logic Family Terminology. UNIT II Boolean Algebra and Mapping Methods: Boolean Algebra, Karnaugh Maps, Realizing Logic Function with Gates, Combinational Design Examples. UNIT III Combinational Logic: Adders- Half adder and full adders,Subtracters- Half and Full Subtractors, Encoders and Decoders, Multiplexers and De-multiplexers. UNIT IV Sequential Logic: Bi-stable elements, latch, Flip Flops- SR, JK, Toggle and Data. Counter- Synchronous and Asynchronous counters. Registers: Serial-in-Serial-Out, Serial-in-Parallel-Out, Parallel-in-Serial-Out, Parallel-in-Parallel-Out, Flip Flops and its Applications.

References:

1. Willam Stalling, "Computer Organization & Architecture" Pearson Education Asia 2. Mano Morris, "Computer System Architecture" PHI 3. Zaky&Hamacher, "Computer Organization: McGraw Hill 4. B. Ram, "Computer Fundamental Architecture & Organization" New Age 5. Tannenbaum, "Structured Computer Organization" PHI.


17

THIRD SEMESTER

S.

No


Practic

al

Credit



Total

Theory

4. BCA-301 Computer Networks 4 1 4 10 20 30 70 100 5/2

BCA-301: Computer Networks

Unit I

Introductory Concepts: Goals and Applications of Networks, Network structure and transmission,

switching methods, Integrated services digital networks, terminal handling.

Unit II

Medium Access sub Layer: Channel allocations, LAN protocols, ALOHA Protocols-Pure Aloha, slotted

ALOHA, Carrier Sense Multiple Access Protocols, CSMA with Collision Detection, Collision free

Protocols, IEEE standards, FDDI, Data Linked Layer elementary data link protocols, sliding windows

protocols, error handling, High Level Data Link Control.

Unit III

Network Layer: Point-to Point networks, routing algorithms, congestion control algorithms,

internetworking, TCP/IP packet, IP addresses, Ipv6.

Unit IV

Transport Layer: Design issues, connection management, TCP window Management,User Datagram

Protocol, Transmission Control Protocol.

Unit V

Application Layer: Network Security, DES, RSA algorithms, Domain Name System,Simple Network

Management Protocol, Electronic mail, File Transfer Protocol, HyperText Transfer Protocol,

Cryptography and compression Techniques.

References:

1. A.S. Tanenbaum, "Computer Networks, 3rd Edition," PHI

2. W.Stallings, "Data and Computer Communication" Macmillan Press

3. Comer, "Internetworking with TCP/IP" PHI

4. Comer, "Computer networks & Inter" PHI

5. Forouzan, "Data Communication and Networking:. TMH


18

S.

No


Practic

al

Credit



Total

Theory

4. BCA-302 Core Java Programming 4 - 4 10 20 30 70 100 4/2

BCA-302: Core Java Programming

Unit I

Introduction to Java programming–Java Buzzword, The Java Virtual Machine, Variables and data

types, Operators and Expressions- Introduction, Arithmetic Operators, Relational Operators Logical

Operators, Assignment Operators, Increment and Decrement Operators, Conditional Operators,

Bitwise Operators, Special Operators, Arithmetic Expressions, Evaluation of Expressions, Precedence

of Arithmetic Operators, Type Conversion and Associativity,

Unit II Decision Making and Branching- Introduction, Decision Making with if Statement, Simple if

Statement, The if…..else Statement, Nesting of if .Else Statements, The else if Ladder, The Switch

Statement, The ?: Operator. Decision Making and Looping – Introduction, while Statement, do

Statement, for Statement, Jumps in Loops Labeled Loops

Unit III

Classes, Objects and Methods- Introduction, Defining a Class, Adding Variables, Adding Methods,

Creating Objects, Accessing Class Members, Constructors, Methods Overloading, Static Members,

Nesting of Methods, Inheritance- Types of inheritance single, multiple, multi-level, hierarchical,

Interfaces, Extending a Class Overriding Methods, Final Variables and Methods, Finalizer methods,

Abstract Methods and Classes, Visibility Control. Arrays, Strings and Vectors- Arrays, One-

dimensional Arrays, Creating an Array, Two -Dimensional Arrays, Creating an Array, Two –

dimensional Arrays, Strings, Vectors, Wrapper Classes.

Unit IV

Multithreaded Programming- Introduction, Creating Threads, Extending the Thread Class, Stopping

and Blocking a thread, Life Cycle of a thread, Using Thread Methods, Thread Exceptions, Thread

Priority, Synchronization, Implementing the ‘Runnable’ Interface.Packages - Using a Package,

Adding a Class to a Package, Exceptions Handling - Introduction, Types of Exception Handling

Code, Multiple Catch Statements, Using Finally Statement,

Unit V

Applet Programming - Introduction, How Applets Differ from Applications, , Applet Life Cycle,

Creating Applet Tag, Adding Applet to HTML File, running the Applet, Input/OutputFiles in JAVA:-


19

Introduction, Concept of Streams, Stream Classes, Byte Stream Classes, Character Stream Classes,

Using Streams, Using the File Class

Text Books:

1. A.Balaguruswamy, “Programming with JAVA”, A Primer, TMH, 1999.

Reference Books:

1. Thomas Boutel, “CGI programming in C and Perl”, Addison – Wesley, 1996.

2. Jefry Dwight et al, Using CGI, Second Edition, Prentice Hall, India, 1997.

3. Patrick Naughton& Herbert Schildt, JAVA 2: The Complete Reference, THM, 1999.

4. Schildt, “JAVA The Complete Reference”, 7th Edition.


20

S.

No




Total

Theory

4. BCA-303 Computer Organization &

Architecture

4 1 - 10 20 30 70 100 5

BCA-303: Computer Organization & Architecture

UNIT I

Introduction to Computers- Basics of Computer, Von Neumann Architecture, Generation of

Computer, Classification of Computers, Instruction Execution, Register Transfer and Micro

operations- Register Transfer, Bus and Memory Transfers, Tree-State Bus Buffers, Memory

Transfer, Micro-Operations, Register Transfer Micro-Operations, Arithmetic Micro-Operations, Logic

Micro-Operations, Shift Micro-Operations.

UNIT II

Computer Arithmetic- Addition and Subtraction with Signed-Magnitude, Multiplication Algorithm,

Booth Multiplication Algorithm, IEEE floating-point number representation.

UNIT III

Organization of a Computer- Central Progressing Unit (CPU), Stack Organization, Register Stack,

Memory Stack, Reverse Polish Notation. Instruction Formats, Three- Address Instructions, Two –

Address Instructions, One- Address Instructions, Zero Address Instructions, Addressing modes,

RISC Instructions, CISC Characteristics vs. RISC Characteristics, Pipelining General Consideration,

Arithmetic Pipeline Instruction Pipeline.

UNIT IV

Memory Organization- Memory Hierarchy, Main Memory, Auxiliary Memory, Cache Memory,

Virtual Memory. Address Space and Memory Space, Associative Memory, Page Table, Page

Replacement.

UNIT V

Input-Output Organization- Modes Of Transfer, Priority Interrupt, DMA, Input-Output Processor

(IOP), CPUIOP Communication.

References: -

1. “Computer System Architecture”, John. P. Hayes.

2. “Computer Architecture and parallel Processing “, Hwang K. Briggs.

3. “Computer System Architecture”, M. Morris Mano.


21

S.

No




Total

Theory

4. BCA-SEC1 SEC1 4 - - 10 20 30 70 100 4

SEC1.1: System Analysis and Design

Unit I

System Concepts and Information System Environment- The System Concept, Definition, Characteristics of Systems, Elements of a System, Open and Closed and closed system, Formal and Informal Information Systems, Computer based Information Systems, Management Information System, Decision Support System Unit II

The System Development Life Cycle- Recognition of needs, Impetus for System Change, Feasibility Study, Analysis, Design, Implementation, Post implementation and Maintenance. The Role of the Systems Analyst, Academic and Personal Qualifications, Skills of System Analyst

Unit III

Systems Planning and Initial Investigation- Strategies for Determining Information Requirement, Problem Definition and Project initiation, Background Analysis, Fact Analysis, Review of Written Documents, Onsite Observations, Interviews and Questionnaires, Fact Analysis, Performance Analysis, Efficiency Analysis, Service Analysis. Information Gathering- Kind of Information needed. Information about the firms, Information gathering tools, the art of Interviewing, Arranging the Interview, Guides to Successful Interview, Types of Interviews and Questionnaires, The Structured and Unstructured Alternatives.

Unit IV

The Tools of Structured Analysis- The Dataflow Diagram (DFD), Data Dictionary, Decision Table, Decision Trees and Structured English. Unit V Input/Output and Forms Design- Input Design, CRT Screen Design, Output Design, Requirements form Design. References: 1. Elias M.Awad, "Systems Analysis and Design" Galgotia Publication 2. Hoffer, "Modern Systems Analysis and Design" Addision Wesley 3. Kendall, "Introduction to System Analysis and Desogm", McGraw Hill 4. System Analysis and Design Handbook: V. K. Jain, Wiley dreamtech


22

SEC1.2: E-Commerce

Unit-I Overview of Electronic Commerce - Main Activities of E-Commerce, Broad Goals of E-Commerce, E-Commerce technical Components, Functions of E-Commerce, Prospectus of E-commerce, Lessons from E-commerce Evolution, Scope of E-commerce. Unit-II E-commerce Technical Architecture, E- Commerce Strategies, E-commerce Essentials, E-commerce applications, Foundation of E-commerce, Growth of E-Commerce, Advantages of E-Commerce, Disadvantages of E-commerce, progress of E-commerce in India. Unit-III Driving the E-commerce Revolution. E-commerce Activities, Matrix of E-commerce models, B2C, B2B, B2B Boom, E-commerce opportunity Frame work, Developing an E-commerce Strategy, International E-commerce, International strategy Development, Dotcom Companies. Unit-IV Electronic Market-Online Shopping, Online Purchasing, Electronic Market, Three models of Electronic Market, Markets category, International, Marketing, one-to -one Marketing, Permission Marketing, pull and push technologies, B2B Hubs, B2B market places, B2B exchange. Unit-V Electronic Business - Electronic Business applications Emerging applications, Electronic Business Architecture, AMR Model for Electronic Business, Evolution of Electronic Business Application, Application, Dotcom companies, The Indian scenario for E-Business, electronic business implementations, B2B E-commerce, B2C E-commerce, B2B Market Place.

References:

1. E-Commerce Concepts. Models, Strategies C.S.V Murthy, Himalaya Publishing House

2..The Complete E-Commerce Book: Design, Build & Maintain a Successful Web-based Business by

Janice Reynolds

3..E-Commerce: Fundamentals and Applications by Henry Chan, Raymond Lee, Tharam Dillon,

Elizabeth Chang November 2001


23

SEC1.3: Cyber Laws

Unit I Definitions, Digital Signature And Electronic Signature, Penalty and Compensation for damage to computer, computer system, etc. Unit II Tampering with Computer Source Documents, Punishment for sending offensive messages through communication service, etc. Punishments for dishonestly receiving stolen computer resource or communication device, Punishment for identity theft. Punishment for cheating by personation by using computer resource, Punishment for violation of privacy, Punishment for cyber terrorism, Punishment for publishing or transmitting obscene material in electronic form, Punishment for publishing or transmitting of material containing sexually explicit act, etc. in electronic form, Punishment for publishing or transmitting of material depicting children in sexually explicit act, etc. in electronic form, Breach of confidentiality and privacy

References:

1. M. Merkow, J. Breithaupt, Information Security Principles and Practices,Pearson Education.2005

2. G.R.F. Snyder, T. Pardoe, Network Security, Cengage Learning, 2010


24

FOURTH SEMESTER

S.

No


Practic

al

Credit



Total

Theory

4. BCA-401 Database Management System 4 1 4 10 20 30 70 100 5/2

BCA-401: Database Management System

Unit I Database fundamental concepts, Advantages and Disadvantages of DBMS, Database Administrator, Architecture of DBMS, Schema and Sub Schema, Data Models: Hierarchical data Model, Network Data Model, Relational Data Model. Unit II Keys: Super Key, candidate key, Primary key, Foreign Key; Referential Integrity, Entity, Attribute, Relationship, Generalization and Specialization, Entity – Relationship (E-R) Data Model, Relationship Degree, Relational Algebra, Relational calculus: Tuple relational calculus, Domain relational calculus. Unit III Database design and Normalization: Function Dependency, Lossless – Join Decomposition, Dependency Preservation, Anomalies in a database, Normalization: 1NF, 2NF, 3NF, BCNF, 4NF, 5NF Unit IV SQL: Creating table, DDL, DML, Restricting and Sorting Data, Single-Row Functions, Aggregated Data Using the Group Functions, Joining, Sub queries, Keys.

TEXT BOOKS

1. Abraham Silberschatz, Henry F. Korth, Sudharshan S., (2006), “Database System Concepts”,

Fifth Edition, Tata McGraw Hill.(Unit I, IV & V)

2. Date C.J., Kannan A., Swamynathan S., (2006), “An Introduction to Database Systems”,

Eighth Edition, Pearson Education.(Unit II & III)

REFERENCE

1. RamezElmasri, Shamkant B. Navathe (2007), “Fundamentals of Database


25

S.

No


Practic

al

Credit



Total

Theory

4. BCA-402 Operating System 4 - 4 10 20 30 70 100 4/2

BCA-402: Operating System

UNIT I Operating system – definition simple batch system, time sharing system, Real time and Hand held systems, Mainframe system Desktop Systems, Multiprocessor systems, distributed systems , clustered systems ,System components - OS Services, System Calls Programs. UNIT II Process concepts – Process Scheduling , operation on Process , Cooperating process , IPC ,CPU Scheduling: Basic Concepts , Scheduling criteria , Scheduling algorithms , Multiprocessor Scheduling , Real time Scheduling. UNIT III Background - The critical Section problem, synchronization hardware, semaphores, Classic Problems of Synchronization, critical Regions, Monitors. UNIT IV System model , Deadlock Characterization , Methods for Handling Deadlocks, Deadlock prevention , Deadlock Avoidance, Deadlock Detection and Recovery from Deadlock. UNIT V Virtual memory, Swapping, Contiguous memory Allocation, Paging segmentation , segmentation with paging , Demand Paging , Process creation, Page Replacement , Thrashing, File System: File supports, access methods, allocation methods-contiguous, linked and index allocation, directory system – single level, tree structured, acyclic graph and general graph directory, file protection. Secondary storage structure: Disk structures, disk scheduling disk management, allocation methods, free space management.

TEXT BOOK 1. Abraham Silberschatz, Peter Baer Galvin & Greg Gagne , “Operating System Concepts”,

Sixth Edition, John Wiley & Sons, Inc. 2. MilankovicM “Operating System concepts and Design”, 2nd edition, Tata Mcgraw hill. 3. Deitel H.M. “An Introduction to Operating Sysems”,2nd edition, Pearson Education.


26

S.

No




Total

Theory

4. BCA-403 Software Engineering 4 1 - 10 20 30 70 100 5

BCA-403: Software Engineering

Unit I Introduction: Introduction to software engineering, Importance of software, evolving role of software, Software Characteristics, Software Components, Software Applications, Software Crisis, Software engineering problems, Software Development Life Cycle, Software Process. Unit II Software Requirement Specification: Analysis, Principles, Water Fall Model, The Incremental Model, Prototyping, Spiral Model, Role of management in software development, Role of matrices and Measurement, Problem Analysis, Requirement specification, Monitoring and Control. Unit III 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, Software Architecture, Transaction and Transform Mapping, Component level Design, Fourth Generation Techniques. Unit IV Coding: Top-Down and Bottom Up programming, structured programming, information hiding, programming style and internal documentation. Testing principles, Levels of testing, functional testing, structural testing, test plane, test case specification, reliability assessment, software testing strategies, Verification and validation, Unit testing, Integration Testing, Alpha & Beta testing, system testing and debugging. Unit V Software Project Management: The Management spectrum (The people, the product, the process, the project) Cost estimation, project scheduling, staffing, software configuration management, Structured Vs. Unstructured maintenance, quality assurance, project monitoring, risk management. Unit VI Software Reliability & Quality Assurance: Reliability issues, Reliability metrics, Reliability growth modeling, Software quality, ISO 9000 Certification for software industry, SEI capability maturity model, comparison between ISO & SEI CMM. 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. References: 1. Pressman, Roger S., "Software Engineering: A Practitioner's Approach Ed.Boston: McGraw Hill, 2001 2. Jalote, Pankaj, "Software Engineering Ed.2"New Delhi: Narosa 2002 3. Schaum's Series, "Software Engineering" TMH 4. Ghezzi Carlo and Others "Fundamentals of Software Engineering" PHI


27

S.

No




Total

Theory

4. BCA-SEC2 SEC2 4 - - 10 20 30 70 100 4

SEC 2.1: Graph Theory

Unit-1

Definition, examples and basic properties of graphs, pseudo graphs, complete graphs, bi‐partite

graphs, isomorphism of graphs, paths and circuits

Unit-II

Eulerian circuits, Hamiltonian cycles, the adjacency matrix, weighted graph, travelling salesman’s

problem,

Unit-III

Shortest path Algorithms: Dijkstra’s , Floyd‐Warshall algorithm.

Unit-IV

Trees and fundamental circuits, distance diameters, radius and pendent vertices, rooted and binary

trees, on counting trees, spanning trees- prims, Kruskal, fundamental circuits.

Unit V

Coloring and covering partitioning of graph, Chromatic number, Chromatic partitioning, Chromatic

polynomials, Matching, covering, Four color problem.

References:

1. Edgar G. Goodaire and Michael M. Parmenter, Discrete Mathematics with Graph Theory, 2nd

Ed., Pearson Education (Singapore) P. Ltd., Indian Reprint 2003.

2. Rudolf Lidl and Günter Pilz, Applied Abstract Algebra, 2nd Ed., Undergraduate Texts in

Mathematics, Springer (SIE), Indian reprint, 2004.


28

SEC 2.2: Boolean Algebra

Unit I

Fundamental Theorems of Boolean Algebra, The Existence and the Oneness of the Boolean

Functions, Representing Logical Functions and Arithmetic Operations by Logical Gate-Binary

Switches, Implementing Logical Function, Truth Tables and Canonical Forms of Boolean Functions

Unit II

Representation Forms of Boolean Functions, Boolean algebras, Boolean polynomials, minimal forms

of Boolean polynomials, Quinn- McCluskey method, Karnaugh diagrams

Unit III

Definition, examples and basic properties of ordered sets, maps between ordered sets, duality

principle, maximal and minimal elements, lattices as ordered sets, complete lattices, lattices as

algebraic structures, sublattices, products and homomorphisms. Definition, examples and properties

of modular and distributive lattices,

References:

1. B A. Davey and H.A. Priestley, Introduction to Lattices and Order, Cambridge University Press,

Cambridge, 1990.

2. Rudolf Lidl and Günter Pilz, Applied Abstract Algebra, 2nd Ed., Undergraduate Texts in

Mathematics, Springer (SIE), Indian reprint, 2004.


29

SEC 2.3: Software Testing

UNIT I

Introduction to Software Testing, Strategic Approach to Software Testing, Test Strategies for

Conventional Software, Basic Terminologies,.

UNIT II

Software Development Life Cycle, V Shaped Software Lifecycle Model, Types of testing, White

Box Testing, Black Box Testing.

UNIT III

White-Box Testing- Loop Testing Path Testing, Condition testing, Memory Testing,

Performance Testing, Basis Path Testing: Program Graph, DD Path graph, Cyclomatic Complexity,

Graph Matrices, Control Flow.

UNIT IV

Black-Box Testing- Functional Testing, Integration Testing ( Incremental Integration Testing )

: Top Down Incremental Integration Testing ,Bottom Up Incremental Integration Testing & Non

Incremental Integration Testing ), System Testing, Acceptance Testing, Smoke Testing,

Exploratory Testing, Adhoc Testing, Performance Testing.

UNIT V

Test Case Design Techniques- Error Guessing , Equivalence Partitioning , Boundary Value Analysis.

Decision Table Based Testing, Structural Testing.

References:

1. Roger S. Pressman, Software Engineering: A Practitioner’s Approach, Seventh Edition, McGraw

Hill Education.2009.

2. Yogesh Singh, Software Testing, Cambridge University Press,2011.


30

FIFTH SEMESTER S.

No

Course No. Subject Evaluation – Scheme Theor

y/Prac

tical

Credit



Total

Theory

4. BCA-DSE1 DSE1 4 - 4 10 20 30 70 100 4/2

DSE 1.1: Python Programming

Unit I Introduction to Python - The basic elements of python ,Branching Programs, Control Structures, Strings and Input, Iteration, Functions, Scoping and Abstraction Functions and scoping specifications Recursion Global variables Modules Files System Functions and Parameters. Unit II Functions, Scoping and Abstraction Functions and scoping specifications Recursion, Structured Types, Mutability and Higher-Order Functions Strings, Tuples, Lists and Dictionaries Lists and Mutability Functions as Objects,Testing, Debugging, Exceptions and Assertions Types of testing –Black-box and Glass-box Debugging Handling Exceptions. Unit III Classes and Object -Oriented Programming Abstract Data Types and Classes Inheritance Encapsulation and information Hiding, Simple Algorithms and Data structures Search Algorithms Sorting Algorithms Hash Tables. Unit IV Advanced Topics I Regular Expressions – REs and Python Plotting using PyLab Networking and MultithreadedProgramming –Sockets, Threads and Processes, Chat Application.

Reference Books: 1 John V Guttag. “Introduction to Computation and Programming Using Python”, Prentice Hall of India 2.R. NageswaraRao,“Core Python Programming”, dreamtech 3.Wesley J. Chun. “Core Python Programming -Second Edition”, Prentice Hall 4.Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, “Data Structures and Algorithms in Pyhon”, Wiley


31

DSE 1.2: Android Programming

Unit I Introduction: History of Android, Introduction to Android Operating Systems, Android Development Tools, Android Architecture. Unit II Overview of object oriented programming using Java: OOPs Concepts: Inheritance, Polymorphism, Interfaces, Abstract class, Threads, Overloading and Overriding, Java Virtual Machine. Unit III Development Tools: Installing and using Eclipse with ADT plug-in, Installing Virtual machine for Android sandwich/Jelly bean (Emulator), configuring the installed tools, creating an android project-Running on emulator, Deploy it on USB-connected Android device. Unit IV User Interface Architecture: Application context, intents, Activity life cycle, multiple screen sizes.User Interface Design: Form widgets, Text Fields, Layouts, Button control, toggle buttons, Spinners(Combo boxes),Images, Menu, Dialog. Unit V Database: Understanding of SQLite database, connecting with the database. References: 1. Android application development for java programmers. By James C. Sheusi. Publisher: Cengage Learning, 2013.

\


32

DSE 1.3: Web Programming using HTML &CSS Unit-I Introduction- Introduction to the Internet, Introduction to HTML Terminology, Designing a Webpage: Design Considerations and Planning, Basic Tags and Document Structure, HTML Tags, Head Tags, Title Tags, Body Tags, Metadata, Saving an HTML Page Unit II Page Formatting- Adding a New Paragraph, Adding a Line Break, Inserting Blank Space, Preformatted Text, Changing a Page’s Background Color, Div Element. Text Items and Objects: Headings, Comments, Block Quotes, Horizontal Lines. Special Characters, Creating Lists- Numbered (Ordered) Lists, Bulleted (Unordered) Lists, Nested Lists, Definition Lists. Unit III Links-What are Links?, Text Links, Image Links, Opening a Page in a New Window or Tab, Setting all Links on a Page to Open in a New Window or Tab, Linking to an Area on the Same Page (Bookmarks), Linking to an E-mail Address, Linking to Other Types of Files, Images- Introduction to Images for Webpages, Adding Images to Webpages, Resizing an Image, Alternative (ALT) Text, Image Labels. Unit IV Basic Tables-Inserting a Table, Table Borders, Table Headers,Col and row span, IFrames: What is an Iframe, Inserting Iframes, Setting Height and Width, Using an Iframe for a link target. Forms: About Forms, Text Boxes, Text Areas, Check Boxes, Menu Lists, Radio Buttons, The Submit Button, The Reset Button, Changing the Tab Order, Sending to E-mail, event handling Unit V Cascading Style Sheets- CSS Introduction , CSS Syntax, Creating an External CSS, Linking to a CSS, Adding Comments and Notes to a CSS, Creating an Internal Style Sheet, ID and Class, Inline Styling. Working With Text in CSS: Emphasizing Text (Bold and Italic), Decoration, Indentation, Transformation, Text Alignment, Fonts, Font Sizes, Letter Spacing, Text Color, Margins, Padding, Borders, Styling Links, Number and Bullet Styles, Sizing Elements, Text Wrapping, Shadowing. References: 1. Burdman, "Collaborative Web Development", Addison Wesley 2. Sharma & Sharma, "Developing E-Commerce Sites" Addison Wesley 3. Iva Bayross, "Web Technologies Part-II" BPB Publications 4. ShishirGundavarma, CGI Programming on the World Wide Web" O'Reilly &Associate 5. DON Box, "Essential COM" Addison Wesley 6. Greg Buczek, " ASP Developer's Guide" TMH


33

S.

No

Course No. Subject Evaluation – Scheme Theor

y/Prac

tical

Credit



Total

Theory

4. BCA-DSE2 DSE2 4 - 4 10 20 30 70 100 4/2

DSE 2.1: C# Programming with .Net framework Unit-I Introduction to .NET Framework- .NET framework, MSIL, CLR, CLS, CTS, Just in time (JIT) Compiler, Base class library, Namespaces, Assemblies, DLL Hell -Problem ,Garbage Collection. Unit II C# Object oriented programming- OOPs, Classes and objects, loops, Array, Encapsulation, Inheritance, Polymorphism, Interface ,Constructor and Destructors, Method Overloading ,Method overriding, Operator Overloading, Modifiers, Indexers , Collections Namespaces, Delegates, Exception Handling. Unit III Microsoft .NET IDE- Creating a Project and solution, Building project, Debugging project, Solution Explorer, Toolbox,Server Explorer, Property Window, Windows Forms and Controls in details-The Windows Forms Model, Creating Windows Forms Windows Forms Properties and Events, Windows Form Controls . Unit IV ADO.Net, C# windows forms for data control: Grid, Datasource and databinding controls, Connected and disconnected scenarios, Dataset, connections, Adapters, commands, data readers.

Unit V ASP.net-Introduction to ASP.NET, Architecture ,Working with Web and HTML Controls, Web forms ,Using Rich Server Controls, Overview of ASP.NET Validation Controls, Data base connectivity using ASP.net.

Text Books

1. A Guide to the Project Management Body of Knowledge (PMBOK), Project Management Institute, PA, (2004). 2. Harold Kerzner, Frank P. Saladis, Project Management Workbook and PMP/CAPM Exam Study Guide , Wiley Publishers (2006) 3. Addison Wesley –C# Developers Guide to ASP.Net 4. Wiley,” Beginning Visual C# 2008”,Wrox Reference Books

1. Claudia M. Baca, Patti, PMP: Project Management Professional Workbook, Sybex, Workbook (2003). 2. C#.Net Developers Guide- Greg Hack, Jason Werry, SaurabhNandu. (SyngRess) 3. Wrox Press Professional C# 3rd Edition – Simon Robinson, Jay Glynn


34

DSE 2.2: Functional Programming using Haskell

Principles of functional programming: expressions, evaluations, functions, and types. Type definitions and built-in types: numbers, characters, strings and lists. Basic operations on lists, including map, fold and filter, together with their algebraic properties. Recursive definitions and structural induction. Simple program calculation. Infinite lists and their uses. Further data structures: binary trees, general trees. Use of trees for representing sets and symbolic data. Normal order reduction and lazy evaluation. Simple cost models for functional programs; time and space complexity. Books 1. Introduction to Functional Programming using Haskell (2nd Edition) 2nd Edition by Richard Bir


35

DSE 2.3: SQL/PL-SQL

Unit I Introduction to SQL, SQL Commands and Data types, PL/SQL, comparison SQL & PL/SQL, Benefits of PL/SQL, Subprograms, Overview of the Types of PL/SQL blocks Unit II PL/SQL Identifiers -List the different Types of Identifiers in a PL/SQL subprogram, Usage of the Declarative Section to define Identifiers, Use variables to store data, Identify Scalar Data Types, %TYPE Attribute, Bind Variables, Sequences in PL/SQL Expressions Unit III Control Structures - Conditional processing Using IF Statements, Conditional processing Using CASE Statements, Use simple Loop Statement, Use While Loop Statement, Use For Loop Statement, Describe the Continue Statement Unit IV Composite Data Types - Use PL/SQL Records, %ROWTYPE Attribute, Insert and Update with PL/SQL Records, Associative Arrays (INDEX BY Tables), Explicit Cursors-Declare the Cursor, Open the Cursor, Fetch data from the Cursor, Close the Cursor, Cursor FOR loop, Explicit Cursor Attributes Unit V Create stored procedure, functions, packages, Introduction to trigger, Create DML Triggers Using the CREATE TRIGGER Statement and SQL Developer.

Books 1. SQL, PL/SQL the Programming Language of Oracle, Ivan Bayross, BPB Publication.


36

S.

No




Total

Theory

4. BCA-DSE3 DSE3 3 1 - 10 20 30 70 100 4

DSE 3.1: Fuzzy Logic & Neural Network

Unit I Evolution of neural networks; Artificial Neural Network: Basic model, Classification, Feed forward and Recurrent topologies, Activation functions; Learning algorithms: Supervised, Un-supervised and Reinforcement; Fundamentals of connectionist modeling: McCulloach – Pits model, Perceptron, Adaline, Madaline. UNITII Topology of Multi-layer perceptron, Back propagation learning algorithm, limitations of Multi-layer perceptron. Radial Basis Function networks- Topology, learning algorithm; Kohenen’s self-organising network: Topology, learning algorithm UNIT III Recurrent neural networks: Basic concepts, Dynamics, Architecture and training algorithms, Applications; Hopfield network: Topology, learning algorithm, Applications; Industrial and commercial applications of Neural networks: UNIT IV Classical and fuzzy sets: Introduction, Operations and Properties, Fuzzy Relations: Cardinality, Operations and Properties, Equivalence and tolerance relation, Value assignment: cosine amplitude and max-min method; Fuzzification: Membership value assignment- Inference, rank ordering, angular fuzzy sets. Defuzzification methods, Fuzzy measures, Fuzzy integrals, Fuzziness and fuzzy resolution; possibility theory and Fuzzy arithmetic; composition and inference; Considerations of fuzzy decision-making. UNIT V Basic structure and operation of Fuzzy logic control systems; Design methodology and stability analysis of fuzzy control systems; Applications of Fuzzy controllers. Applications of fuzzy theory.

Suggested Reading: 1. Limin Fu, “Neural Networks in Computer Intelligence,” McGraw Hill, 2003. 2. Fakhreddine O. Karray and Clarence De Silva., “Soft Computingand Intelligent

Systems Design, Theory, Tools and Applications,” Pearson Education, India, 2009. 3. Timothy J. Ross, “Fuzzy Logic with Engineering Applications,” McGraw Hill,1995. 4. B.Yegnanarayana, “Artificial Neural Networks,” PHI, India, 2006.


37

DSE 3.2: Distributed and Parallel Computing

Unit I Introduction- Parallel Computing, Parallel Architecture, Architectural Classification Scheme, Performance of Parallel Computers, Performance Metrics for Processors, Parallel Programming Models, Parallel Algorithms. Unit II Pipeline Processing - Introduction, Pipeline Performance, Arithmetic Pipelines, Pipelined Instruction Processing, Pipeline Stage Design, Hazards, Dynamic, Instruction Scheduling, Unit III Synchronous Parallel Processing- Introduction, Example-SIMD Architecture and Programming Principles, SIMD Parallel Algorithms, Data Mapping and memory in array, processors, Case studies of SIMD parallel Processors Unit IV Introduction to Distributed Systems, Definition, Issues, Goals, Types of distributed systems, Distributed System Models, Hardware concepts, Software Concept, Models of Middleware, Services offered by middleware, Client Server model ,Token Based Algorithms - Suzuki-Kasami’s Broardcast Algorithms,Singhal’s Heurastic Algorithm, Raymond’s Tree based Algorithm, Comparative Performance Analysis. Unit V Distributed File Systems - Introduction, good features of DFS, File models, File Accessing models, File-Caching Schemes, File Replication, Network File System(NFS) Text Books 1.M.R. Bhujade, “Parallel Computing”, 2nd edition, New Age International Publishers 2009. 2.Andrew S. Tanenbaum and Maarten Van Steen, “Distributed Systems: Principles and Paradigms, 2nd edition, Pearson Education, Inc., 2007, ISBN: 0-13-239227-5. Reference Books 1. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems: Concepts andDesign” (4th Edition), Addison Wesley/Pearson Education. 2.Pradeep K Sinha, “Distributed Operating Systems : Concepts and design”, IEEEcomputer society press


38

DSE 3.3: Artificial Intelligence

Unit I

Introduction:- Definition and meaning of artificial intelligence, A.I. techniques, pattern recognition, Level of, speech recognition representation in A.I. properties of internal representation. Unit II

Production System:- Different types of tracing, strategies, graph search strategies, Heuristic graph, search procedure, AND/OR graph, relationship between decomposional and compatible systems, searching Gate Tree, min-max search game playing, actual game playing.

Unit III

Introduction to Predicate Calculus:- Predicates and Arguments, connectives, Simplifications of strategies, extracting answers from Resolution Refutation. Control strategies. Unit IV

Rule Based Deduction Systems: Forward and backward deduction system, resoling with AND/OR graph, computation, deduction and program synthesis, central knowledge for rules based deduct systems. Unit V

Structural Object Representation: Semantic networks semantic market matching deductive operations on structured objects. Architectural for A.I. Systems: Knowledge, acquisitions representation IMAGES PROCESSING, Natural language processing. References: 1. Introduction to artificial Intelligence Eugene Charnik Drew MC mott 2. Artificial Intelligence Elaine Rice. 3. Principal of Artificial Intelligence, Nelson, Springer-Verlag. 4. Artificial Intelligence Application Programming: Tim Jones, Wiley dreamtech


39

DSE 3.4: Automata and Formal Languages

Unit I Introduction of Finite Automata- Alphabets, Strings, Languages, Finite Automata (FA), acceptance of strings, and languages, Deterministic Finite Automata (DFA) and Non Deterministic Finite Automata (NFA), transition diagrams and Language recognizers. Conversions and Equivalence: Equivalence between NFA with and without ε-transitions, NFA to DFA conversion, minimization of FSM, equivalence between two FSM’s, Finite Automata with output-Moore and Mealy machines. Unit II Regular Expressions & Languages- FA and Regular Expressions, Conversion from RE to FA and FA to RE, Pumping lemma for regular languages, Closure properties of regular languages, Equivalence and minimization of Automata. Unit III Context Free Grammars and Languages-CFG, Leftmost, Rightmost derivations, Ambiguity in grammars and languages. Simplification of Context Free Grammars, Chomsky normal form (CNF), Greibach normal form (GNF), Pumping Lemma for Context Free Languages. Unit IV Push Down Automata-Definition and languages of PDA, Equivalence & conversion of CFG’s and PDA’s, Deterministic PDA. Unit V Turing Theory-Turing Machines, definition, model, design of TM, Variations of TM-Multitape TMs, Non Deterministic TM, Universal TM,The Church-Turing thesis Recursively enumerable languages, Context -Sensitive Languages and the Chomsky Hierarchy. Unsolvable Problems-Halting Problem, Post’s Correspondence Problem (PCP). References:

1. J.E.Hopcraft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory,Languages and Computation”, Pearson Education

2. Cohen, “Introduction to Computer Theory”, John Wiley.3. M. Sipser, Introduction to Theory of Computation, PWS Publishing Corporation,1997.

3. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages andComputation, Addison-Wisley, 1979.

4. T.C. Martin, Theory of Computation, Tata McGraw-Hill 5. H.R. Lewis, C.H. Papadimitrou, Elements of the Theory of Computation, PHI.


40

S.

No




Total

Theory

4. BCA-SEC3 SEC3 4 - - 10 20 30 70 100 4

SEC3.1: Data Warehousing &Data Mining

Unit I Introduction to data mining :-kinds of data, relational databases, traditional databases, advanced database systems. Data Mining functionalities and patterns generated. Unit II Data Preprocessing:- Data Cleaning, Data Integration and Transformation, Data Reduction, Data Discretization. Concept Hierarchy Generation Data Warehouse and OLAP Technology Unit III A Multidimensional Data Model Stars, Snow flake and Fact Constellations Schemas for Multidimensional Databases, OLAP operations, Data Warehouse Architecture Associations and Correlations the Apriori Algorithm, Finding Frequent Item sets Using Candidate Generation Mining, Frequent Item sets without Candidate Generation Mining, and Frequent Item sets Using Vertical Data Format Classification, Classification by Decision Tree Induction, Bayesian Classification RuleBased Classification, Associative Classification Unit IV Clustering :-Similarity and distance measures, Outliers, Partitioning and hierarchical Methods, Mining Social Network, spatial databases, multidimensional databases, text databases and World Wide Web. References: Data Mining: Concepts and Techniques Jiawei Han, MichelineKamber and Jian Pei, 2.Data Mining Introduction and Advance Topic Margaret H. Dunham and S. Sridhar 3.Data Warehousing in the real World, Sam Anahory and Dennis Murray


41

SEC3.2: Management Information System

UNIT 1

Organisation & Types, Decision Making, Data & information, Characteristics & Classification of information, Cost & value of information, various channels of information & MIS. UNIT 2

Foundation of Information System: Introduction to Information System in Business Fundamentals of Information System, Solving Business Problems with Information System, Concept of Balanced MIS, Effectiveness & Efficiency Criteria. Tool and Techniques of MIS- dataflow diagram, flow chart etc. UNIT 3

Business application of information technology: electronic commerce Internet, Intranet, Extranet & Enterprise Solutions, Information System for Business Operations, Information system for managerial Decision Support, Information System for Strategic Advantage. UNIT 4

Managing Information Technology, Enterprise & Global Management, Security & Ethical Challenges, Planning & Implementing Change. Reports: Various types of MIS reports, GUI & Other Presentation tools. UNIT 5

Advanced concepts in information system: Enterprise Resource Planning: introduction, various modules like Human Resources, Finance, Accounting, Production& Logistics. Supply Chain Management, CRM, Procurement, Management System Object Oriented modeling case studies. Reference & Text Books 1. O.Brian, “Introduction to Information System”, McGraw Hill. 2. O.Brian, “Management Information System”, TMH. 3. Alter, “Information Systems: A Management Perspective”, Addison Wesley. 4. Arora& Bhatia, “Information Systems for Managers”, Excel 5. Bansal, “Information System Analysis & Design”, TMH. 6. Jawadegar, “Management Information System”, TMH. 7. Murdick, “Information System for Modern Management”, PHI. 8. Alexis Leon, “Enterprise Resource Planning”, TMH.


42

SEC3.3: Multimedia Applications

Unit I

Multimedia: Introduction to multimedia, Components, Uses of multimedia. Making Multimedia: Stages of a multimedia project, Requirements to make good multimedia, Multimedia Hardware - Macintosh and Windows production Platforms, Hardware peripherals - Connections, Memory and storage devices, Multimedia software and Authoring tools.

Unit II

Text: Fonts & Faces, Using Text in Multimedia, Font Editing & Design Tools, Hypermedia &Hypertext. Images: Still Images – Bitmaps, Vector Drawing, 3D Drawing & rendering, Natural Light &Colors, Computerized Colors, Color Palletes, Image File Formats.

Unit III

Sound: Digital Audio, MIDI Audio, MIDI vs Digital Audio, Audio File Formats. Video: How Video Works, Analog Video, Digital Video, Video File Formats, Video Shooting and Editing.

Unit IV

Animation: Principle of Animations. Animation Techniques, Animation File Formats.

References:

1. Tay Vaughan, “Multimedia: Making it work”, TMH, Eighth edition. 2006

2. Ralf Steinmetz and KlaraNaharstedt, “Multimedia: Computing, Communications Applications”,

Pearson,1995.

3. Keyes, “Multimedia Handbook”, TMH. 2000.

4. K. Andleigh and K. Thakkar, “Multimedia System Design”, PHI,2000


43

SEC3.4: Advance RDBMS Unit I Data Processing Systems. Transaction Processing and Concepts: Transaction system, Testing of seralizability, Seralizability of schedules, conflict and view seralizable schedule, recoverability, Recovery form transaction failures, deadlock handling. Unit II File processing system. File Management system. Components of RDBMS.DatabaseArchitecture. Object Oriented Databases. Distributed Databases. Client/server database. DataDictionary. Database models.Normalization. Unit III The Database Administration. Database Manager responsibilities. Monitoring Database performance. Database Machine overview. Designing RDBMS for organization. Object modeling. Perspectives of Data Modelling.Evolving the logical model. Transformation from Logical to Phical model. Unit IV Concurrency Control Techniques: Concurrency control, locking Techniques for concurrency control. CODD’s 12 rules for a fully relational DBMS. Data Integrity. Redundancy. Primary and Foreign keys. Object database management. Database design and choosing the database server. SQL and MySql. Database access and ODBC. Unit V Web technology and DBMS, Web as a database Application Platform: Requirements for web-DBMS integration, web-DBMS architecture, advantages and disadvantages of web-DBMS approach, Database security and Recovery. Data Mining and Warehouse. References:

1. Adv. DBMS by V.K. Jain, Cyber Tech Publication, 5A/13 Ansari Road, Daryagang, N.Delhi.-110002

2. Date C.J. "An Introduction to Database System". Addision Wesley 3. Korth, Silbertz, Sudarshan, "Database Concepts" McGraw Hill 4. Elmasri, Navathe, "Fundamentals of Database Systems" Addision Wesley 5. Paul Beynon Davis, "Database Systems" Palgrave Macmillan 6. Bipin C. Desai, "An introduction to Database Systems", Galgotia Pub.


44

SIXTH SEMESTER

S.

No

Course No. Subject Evaluation – Scheme Theory/P

ractical

Credit



Total

Theory

4. BCA-DSE4 DSE4 4 1 4 10 20 30 70 100 5/2

DES4.1: Advance Java Programming

UNIT I Applets and Layout managers- Applets in java, AWT controls- Labels, Buttons, CheckBox, Choice, TextField, TextArea, Lists, ScrollBar, ProgressBar, Window, Frame, Menu, MenuBar etc. Layout Managers- FlowLayout, BorderLayout, gridlayout, CardLayout, GridBagLayout. UNIT II Java Swing and Event Handling-Working with JFrame, JApplet, JPanel, JTextField, JPasswordField, JButton,JCheckBox, JRadioButton, JList, JScrollPane, JComboBox,JMenu, JMenuBar,JMenultem. Event Handling- Event delegation model or event class hierarchy, all classes and interfaces of event delegation model, programs related to event. UNIT III Servlets- Servlet Overview and Architecture, Servlet Life Cycle, GET and POST methods, HTTPServletRequest and HTTPServletResponse objects, Developing an interactive servlet using an HTML page, HTTPSession object. UNIT IV Java Beans- Preparing a Class to be a Java Bean, Creating a JavaBean, JavaBean Properties, Types of beans, Stateful Session bean, Stateless Session bean, Entity bean. UNIT V JDBC Connectivity- Database concepts and HTML Forms. JDBC driver types, JDBC-ODBC Bridge, SQL Statements, Prepared Statements. Using JDBC in servlets. Text Books

1. Herbert Schildt (2006), “The Complete Reference Java 2 (Updated to Cover J2SE 1.4)”, Ed. 05, Tata McGraw-Hill publishing company Ltd. New Delhi, India.

2. Cay S. Horstmann Gary Cornell, “ Core Java 2 Volume-I Fundamentals”, Ed-07, PEARSON Education, Singapore Pte.Ltd., Indian Branch, New Delhi, India 2005.

Reference Books

1. Michael Morgan, “Java 2 for Professionals Developers”, Ed. 01, SAMS, Techmedia, New Delhi, India,2000.


45

DES 4.2: UNIX & Shell Programming

Unit I

Basic Unix Commands: The Unix editors and vi; Redirection, Piping, Tees and filters; The Unix

Utilities grep, sed, etc. Overview of Unix Architecture: The kernel and the Shell; Processes and

Time Sharing files and Directories; Peripheral Device as files.

Unit II

Introduction the Shell Scripts: The Bourne and C-shells; Shell variables, scripts meta-characters

and environment; the if and case statements; for, while and until loops. System calls and the ‘C’

library:Discussion of the Unix system calls and ‘C’ library functions, the standard I/O Package; file

handling; math library; command line parameters etc. The Unix ‘C’ interface; ‘C’ files and

Graphics. Introduction of systems Administration under Unix: The system Manger OLE and

functions.

Unit III

Different Tools: Debugging language development, System development different print formatting

UNIX Tools.Bourne Shell: Shell meta characteristics, shell variable, scripts, facilities, commands

and environments, shell archive, idea about restricted shell, ROLC program. Korn Shell:Shell

variables and scripts, built in EDITOR, built in integer arithmetic, string manipulation capabilities,

Command Aliasing, Array Job control. C-Shell:Shell variables and scripts, shell facilities, history

Integer Arithmetic Decision making and job control.

References:

1. Stephan Prata: Advanced Unix – A Programmers Guide – BPB PUB.

2. Kernighlan&Pike : The Unix Programming Environment – PHI.

3. The Unix System Manuals.


46

DSE 4.3: Microprocessor Systems

UNIT I Introduction to Microprocessor, History of Microprocessors, Micro-Computers and Micro-Controllers, Microprocessor architecture and its operations, Memory, Input & output devices, Logic devices for interfacing, The 8085 MPU, Example of an 8085 based computer, Memory interfacing & Address Decoding. UNIT II Basic interfacing concepts, Interfacing output displays, Interfacing input devices, Memory mapped I/O, Peripheral Mapped I/O, Flow chart symbols, Data Transfer operations, Arithmetic operations, Logic Operations, Branch operation, Writing assembly language programs, Programming techniques: looping, counting. UNIT III Additional data transfer and 16 bit arithmetic instruction, Arithmetic operations related to memory, Logic operation: rotate, compare, Stack, Subroutine, Restart, Conditional call and return instructions, 8085 Interrupts, 8085 vector interrupts, RIM & SIM Instruction. UNIT IV Program: Addition, subtraction, multiplication & division of 8-bit numbers, finding largest & smallest numbers in an array, sorting of array, BCD-to-Binary conversion, Binary-to-BCD conversion. UNIT V 8255 Programmable peripheral interface, interfacing keyboard and seven segment display,Direct Memory Access and 8237 DMA controller. References : 1. Ramesh Gaonkar, “Microprocessor Architecture, Programming, and Applications with the 8085”, 5th Edition, Penram International Publication (India) Pvt. Ltd. 2. Douglas V. Hall, “Microprocessors and Interfacing”, Tata McGraw Hill.


47

S.

No

Course No. Subject Evaluation – Scheme Theory/Prac

tical Credit Period Sessional Examination


Total

Theory

4. BCA-DSE5 DSE5 4 1 4 10 20 30 70 100 5/2

DSE 5. 1: Advance Software Engineering UNIT I

Unified Modeling Language, Basic structures and modeling classes, common modeling techniques, relationships, common mechanism, class diagrams UNIT II

Advanced structured modeling, advanced classes and relationships, interfaces, types and roles, instances and object diagram. Basic idea of behavioral modeling. UNIT III

Object- oriented concepts and principles. Identifying the elements of an object model. Object oriented projects metrics and estimation. Design for object – oriented systems. The system design process. Object – oriented testing – testing OOA and OOD models. The object – oriented testing strategies. Inter class testing. UNIT IV

Technical metrics for O-O systems. Class oriented metrics and metrics for O-O projects. Advanced topics in software engineering. Component based software engineering and development. Classifying and retrieving components.


48

DSE 5.2: Computer Graphics Unit I Graphics Primitives: Display Devices: Refresh Cathode Ray Tube, Raster Scan Display, Plasma display, Liquid Crystal display Plotters, Printers. Input Devices: Keyboard, Trackball, Joystick, Mouse, Light Pen, Tablet, and Digitizing Camera. Unit II Input Techniques: Positioning techniques, Potentiometers, Constraints, Scales & Guidelines, Rubber-Band techniques, Dragging Dimensioning techniques and Graphical Potentiometers, Pointing and Selection: the use of selection points defining a boundary rectangle, multiple selections, Menu selection. Mathematics for Computer Graphics: Point representation, Vector representation, Matrices and operations related to matrices, Vector addition and vector multiplication, Scalar product of two vectors, Vector product of two vectors. Unit III Line Drawing Algorithms: DDA Algorithms, Bresenham's Line algorithm. Segment & Display files: Segments, Functions for segmenting the display file, Posting and posting a segment, segment naming schemes, Default error conditions, Appending to segments, Refresh concurrent with reconstruction, Free storage allocation, Display file structure. Unit IV Graphics Operations: Clipping, Point Clipping, Line Clipping, Polygon Clipping. Filling: Inside Tests, Flood fill algorithm, Boundary-Fill Algorithm and scan-line polygon fill algorithm. Conics, Curves and Surfaces: Quadric surfaces: Sphere, Ellipsoid, and Torus. Super quadrics: Super ellipse, super ellipsoid, Spline & Bezier Representations: Interpolation and approximation splines, parametric continuity conditions, Geometric Continuity Conditions, Spline specifications. Bezier curves and surfaces. Unit V Transformation: 2D transformation, Basic Transformations, Composite transformations: Reflection, Shearing, Transformation between coordinate systems. 3D Graphics: 3D Display Methods, 3D transformations, Parallel projection, Perspective projection, Visible lines and surfaces identification, Hidden surface removal.Animation: Introduction to Animation to Animation, Principles of Animation, Types of Animation, Types of Animation Systems: Scripting, Procedural, Representational, Stochastic, etc. Animation Tools: Hardware-SGI, PC's Amiga etc. References: 1. Donald Hearn and M Pauline Baker, "Computer Graphics" PHI 2. Steven Harrington, "Computer Graphics: A Programming Approach" TMH 3. Prajapati A.K. "Computer Graphics" PPM Ed2 4. Foley James D, "Computer Graphics" AW Ed2 5. Newman and Sprould, "Principle of to Interactive Computer Graphics" McGraw Hill 6. Rogers, "Procedural Elements of Computer Graphics", McGraw Hill 7. Rogers and Adams, "Mathematical Elements of Computer Graphics" McGraw Hill


49

DSE 5.3: Computer Based Numerical Techniques

Unit I

Floating point Arithmetic: Representation of floating point numbers, Operations, Normalization,

Pitfalls of floating point representation, Errors in numerical computation.

Unit II

Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using

Bisection Method, Iteration method, Regula-Falsi method, Newton Raphson method, Secant

method, Rate of convergence of iterative methods.

Unit III

Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss Elimination direct

method and pivoting, III conditioned system of equations, Refinement of solution. Gauss Seidal

iterative method, Rate of Convergence. Interpolation and approximation: Finite Differences,

Difference tables. Polynomial Interpolation: Newton's forward and backward formula Central

Difference Formulae: Gauss forward and backward formula, stirling's Bassel's Everett's formula.

Interpolation with unequal intervals: Language's Interpolation, Newton Divided difference formula.

Unit IV

Numerical Differentiation and Integration: Introduction, Numerical Differentiation, Numerical

Integration, Trapazoidal rule, Simpon's rules, Boole's Rule Euler-MaclaurinFormula ,Solution of

Differential Equations: Picard's Method, Euler's Method, Taylor's Method, Runge-Kutta methods.

References:

1. Rajaraman V., :Computer Oriented Numerical Methods". PHI

2. Gerald and Wheatley, "Applied Numerical Analyses", AW

3. Jain, Lyengar and Jain, "Numerical Methods for Scientific and Engineering Computations:, New

Ager Int.

4. Grewal B.S., "Numerical methods in Engineering and Science. Khanna Publishers, Delhi.

5. T.Veerarajan, T Ramchandran, "Theory and Problems of Numerical Methods", TMH


50

S.

No




Total

Theory

4. BCA-SEC4 SEC4 4 - - 10 20 30 70 100 4

SEC4.1: E-Governance Unit I

Overview of E-Government and E-Governance, Stages of E-Governance, National E- Governance Plan(NeGP), Mission Mode Projects and their implementation status, E-Governance , Introduction to E-governance, Role of ICT’s in e-governance, Need, importance of E-governance Unit II Categories of E-governance, Key Issues of E-Governance, Technology, Policies, Infrastructure, Training,Copyrights , Consulting Funds, E-governance Models, Model of Digital Governance, Broadcasting /Wider Dissemination Model Unit III Critical Flow Model, Interactive-service model/Government –to-Citizen-to-Government Model (G2C2G),Major areas of E-governance Services, Public Grievances: Telephone, Ration card, transportation, Ruralservices Land Records, Police: FIR registration, Lost and found, Social services: Death, domicile, school certificates. Unit IV Public information: employment, hospitals, railway, Agricultural sector: Fertilizers, Seeds, Utilitypayments Electricity, water, telephone, Commercial: income tax, custom duty, excise duty-Governance, Infrastructure, stages in evolution and strategies for success, -Governance Infrastructure, stages in evolution and strategies for success. Reference books (1) Geo-information international publications (2) E-governance projects, PHI publication


51

SEC 4.2: Cloud Computing Unit-I Introduction:- Historical development ,Vision of Cloud Computing, Characteristics of cloud computing as per NIST , Cloud computing reference model ,Cloud computing environments, Cloud services requirements, Cloud and dynamic infrastructure, Cloud Adoption and rudiments. Overview of cloud applications:- ECG Analysis in the cloud, Protein structure prediction, Gene Expression Data Analysis ,Satellite Image Processing ,CRM and ERP ,Social networking Unit-II Cloud Computing Architecture:- Cloud Reference Model, Types of Clouds, Cloud Interoperability & Standards, Scalability and Fault Tolerance; Cloud Solutions:- Cloud Ecosystem, Cloud Business Process Management, Cloud Service Management. Cloud Offerings:- Cloud Analytics, Testing Under Control, Virtual Desktop Infrastructure. Unit –III Cloud Management & Virtualization Technology: - Resiliency, Provisioning, Asset management, Concepts of Map reduce , Cloud Governance, High Availability and Disaster Recovery. Virtualization: Fundamental concepts of compute ,storage, networking, desktop and application virtualization .Virtualization benefits, server virtualization, Block and file level storage virtualization Hypervisor management software, Infrastructure Requirements , Virtual LAN(VLAN) and Virtual SAN(VSAN) and their benefits. . Unit-IV Cloud Security: - Cloud Information security fundamentals, Cloud security services, Design principles, Secure Cloud Software Requirements, Policy Implementation, Cloud Computing Security Challenges, Virtualization security Management, Cloud Computing Security Architecture. Unit-V Market Based Management of Clouds , Federated Clouds/Inter Cloud: Characterization &Definition ,Cloud Federation Stack , Third Party Cloud Services .Case study : Google App Engine, Microsoft Azure , Hadoop , Amazon, AnekaList of Experiments. Recommended Text: 1. Buyya, Selvi ,” Mastering Cloud Computing “,TMH Pub 2. Kumar Saurabh, “Cloud Computing” , Wiley Pub 3. Krutz , Vines, “Cloud Security “ , Wiley Pub 4. Velte, “Cloud Computing- A Practical Approach” ,TMH Pub 5. Sosinsky, “ Cloud Computing” , Wiley Pub


52

SEC 4.3: Software Project Management

Unit I Introduction to Software Project Management:- Software development as a project; Stakeholders in software project; Software product, process, resources, quality, and cost; Objectives, issues, and problems relating to software projects. Overview of Project Planning: - Steps in project planning; Defining scope and objectives; work breakdown structure; Deliverables and other products; time, cost, and resource estimation; Alternatives in Planning Project Evaluation: Strategic assessment; Technical assessment; Cost-benefit analysis; Cash flow forecasting; Cost benefit evaluation techniques; Break-even analysis; Risk evaluation Unit II Selection of Appropriate Project Approach:-Choosing development technology and methodology; choice of process model; Rapid application development; Waterfall model; V-process model; Spiral model; Prototyping; Incremental delivery. Software Effort Estimation Problem in software estimation; Effort estimation techniques; Expert judgment; Estimation by analogy; Delphi technique; Algorithmic methods; Top-down and bottom-up estimation; Function point analysis; Object points; COCOMO model. Unit III Activity Planning Network planning model; Activity-on-arrow network; Precedence network; Forward pass; Backward pass; Critical path; Slack and float. Risk Analysis and Management Nature and categories of risk in software development; risk Identification; Risk assessment; Risk mitigation, monitoring, and management; Evaluating schedule risk using PERT. Recourse Allocation Nature of project resources; Identifying resource requirement of activities; Allocating and scheduling resources; cost of resources; Standard, planned, and actual cost; Cost variance; time-cost trade-off. Unit IV Project Tracking and Control Measurement of physical and financial progress; Earned value analysis; Status reports; Miles tone reports; Change control. Contact Management Outsourcing of products and services; Types of contracts; Stages in contract placement; Terms of contract; Contract monitoring; Acceptance testing Unit V Software Quality Assurance -Planning for quality; Product versus process quality management; Procedural and quantitative approaches; Defect analysis and prevention; Statistical process control; Pareto analysis; Causal analysis; Quality standards; ISO 9000; Capability Maturity Model; Quality audit. References: 1. Robert T. Futrell, Donald F. Shafer, and Linda I..Shafer, “Quality Software Project Management”2002, Pearson Education Asia. 2. Ramesh Gopalaswamy, “Managing Global Software Projects”, 2003, Tata McGraw-Hill


53

SEC 4.4: Network Security & Cryptography Unit I Introduction To security: Attacks, Services & Mechanisms, Security, Attacks, Security Services, Conventional Encryption:-Classical Techniques, Conventional Encryption Model, and steganography, Classical Encryption Techniques. Modern Techniques:- Simplified DES, Block Cipher Principles, DES Standard, DES Strength, Differential &Linear Cryptanalysis, Block Cipher Design Principles, Block Cipher Modes of Operations. Unit II

Conventional Encryption Algorithms: Triples DES, Blowfish, International Data Encryption Algorithm, RCS, CAST-128, CR2 Placement & Encryption Function, Key Distribution, Random Number Generation, Placement of Encryption Function. Unit III Hash Functions:- Message Authentication & Hash Functions: Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash Function Birthday Attacks, Security of Hash Function & MACS, MD5 Message Digest Algorithm, Secure Hash Algorithm (SHA), Digital Signatures: Digital Signature, Authentication Protocol, Digital Signature Standard (DDS) Proof of Digital Signature Algorithm. Unit IV Network & System Security: Authentication Applications: Kerberos X-509, DirectoryAuthentication Service, Electronic Mail Security, Pretty Good Privacy (PGP),S/MineSecurity: Architecture, Authentication Header, Encapsulating Security Payloads, Combining Security Associations, Key Management. References: 1. William Stallings, "Cryptography and Network Security: Principles and Practice, Prentice Hall, New Jersey 2. Johannes A. Buchmann, "Introduction to Cryptography" Springer-Verlag