THIRUVALLUVAR UNIVERSITY

SERKKADU, VELLORE–632115

B. Sc. Computer Science

SYLLABUS

FROM THE ACADEMIC YEAR

2023 – 2024
 Choice Based Credit System (CBCS), Learning Outcomes Based Curriculum
Framework (LOCF) Guideline Based Credit and Hours Distribution System
for all UG courses including Lab Hours
First Year – Semester-I

Part List of Courses Credit No. of

Hours
Part-1 Language – Tamil 3 6
Part-2 English 3 6
Part-3 Core Courses
CC1- OBJECT ORIENTED PROGRAMMING CONCEPTS 5 5
USING C++
CC2- Practical : OBJECT ORIENTED PROGRAMMING 5 5
CONCEPTS USING C++ LAB
Elective Courses:(Choose one from the following list)
i. Numerical Methods-I 3 4
ii. Discrete Mathematics- I
Skill Enhancement Course SEC-1: 2 2
Part-4 Introduction to HTML
Foundation Course: (Discipline / Subject Specific) 2 2
Problem Solving Technique
23 30

Semester-II

Part List of Courses Credit No. of

Hours
Part-1 Language – Tamil 3 6
Part-2 English 3 6
Part-3 Core Courses & Elective Courses including laboratory [in Total]

CC3 – Data Structures and Algorithm 5 5

CC4 - Practical: Data Structures and Algorithm 5 5
Elective Courses
i) Numerical Methods-II 3
ii) Discrete Mathematics – II 4
Part-4 Skill Enhancement Course -SEC-2 2 2
Office Automation
Skill Enhancement Course -SEC-3 (Discipline / Subject Specific) 2 2
PHP Programming
23 30
 FIRST SEMESTER
Semester I

CORE PAPER

Subject Subject Name L T P S Marks

Inst. Hours
Code

Category

Credits

External

Total
CIA
OBJECT ORIENTED Core 5 - - - 4 5 25
PROGRAMMING
75 100
CONCEPTS USING
C++
Learning Objective
LO1 Describe the procedural and object oriented paradigm with concepts of streams, classes,
functions, data and objects

LO2 Understand dynamic memory management techniques using pointers, constructors, destructors,
etc

LO3 Describe the concept of function overloading, operator overloading, virtual functions and
polymorphism

LO4 Classify inheritance with the understanding of early and late binding, usage of exception
handling, generic programming

LO5 Demonstrate the use of various OOPs concepts with the help of programs

UNIT Contents No. of

Hours
I Introduction to C++ - key concepts of Object-Oriented Programming – 15
Advantages – Object Oriented Languages – I/O in C++ - C++
Declarations. Control Structures : - Decision Making and Statements : If
..else, jump, goto, break, continue, Switch case statements - Loops in
C++ :for, while, do - functions in C++ - inline functions – Function
Overloading.

II Classes and Objects: Declaring Objects – Defining Member Functions – 15

Static Member variables and functions – array of objects –friend
functions – Overloading member functions – Bit fields and classes –
Constructor and destructor with static members.

III Operator Overloading: Overloading unary, binary operators – 15

Overloading Friend functions –type conversion – Inheritance: Types of
 Inheritance – Single, Multilevel, Multiple, Hierarchal, Hybrid, Multi path
inheritance – Virtual base Classes – Abstract Classes.

IV Pointers – Declaration – Pointer to Class , Object – this pointer – Pointers 15

to derived classes and Base classes – Arrays – Characteristics – array of
classes – Memory models – new and delete operators – dynamic object –
Binding, Polymorphism and Virtual Functions.

V Files – File stream classes – file modes – Sequential Read / Write 15

operations – Binary and ASCII Files – Random Access Operation –
Templates – Exception Handling - String – Declaring and Initializing
string objects – String Attributes – Miscellaneous functions.

Total 75

Course Outcomes Programme Outcome

CO Upon completion of the course the students would be
able to:
1 Remember the program structure of C with its syntax and
PO1, PO6
semantics
2 Understand the programming principles in C (data types,
operators, branching and looping, arrays, functions, PO2
structures, pointers and files)
3 Apply the programming principles learnt in real-
PO4, PO5
time problems
4 Analyze the various methods of solving a problem
PO6
and choose the best method
5 Code, debug and test the programs with appropriate test
PO3, PO6
cases
Text Book
1 E. Balagurusamy, “Object-Oriented Programming with C++”, TMH 2013, 7th Edition.

Reference Books
1. Ashok N Kamthane, “Object-Oriented Programming with ANSI and Turbo C++”,

Pearson Education 2003.

2. Maria Litvin& Gray Litvin, “C++ for you”, Vikas publication 2002.

Web Resources
1. https://alison.com/course/introduction-to-c-plus-plus-programming

Mapping with Programme Outcomes:

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6

CO 1 3 3 3 3 3 3
 CO 2 3 3 3 2 3 3

CO 3 3 2 2 2 3 2

CO 4 3 3 3 3 2 3

CO 5 3 2 3 2 3 3

Weight age of course 15 13 14 12 14 14

contributed to each
PSO

S-Strong-3 M-Medium-2 L-Low-1

Subject Subject Name L T P S Marks

Inst. Hours
Code
Category

Credits

External

Total
CIA
OBJECT ORIENTED Core - - 4 - 4 4 25 75 100
PROGRAMMING
CONCEPTS USING
C++LAB

Course Objective
C1 Describe the procedural and object oriented paradigm with concepts of streams, classes,
functions, data and objects

C2 Understand dynamic memory management techniques using pointers, constructors, destructors,

etc

C3 Describe the concept of function overloading, operator overloading, virtual functions and
polymorphism

C4 Classify inheritance with the understanding of early and late binding, usage of exception
handling, generic programming

C5 Demonstrate the use of various OOPs concepts with the help of programs

S.No List of Excercises No. of

Hours
1 Write a C++ program to demonstrate Class and Objects
2 Write a C++ program to demonstrate Constructor, copy constructor and
 Destructor.

3 Write a C++ program to demonstrate function overloading, Default

Arguments and Inline function.
4 Write a C++ program to demonstrate the Friend Functions.

5 Write a C++ program to demonstrate the concept of Passing Objects to

Functions
6 Write a C++ program to demonstrate pointers and dynamic memory
allocation using new and delete operators
7 Write a C++ program to demonstrate Unary Operator Overloading

60
8 Write a C++ program to demonstrate Binary Operator Overloading

9 Write a C++ program to demonstrate:

 Single Inheritance
 Multilevel Inheritance
 Multiple Inheritance
 Hierarchical Inheritance

10 Write a C++ program to demonstrate Virtual Functions.

11 Write a C++ program to manipulate a Text File.

12 Write a C++ program to perform Sequential I/O Operations on a file.

13 Write a C++ program to find the Biggest Number using Command Line
Arguments

14 Write a C++ program to demonstrate Class Template

15 Write a C++ program to demonstrate Function Template.

16 Write a C++ program to demonstrate Exception Handling.

Course Outcomes Programme Outcome

CO Upon completion of the course the students would be
able to:
1 Remember the program structure of C with its syntax and
semantics
PO4, PO5
 2 Understand the programming principles in C (data types,
operators, branching and looping, arrays, functions, PO6
structures, pointers and files)
3
Apply the programming principles learnt in real-
PO4 , PO5
time problems
4 Analyze the various methods of solving a problem
PO6
and choose the best method
5
Code, debug and test the programs with appropriate test
cases
PO4, PO5

Text Book
1 E. Balagurusamy, “Object-Oriented Programming with C++”, TMH 2013, 7th Edition.

Reference Books
1. Ashok N Kamthane, “Object-Oriented Programming with ANSI and Turbo C++”,

Pearson Education 2003.

2. Maria Litvin& Gray Litvin, “C++ for you”, Vikas publication 2002.

Web Resources
1. https://alison.com/course/introduction-to-c-plus-plus-programming

Mapping with Programme Outcomes:

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6

CO 1 3 3 3 3 3 3
CO 2 3 2 3 3 2 3
CO 3 3 3 3 3 3 3
CO 4 3 2 2 3 3 3
CO 5 3 2 3 3 3 2
Weightage of course 15 12 14 15 14 14
contributed to each
PSO
S-Strong-3 M-Medium-2 L-Low-1
Subject Subject Name L T P S Mar Subj

Categor

Credits

Hour
Inst.
Code ks ect

y
Code
INTRODUCTION Skill 2 - - 2 25 75 100
TO HTML Enha
.
Cour
se
(SEC
)
Learning Objectives
LO1 Insert a graphic within a web page.
LO2 Create a link within a web page.
LO3 Create a table within a web page.
LO4 Insert heading levels within a web page.

LO5 Insert ordered and unordered lists within a web page. Create a web page.
UNIT Contents No. Of.
Hours
I Introduction: Web Basics: What is Internet–Web browsers–What is
6
Webpage –HTML Basics: Understanding tags.
II TagsforDocumentstructure(HTML,Head,BodyTag).Blockleveltextelements
:Headings-paragraph(<p> tag)–Font-style elements:(bold, italic, font, 6
small, strong, strike, big tags)
III Lists: Types of lists: Ordered, Unordered– Nesting Lists–Other tags:
6
Marquee, HR, BR- Using Images –Creating Hyper-links.
IV Tables: Creating basic Table, Table elements, Caption–Table and cell
6
alignment–Row span, Col span–Cellpadding.
V Frames: Frameset–Targeted Links–No frame–Forms: Input, Text area,
Select, Option. 6
TOTAL HOURS 30

Course Outcomes Programme Outcomes

CO On completion of this course, students will
Knows the basic concept in HTML PO1, PO2, PO3, PO4, PO5,
CO Concept of resources in HTML PO6
1
Knows Design concept. PO1, PO2, PO3, PO4, PO5,
CO Concept of Meta Data PO6
2 Understand the concept of save the files.
Understand the page formatting.
PO1, PO2, PO3, PO4, PO5,
CO Concept of list
PO6
3
Creating Links.
PO1, PO2, PO3, PO4, PO5,
CO Know the concept of creating link to email address
PO6
4
Concept of adding images
PO1, PO2, PO3, PO4, PO5,
CO Understand the table creation.
PO6
5
 Textbooks
1 “Mastering HTML5 and CSS3 Made Easy”, TeachUComp Inc., 2014.
2

Thomas Michaud, “Foundations of Web Design: Introduction to HTML & CSS”

Web Resources
1 https://www.teachucomp.com/samples/html/5/manuals/Mastering-HTML5-CSS3.pdf
.
2 https://www.w3schools.com/html/default.asp
.

Mapping with Programme Outcomes:

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6

CO 1 3 3 3 3 3 3

CO 2 3 3 2 3 3 3

CO 3 2 3 3 3 3 3

CO 4 3 3 3 3 3 3

CO 5 3 3 3 2 3 3

Weightage of course 14 15 14 14 15 15
contributed to each PSO

S-Strong-3 M-Medium-2 L-Low-1

Subject Subject Name L T P S Marks

Inst. Hours

Code
Category

Credits

External

Total
CIA

Problem Solving
FC FC 2 - - - 2 2 25 75 100
Techniques
Learning Objectives
LO1 Familiarize with writing of algorithms, fundamentals of C and philosophy of problem solving.
LO2 Implement different programming constructs and decomposition of problems into functions.
LO3 Use data flow diagram, Pseudo code to implement solutions.
LO4 Define and use of arrays with simple applications

LO5 Understand about operating system and their uses

UNIT Contents No. Of. Hours
 I Introduction: History, characteristics and limitations of
Computer. Hardware/Anatomy of Computer: CPU, Memory,
Secondary storage devices, Input Devices and Output
devices. Types of Computers: PC, Workstation,
Minicomputer, Main frame and Supercomputer. Software: 6
System software and Application software. Programming
Languages: Machine language, Assembly language, High-
level language,4 GL and 5GL-Features of good programming
language. Translators: Interpreters and Compilers.
II Data: Data types, Input, Processing of data, Arithmetic
Operators, Hierarchy of operations and Output. Different
phases in Program Development Cycle (PDC).Structured
Programming: Algorithm: Features of good algorithm,
Benefits and drawbacks of algorithm. Flowcharts:
6
Advantages and limitations of flowcharts, when to use
flowcharts, flowchart symbols and types of flowcharts.
Pseudocode: Writing a pseudocode. Coding, documenting
and testing a program: Comment lines and types of errors.
Program design: Modular Programming.
III Selection Structures: Relational and Logical Operators -
Selecting from Several Alternatives – Applications of
Selection Structures. Repetition Structures: Counter 6
Controlled Loops –Nested Loops– Applications of Repetition
Structures.
IV Data: Numeric Data and Character Based Data. Arrays:
One Dimensional Array - Two Dimensional Arrays – Strings 6
as Arrays of Characters.
V Data Flow Diagrams: Definition, DFD symbols and types
of DFDs. Program Modules: Subprograms-Value and
Reference parameters- Scope of a variable - Functions –
6
Recursion. Files: File Basics-Creating and reading a
sequential file- Modifying Sequential Files.
TOTAL HOURS 30
Course Outcomes Programme
Outcomes
CO On completion of this course, students will
Study the basic knowledge of Computers. PO1, PO2, PO3,
CO1 Analyze the programming languages. PO4, PO5, PO6

Study the data types and arithmetic operations. PO1, PO2, PO3,
CO2 Know about the algorithms. PO4, PO5, PO6
Develop program using flow chart and pseudocode.
Determine the various operators.
PO1, PO2, PO3,
CO3 Explain about the structures.
PO4, PO5, PO6
Illustrate the concept of Loops
Study about Numeric data and character-based data. PO1, PO2, PO3,
 CO4 Analyze about Arrays. PO4, PO5, PO6
Explain about DFD
PO1, PO2, PO3,
CO5 Illustrate program modules.
PO4, PO5, PO6
Creating and reading Files
Textbooks
1 Stewart Venit, “Introduction to Programming: Concepts and Design”, Fourth Edition,
2010, Dream Tech Publishers.

Web Resources
1. https://www.codesansar.com/computer-basics/problem-solving-using-computer.htm
2. http://www.nptel.iitm.ac.in/video.php?subjectId=106102067
3. http://utubersity.com/?page_id=876

Mapping with Programme Outcomes:

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6

CO 1 3 3 3 3 3 3
CO 2 3 3 3 3 3 3
CO 3 3 2 3 3 3 3
CO 4 3 3 2 3 3 3
CO 5 3 3 3 3 3 2

Weightage of course 15 14 14 15 15 14
contributed to each PSO
S-Strong-3 M-Medium-2 L-Low-1

Semester II
Title of the Subject Name Category L T P S
M

k
a
r

s
Inst. Hours

Course/
Credits

Paper
External

Total
CIA

DATA
STRUCTURE AND Core
5 - - - 4 5 25 75 100
CC3 ALGORITHMS

Learning Objectives
LO1 To understand the concepts of ADTs
LO2 To learn linear data structures-lists, stacks, queues
LO3 To learn Tree structures and application of trees
LO4 To learn graph strutures and and application of graphs
 LO5 To understand various sorting and searching
UNIT Contents No. of
Hours
Abstract Data Types (ADTs)- List ADT-array-based implementation-
linked list implementation: singly linked lists-circular linked lists-
I 15
doubly-linked lists - operations- Insertion-Deletion -Applications of
lists-Polynomial Addition
Stack ADT-Operations- Applications- Evaluating arithmetic expressions
II – Conversion of infix to postfix expression-Queue ADT-Operations- 15
Circular Queue- applications of queues.
Tree ADT-Binary Tree ADT-expression trees-applications of trees-
III binary search tree ADT- insertion and deletion operations binary-tree 15
traversals
Definition- Representation of Graph-Types of graph-Breadth first
IV 15
traversal – Depth first traversal
Searching-Linear search-Binary search-Sorting-Bubble sort-Selection
V sort-Insertion sort-Hashing-Hash functions-Separate chaining-Open 15
Addressing-Rehashing Extendible Hashing
Total 75

Course Outcomes Programmeme Outcome

CO On completion of this course, students will
CO1 Understand the concept of Dynamic memory
PO1, PO6
management, data types, algorithms, Big O notation
CO2 Understand basic data structures such as arrays, linked
PO2
lists, stacks and queues
CO3 Describe the hash function and concepts of collision and
PO2, PO4
its resolution methods
CO4 Solve problem involving graphs, trees and heaps PO4, PO6
CO5 Apply Algorithm for solving problems like sorting,
PO5, PO6
searching, insertion and deletion of data
Text Book
1 1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson
Education 2014, 4th Edition.
2 ReemaThareja, “Data Structures Using C”, Oxford Universities Press 2014, 2nd
Edition
Reference Books
1. Thomas H.Cormen,ChalesE.Leiserson,RonaldL.Rivest, Clifford Stein, “Introduction to
Algorithms”, McGraw Hill 2009, 3rd Edition.
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education 2003
Web Resources
1. https://www.programiz.com/dsa

2. https://www.geeksforgeeks.org/learn-data-structures-and-algorithms-dsa-tutorial/

Mapping with Programme Outcomes:

 CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6
CO 1 3 3 3 3 3 3
CO 2 3 3 1 3 3 3
CO 3 3 3 3 2 3 2
CO 4 3 2 3 2 3 3
CO 5 3 3 3 3 3 3
Weightage of course 15 14 13 13 15 14
contributed to each
PSO
S-Strong-3 M-Medium-2 L-Low-1

Title of the Subject Name Category L T P S

k
a
r

s
Inst. Hours
Course/

Credits
Paper

External

Total
CIA
DATA
STRUCTURE AND
ALGORITHMS
CC4 LAB
Core - - 4 - 4 4 25 75 100
[Note: Practicals
offered through C++]
Learning Objectives
LO1 To understand the concepts of ADTs
LO2 To learn linear data structures-lists, stacks, queues
LO3 To learn Tree structures and application of trees
LO4 To learn graph structures and application of graphs
LO5 To understand various sorting and searching
Sl. No Contents No. of
Hours
Write a program to implement the List ADT using arrays and linked
1.
lists.

Write a program to implement the Stack ADT using arrays and

2. linked lists

3.
Write a program to implement the Queue ADT using arrays and
linked list.
4. Write a program that reads an infix expression, converts the
expression to postfix form and then evaluates the postfix expression (use
 stack ADT).

Write a program to perform the following operations:

 Insert an element into a Doubly Linked List.
5.
 Delete an element from a Doubly Linked List. 60
 Search for a key element in a Doubly Linked List.
Write a program to perform the following operations:
6.
 Insert an element into a binary search tree.
 Delete an element from a binary search tree.
 Inorder, preorder and postorder Traversals of a binary
search tree.
Write a programs for the implementation of BFS and DFS for a
7.
given graph.

Write a programs for implementing the following searching methods:

 Linear search
8
 Binary search.

Write a programs for implementing the following sorting methods:

 Bubble sort
9.
 Selection sort
 Insertion sort

Total 60

Course Outcomes Programmem Outcome

CO On completion of this course, students will
1 Understand the concept of Dynamic memory
PO1,PO4,PO5
management, data types, algorithms, Big O notation
2 Understand basic data structures such as arrays, linked
PO1, PO4,PO6
lists, stacks and queues
3 Describe the hash function and concepts of collision and
PO1,PO3,PO6
its resolution methods
4 Solve problem involving graphs, trees and heaps PO3,PO4
5 Apply Algorithm for solving problems like sorting,
PO1,PO5,PO6
searching, insertion and deletion of data
Text Book
1 Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson
Education 2014, 4th Edition.
2 ReemaThareja, “Data Structures Using C”, Oxford Universities Press 2014, 2nd
Edition
 Reference Books
1 Thomas H.Cormen,ChalesE.Leiserson,RonaldL.Rivest, Clifford Stein, “Introduction
to Algorithms”, McGraw Hill 2009, 3rd Edition
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education
2003
Web Resources
1. https://www.programiz.com/dsa

2. https://www.geeksforgeeks.org/learn-data-structures-and-algorithms-dsa-tutorial/

Mapping with Programme Outcomes:

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6

CO 1 3 3 3 3 3 3
CO 2 3 3 1 3 2 3
CO 3 3 3 3 3 2 3
CO 4 3 3 3 3 2 3
CO 5 3 2 3 3 3 3
Weightage of course 15 15 13 15 13 15
contributed to each
PSO
S-Strong-3 M-Medium-2 L-Low-1

Subject Code Subject Name L T P S Marks

Inst. Hours
Category

Credits

External

Total
CIA

SEC1 OFFICE AUTOMATION Skill - - - 2 2 25 75 100

Enha. 2
Course
(SEC)
Learning Objectives
LO1 Understand the basics of computer systems and its components.
LO2 Understand and apply the basic concepts of a word processing package.
LO3 Understand and apply the basic concepts of electronic spreadsheet software.
LO4 Understand and apply the basic concepts of database management system.
LO5 Understand and create a presentation using PowerPoint tool.
UNIT Contents No. of
Hours
I Introductory concepts: Memory unit– CPU-Input Devices: Key board, Mouse
and
Scanner.Outputdevices:Monitor,Printer.IntroductiontoOperatingsystems&itsfea 6
tures:LINUX–Windows. IntroductiontoProgrammingLanguages.

II Word Processing: Open, Save and close word document; Editing 6

text – tools, formatting, bullets; Spell Checker - Document
 formatting – Paragraph alignment, indentation, headers and footers,
numbering; printing–Preview, options, merge.

III Spreadsheets:Excel–
opening,enteringtextanddata,formatting,navigating;Formulas–
entering,handling and copying; Charts–creating, formatting and 6
printing,analysistables,preparationoffinancialstatements,introductiont
odataanalytics.

IV Database Concepts: The concept of data base management system;

Data field, records, and files, Sorting and indexing data; Searching 6
records. Designing queries, and reports(MS–Access).

V Power point: Introduction to Power point - Features –

Understanding slide typecasting &viewing slides – creating slide
shows. Applying special object – including objects & pictures – Slide 6
transition–Animation effects, audio inclusion, timers.

Total 30

Course Outcomes Programme Outcomes

CO On completion of this course, students will
CO1 Possess the knowledge on the basics of computers
PO1,PO2,PO3,PO6,PO8
and its components
CO2 Gain knowledge on Creating Documents, spreadsheet
PO1,PO2,PO3,PO6
and presentation.
CO3 Learn the concepts of Database and implement the
PO3,PO5,PO7
Query in Database.
CO4 Demonstrate the understanding of different
PO3,PO4,PO5,PO7
automation tools.
CO5 Utilize the automation tools for documentation,
PO4,PO6,PO7,PO8
calculation and presentation purpose.
Text Book
1 PeterNorton,“IntroductiontoComputers”–TataMcGraw-Hill.
Reference Books
1. Jennifer Ackerman Kettel, Guy Hat-Davis, Curt Simmons, “Microsoft 2003”, Tata
McGrawHill.
Web Resources
1. https://www.udemy.com/course/office-automation-certificate-course/

2. https://www.javatpoint.com/automation-tools

Mapping with Programme Outcomes:

MAPPING TABLE
 CO/ PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6

CO1 3 2 2 3 3 3

CO2 3 3 3 3 3 3

CO3 3 3 3 3 3 3

CO4 3 3 3 3 3 3

CO5 3 3 3 3 3 3

Weightage of course

contributed to each
15 14 14 15 15 15
PSO

S-Strong-3 M-Medium-2 L-Low-1

Subject Subject Name L T P S Marks

Code Inst. Hours
Category

Credits

External

Total
CIA

PHP Skill 2 - - - 2 2 25 75 100

PROGRAMMING Enha.
Course
(SEC)
Learn ing Objectives
LO1 To provide the necessary knowledge on basics of PHP.

LO2 To design and develop dynamic, database-driven web applications using PHP version.
LO3 To get an experience on various web application development techniques.
LO4 To learn the necessary concepts for working with the files using PHP.
LO5 To get a knowledge on OOPS with PHP.
UNIT Contents No. of Hours
Introduction to PHP -Basic Knowledge of websites -Introduction
I of Dynamic Website -Introduction to PHP -Scope of PHP - 6
XAMPP and WAMP Installation
PHP Programming Basics -Syntax of PHP -Embedding PHP in
HTML -Embedding HTML in PHP.
II Introduction to PHP Variable -Understanding Data Types -Using 6
Operators -Using Conditional Statements -If(), else if() and else if
condition Statement.
Switch() Statements -Using the while() Loop -Using the for()
III Loop PHP Functions. 6
PHP Functions -Creating an Array -Modifying Array Elements -
 Processing Arrays with Loops - Grouping Form Selections with
Arrays -Using Array Functions.
PHP Advanced Concepts -Reading and Writing Files -Reading
IV 6
Data from a File.
Managing Sessions and Using Session Variables -Destroying a
V Session -Storing Data in Cookies -Setting Cookies. 6

Total 30

Course Outcomes Programme Outcomes

CO On completion of this course, students will
CO1 Write PHP scripts to handle HTML forms PO1, PO4, PO6
Write regular expressions including modifiers,
CO2 operators, and metacharacters. PO2, PO5, PO7.

Create PHP Program using the concept of

CO3 array. PO3, PO4, PO5.

Create PHP programs that use various PHP

CO4 library functions PO2, PO3, PO5

CO5 Manipulate files and directories. PO3, PO5, PO6.

Text Book

1 Head First PHP & MySQL: A Brain-Friendly Guide- 2009-Lynn mighley and Michael
Morrison.

2 The Joy of PHP: A Beginner's Guide to Programming Interactive Web Applications

with PHP and MySQL- Alan Forbes
Reference Books
1. PHP: The Complete Reference-Steven Holzner.

2. DT Editorial Services (Author), “HTML 5 Black Book (Covers CSS3, JavaScript, XML,
XHTML, AJAX, PHP, jQuery)”, Paperback 2016, 2ndEdition.
Web Resources
1. Opensource digital libraries: PHP Programming

2. https://www.w3schools.com/php/default.asp

Mapping with Programme Outcomes:

 CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6

CO1 3 2 1 2 1 2

CO2 3 3 2 2 3 3

CO3 3 3 2 3 3 2

CO4 3 2 3 2 2 3

CO5 3 2 2 2 3 3

Weightage of course

contributed to each 15 12 10 11 12 13
PSO

S-Strong-3 M-Medium-2 L-Low-1