lesson plan BCA (2)
lesson plan BCA (2)
Programme: BCA
Course /paper name: Fundamentals Of Computers(CA1T1)
Semester: 1st Sem
Class: I Year BCA
Name of the faculty: PAVITHRA L Total Hours: 42 Hrs
UNIT-II 10 Hrs
04 Introduction to computers: Characteristics of
computers, Classification of Digital
Computer Systems:Microcomputers, 5 Hrs Lecture ,PPT
Minicomputers, Mainframes,
Super computers.
Anatomy of Computer: Introduction,
Functions & Components of a Computer,
05 Central Processing Unit, 5 Hrs Lecture ,PPT
Microprocessor,Storage units,Input and
output Devices. How CPU and memory
works. Program execution with illustrative
examples. Introduction to microcontrollers.
UNIT-III 10 Hrs
Operating System Fundamentals:
OperatingSystems: Introduction, Functions
of an operating System, Classification of
06 Operating Systems, System programs, 5 Hrs Lecture ,PPT
Application programs, Utilities.
UNIT-IV 6 Hrs
Introduction to Database Management
Systems:Database, DBMS, Why Database -
08 File system vs DBMS, Database 6 Hrs Lecture ,PPT
applications, Database users, Introduction to
SQL, Data types, Classification of SQL-
DDL with constraints, DML, DCL, TCL
UNIT-V 6 Hrs
Internet Basics: Introduction, Features of
Internet, Internet application, Services of
Internet, Logical and physical addresses, 6 Hrs Lecture ,PPT
09 Internet Service Providers, Domain Name
System. Web Basics: Introduction to web,
web browsers, http/https, URL, HTML5,
CSS
Internal Assessment Test -02 Total Internal Total Theory
Assignment 01 Assessment Marks - 60
Marks: 40
UNIT-II 12 Hrs
UNIT-III 8 Hrs
Programme: BCA
Course /paper name: Data Structures using C
Semester:2nd Sem
Class: I Year BCA
Name of the faculty: PAVITHRA L Total Hours: 42 Hrs
Sl.no Topic covered EVEN SEMESTER No. of Lecture Methodology/
Hours Pedagogy
UNIT-I 8 Hrs
Introduction to data structures: Definition; Types
of data structures - Primitive & Non-primitive,
01 Linear and Non-linear; Operations on data 4 Hrs Lecture , PPT
structures. Dynamic memory allocation: Static &
Dynamic memory allocation; Memory allocation
and de-allocation functions - malloc, calloc,
realloc and free. Algorithm Specification,
Performance Analysis, Performance Measurement
Recursion: Definition; Types of recursions;
02 Recursion Technique Examples - GCD, Binomial 4 Hrs Lecture , PPT
coefficient nCr, Towers of Hanoi; Comparison
between iterative and recursive functions.
UNIT-II 10 Hrs
Arrays: Basic Concepts – Definition, Declaration,
03 Initialisation, Operations on arrays; Types of 5 Hrs Lecture , PPT
arrays; Arrays as abstract data types (ADT);
Representation of Linear Arrays in memory;
Traversing linear arrays; Inserting and deleting
04 elements; Sorting – Selection sort, Bubble sort, 5 Hrs Lecture , PPT
Quick sort, Selection sort, Insertion sort;
Searching - Sequential Search, 10 25 Binary
search; Iterative and Recursive searching;
Multidimensional arrays; Representation of
multidimensional arrays; Sparse matrices.
UNIT-III 8 Hrs
05 Linked list: Basic Concepts – Definition and
Representation of linked list, Types of linked lists
- Singly linked list, Doubly liked list, Header liked
list, Circular linked list; Representation of Linked 4 Hrs Lecture , PPT
list in Memory;
06 Operations on Singly linked lists –
Traversing,Searching, Insertion,Deletion; Memory 4 Hrs Lecture , PPT
allocation; Garbage collection,
UNIT-IV 8 Hrs
Stacks: Basic Concepts – Definition and
Representation of stacks; Operations on stacks;
07 Applications of stacks; Infix, postfix and prefix
notations; Conversion from infix to postfix using 4 Hrs Lecture , PPT
stack; Evaluation of postfix expression using
stack; Application of stack in function calls.
Queues: Basic Concepts – Definition and
Representation of queues; Types of queues -
08 Simple queues, Circular queues, Double ended
queues, Priority queues; Operations on Simple 4 Hrs Lecture , PPT
queues;
UNIT-IV 8 Hrs
Trees: Definition; Tree terminologies –node, root
node, parent node, ancestors of a node, siblings, 4 Hrs Lecture , PPT
09 terminal & non-terminal nodes, degree of a node,
level, edge, path, depth;
Binary tree: Type of binary trees - strict binary
tree, complete binary tree, binary search tree and
10 heap tree; Array representation of binary tree. 4 Hrs Lecture , PPT
Traversal of binary tree; preorder, inorder and
postorder traversal;
Internal Assessment Test -02 Total Internal Total Theory
Assignment 01 Assessment Marks - 60
Marks: 40