Bachelor of Computer Applications (BCA) Degree Programme: I Semester BCA - Blown Up Syllabus
Bachelor of Computer Applications (BCA) Degree Programme: I Semester BCA - Blown Up Syllabus
UNIT II 12 Hours
Computer memory and storage: Introduction, memory Chapter 3
representation, memory hierarchy, Random access memory, Types of (excluding 3.9.3, 3.13.2)
RAM, Read-only memory, Types of ROM, RAM, ROM and CPU
interaction.
Page 1 of 13
UNIT IV 12 Hours
Computer programming languages: Introduction, Developing a
program, Program development cycle, Types of programming Chapter 10.1, 10.1.1,
languages, generation of programming languages, Features of a 10.1.2, 10.9,10.9.1, 10.10,
goodprogramming language. 10.10.1 to 10.10.5, 10.11
Chapter 11
Computer software: Introduction, software definition, relationship Chapter 13
between software and hardware, software categories, Installing and Chapter 14.1, 14.2.1,
uninstalling software, software piracy, software terminologies. 14.4.5, 14.5, 14.6, 14.7,
Chapter 15.1, 15.2.1,
Word processing software,Spreadsheet software: Excel 15.3.1, 15.4, 15.5.2,
environment,Copying cells using Fill handle, dragging cells, Formulas 15.5.7, 15.5.8
and functions, Inserting Charts, sorting. Chapter 22.1, 22.4
Page 2 of 13
Group I 48 hours
BCAC 132
Theory/Week: 4 Hrs IA: 20
Credits:2 Problem Solving Using C Exam: 80
Chapter Pag Nos
UNIT I 12 Hours
Problem Solving techniques: Introduction, Problem solving procedure,
Algorithm: Steps involved in algorithm development, Algorithms for Chapter 10 275-287
simple problems: To find largest of three numbers, factorial of a Book-2
number, check for prime number ,check for palindrome , Count number
of odd, even and zeros in a list of integers.
Flowcharts: Definition, advantages, Symbols used in flow charts.
Flowcharts for simple problems mentioned in algorithms. Psuedocode.
Introduction to C: Overview of C Program, Importance of C Program, Chapter 1 1-3,12-14
Basic structure of a C-program, Execution of C Program.
Constants, Variables and Data types: Character set, C token, Chapter 2 22-34
Keywords and identifiers, Constants, Variables, data types, Declaration 37-38
of variables, assigning values to variables, defining symbolic constants. 42-44
UNIT II 12 Hours
Operators and Expression: Arithmetic, Relational, logical, Chapter 3 51-72
assignment, increment and decrement, conditional, bitwise and special
operators, evaluation of expressions, Precedence of arithmetic operators,
type conversions in expressions, operator precedence and Associativity,
built in mathematical functions.
Managing Input and Output operations: Reading and writing a Chapter 4 81-101
character, formatted input and output
Decision Making and Branching: Decision making with if statement, Chapter 5 111-135
simple if statement, the if else statement, nesting of if … else
statements, the else if ladder, the switch statement, the ?: operator, the
go to statement.
Decision making and looping: The while statement, the do statement, Chapter 6 149-170
for statement, exit, break, jumps in loops.
UNIT III 12 Hours
Arrays: Declaration, initialization and access of one-dimensional and Chapter 7 189-205
two-dimensional arrays. Programs using one- and two-dimensional
arrays, sorting and searching arrays.
Handling of Strings: Declaring and initializing string variables, reading Chapter 8 234-254
strings from terminal, writing strings to screen,Arithmetic operations on
characters, String Handling functions,table of strings.
User-defined functions: Need for user-defined functions, Declaring, Chapter 9 265-291
defining and calling C functions, return values and their types,
Categories of functions: With/without arguments, with/without return
values. Nesting of functions.
UNIT IV 12 Hours
Recursion: Definition, example programs. Storage classes: The scope, Chapter 9 291-292
visibility and lifetime of variables. 298-307
Structures and unions: Structure definition, giving values to members,
structure initialization, comparison of structure variables, arrays of Chapter 10 320-339
structures, arrays within structures, Structure and functions, structures
within structures. Unions.
Page 3 of 13
Pointers: Understanding pointers, accessing the address of a variable,
declaring and initializing pointers, accessing a variable through its Chapter 11 353-368
pointer, pointer expression, pointer increments and scale factor, pointers 371-372
and arrays, pointer and strings, passing pointer variables as function
arguments. Chapter 12 391-398
File Management: Create in Read/Write and Append mode, copying
file. Chapter 14 447-452
The Preprocessor: Macro substitution, file inclusion.
Text Books:
1. E. Balagurusamy, Programming in ANSI C, 7th Edition, Tata McGraw Hill
2. Introduction to Information Technology ITL education solution Ltd, Second Edition
Reference Books:
1. K.R. Venugopal and Sudeep R. Prasad, Programming with C, 4th Edition, Tata McGraw-Hill
Education
2. Yashavant P. Kanetkar, Let Us C, 10thEdition, Tata McGraw Hill, 2010
Page 4 of 13
Group I 48 Hours
BCAC133
Theory/Week:4 Hrs IA: 20
Credits: 2 COMPUTER ORGANISATION Exam: 80
Chapter
UNIT I 12 Hours
Digital computers and Digital systems: Introduction to Number
system, Decimal number, Binary numbers,Octal and Hexadecimal
Chapter -1.1, 1.2, 1.3, 1.4, 1.5,
numbers, Number base conversions, Complements, Binary codes,
1.6 (Page No:1-22)
Binary arithmetic ,Addition, Subtraction in the 1’s and 2’s
complements system, Subtraction in the 9’s and 10’s complement
Chapter-2.1, 2.2, 2.3
system. Boolean Algebra: Basic definitions, Axiomatic definition of
(Page No:34-43)
Boolean algebra, Basic theorems and properties of Boolean algebra,
Venn diagram.
UNIT II 12 Hours
Digital logical gates: Boolean functions, Canonical and Standard Chapter-2.4, 2.5, 2.6, 2.7
forms, other logic operations, Digital logicgates, Universal gate. (Page No:43-
57,132,141(Universal gates))
Simplification of Boolean functions: The map method, Two and Chapter-3.1, 3.2, 3.3, 3.5, 3.6,
three variable maps,Four-variable maps, Don’t care conditions, 3.8
Product of sum Simplification, NAND implementation, (Page No:72-80, 83-93, 100-
NORimplementation. Implementation of EX-OR,EX-NOR using 102)
NAND and NOR gate.
UNIT III 12 Hours
Combinational Logic : Introduction, Design Procedure, Half adder, Chapter 4.1, 4.2, 4.3, 4.4, 4.5
Full adder, half Subtractor, Full Subtractor, Binary parallel adder, (Page No:116-128)
BCD adder.
Combinational logic with MSI and LSI: Code converter, Chapter 5.3, 5.4, 5.5, 5.6
Exclusive-OR and Equivalence functions. Magnitude comparator, (Page No:161-176)
Decoders, Encoders, Multiplexers, Demultiplexers.
UNIT IV 12 Hours
Sequential Logic: Introduction, Flip-flops, RS-FF, D-FF, T-FF, and Chapter 6.1, 6.2, 6.3, 6.4, 6.6,
JK-FF, Triggering of flip-flops, Master slave flip-flop, state table, 6.8 (Page No:202-213, 217-
and state diagram. State equations, Flip Flop excitation tables, 222, 230-232, 243-247)
Sequential circuits design.
Registers, Counters: Synchronous Counter Design using RS, JK, Chapter 7.1, 7.2, 7.3, 7.4
D& T flip flops. Ripple counters, Introduction to Registers, Shift (Page No:256-258, 263-268,
registers, Timing sequences, Bidirectional shift register. 272-274)
Text Book:
1. M.Morris Mano,Digital Logic and Computer design, PHI, 2015
References Books:
1. Thomas L. Floyd, Digital Fundamentals, 10th Edition, Pearson, 2011
2. Thomas C. Bartee, Digital Computer Fundamentals, 6th edition, TMH
Page 5 of 13
Group-II
Course-1
Elective - I : Supportive Course 24 Hours
Theory : 2 hrs/week
BCACE 136 IA : 10
Credits : 1 E1: Internet Basics & HTML Exam : 40
UNIT I 12 Hours
The Internet : Introduction, Evolution, basic internet terms, Getting
connect to internet, Internet applications, Data over the internet
Internet tools: Web browser, Web browser features, Internet Explorer
environment, Electronic mail, Email address structure, checking email,
Book 1
sending email, email attachment, How email works, advantages and
disadvantages of email,
Search Engines: Searching an internet, refining the search, Instant
messaging, Features of messengers.
UNIT II 12 Hours
Creating Web page using HTML tags: Concepts of HTML, Head &
Body Sections, Building HTML documents using various text
formatting tags: <H1>...<H6>, <B>,<U>,<I>, <FONT>,
<SUP><SUB><P>withalign,<BR><BLOCKQUOTE><BODY> with
attributes bgcolor, background, text, <HR> with size, color, Lists:
Ordered, unordered and definition lists, <IMG><A>
Book 2
Creating tables : <TABLE>,<CAPTION>, <TH><TR><TD> with
[All attributes with each
various attributes
tag]
Creating frames<FRAMESET>,<FRAME> tags with attributes-
Creating FORMS with elements <Input> types textbox, radio,
checkbox, list box, combo box, text area, submit, button, reset.
Cascading Stylesheets: Inline, embedded and external stylesheets with
examples by applying font, background and box properties
Text Books:
1. ITL Education Solution Limited, Introduction to Information Technology, Pearson Education,
2012
2. Steven Holzner, HTML Black book, Dreamtech Publisher, 2010
Page 6 of 13
Group II Elective - I: Supportive Course 24 Hours
Course : 2 BCACE 137
Theory/Week: 2 Hrs IA:10
E2: CLOUD COMPUTING
Credit:1 Exam:40
UNIT I 12 Hours
Chapter Sub Sections
Introduction to Cloud Computing:History and Evolution Chapter 1 1.1 To 1.8 [including all
of Cloud Computing, Roots of Cloud Computing, Layers subsections]
and Types of Clouds,Cloud, Desired Features of acloud,
Cloud Infrastructure Management, Infrastructure as a 2.1,2.2, 2.3 [[including all
Service Providers, Platform as a Service Providers, Chapter 2 subsections]
Challenges and Risks.
Migrating into a Cloud: Introduction, Broad Approaches 4.2.1 ,4.2.2 ,4.4 4.7
to Migrating into the Cloud, The Seven-Step Model of
Migration into a Cloud, Migration Risks and Mitigation Chapter 4
TheEnterprise Cloud Computing Paradigm: Relevant 5.1 , 5.2[all sub
Deployment Models for Enterprise Cloud Computing, sections],5.3,5.3.1, 5.4 [all
Adoption and Consumption Strategies, Transition sub sections]
challenges,The Cloud supply chain. Chapter 5
Virtualization: Introduction to Virtualization,
Virtualization technology Overview, Virtual machine
provisioning and Manageability,Virtual machine migration
services
UNIT II 12 Hours
Secure distributed data storage in cloud computing : Chapter 8 8.1,8.2,8.2.1,8.2.2,8.2.3,8.3
cloud storage: From LANs to WAN, Moving From LANs [all subsections]
to WANs, Existing Commercial Cloud Services,
Vulnerabilities in Current Cloud Services, Technologies
for data security in cloud computing, Database
Outsourcing and Query Integrity Assurance, Data Integrity
in Untrustworthy Storage, Web-Application-Based 16.1 To 16.6
Security Multimedia Data Security Storage. Chapter [All subsections]
SLA Management in Cloud : Introduction , traditional 16
methods of SLO management,types of SLA, Life cycle of 17.1,17.2,17.3,17.4 [All
SLA, SLA Management in Cloud, Automated Policy Chapter subsections]
Based Management 17 18.1, 18.2.1, 18.2.2, 18.2.3,
Performance Prediction for HPC in Cloud: Grid and Chapter 18.4
Cloud, Grid and Cloud integration,HPC in cloud. 18 [all subsections]
Cloud Best Practices:Business and technical benefits of
cloud Computing, Understanding Amazon Web Services Chapter 23.1,23.4, 23.6
Cloud, CloudBest Practices. 23
Data Security in Cloud Computing: Introduction, data
Security risk, Cloud computing and identity digital identity
and data Security.
Text Book:
Cloud Computing: Principles and Paradigms, RajkumarBuyya, James Broberg, Andrzej M. Goscinski,
John Wiley and Sons Publications
Reference Books:
1. Cloud Computing Black Book : KailashJayaswal, JaganathKallakurchi ,Donald &Dr.Deven Shah
2. Cloud Computing, A Practical Approach by Toby Velte (Author), AnthonyVenlte
Page 7 of 13
BCAP 134
Practical-I 48 Hrs
Office Automation Lab
Practical/Week: 4 Hrs I.A.: 20
Credits: 2
Exercises in MS Office Package Exam: 80
2. Paper cutting with word art, drop cap, columns, inserting textbox, symbols, equation of any
mathematical series, background color, header and footer.
3. Draw the following using various drawing tools (Maintain the format same but matter can be
changed).
Start
READ A, B, C
No Yes
Is A > B?
Yes No No Yes
Is B > C? Is A > C?
Stop
4. Prepare a document with table to insert Rollno, Name, Class, Marks in three subjects of ten
students. Calculate total marks and average. Also find the highest total marks and also the
maximum and minimum marks secured in each subject.
5. Prepare interview call letter for five candidates describing about the company and instructions
about the interview. Use Mail merge feature.
Page 8 of 13
6. Prepare a resume with the following details:
Name, Address, objective, summary of qualifications, experience, education, computer skills,
languages, activities and hobbies and references as in the given format.
2. Prepare a worksheet to store details of Electricity consumed by customers. Details are Customer
No, Customer Name, Meter No, Previous meter reading, Current meter reading of 10 customers.
Calculate total number of units consumed and total amount to be paid by each consumer using
following conditions:
If unit consumed is up to 30, charge is 100.
31 to 100 units, 4.70 per unit
101 to 200 units, 6.25 per unit
Above 200 units, 7.30 per unit.
Use Data validation to see that current reading is more than previous reading.
Arrange the records in the alphabetic order of names.
Filter the records whose bill amount is more than Rs.1500.
(Note: Worksheet creation:6 marks, Data validation: 3 marks, calculations: 6 marks, sorting: 2
marks, Filtering: 3 marks, other formatting: 2 marks)
Page 9 of 13
3. Create Employee database having EmpNo, EmpName, DOJ, Department, Ddesignation and Basic
Pay of 8 employees. Calculate DA, HRA, Gross Pay, Profession Tax, Net Pay, Provident Fund as per
the rule :
DA = 30% of basic pay
HRA = 10% of basic pay if basic pay is less than 25000, 15% of basic pay otherwise.
Gross =DA +HRA+ Basic pay
Provident fund =12% of Basic pay or Rs.2000, whichever is less.
Profession Tax= Rs.100 if Gross pay is less than 10000, Rs.200 otherwise.
NetPay = Gross - (Professional tax + Provident Fund)
Prepare individual pay slips of (at least 3) employees in another work sheet
Using Pivot table, display the number of employees in each department and represent it using
Pie chart.
(Note: Worksheet creation: 5 marks, calculations:6 marks, Individual slip: 3 marks, Pivot table: 3
marks, Chart: 3 marks, other formatting: 2 marks)
Part C
a) MS Power Point Exercises: 10 Marks
(4 slides: 6 marks, Applying various features: 4marks)
Prepare a power point presentation with at least four slides(in each exercise) and picture, chart and other
contents for the following. Apply various transition and animations. Slides should be moved automatically
and repeatedly.
Exercise No. 1:About your college.
Exercise No. 2:Any visiting place of your choice.
Exercise No. 3: A simple quiz program. Use diagrams. Use hyperlinks to move to another slide in the
presentation to display the result and correct answer. Use at least four questions.
Page 10 of 13
b) MS Access Exercises: 15 marks
(Note: Insert ten records for each exercise in such a way to get the result for all the queries. Use Access
queries)
1. Create a student table with the following details:
StudentNo (Primary key), Name, Address, Class, Marks1, Marks2, Marks3. Find the total and average
marks of all the students.
Execute the following queries:
a) List the records belonging to I BCA Class
b) Extract the records where average is greater than 50
c) Extract the records where total is in between 200 and 275
(Note: Table creation:4 marks, inserting records: 2 marks, query results:6 marks, update
queries: 3 marks)
3. Create Employee database having employee number, employee name, doj, designation andbasic pay.
Calculate DA,HRA, Gross pay, Income tax, Net pay,Provident fund as per the rule.
DA= 10% of basic pay
HRA: 10% of basic pay if basic pay is less than 25000, 25% of basic pay otherwise.
Gross =DA +HRA+ Basic pay
Provident fund =12% of Basic pay
Professional Tax is Rs.100 if Gross salary is less than 10000,Rs.200 otherwise.
NetPay = Gross - (Professional tax + Provident Fund)
Using employee table,execute the following queries:
a) Select employees who are drawing gross salary not more than 5000.
b) Select employees who joined after 1stJuly 2010.
(Note: Table creation:4 marks, inserting records: 2 marks, query results:4 marks, update
queries: 5 marks)
Scheme of Examination
S. No. Details Marks
1. Part A MS Word 18
2. Part B MS Excel 22
a) MS Power Point 10
3. Part C
b) MS Access 15
4. Class Records 10
5. Viva-Voce 5
Total Marks 80
Page 11 of 13
BCAP 135
Practical-II 48 Hrs
C Programming Lab
Practical/Week: 4 Hrs I.A.: 20
Credits: 2 Exercises in C Language Exam: 80
Part B: 22 Marks
1. Write a program to input n numbers and sort it in ascending order using bubble sort.
2. Write a program to search a number in a list with duplicate elements using linear search
technique. If present, print its position(s).
3. Write a program to find the transpose of the matrix. Also check for symmetry.
4. Write a program to find the sum of the following series upto n terms.
x3 x x
sin(x) x …
3
Use recursive function to find factorial.
(Note: Input x in degrees and convert into radians by multiplying with π/180).
5. Write a program to count the numbers of words, vowels, digits and spaces in a given sentence.
(Words may be separated by multiple spaces).
6. Write a program to add two matrices using pointers.
Part C: 25 Marks
1. Write a program to enter the information of n students like name, register number, marks in three
subjects into array of structures and display total, average and grade for each student. Display the
records in a neat tabular form.
2. Write a program to input Name of the branches, Total sales of company into an array of structures,
Display the Branch Name and Sales of branch with highest sales. Assume many branches can have
same highest sales.
3. Write a menu driven program to
a) create a text file
b) append the contents of a text file to another existing file by accepting filenames
c) display the content of entered filename
d) exit
Create two text files during the execution of the program. Display their contents. Perform
Appending. Display the contents again. Always check for the existence of the input files.
Page 12 of 13
4. Write a program to create a data file ITEM to input item information ItemNo, Name, Stock and
Rate/unit. Read the table ITEM and copy only those records where stock is more than 100 to another
file STOCK100. Display the contents of both the files separately. Also print total number of records
in each file.
Scheme of Examination
S. No. Details Marks Total
i. Problem solving and coding 8
1. Part A ii. Compiling and debugging 6 18
iii. Execution and testing 4
i. Problem solving and coding 10
2. Part B ii. Compiling and debugging 7 22
iii. Execution and testing 5
i. Problem solving and coding 11
3. Part C ii. Compiling and debugging 8 25
iii. Execution and testing 6
4. Class Records 10
5. Viva-Voce 5
Total Marks 80
Page 13 of 13