Subject Code / Name University college of Engineering Villupuram

Regulation L T P C Hours/Week

Lesson Plan
Department
B.Tech IT CS25C03/Essentials of Computing R-2025 2 0 2 3 6
Sub. Objective: 1. To introduce the basic components and operations of computers.
2. To develop problem-solving and computational thinking skills.
3. To enable learners to design simple solutions using algorithms and flowcharts.
4. To provide hands-on experience in visual programming and basic app development.
Outcomes 1.Describe the basic components and functioning of computers, number systems, and data representation.
2. Apply computational thinking and problem-solving techniques to design simple algorithms for real world problems
3. Design and represent solutions using flowcharts, pseudocode, and basic visual programming tools.
4. Demonstrate the ability to independently learn new computing tools and practices essential for lifelong learning
Ref. Book
R1 Thareja, R. (2020). Fundamentals of computers. Oxford University Press.
R2 Rajaraman, V., & Adabala, N. (2014). Fundamentals of computers. PHI Learning
R3 Brookshear, J. G., & Brylow, D. (2015). Computer science: An overview. Pearson.
R4 Dromey, R. G. (1982). How to solve it by computer. Prentice Hall International.
R5 Marji, M. (2014). Learn to program with Scratch: A visual introduction to programming with games, art, science and math. No Starch Press.
R6 Riley, D. D., & Hunt, K. A. (2014). Computational thinking for the modern problem solver. CRC Press.
R7 Venkatesh, G., & Mukund, M. (2021). Computational thinking. Notion Press.
E-Resource
1. Brennan and Resnick’s CT Framework 2012:https://scratched.gse.harvard.edu/ct/files/AERA2012.pdf
2. CS50X 2025 Scratch YouTube lectures by Prof. David J Malan, Harvard University:https://www.youtube.com/watch?v=2WtPyqwTLKM
3. https://teachinglondoncomputing.org/resources/developing-computational-thinking/
4. Scratch software: https://scratch.mit.edu/
5. MIT APP INVENTOR software: https://appinventor.mit.edu/
6. app.diagrams.net
Teaching Aid (TA):
BB Black Board PP Power Point VA Visual Aids (Video / Edusat class / Animation / Audio)
Teaching Methodology (TM):
AC Acronym AS Assignment BC Bridge Course GD Group Discussion
GL Guest Lecture IV Industrial Visit MM Mind Mapping NM NPTEL Videos / Materials
PD Project / Demo RP Roleplay SR Seminar TT Tutorials
Perio Topics of unit : 1 Pages Referred TA TM
d
ABSTRACT DATA TYPES T1 R1 R2 R3 R4 R5 S1
Abstract Data Types (ADTs) – Introduction – Definition –
1. - - 02 01-40 BB Lect.
Application of ADTs – Real time examples
ADTs and Classes – Introduction to LISTS, ARRAYS, STACK,
2. QUEUES - - 07 - BB Lect

Introduction to OOP – Introduction – Goals – Principles and

3. patterns - 57 - - BB Lect

Classes in Python – Inheritance - Class Definitions – operator

4. 69 - 493 - VA NM
overloading and python’s special method – Abstract Base Classes
Namespaces – Shallow and Deep Copying – Introduction to
5. Namespaces – Name Resolution and Dynamic Dispatch – Copy 96 - 486 - BB Lect
Module – Diff between Shallow and Deep Copying
Introduction to Analysis of Algorithms – Complexity Analysis –
6. - - 97 01-37 BB Lect
Evaluating Python Code – Amortized Cost – Evaluating the set
Asymptotic Notations – Divide and Conquer – The Big Oh
7. 123 - - BB SR
Notation – Comparative Analysis - Examples
Recursion – Analyzing Recursive Algorithms – Constant Time
8. 130 67 277 - BB TT
operations – Prefix Averages -
Beyond the Syllabus – Introduction to Classes, Objects,
9. - BB Lect
Inheritance, Polymorphism, Data Abstraction and Encapsulation
Peri Topics of unit : 2 Pages Referred TA TM
od LINEAR STRUCTURES T1 R1 R2 R3 R4 R5 S1
List ADT – Array Based Implementation
1. - - - BB Lect

2. Linked List Implementation

- 117 - BB Lect

3. Singly linked list – Introduction – Definition – Implementing a

Stack with Singly Linked List – Implementing a Queue with Singly 256 - 159 - BB Lect
Linked List - Examples
4. Circular linked list – Introduction – Round Robin Schedulers –
266 - 253 - BB TT
Implementing a Queue with Circular Linked List
5. Doubly linked list – Introduction – Basic Implementation of a
Doubly Linked List – Implementing a Deque with Double Linked 270 - 247 - BB Lect
List
6. Stack ADT – Introduction – Simple Array Based Implementation – 229 123 193 - BB
Reversing Data – Matching parenthesis and HTML Tags Quiz
7. Queue ADT – Introduction – Array Based Implementation – Real-
239 130 221 - BB Lect
time Examples of QUEUES - Applications
8. Double Ended Queues – Applications – The DEQUEUE -
247 - - - BB TT
Implementing with Circular Arrays – Dequeues in python module
9. Beyond the Syllabus – Real-time examples for Stacks and - - - BB
Queues Lect
Peri Topics of unit : 3 Pages Referred TA TM

od SORTING AND SEARCHING T1 R1 R2 R3 R4 R5 S1

1. Bubble Sort – Selection Sort – Prune and Search – Randomized 571 102 132,136 1-44 BB
Quick Select – Analyzing Randomized Quick Select Lect

2 Insertion Sort – Merge sort – Divide and Conquer - Array based 538 105 138,339 1-44 BB
implementation – Recurrence equations - Alternative Lect
Quick Sort – Analysis of Sorting Algorithms – Randomized Quick
3 550 109 347 1-44 BB Lect
Sort – Additional Optimizations of Quick Sort
Linear search – Introduction – Explanation - Examples
4. - 125 - BB TT,AS

Binary Search - Introduction – Explanation - Examples

5. - 128 - BB Lect

6. Hashing – Introduction – Definition – Maps and Dictionaries – The 403 - - BB

MAP ADT – Application – Counting Word Frequencies Lect
Hash functions – Hash Tables – Goal of Hash functions – Hash
7. 410 144 309 - BB QUIZ
Codes – Bit Representation as an Integer
Collision Handling – Introduction – Separate Chaining – Open
8. 417 - - BB TT
Addressing – Linear Probing and its variants
Load factors, Rehashing and Efficiency – Efficiency of Hash
9. 420 - - BB Lect
Tables – Python Hash Table Implementation
Peri Topics of unit : 4 Pages Referred TA
TM
od TREE STRUCTURES T1 R1 R2 R3 R4 R5 S1

1. Tree ADT – General Trees – Tree Definition and Properties – The 300 163 1-32 BB Lect
Tree Abstract Data Type – Computing Depth and Height
2. Binary Tree ADT – Introduction – The Binary Tree Abstract Data 311 261 369 1-32 BB Lect
Type – Properties of Binary Trees
Tree Traversals – Pre-order and Post order Traversals – Breadth
3. First Traversal – In-order Traversal – Application of Tree 328 - 1-32 BB Lect
Traversals in Python
Binary Search Trees – Introduction – Navigating a Binary Search
4. 460 170 412 1-32 BB TT
Tree – Searches – Insertions and Deletions - Implementation
AVL Trees – Introduction – Definition – Justification – Height
5. 481 239 428 - BB Lect.
Balance Property – Update Operations

6. Heaps – Introduction – Goals – Key Ideas – Building a Heap – - 215 390 - BB Lect.
Heapsort Algorithm – Analysis of Version I
7. Multi way Search Trees - Definition - Searching in a Multiway 502 - - BB Lect.
Tree – Data Structures for representing Multiway Search Tree
8. Red-Black Trees – Definition – Red Black Tree Operations – 512 - - BB TT
Insertion – Deletion – 3 possible ways for Remedies
9. - BB Lect.
 Pages Referred TA TM
Peri Topics of unit : 5
od GRAPH STRUCTURES T1 R1 R2 R3 R4 R5 S1

Graph ADT - Representation of Graphs – Introduction – Edge List

1. - Adjacency – Map Structure -Matrix Structure – Python 620 185 1-31 BB Lect.
implementation
Graph Traversals – Introduction – Depth First Search – DFS
2. 638 - 1-31 BB Lect.
Implementation and Extensions – Breadth First Search

3. DAG – Topological Ordering - 1-31 BB Lect.

4. Greedy Algorithms - - BB TT

Dynamic Programming – Shortest Paths

5. - - BB Lect.

Minimum Spanning Trees – Introduction – Prim-Jarnik Algorithm

6. – Kruskal’s Algorithm – Disjoint Partitions and Union-Find 670 190 - BB Lect.
Structures
7. Introduction to complexity classes and intractability - - VA NM
8. - VA NM

9. - VA NM
Approval:

Name Designation Signature Date

Prepared by Mrs. G. Saraswathi AP / IT

Verified by Mr. A. Joseph Selva Kumar ASP / IT

Approved by Principal
Revision History:
Date of Unit Period Details of Revision Revised by Approved by
revision
10.07.2021 1-5
- CIAT’S REDUCED HOD PRINCIPAL

YESTER YEAR HISTORY:

S. No Name of the Faculty Year/Class SEM Pass % Remarks

1 Mr. S. Prabakaran II / IT III 95.24%

2 Mrs. S. Jeeva II / IT III 68%

3 Mrs. V. Archana II / IT III 66.66%