Accredited By NAAC with ‘A’ Grade CHOICE BASED ... syllabus...DSE-E3 C#.Net 3 DSE-F3 ASP.Net 3 DSE-E4 Cloud Computing 3 DSE-F4 Mobile Computing 3 DSE-E5 Cyber Forensic 3 DSE-F5

************

Accredited By NAAC with ‘A’ Grade

CHOICE BASED CREDIT SYSTEM (CBCS)

Syllabus For

B. C. A. Part – I

SEMESTER – I AND II

(Syllabus to be implemented from June, 2019 onwards.)

Page 1 of 36

Shivaji University, Kolhapur Choice Based Credit System

Bachelor of Computer Applications (B.C.A.) Under the Faculty of Science& Technology

(To be implemented from Academic Year 2019 - 2020)

B.C.A. Part – I CBCS Pattern (2019 – 2020)

S E M E S T E R – I

Sr. No.

Cou

rse

Titl

e TEACHING SCHEME EXAMINATION SCHEME THEORY

PRACTICAL THEORY

PRACTICAL

No.

of

lect

ures

Hou

rs

Cre

dits

No.

of

lect

ures

Hou

rs

Cre

dits

Hou

rs

Max

Tot

al

Mar

ks

Min

Hou

rs

Max

Min

1 DSC-A 5 4 2 4 3.2 4 2 50 --- 20

Practical Examination is

Annual

2 DSC-A 2 2 50 20 3 DSC-A 5 4 2 4 3.2 4 2 50 --- 20 4 DSC-A 2 2 50 20 5 DSC-A 5 4 2 --- --- --- 2 50 --- 20 6 DSC-A 2 2 50 20 7 DSC-A 5 4 2 --- --- --- 2 50 --- 20 8 DSC-A 2 2 50 20 9 AECC-A 4 3.2 2 --- --- --- 2 50 --- 20 Total 24 19.2 18 8 6.4 8 450 ---

S E M E S T E R – II 1 DSC-B 5 4 2

4 3.2 4 2 50 --- 20

As per

BOS Guideline

s

100 40 2 DSC-B 2 2 50 20 3 DSC-B 5 4 2 4 3.2 4 2 50 --- 20 100 40 4 DSC-B 2 2 50 20 5 DSC-B 5 4 2 --- --- --- 2 50 --- 20 --- --- 6 DSC-B 2 2 50 20 7 DSC-B 5 4 2 --- --- --- 2 50 --- 20 --- --- 8 DSC-B 2 2 50 20 9 AECC-B 4 3.2 2 --- --- --- 2 50 --- 20 --- --- Total 24 19.2 18 8 6.4 8 450 --- 200 Grand Total 48 38.4 36 16 12.8 16 900 --- 200

• Student contact hours per week : 32 Hours (Min.) • Total Marks for BCA-I (Including AECC) : 1100 • Theory and Practical Lectures : 48 Minutes Each • Total Credits for BCA.-I (Semester I & II) :52 • DSC – Discipline Specific Core Course:8Courses from A1 to A8 and B1 to B8. • AECC – Ability Enhancement Compulsory Course (A &B) • Practical Examination will be conducted annually for 100 Marks per Lab Course (Lab course-1, 2) • Passing for each theory course of 50 marks, min. 20 marks required. • Passing for each Lab Course of 100 marks, min. 40 marks required.

Page 2 of 36

B.C.A. Part – II CBCS Pattern (2020 – 2021)

S E M E S T E R – III

Sr. No.

Cou

rse

Titl

e TEACHING SCHEME EXAMINATION SCHEME THEORY

PRACTICAL THEORY

PRACTICAL N

o. o

f le

ctur

es

Hou

rs

Cre

dits

No.

of

lect

ures

Hou

rs

Cre

dits

Hou

rs

Max

Tot

al

Mar

ks

Min

Hou

rs

Max

Min

1 DSC-C 3 2.4 2 4 3.2 4 2 50 --- 20


Annual

2 DSC-C 3 2.4 2 2 50 20 3 DSC-C 3 2.4 2 4 3.2 4 2 50 --- 20 4 DSC-C 3 2.4 2 2 50 20 5 DSC-C 3 2.4 2 --- --- --- 2 50 --- 20 6 DSC-C 3 2.4 2 2 50 20 7 PW --- --- --- 4 3.2 4 -- -- -- -- 8 AECC-C 4 3.2 4 --- --- --- -- -- --- -- Total 22 17.6 16 12 9.6 12 300 ---

S E M E S T E R – IV 1 DSC-D 3 2.4 2

4 3.2 4 2 50 --- 20

As per

BOS Guideline

s

100 40 2 DSC-D 3 2.4 2 2 50 20 3 DSC-D 3 2.4 2 4 3.2 4 2 50 --- 20 100 40 4 DSC-D 3 2.4 2 2 50 20 5 DSC-D 3 2.4 2 --- --- --- 2 50 --- 20 --- --- 6 DSC-D 3 2.4 2 2 50 20 7 PW --- --- --- 4 3.2 4 -- -- -- -- 100 40

8 AECC-C AECC-D --- --- --- --- --- --- 3

70 100

25 --- ---

30 10 --- --- ---

Total 18 14.4 12 12 9.6 12 400 --- 300 Grand Total 40 32 28 24 19.2 24 700 300

• Student contact hours per week : 32 Hours (Min.) • Total Marks for BCA-II (Including Env.) : 1000 • Theory and Practical Lectures : 48 Minutes Each • Total Credits for BCA-II (SemesterIII & IV) :52 • DSC – Discipline Specific Core Course:6Courses from C1 to C6 and D1 to D6. • AECC – Ability Enhancement Compulsory Course (C&D)-

Environmental Studies( Theory – 70 & Project – 30 Marks) • Practical Examination will be conducted annually for 100 Marks per Lab Course (Lab course-3, 4) & Project

Work • Passing for each theory course of 50 marks, min. 20 marks required. • Passing for each Project work and Lab Course of 100 marks, min. 40 marks required.

Page 3 of 36

B.C.A. Part –III CBCS Pattern (2021 – 2022)

S E M E S T E R – V

Sr. No.

Cou

rse

Titl

e

TEACHING SCHEME

EXAMINATION SCHEME

THEORY

PRACTICAL THEORY

PRACTICAL University Internal

No.

of

lect

ures

Hou

rs

Cre

dits

No.

of

lect

ures

Hou

rs

Cre

dits

Hou

rs

Max

Min

Max

Min

Hou

rs

Max

Min

1 DSE-E 3 2.4 2 4 3.2 4 2 40 16 10 4


Annual

2 DSE-E 3 2.4 2 2 40 16 10 4 3 DSE-E 3 2.4 2

4 3.2 4 2 40 16 10 4

4 DSE-E 3 2.4 2 2 40 16 10 4 5 DSE-E 3 2.4 2 --- --- --- 2 40 16 10 4 6 AECC-E 4 3.2 2 --- --- --- 2 40 16 10 4 7 PW --- --- --- 4 3.2 4 --- --- --- --- --- Total 19 15.2 12 12 9.6 12 240 60

S E M E S T E R – VI 1 DSE-F 3 2.4 2

4 3.2 4

2 40 16 10 4

As per

BOS Guidelines

100 40 2 DSE-F 3 2.4 2 2 40 16 10 4 3 DSE-F 3 2.4 2

4 3.2 4 2 40 16 10 4

100 40 4 DSE-F 3 2.4 2 2 40 16 10 4 5 DSE-F 3 2.4 2 --- --- --- 2 40 16 10 4 6 AECC-F 4 3.2 2 --- --- --- 2 40 16 10 4 --- --- 7 PW --- --- --- 4 3.2 4 --- --- --- --- --- 100 40 Total 19 15.2 12 12 9.6 12 240 60 300 Total 38 30.4 24 24 19.2 24 480 120 300

• Student contact hours per week : 32 Hours (Min.) • Total Marks for BCA-III (Including English) : 900 • Theory and Practical Lectures : 48 Minutes Each • Total Credits for BCA-III (Semester V & VI) :48 • DSE – Discipline Specific Elective: 5 Coursesfrom E1 to E5 and F1 to F5. • AECC – Ability Enhancement Compulsory Course (E&F)- English • Practical Examination will be conducted annually for 100 Marks per Lab Course (Lab course-5, 6) & Project

Work • Passing for each theory course of 50 marks (Theory 40 marks & Internal 10 marks), min. 20 marks (Theory 16

marks & Internal 4 marks) required. • Passing for each Project work and Lab Course of 100 marks, min. 40 marks required.

Page 4 of 36

Programme Structure

B.C.A. Part –I

Semester-I

Semester-II

Course Code

Course Title Work load

Course Code


DSC-A1 Problem Solving Techniques 5

DSC-B1 Data Structure Fundamentals 5

DSC-A2 Programming in C DSC-B2 Advanced ‘C’ Programming

DSC-A3 Fundamentals of Computer 5

DSC-B3 Computer Peripherals 5

DSC-A4 Database Concepts DSC-B4 Advance Database

DSC-A5 Computer Security 5

DSC-B5 Basics of Cyber Security 5

DSC-A6 Basics of Digital Systems DSC-B6 Advanced Digital Systems

DSC-A7 Descriptive Statistics 5

DSC-B7 Statistical Methods 5

DSC-A8 Mathematical Foundation DSC-B8 Discrete Mathematics

AECC-A Communication Skills 2 AECC-B Soft Skills 2

Lab Course-1

Based on DSC-A2, DSC-B1, DSC-B2 4+4

Lab Course-2

Based on DSC-B3, DSC-B4 4+4

Page 5 of 36

Programme Structure B.C.A. Part –II

Semester-III

Semester-IV

Course Code

Course Title Workload

Course Code

Course Title Workload

DSC-C1 OOP with C++ 3 DSC-D1 Core Java 3

DSC-C2 Operating System 3 DSC-D2 Linux Operating System 3

DSC-C3 Web Designing 3 DSC-D3 PHP 3

DSC-C4 Computer Network 3 DSC-D4 Data Mining & Data Warehouse

3

DSC-C5 Software Engineering 3 DSC-D5 Software Project Management

3

DSC-C6 E-mail & Web Security 3 DSC-D6 Network Security 3

AECC-C Environment Studies 4 AECC-D Environment Studies (Project)

--

Lab Course-3 Based on DSC – C1, DSC – C2, DSC – D1, DSC – D2 4+4

Lab Course-4 Based on DSC – C3, DSC – C4, DSC – D3, DSC – D4 4+4

PW Project Work 4+4

Page 6 of 36

Programme Structure

B.C.A. Part –III

Semester-V

Semester-VI

Course Code


Course Code


DSE-E1 Essential of Data Science 3 DSE-F1 Artificial Intelligence 3

DSE-E2 Advance Java 3 DSE-F2 Machine Learning 3

DSE-E3 C#.Net 3 DSE-F3 ASP.Net 3

DSE-E4 Cloud Computing 3 DSE-F4 Mobile Computing 3

DSE-E5 Cyber Forensic 3 DSE-F5 Mobile & Cloud Security 3

AECC-E English 3 AECC-F English 3

Lab Course-5 Based on DSC – E1, DSC – E2, DSC – F1, DSC – F2 4+4

Lab Course-6 Based on DSC – E3, DSC – E4, DSC – F3, DSC – F4 4+4

PW Project Work 4+4

Page 7 of 36

Bachelor of Computer Applications (B.C.A.) (Under the Faculty of Science & Technology)

B.C.A. – I Semester – I DSC-A1: Problem Solving Techniques

Theory: 30 Hrs. Marks-50 (Credits: 02) Unit -1: Introduction to Problem Solving (15Hrs)

1.1 Concept of problem solving, Problem definition, Program design, Debugging, Types of errors in programming, Documentation.

1.2 Introduction to Program : Development of program (input, process, output) 1.3 Program Development Life Cycle: Analyze the problem, Task Analysis,

Developing Algorithm, Testing the algorithm for accuracy, Coding, Test and debug the program, Documentation, Implementation, Maintenance and enhancement

1.4 Purpose of Program planning

Unit -2: Techniques of Problem Solving (15Hrs) 2.1 Algorithm

2.1.1 Definition 2.1.2 Characteristics: Input, Output, Finiteness, Effectiveness, Definiteness,

Feasibility, Independent 2.1.3 Generation of Algorithm: Checking Validation, Requirement analysis, Design,

System Feasibility, Algorithm selection, Data structure selection, Algorithm Design, Testing Algorithm, Analysis of Algorithm, Generating Code, Testing.

2.1.4 Algorithm representation: Program, Flowchart, Pseudo code 2.1.5 Examples of algorithm: simple, decision making, looping and sub procedure

non-recursive and recursive 2.2 Flowchart

2.2.1 Definition 2.2.2 Symbols: Terminal, Input/output, Flow lines, process, decision, document,

predefined process, manual input, manual operation, connector, off-page connector, magnetic disk, communication link, annotation, online storage, offline storage

2.2.3 Rules for drawing flowchart 2.2.4 Benefits 2.2.5 Flowchart an effective problem solving tool: Effective analysis, makes logic

clear, useful in coding, appropriate documentation, communication, proper testing and debugging

2.2.6 Limitation: Complex, Difficult to modify, Costly, No update, Time consuming 2.2.7 Examples of flowchart: simple, decision making, looping and sub procedure

non-recursive and recursive Reference Books –

1) Computer Fundamentals - 6th Edition By Pradeep K. Sinha, PritiSinha - BPB Publications

2) Dr. Anita Goel, Computer Fundamentals, Pearson Education, 2010. 3) How to Solve it by Computer By R. G. Dromey – Prentice – Hall International

Page 8 of 36


B.C.A. – I Semester – I DSC-A2: Programming in C

Theory: 30 Hrs. Marks-50 (Credits: 02)

Unit – 1: Introduction to C using Linux (15 Hrs)

1.1 Introduction to C 1.1.1 History : ALGOL(1960),BCPL(1967), B(1970), Traditional C(1972) ,

K&R C(1978), ANSI C also known asC89 (1989), ANSI/ISO C(1990), C99(1999), C11(2011).

1.1.2 Structure of C Program 1.1.3 Character set 1.1.4 Components of Compilation: Preprocessing(cpp), Compilation(gcc),

Assemble(as), Linking(ld) 1.1.5 GCC command: syntax, options, examples. 1.1.6 GDB command : Syntax, options, Start gdb, Stop gdb, execute

program through gdb (run, kill, set args, set env, show env, show args, unset env, continue, step, next, until, finish, return ), breakpoint and watch point (break, b, tbreak, rbreak, watch ,catch, info, clear, delete, disable, enable, ignore, end), display (print, call, display, undisplay, info display), Scripts( source, define … end, document … end) Expression( expr, $, $n, $$, $$n, $_, $__, $value, show)

1.2 Data types and Qualifiers 1.2.1 Data Types

• Fundamental: Integral (char, int), Floating (float,double) • Abstract : pointer, array, function (Introduction) • User Defined Data Type : struct, union, enum (Introduction)

1.2.2 Qualifiers • Sign qualifier (signed, unsigned) • Size qualifier (short, long, long long) • const • volatile (introduction) • restrict(included from C99) • inline (included from C99)

1.2.3 Fundamental data types with their size and range (gcc-32 bit) 1.3 C Tokens

1.3.1 Identifiers: Definition and Rules 1.3.2 Keywords 1.3.3 Constants

• Integer: Octal(0 prefix), Hex(0x prefix), Decimal, long(l suffix), unsigned(u suffix), long long (ll suffix), unsigned long(ul), unsigned long long(ull)

Page 9 of 36

• Floating: float(suffix f), double, long double (suffix l), exponential

• Character : escape sequences(special character, octal and hex equivalent, wild character like \\,\’,\”), Character classes(Digits, Hex Digits, Lower, Upper, Leters, Alphanumeric, Punctuation, Space) and functions from ctype.h (toupper(), tolower(), isalpha(), isdigit(), isxdigit(), isalnum(), isspace(), ispunct(), islower(), isupper())

• Enumerator constants 1.3.4 String : definition, string constant, null character and string (‘\0’)

1.4 Constant Expression (Operators)

1.4.1 Arithmetic (Binary: +,-,*,/; Unary: +,-) 1.4.2 Assignment (=, +=, -=, *=, /=, %=) 1.4.3 Increment and Decrement (++,-- ,pre and post) 1.4.4 Relational (> ,>= ,< ,<= ,== , !=) 1.4.5 Logical (!,&&, ||) 1.4.6 Bitwise (&, |, ^, <<, >>, ~) 1.4.7 Conditional/Ternary (?:) 1.4.8 sizeof 1.4.9 Pointer referencing operator (&)

1.4.10 typedef 1.5 Operator Precedence 1.6 Variable: Definition, Declaration, Initialization. 1.7 Formatted Standard Output Functions: printf() (format specifier: type

conversion characters d,i,o,u,x,X,f,e,g,E,G,c,s,a,A; width specifier; precision specifier; size modifier: h,l,L,hh,ll; flag specifier: +, -, #)

1.8 Formatted Standard Input Functions: scanf() (format specifier: type conversion characters d,D,i,I,o,O,u,U,x,X,f,e,g,E,G,c,s, search set [ ],[^ ]; width specifier; precision specifier; size modifier: h,l,L) and examples

1.9 Unformatted Standard I/O functions: getchar(), gets(), putchar(), puts()

Unit – 2: Control Structure and Array (15 Hrs)

2.1 Conditional Branching Statements: if, if…else, if…else if ladder, nested if 2.2 Looping/ Iterative Statements: while, for, do…while 2.3 Unconditional Control Statements: break, continue, Label (simple labels, case

labels, default label), switch, goto. 2.4 Array

2.4.1 Array: Introduction, Need, Definition, Declaration, size 2.4.2 Types of Array: One Dimensional, Multi Dimensional (Two

Dimensional only) 2.4.3 Array Operations: Declaration and initialization of 1D and 2D array,

Accessing Array elements (Array Subscript Operator []), size of array. 2.4.4 Advantages and Disadvantages of array. 2.4.5 String: definition, operations on string (strcmp(), strcat(), strrev(),

strlen(), strcpy(), strlwr(), strupr() from string.h)

Page 10 of 36

Reference Books: 1) The Complete Reference C 4th edition by Herbert Schildt 2) Let Us C by YashavantKanetkar – BPB Publications 3) “C Programming in an Open Source Paradigm: A Hands on approach”, K.S.Oza,

S.R.Patil, R.K.Kamat River Publisher Series in Information Science and Technology, Netherland 978-87-93237-67-4 , 2015

4) Programming in ANSI C by E. Balagurusamy 5) Beginning C by Ivor Horton 6) The GNU C Reference Manual by TrevisRothwell, James Youngman 7) C for programmer with Introduction to C11 by Paul Deitel, Harvey Deitel 8) Modern C by Jens Gustedt 9) C Primer Plus By Stephen Prata 10) C programming A modern approach by K. N. King 11) C book by GBdirect publications http://publications.gbdirect.co.uk/c_book/

Page 11 of 36


B.C.A. – I Semester – I DSC-A3: Fundamentals of Computer

Theory: 30 Hrs. Marks-50 (Credits: 02) Unit – 1: Introduction to Computer (15 Hrs)

1.1 Introduction 1.2 Characteristics of computer 1.3 History and evolution 1.4 Basic Organization of a Computer System 1.5 Classification of Computers

1.5.1 Operating principles (based on their construction and working) – Digital, Analog& Hybrid

1.5.2 Area of applications - Special Purpose Computers&General Purpose Computers 1.5.3 Size and capability - micro, mini, mainframe and supercomputers 1.5.4 Number of Microprocessors – Sequential & Parallel 1.5.5 Word length 1.5.6 Number of users – Single User, Multi User, Network

1.6 Applications of Computers in Various Fields 1.7 Concept of Hardware & Software

Unit – 2: Introduction to Computer Languages and Operating System (15 Hrs)

2.1 Computer Languages 2.1.1 Types: Low Level (Machine, Assembly), High level Language, their features,

advantages and disadvantages. 2.1.2 Generation of Programming language: First (Machine), Second (Assembly),

Third (High level-Procedure and object oriented like C, C++, java), Fourth generation(database programming and scripting perl, php)

2.1.3 Features of Language 2.1.4 Language Translator: Types (Assembler, Compiler, Interpreter) and their

functions. 2.1.5 Linker: Need, Features 2.1.6 Loader: Functions(Allocation, Linking, Relocation, Loading), Types (Absolute,

Relocating) 2.2 Introduction to Operating System

2.2.1 Meaning and Definition 2.2.2 Logical Architecture of a Computer System 2.2.3 Functions of Operating System 2.2.4 Booting of OS & it’s types 2.2.5 Types of Operating System

Page 12 of 36

2.2.6 Introduction to Linux, History and development of Linux 2.2.7 Features and Advantages of Linux 2.2.8 Concept of shell and its types, kernel, Kernel-shell relationship 2.2.9 Concept of file, types, file system tree, Different GPU (cal, date, echo, printf, bc,

script, passwd, who, man), whereis, which commands

Reference Books –


2) Fundamentals of Computers - By V. Rajaraman, Prentice Hall India Pvt., Limited 3) Computer Fundamentals: Architecture and Organization – By B. Ram, New Age

International Publishers 4) UNIX CONCEPTS AND APPLICATIONS by Sumitabha Das – McGraw – Hill

Publishing 5) A Practical Guide to Linux Commands, Editors, and Shell Programmingby Mark G.

Sobell

Page 13 of 36


B.C.A. – I Semester – I DSC-A4: Database Concepts


Unit-1 Basics of RDBMS Database Management System: Overview(Basics, Internal Process, Tables Rows and Columns), functions of DBMS, advantages, disadvantages of DBMS, DBMS Record Based Models(Hierarchical Model, Network Model, Relational Model), Database System Architecture(External, Conceptual, Internal) Relational Database Management System RDMS Architecture: Two tier architecture, data independence, three tier architecture Functions of RDBMS, RDBMS terminology, advantages, disadvantages of RDBMS, Integrity Constraints(Domain, Entity, Referential), Key: Superkey, Composite Key, Candidate Key, Primary Key, Alternate Key or Secondary Key, Foreign Key), Normalization: 1Nf, 2NF, 3NF,De-normalization

(15 Hrs)

Unit-2 Introduction to MYSQL- Introduction: History, Features, Drawbacks, Basic data types(Numeric, String, text, Date And Time) Database:(Create, Use, Drop) Table: DDL(Create, Alter: Add, modify, drop, rename column, rename table using first/after; Drop, Rename, Truncate), DML(insert, update, delete, select) Show: Databases, Tables, Errors, Character Set, Columns From, Create Database, Create table

(15 Hrs)

Reference Books -

1) Database System Concept – Silberschatz, Korth 2) Fundamentals of Database System- RamezElmasri,Shamkant B.

Navathe(Pearson) 3) Database Management System- Raghu Ramkrishnan,Gehrke (McGraw Hill) 4) Learning MySQL- Hugh Williams, Saied Tahaghoghi 5) MySQL in a Nutshell, 2nd Edition-A Desktop Quick Reference- Russell Dyer

Page 14 of 36


B.C.A. – I Semester – I DSC-A5: Computer Security

Theory: 30 Hrs. Marks-50 (Credits: 02) Unit – 1: Introduction to Computer Security (15 Hrs)

1.1 Definition of Computer Security 1.2 Security Goals (Integrity, Confidentiality, Availability) 1.3 Vulnerabilities(Hardware, Software, Data), Threats(interception, interruption,

modification, fabrication), Controls: encryption 1.4 Computer Contaminants (Virus, worms, Trojans, Spyware, Malwares, Adware) 1.5 Overview of antivirus-Basic Functions of Antivirus Engines 1.6 Different Ways to secure computer 1.7 Security Policies

Unit – 2: Cryptography (15 Hrs)

2.1 Basic Concepts: Encryption, Decryption, Cipher Text 2.2 Concept of Cryptography and Cryptanalysis 2.3 Symmetric and Asymmetric Cryptography 2.4 Digital signatures 2.5 Cryptographic hash functions 2.6 Applications of Cryptography

Reference Books:

1) “Cyber Security Essentials”, James Graham, Richard Howard, Ryan Olson, CRC Press, Taylor’s and Francis Group, An AUERBACH Book

2) “An Introduction to Computer Security: The NIST Handbook”, National Institute of Standards and Technology

3) “Security in Computing”, By Charles P. Pfleeger - Pfleeger Consulting Group, Shari Lawrence Pfleeger - RAND Corporation, Publisher: Prentice Hall

4) “Introduction to Cyber Security”, By JeetendraPande

Page 15 of 36


B.C.A. – I Semester – I DSC-A6: Basics of Digital Systems

Theory: 30 Hrs. Marks-50 (Credits: 02) Unit – 1: Number System & Computer Codes (15 Hrs)

1.1 Number Systems 1.2.1 Introduction and definition 1.2.2 Classification (Positional & Non – Positional) 1.2.3 Positional Number System – Binary Number System, Decimal Number System,

Octal Number System, Hexadecimal Number System 1.2.4 Conversion from one base to another base 1.2.5 Binary Arithmetic 1.2.6 1’s & 2’s complement of binary numbers

1.2 Computer Codes 1.3.1 Introduction and definition 1.3.2 BCD : (4-bit BCD, 6-bit BCD) 1.3.3 EBCDIC 1.3.4 ASCII : (ASCII – 7, ASCII-8) 1.3.5 Gray Code 1.3.6 Unicode

1.3 Concept of parity bit,Signed and unsigned numbers representation

Unit – 2: Logic Gates (15 Hrs)

2.1 Definition 2.2 AND, OR, NOT, NOR, NAND, EX-OR (Symbol, Expression and Truth Table) 2.3 Boolean algebra and identities 2.4 De Morgan’s theorem and Inter conversion of logic Gates (NAND and NOR) 2.5 Introduction to K - map

Reference Books –

1) Digital principals and applications; Malvino Leach, Tata McGraw Hill,4th Edition 2) Fundamentals of Digital Electronics: A. Anand Kumar PHI Publication 2001 3) Digital principals: T.L. Floyd 3rd edition 4) Digital Electronics: C.F. Strangio 5) Modern digital Electronics: R.P. Jain, Tata McGraw Hill Publication 6) Digital logic and computer design – Morris Mano 7) First course in Digital System Design: John P. Uyemura, Brooke/ColeThompson

Learning (2001)

Page 16 of 36


B.C.A. – I Semester – I DSC-A7: Descriptive Statistics

Theory: 30 Hrs. Marks-50 (Credits: 02) Unit – 1: Introduction to Statistics & Measures of Central Tendency (Averages) (15 Hrs.)

1.1 Introduction to Statistics 1.1.1 Meaning and scope of statistics. 1.1.2 Primary and secondary data, Qualitative and Quantitative data 1.1.3 Discrete and continuous variables, Frequency and Frequency distribution 1.1.4 Sampling Techniques: Need and meaning, Definitions of population, sample.

Sampling and census, Advantages of sampling method over census method.

1.2 Measures of Central Tendency (Averages) 1.2.1 Concept of central tendency, Requirements of good statistical average. 1.2.2 Arithmetic Mean: Definition, Properties of A.M. (without proof), combined

mean. 1.2.3 Positional averages: Median, Quartiles and Mode. Merits and Demerits of mean,

median and mode. 1.2.4 Empirical relation between mean, median and mode. 1.2.5 Numerical Examples.

Unit –2: Measures of Dispersion (Variations) (15 Hrs.)

2.1 Concept of dispersion, Requirements of good measures of dispersion. 2.2 Absolute measures of dispersion : Range , Quartile Deviation (Q.D), Standard

Deviation (S.D.), Variance, Combined S.D for two groups 2.3 Relative measures of dispersion: Coefficient of Range, Coefficient of Q.D.,

Coefficient of S.D., Coefficient of Variation (C.V.) and its use, Coefficient of combined S.D., Combined C.V.

2.4 Merits and Demerits of S.D. 2.5 Numerical Examples.

Reference Book

1) Mathematical Statistics by H.C. Saxena and J. N. Kapur 2) Fundamentals of Statistics by S. C. Gupta 3) Bhat B. R., Srivenkatramana T. and MadhavaRao K. S. (1996): Statistics: A

Beginner’s Text, Vol. 1, New Age International (P) Ltd. 4) Gupta V.K. &Kapoor S.C. Fundamentals of Mathematical Statistics.- Sultan &

Chand. 5) Croxton F. E., Cowden D.J. and Kelin S. (1973): Applied General Statistics, Prentice

Hall of India 6) Goon A.M., Gupta M.K., and Dasgupta B.: Fundamentals of Statistics Vol. I and II,

World Press, Calcutta.

Page 17 of 36


B.C.A. – I Semester – I DSC-A8: Mathematical Foundation


Unit – 1: Linear Programming Problems& Determinants (15 Hrs)

1.1 L.P.P. 1.1.1 Introduction 1.1.2 Formation of L.P.P. 1.1.3 Graphical method of solution 1.1.4 Problems relating to two variables including the case of mixed constraints 1.1.5 Cases having no solution, multiple solutions, unbounded solution.

1.2 Determinants

1.2.1 Definition of determinant of order three–definition, expansion, 1.2.2 properties of determinants 1.2.3 Condition of consistency, area of a triangle, Cramer’s rule 1.2.4 System of equations in three variables. 1.2.5 Examples

Unit – 2: Matrices (15 Hrs)

2.1 Meaning of a matrix, Order of matrix. 2.2 Types of matrices

2.2.1 Row matrix, Column matrix, Null matrix, Unit matrix 2.2.2 Square Matrix, Diagonal matrix, Scalar matrix, 2.2.3 Symmetric matrix, Skew - symmetric matrix 2.2.4 Transpose of a matrix

2.3 Singular and Non-Singular Matrices 2.4 Algebra of Matrices

2.4.1 Equality of matrices 2.4.2 Scalar Multiplication of matrix 2.4.3 Addition of matrices, Subtraction of matrices 2.4.4 Multiplication of matrices.

2.5 Elementary Row & Column Transformations 2.6 Inverse of Matrix (Using Elementary Transformations) 2.7 Examples based on above.

Reference Books: 1) Discrete Mathematics & Structures by SatinderBal Gupta, University Science Press 2) Fundamental Approach to Discrete Mathematics by D. P. Acharjya, Sreekumar, New

Age International Publishers 3) Discrete Mathematical Structures by Kolman, Busby, Ross, Pearson Education Asia 4) Matrices by Shantinarayan, S. Chand & Co. , New Delhi 5) Discrete Mathematics by Schaum Series 6) Discrete Mathematics by K D Joshi

Page 18 of 36


B.C.A. – I Semester – I AECC-A: Communication Skills

Theory: 30 Hrs. Marks-50 (Credits: 02) Unit – 1: Nature of Communication (15Hrs)

1.1 Definition 1.2 Need and Importance of communication skills 1.3 Basic types of communication (Reading, writing, listening, speaking) 1.4 Forms of Communication: (verbal, written, oral Nonverbal, Body language, signs,

symbols etc.) 1.5 The communication Process (Thinking, Getting ideas, Determining intent, Selecting

notes, and media) 1.6 Encoding, transmitting messages, decoding, receiving, perceiving and interpreting,

giving feed-back. 1.7 Barriers of Communication and ways in overcoming barriers 1.8 Nature and importance of Intrapersonal, interpersonal group and Mass

Communication. 1.9 Written Communication

1.9.1 The process of formal written communication – Designing a message, deciding purpose, analyzing audience, organizing, selecting, arranging ideas and preparing outlines,

1.9.2 Enveloping a message – writing, evaluating, revising and editing. The qualities of good writing – the ‘You ‘attitude, clarity, conciseness, preciseness, style, flow, accuracy and readability.

Unit – 2: Business Correspondence (15Hrs)

2.1 Business Correspondence in organization 2.2 Business letters: Related to purchase, Letters related to sales, letters related to

insurancecompanies, Banks, Public authorities. 2.3 Inter Departmental Communication – Internal Memo, Office Circulars, Office orders,

office notes, communication with Regional and Branch.

Reference Books:

1) A Complete Course in Communication Skills by Dr. Ravi S. Sharma, Sheel Sons 2) Essentials of Business Communications:- Rajendra Pal & J.S. Korlahalli 3) Business Communication by Dr.Prakash M. Herekar, Mehta Publishing House 4) Business Communication:- U.S. Rai, S.M. Rai 5) Business Correspondence & Report Writing:-R.C. Sharma & Krishna Mohan 6) Hunt,Gray T. Communication skills in the organization, New Jerry, Prentice Hall. 7) Basic Business Communication : Robert MaArcher , Ruth Pearson Amos Prentice

Hall

Page 19 of 36


B.C.A. – I Semester – II DSC-B1: Data Structure Fundamentals Theory: 30 Hrs. Marks-50 (Credits: 02)

Unit – 1: Introduction to Data structure, Array, Sorting and Searching (15 Hrs.)

1.1 Concept of Abstract Data Types 1.2 Definitions –Data types, Data Object, Data structure(Data Axioms Operations) 1.3 Implementations of Data structure 1.4 Basic Operations(Traversing, Searching, Insertion, Deletion, Sorting, Merging) 1.5 Array: Array- definition, Types- one, two and multi dimensional, character string. 1.6 Sorting – Definition, Stable-Unstable Sorting, Adaptive-Non Adaptive Sorting,

Order of Sorting (Increasing, Decreasing, Non Increasing, Non Decreasing) Sorting methods - Exchange sort, Bubble sort, Insertion sort,Shell Sort, Selection sort, Quick Sort, Merge Sort, Radix sort

1.7 Searching: Definition and terminology of searching, Linear Search, Binary search, Searching application.

Unit – 2: Stack &Queue (15 Hrs.)

2.1 Stack 2.1.1 Definition of stack 2.1.2 Operations on stack (Push, Pop, Peek, Isfull,Isempty) 2.1.3 Declaration of stack 2.1.4 Implementation of stack using array 2.1.5 Applications of stack (Recursion, Well-Parenthesised Mathematical

Expression)

2.2 Queue 2.2.1 Definition of queue 2.2.2 Operations on queue (Enqueue, Dequeue, Peek, Isfull, Isempty) 2.2.3 Types of queue – Linear, Circular, Priority 2.2.4 Implementation using array of Linear and Circular queue(Using Counter) 2.2.5 Application of queue.

Reference Books:

1) Data Structures Using C by Aaron M. Tenenbaum - Pearson Education India 2) Data Structures through C by YashavantKanetkar – BPB Publications 3) Data Structures Using C by E. Balagurusamy – McGraw Hill Education 4) Data Structure using C By Thareja, Reema- Oxford University Press 5) Principles of Data Structures Using C and C++ By Vinu V Das - New Age

International Pvt Ltd Publishers 6) Data Structures Using C By ISRD Group - Tata McGraw-Hill Education

Page 20 of 36


B.C.A. – I Semester – II DSC-B2: Advanced ‘C’ Programming


Unit – 1: Pointers, Function and Storage Classes (15 Hrs) 1.1 Pointer:

1.1.1 Definition and Declaration 1.1.2 Operations on pointer 1.1.3 Pointer initialization with pointer referencing operator (&) 1.1.4 Accessing Pointer using pointer dereferencing operator (*) 1.1.5 Pointer Arithmetic 1.1.6 Pointer and Array 1.1.7 Pointer to pointer 1.1.8 DMA function: malloc(), calloc(), realloc(), free() 1.1.9 Restrict pointer (restrict qualifier)

1.2 Functions

1.2.1 Function: Definition, Library and User Defined Functions, function definition and return statement, function call(),Formal and actual arguments and function declaration, types of functions, recursive function, function calling mechanism.

1.2.2 Function and Array: command line arguments (argc, argv) 1.2.3 Function and Pointer : call by value, call by reference, variable number

of arguments( ellipsis …) 1.2.4 Local and Global Variables. 1.2.5 Restrict and inline functions.(restrict and inline qualifier)

1.3 Storage classes: automatic, register, static, external

Unit – 2: Structure, Union and File Handling (15 Hrs)

2.1 Structure 2.1.1 Defining and declaring structure: size of structure 2.1.2 Accessing members using Member direct selector operator (.) 2.1.3 Structure and Array: array as member and array of structure 2.1.4 Pointer to structure and accessing member using Member Indirect

Selector operator ( ). 2.1.5 Nested Structure : Structure variable as member and Structure within

Structure 2.1.6 Self referencing structure.

2.2 Union

2.2.1 Definition, declaration, initialization and size of union 2.2.2 Accessing members of union. 2.2.3 Similarities and Differences between structure and union 2.2.4 Little Endian Representation of Union Variable with example

Page 21 of 36

2.3 File Handling 2.3.1 File: Definition, Text and Binary 2.3.2 Operation on file: open, close, read, write, rewind. 2.3.3 FILE structure, function fopen() and file opening mode (r,w,a,r+,a+,w+

text and binary), closing file using fclose() and fcloseall(). 2.3.4 Read Write Operation using : fgetc(), fputc(), getw(), putw(), fprintf(),

fscanf(), fread(), fwrite() 2.3.5 Reposition file R/W pointer: ftell(), fseek(), rewind().

Reference Books:

1) The Complete Reference C 4th edition by Herbert Schildt 2) Let Us C by YashavantKanetkar – BPB Publications 3) “C Programming in an Open Source Paradigm: A Hands on approach”, K.S.Oza,

S.R.Patil, R.K.Kamat River Publisher Series in Information Science and Technology, Netherland 978-87-93237-67-4 , 2015

4) Programming in ANSI C by E. Balagurusamy 5) Beginning C by Ivor Horton 6) The GNU C Reference Manual by TrevisRothwell, James Youngman 7) C for programmer with Introduction to C11 by Paul Deitel, Harvey Deitel 8) Modern C by Jens Gustedt 9) C Primer Plus By Stephen Prata 10) C programming A modern approach by K. N. King 11) C book by GBdirect publications http://publications.gbdirect.co.uk/c_book/

Page 22 of 36


B.C.A. – I Semester – II DSC-B3: Computer Peripherals

Theory: 30 Hrs. Marks-50 (Credits: 02) Unit – 1: Input and Output Devices (15 Hrs)

1.1 Introduction to Peripheral Devices 1.2 Input Devices

1.2.1 Keying : Keyboard& its types 1.2.2 Pointing : Mouse& its types, Touch Screen, Glide pad, Light pen, Digitizers and

Graphic Tablets, Joystick, Trackball 1.2.3 Scanning : Scanner, MICR, OBCR, OCR, OMR 1.2.4 Video Input : Digital camera, Digital camcorder, Portable media player, Webcam 1.2.5 Audio Input : Microphones

1.3 Output Devices 1.3.1 Display Devices (Monitors) : Monochrome Display, Colored Display (CRT,

Plasma, LCD, LED), Screen Image Projector 1.3.2 Printers : Impact Printers (Dot-Matrix printer, Daisy-wheel printers, Line printers,

Drum printer, Chain printer, Band Printer) Non-Impact Printers (Ink-jet printer, Laser printer)

1.3.3 Plotters : Flatbed plotter, Drum plotter

Unit – 2: Memory (Storage) Devices (15 Hrs)

2.1 Definition and Classification 2.2 Primary Memory

2.2.1 Introduction and definition 2.2.2 Storage Capacity : Bit, Nibble, Byte, KB, MB, GB, TB 2.2.3 Types of primary memory : RAM (Types of RAM - SRAM, DRAM -

Asynchronous DRAM (ADRAM), Synchronous DRAM (SDRAM), EDRAM, EDO RAM, Rambus DRAM (RDRAM), Cache DRAM (CDRAM), Double-Data-Rate SDRAM (DDR SDRAM)) ROM (Types of ROM – PROM, EPROM, EEPROM)

2.2.4 Buffer, Cache Memory 2.3 Secondary Memory & Storage Devices

2.3.1 Introduction and definition 2.3.2 Sequential Access & Random Access 2.3.3 Magnetic Storage Devices (Magnetic Tape, Magnetic Disk, Hard Disk or HDD,

SDD)

Page 23 of 36

2.3.4 Optical Storage Devices (Compact Disc - CD-ROM disc, CD-R / WORM Disc, CD-RW disc, DVD, Blu-ray disc

2.3.5 Flash Memory Devices – USB Pen Drives / Flash Drives, Memory Cards

Reference Books –


2) Computer Peripherals and Interfacing – By JyotiSnehi – Laxmi Publications, New Delhi

3) Fundamentals of Computers - By V. Rajaraman, Prentice Hall India Pvt., Limited 4) Computer Fundamentals: Architecture and Organization – By B. Ram, New Age

International Publishers 5) Foundations of Information Technology – D. S. Yadav

Page 24 of 36


B.C.A. – I Semester – II DSC-B4: Advanced Database


Unit-1 MySQL Operators, Function and Clauses Operators : Arithmetic(DIV, /, -, +, *, %, MOD), Comparison operator (=, <>, >, <, >=, <=), Set operators : Union, Union all, Intersect, Minus Other Operator: like, in, not, between, exists, all, any, is null, is not null, distinct Functions: Date time Functions-curdate, curtime, date, dayname, last_day, monthname, now, sysdate, time, Mathematical Functions-abs, sign, floor, ceil, round, truncate , greatest, least, pow, sqrt, String Functions- length, concat, lcase/lower, ucase/upper, reverse, left, right, mid substr, strcmp, space, Aggregate Functions- count, sum, avg, max, min, first, last, Other functions- bin, conv, current_user, database, if, ifnull, isnull, nullif, nvl(), coalesce, user, case Table Aliases Clauses: Where clause, order by, group by, having, limit, into Nested Query, Join (Inner, Left Outer, Right Outer, Full outer, Self ), User Variables, Auto Increment Field Constraints : Not Null, Unique, Primary Key, Foreign Key, Check, Default View: description, Syntax(create or replace, drop), Example, Commit, Rollback

(15 Hrs)

Unit-2 Advanced MySQL BlockStructure and Stored Procedure: create, replace, drop, exec, call, parameters (in, out, inout), Comment(Single Line and Multi Line), variable declaration and set, delimiter, execute, prepare, deallocate, Control flow statements using conditional operators if, if-else, if-elseif…, ifnull, nullif, case(when, else), Iterative Statements: while do, repeat…untill, loop… end loop and leave Triggers: Use and Benefits, MySQL trigger syntax(Definer, time, event, tablename, for each row, body ), Drop Trigger , MySQL extensions: NEW, OLD

(15 Hrs)

Reference Books -

1) Database System Concept – Silberschatz, Korth 2) Fundamentals of Database System- RamezElmasri,Shamkant

B. Navathe(Pearson) 3) Database Management System- Raghu Ramkrishnan,Gehrke

(McGraw Hill) 4) Learning MySQL- Hugh Williams, Saied Tahaghoghi 5) MySQL in a Nutshell, 2nd Edition-A Desktop Quick

Reference- Russell Dyer

Page 25 of 36


B.C.A. – I Semester – II DSC-B5: Basics of Cyber Security


Unit – 1: Introduction to Cyber Security (15 Hrs)

1.1 Overview of Cyber Security 1.2 Concept of Cyberspace 1.3 Need Of Cyber Security 1.4 Types of Cyber Crimes (Phishing, Smishing, Vishing, Malvertizing, Password

Attack , Web Defacement, DoS, DDoS, MITM, Cyber terrorism, Cyber Espionage, Cyber Bullying, Cyber Stalking, Cyber Squatting, Child Pornography, Software Piracy and Crime related to IPRs, Computer Vandalism, Computer Hacking, Spamming, Cross Site Scripting, Online Auction Fraud, Salami Attack, Data Diddling

Unit – 2: Security Concepts and Protocols (15 Hrs)

2.1 Information Assurance Fundamentals (Authentication, Authorization, and non-repudiation),

2.2 Overview of VPN: Types, Importance, Security and Protocols 2.3 Risks & Limitations Of VPN, 2.4 VPN Security Considerations 2.5 Basic Cyber Security Measures

Reference Books:

1. “Cyber Security Essentials”, By James Graham, Richard Howard, Ryan Olson, CRC Press, Taylor’s and Francis Group, An AUERBACH Book

2. “Introduction to Cyber Security”, By JeetendraPande 3. “Virtual Private Networks” 2nd Edition, By Charlie Scott, Publisher:O'Reilly Media

Page 26 of 36


B.C.A. – I Semester – II DSC-B6: Advanced Digital Systems Theory: 30 Hrs. Marks-50 (Credits: 02)

Unit – 1: Combinational Circuits (15 Hrs)

1.1 Half adder, Half & Full adder, Half Subtractor, Parallel adder, Universal Adder & Subtractor

1.2 Encoder (decimal-BCD), 3 bit priority encoder, Decoder (BCD-Decimal) 1.3 Multiplexer and De-multiplexer (up to 4:1 & 1:4)

Unit – 2: Sequential Circuits (15 Hrs)

2.1 Concept of sequential circuits 2.2 Flip-flops : RS, Clocked RS, Latch, D (edge triggered), JK, Master-Slave JK in detail, 2.3 Counter-synchronous, asynchronous, up-down counter (up to 4-bit), Modulus-N counter,

applications of counter ,Construction of mod-10 counter, 2.4 Shift Register: SISO, SIPO, PISO, PIPO, Ring counter, Johnson counter ( 4-bits),

Reference Books –

1) Digital principals and applications; Malvino Leach, Tata McGraw Hill,4th Edition 2) Fundamentals of Digital Electronics: A. Anand Kumar PHI Publication 2001 3) Digital principals: T.L. Floyd 3rd edition 4) Digital Electronics: C.F. Strangio 5) Modern digital Electronics: R.P. Jain, Tata McGraw Hill Publication 6) Digital logic and computer design – Morris Mano 7) First course in Digital System Design: John P. Uyemura, Brooke/ColeThompson

Learning (2001)

Page 27 of 36


B.C.A. – I Semester – II DSC-B7: Statistical Methods


Unit – 1: Analysis of Bivariate Data &Introduction to Probability(15 Hrs)

1.1 Correlation : 1.1.1 Concept and types of correlation, Methods of studying correlation: Scatter

Diagram , Karl Pearson’s correlation coefficient (r) 1.1.2 Computation of r for ungrouped data 1.1.3 Interpretation of r = -1, r = 0, r = +1

1.2 Regression : 1.2.1 Concept of regression , Lines of regression , Regression coefficients 1.2.2 Relation between Correlation coefficient and Regression coefficients. 1.2.3 Numerical Examples

1.3 Introduction to Probability 1.3.1 Probability 1.3.2 Definition of Trial, Sample Space, Events, Classical definition of

probability. 1.3.3 Addition and Multiplication laws of probability (Without proof). 1.3.4 Examples without use of permutation and combination.

Unit – 2: Index Numbers (15 Hrs)

2.1 Need, Meaning and uses of index numbers. 2.2 Problems involved in construction of index numbers. 2.3 Price, Quantity and Value based index numbers. 2.4 Unweighted (Simple ) index numbers by (i) Simples Aggregate Method

(ii) Simple Average of Relatives Method (A.M., Median ) 2.5 Weighted index numbers by (i) Laspeyre’s, Paasche’s and Fisher’s 2.6 Numerical Examples.

Reference Book

1) Mathematical Statistics by H.C. Saxena and J. N. Kapur 2) Fundamentals of Statistics by S. C. Gupta 3) Bhat B. R., Srivenkatramana T. and MadhavaRao K. S. (1996): Statistics: A

Beginner’s Text, Vol. 1, New Age International (P) Ltd. 4) Gupta V.K. &Kapoor S.C. Fundamentals of Mathematical Statistics.- Sultan &

Chand. 5) Croxton F. E., Cowden D.J. and Kelin S. (1973): Applied General Statistics, Prentice

Hall of India 6) Goon A.M., Gupta M.K., and Dasgupta B.: Fundamentals of Statistics Vol. I and II,

World Press, Calcutta.

Page 28 of 36


B.C.A. – I Semester – II DSC-B8: Discrete Mathematics


Unit-1: SET THEORY & LOGIC (15 Hrs) 1.1 Set Theory

1.1.1 Meaning of a set. 1.1.2 Methods of describing of a set. : Tabular form, Set builder form 1.1.3 Types of a set: Finite set, Infinite set, Empty set, Subset, Universal set. Equal sets, Disjoint sets, Complementary set. 1.1.4 Operation on Sets: Union of sets, Intersection of sets, Difference of sets. 1.1.5 De Morgan’s Laws (without proof). 1.1.6 Venn diagram. 1.1.7 Cartesian product of two sets. 1.1.8 Idempotent laws, Identity laws, Commutative Laws, Associative laws, Distributive laws, Inverse laws, Domination Laws, Absorption laws, Involution laws. 1.1.9 Duality. 1.1.10 Examples based on above.

1.2 Logic 1.2.1 Introduction. 1.2.2 Meaning of Statement (Proposition). 1.2.3 Simple and compound statements. 1.2.4 Truth values of a statement. 1.2.5 Law of excluded middle. 1.2.6 Logical Operations: Negation, Conjunction, Disjunction, Implication, Double Implication. 1.2.7 Equivalence of Logical statements. 1.2.8 Truth Tables and construction of truth tables. 1.2.9 Converse, Inverse and Contra positive. 1.2.10 Statement forms: Tautology, Contradiction, Contingency. 1.2.11 Duality, Laws of logic: Idempotent laws, Commutative laws, Associative laws, Identity laws, Involution laws, Distributive laws, Complement laws, De Morgan’s laws. 1.2.12. Examples based on above.

Unit – 2 Graph Theory (15 Hrs) 2.1 Introduction to Graph 2.2 Kinds of Graph: Simple, Multi and Pseudo Graph 2.3 Digraph 2.4 Weighted Graph

Page 29 of 36

2.5 Degree of Vertex, Isolated Vertex 2.6 walk, trail, tour, Path, Circuit 2.7 Types of Graph: Complete, Regular, Bi-Partite, Complete Bi-partite, Isomorphism of Graph 2.8 Matrix Representation of Graph: Adjacency and Incidence Matrix 2.9 Operation on Graph: Union, Intersection, Complement, Product of Graphs 2.10 Examples based on above.

Reference Books: 1) Discrete Mathematics & Structures by SatinderBal Gupta, University Science Press 2) Fundamental Approach to Discrete Mathematics by D. P. Acharjya, Sreekumar, New

Age International Publishers 3) Discrete Mathematical Structures by Kolman, Busby, Ross, Pearson Education Asia 4) Matrices by Shantinarayan, S. Chand & Co. , New Delhi 5) Discrete Mathematics by Schaum Series 6) Discrete Mathematics by K D Joshi

Page 30 of 36


B.C.A. – I Semester – II AECC-B: Soft Skills


Unit – 1: Report Writing (15 Hrs) 1.1 Principles of writing reports 1.2 Types of reports 1.3 Structures of report 1.4 Preparation of information highlights 1.5 Use of graphs 1.6 Presentation of reports. 1.7 Meetings – Circulars, notice, agenda, minutes, drafting resolutions. 1.8 Oral Communication - The characteristics of face-to face exchange, Oral statements,

Preparation, Delivery public speaking, Prepared and extempore speeches. 1.9 Business interactions – Various situations in business world. Talking to groups

atwork, exercises in-group communication. 1.10 Interviews – Conducting interviews, giving interviews. 1.11 Electronic communication – Telephone, EPABX system, Tele-Conferencing,

answeringmachines, E-mail, voice-mail, Fax, Internet, Audio – Visual aids etc.

Unit – 2: Seminar, Conferences and group discussions (15 Hrs) 2.1 Seminars – Preparation for seminar, conducting seminars, organizing conferences. 2.2 Group Discussions: Group size, parameters of evaluation, opening of topic,

discussion, summary, observer’s comments. 2.3 Concepts of symposium, work-shops, orientation, refresher programs etc.

Reference Books:

1) A Complete Course in Communication Skills by Dr. Ravi S. Sharma, Sheel Sons 2) Essentials of Business Communications:- Rajendra Pal & J.S. Korlahalli 3) Business Communication by Dr.Prakash M. Herekar, Mehta Publishing House 4) Business Communication:- U.S. Rai, S.M. Rai 5) Business Correspondence & Report Writing:-R.C. Sharma & Krishna Mohan 6) Hunt,Gray T. Communication skills in the organization, New Jerry, Prentice Hall. 7) Basic Business Communication : Robert MaArcher , Ruth Pearson Amos Prentice

Hall

Page 31 of 36


B.C.A. – I Semester – I & II Lab Course – 1: Based On DSC-A2, DSC-B1 and DSC-B2

Practical: 4 lectures of 48 minutes(3.2 hrs) per weekper batchMarks-100

Semester – I – Practical Experiments Based on DSC-A2

Use “Problem Solving Techniques” For Following problems and implement code through C programming language. It include: Problem Analysis, Algorithm, Flowchart, Output Tracing using Algorithm, Source Code with Output.

First introduce Linux Operating System, GPU commands, C compilation process and components (cpp, gcc, as only)with simple program and Debugging using (GDB). Sr. No Content

1 Linear Problem: i) Arithmetic Operations on 2 numbers(real) ii) Percentage of Student in 5 Subjects iii) Convert Degree Celsius To Degree Fahrenheit using 32 iv) Calculate Simple Interest.

2 Decision Making: i) Check Integer is even or odd ii) Maximum Between 3 numbers iii) Leap Year or Not iv) Grade of a student from Percentage

3 Iterative - I: i) Factorial of natural number ii) Number of digits, sum of digits, reverse number and palindrome or not iii) Prime number (using break) iv) Permutation of 1,2,3(using continue) v) Patterns: Triangles, Pyramids

4 Iterative - II: i) Sequences: Natural Numbers, Odd Natural Numbers, Even Natural Numbers, Square Natural Numbers, Fibonacci Sequence ii) Series: Sum of First n natural numbers, sum of first n odd natural numbers, sum of first n even natural numbers, sum of first n reciprocals of factorial numbers

5 Switch: Menu driven programs i) Arithmetic Operations using users choice ii) Conversion from Degree Celsius to Degree Fahrenheit or Degree Fahrenheit to Degree Celsius

6 Array - I: Smallest, Largest, Sum, Average of integer array

7 Array -II : Get Matrix, Print Matrix, Addition of 2 Square Matrix, Product of 2 Square matrix

8 String: i) String is Palindrome or not ii) Covert to Lower or Upper Case

Page 32 of 36

Semester – II – Practical Experiments Based On DSC-B1 and DSC-B2

Use “Problem Solving Techniques” For Following problems and implement code through C programming language. It include: Problem Analysis, Algorithm, Flowchart, Output Tracing using Algorithm, Source Code with Output.

Sr. No Content 1 Pointer:

i) Use Dynamic array and Print sum, average, maximum, minimum ii) To simulate working of String functions strlen(), strupr(), strlwr()

2 Function: i) Prime Function ii) Armstrong Function iii) Factorial Function(Recursive) iv) Swap Functions(Call By Reference) v) Display Command Line Arguments

3 File Handling: i) Copy text file(may use command line arguments) ii) Count numbers lines and characters in a text file iii) To store employee information (eno, ename, salary)

4 Sorting -I i) Bubble Sort ii) Selection Sort

5 Sorting - II i) Insertion Sort ii) Quick Sort(recursive function)

6 Searching: i) Linear Search ii) Binary Search

7 Stack And Application:(Using Array) i) Implementation and Operations on Stack ii) Check Expression is Well-Parenthesised or not “Use [,(,{ brackets” iii) Convert Infix to Postfix and Infix to Prefix

8 Queue: i) Implementation and Operations on Queue

Page 33 of 36


B.C.A. – I Semester – I & II Lab Course – 2: Based On DSC-A4, DSC-B4

Practical: 4 lectures of 48 minutes(3.2 hrs) per weekper batchMarks-100

Semester – I and II – Practical Experiments Based on DSC-A4 and DSC-B4

1. A practical on create, use and drop database. 2. A practical on DDL commands –Create table, Alter table : Add, modify, drop, rename

column, rename table using first/after; Drop, Rename, Truncate) 3. A practical on DML commands – insert record, update record, delete record 4. A practical on creating table and use of different constraints on table. Insert at least 10

records. 5. A practical to demonstrate different date & time functions 6. A practical to demonstrate differentmathematical functions 7. A practical to demonstrate different string functions 8. A practical to demonstrate different aggregate functions 9. A practical to demonstrate different other functions 10. A practical to demonstrate differentclauses 11. A practical to demonstrate nested query 12. A practical to demonstrate differentjoin types. 13. A practical on how to create view and drop view. 14. A practical on how to create stored procedure and other operations. 15. A practical to demonstrate differentiterative statements 16. A practical to demonstrate differentcontrol flow statements 17. A practical on how to create and drop triggers.

Page 34 of 36

PRACTICAL SCHEME

Sr. No.

Practical Course Based on theory Paper Duration per week

per batch of 20 students

Marks

1 Lab Course – 1 Based On DSC-A2, DSC-B1 and DSC-B2

4 lectures of 48 minutes (3.2 hrs)

100

2 Lab Course – 2 Based On DSC-A4, DSC-B4

4 lectures of 48 minutes (3.2 hrs)

100

NATURE OF QUESTION PAPER AND SCHEME OF MARKING (Theory)

1) For DisciplineSpecific Core Course (DSC)

Que. No. Question Marks

Q.1. 10 Multiple Choice Questions (One Mark each) 10 Marks

Q.2. Attempt any TWO out of THREE (10 marks each) 20 Marks

i)

ii)

iii)

Q.3. Attempt any FOUR (5 marks each) 20 Marks

i)

ii)

iii)

iv)

v)

vi)

Total Marks 50 Marks

Page 35 of 36

2) For Ability Enhancement Compulsory Course (AECC – A &AECC –B)-

Que. No. Question Marks

Q.1. Attempt any One out of TWO (10 marks each) 10 Marks

i)

ii)

Q.2. Attempt any TWO out of THREE(10 marks each) 20 Marks

i)

ii)

iii)

Q.3. Attempt any FOUR (5 marks each) 20 Marks

i)

ii)

iii)

iv)

v)

vi)

Total Marks 50 Marks

Documents

Accredited By NAAC with ‘A’ Grade CHOICE BASED ... syllabus...DSE-E3 C#.Net 3 DSE-F3 ASP.Net 3 DSE-E4 Cloud Computing 3 DSE-F4 Mobile Computing 3 DSE-E5 Cyber Forensic 3 DSE-F5