DEPARTMENT OF COMPUTER TECHNOLOGY

B.Sc. (COMPUTER TECHNOLOGY)

(Students admitted during 2023-2024 Onwards)

(Under CBCS with Outcome Based Education (OBE) Pattern)

SYLLABUS
I TO VI SEMESTER

GOBI ARTS & SCIENCE COLLEGE

(Govt. Aided Autonomous Co-educational Institution, Affiliated to
Bharathiar University, Coimbatore, Accredited with 'A' Grade by NAAC (4 th cycle)
and Recognised as a STAR College by DBT, Government of India)

KARATTADIPALAYAM POST,
GOBICHETTIPALAYAM - 638453
ERODE DISTRICT.

1
 GOBI ARTS & SCIENCE COLLEGE (Autonomous)

Vision
Social and Economic upliftment of the people of this area through value based quality Education.

Mission
Committed to serve the society with humility and trust, devoid of exploitation; to impart value based
higher education, particularly to the socially and economically deprived sections of this area; to make
students of this institution worthy citizens of our glorious motherland.

DEPARTMENT OF COMPUTER TECHNOLOGY

Vision
To inculcate better programming skills among rural area students.

Mission
To impart value based technical education and educate students towards the design and development
of software products for the benefit of computer industry and society.

2
 GOBI ARTS & SCIENCE COLLEGE (AUTONOMOUS): GOBICHETTIPALAYAM
SCHEME OF EXAMINATIONS - B.Sc. (COMPUTER TECHNOLOGY) (23 BATCH)

Maximum
Course
No. Part Course Total Hrs/ Marks Total Credits
Code Hours Exam Marks
CIA EOS
SEMESTER - I

1 23U1TM01 I TAMIL - I 90 3 25 75 100 3.0

2 23U2EN01 II ENGLISH - I 90 3 25 75 100 3.0

3 23UACT01 III MAJOR CORE : PROGRAMMING IN C 60 3 25 75 100 4.0

DIGITAL COMPUTER FUNDAMENTALS AND
4 23UACT02 III 60 3 25 75 100 4.0
ARCHITECTURE
ALLIED CORE : MATHEMATICAL
5 23UBCT01 III 90 3 25 75 100 5.0
FOUNDATION FOR COMPUTER SCIENCE
MAJOR CORE PROGRAMMING LAB - I :
6 23UACTP1 III 60 3 25 75 100 2.0
(C)
FOUNDATION SUBJECT - A :
7 21U4FN01 IV 1.5 100 100 1.0
GENERAL AWARENESS

SEMESTER - II

8 23U1TM02 I TAMIL – II 90 3 25 75 100 3.0

9 23U2EN02 II ENGLISH – II 90 3 25 75 100 3.0

MAJOR CORE : OBJECT ORIENTED
10 23UACT03 III 60 3 25 75 100 4.0
PROGRAMMING WITH C++
11 23UACT04 III DATA STRUCTURES AND ALGORITHMS 60 3 25 75 100 4.0
ALLIED CORE : COMPUTER ORIENTED
12 23UBCT02 III 90 3 25 75 100 5.0
NUMERICAL AND STATISTICAL METHODS
MAJOR CORE PROGRAMMING LAB - II :
13 23UACTP2 III 60 3 25 75 100 2.0
(C++)
FOUNDATION SUBJECT - B :
14 23U4FN02 IV 3 100 100 2.0
ETHICS & CULTURE

SEMESTER - III

15 23U1TM03 I TAMIL – III 60 3 25 75 100 3.0

16 23U2EN03 II ENGLISH – III 60 3 25 75 100 3.0

17 23UACT05 III MAJOR CORE : JAVA PROGRAMMING 75 3 25 75 100 4.0

18 23UACT06 RELATIONAL DATABASE MANAGEMENT 60 3 25 75 100 4.0

III
SYSTEMS
19 23UBCT03 III ALLIED CORE : CLOUD COMPUTING 75 3 25 75 100 5.0
MAJOR CORE PROGRAMMING LAB - III :
20 23UACTP3 III 60 3 25 75 100 2.0
(JAVA PROGRAMMING)
MAJOR CORE PROGRAMMING LAB - IV :
21 23UACTP4 III 60 3 25 75 100 2.0
(RDBMS)
22 IV FOUNDATION SUBJECT – B 3 100 100 2.0

3
 Contd…

SEMESTER - IV

23 23U1TM04 I TAMIL – IV 60 3 25 75 100 3.0

24 23U2EN04 II ENGLISH – IV 60 3 25 75 100 3.0

25 23UACT07 III MAJOR CORE : VISUAL PROGRAMMING 60 3 25 75 100 4.0

26 23UACT08 III WEB TECHNOLOGY 60 3 25 75 100 4.0

27 III ALLIED OPTIONAL : 90 3 25 75 100 5.0

MAJOR CORE PROGRAMMING LAB - V :
28 23UACTP5 III 60 3 25 75 100 2.0
(VISUAL PROGRAMMING)
MAJOR CORE PROGRAMMING LAB - VI :
29 23UACTP6 III 60 3 25 75 100 2.0
(WEB TECHNOLOGY)
FOUNDATION SUBJECT – B :
30 21U4FN05 IV 3 100 100 2.0
ENVIRONMENTAL STUDIES
31 V CO-CURRICULAR ACTIVITIES 1.0

SEMESTER - V

32 23UACT09 III MAJOR CORE : PYTHON PROGRAMMING 60 3 25 75 100 4.0

33 23UACT10 III BIG DATA WITH R 60 3 25 75 100 4.0

34 23UACT11 III SOFTWARE ENGINEERING 60 3 25 75 100 4.0

35 23UACT12 III CLIENT SERVER COMPUTING 60 3 25 75 100 4.0

MAJOR CORE PROGRAMMING LAB - VII :
36 23UACTP7 III 60 3 25 75 100 2.0
(PYTHON PROGRAMMING)
MAJOR CORE PROGRAMMING LAB - VIII:
37 23UACTP8 III 60 3 25 75 100 2.0
(BIG DATA USING R)
38 III MAJOR OPTIONAL : 90 3 25 75 100 4.0

SEMESTER – VI

39 23UACT13 III MAJOR CORE : PROGRAMMING WITH PHP 75 3 25 75 100 4.0

40 23UACT14 III COMPUTER NETWORKS 75 3 25 75 100 4.0

MAJOR SKILL BASED PAPER : COMPUTER
41 23UECT01 III 90 3 25 75 100 4.0
GRAPHICS
MAJOR CORE PROGRAMMING LAB – IX :
42 23UACTP9 III 60 3 25 75 100 2.0
(PROGRAMMING WITH PHP)
MAJOR SKILL BASED PRACTICAL :
43 23UECTP1 III PROGRAMMING LAB - X : (COMPUTER 60 3 25 75 100 2.0
GRAPHICS)
44 23UACTV1 III PROJECT WORK AND VIVA-VOCE 90 25 75 100 4.0

CREDITS:
=======
4
 PART I : 12 PART II : 12 PART III : MAJOR : 88
ALLIED: 20
---> 108
PART IV : 7 PART V : 1 TOTAL : 140

BLOOM’S TAXONOMY BASED ASSESSMENT PATTERN

K1-Remember; K2-Understanding; K3-Apply; K4-Analyze; K5-Evaluate
I. END OF SEMESTER (EOS) EXAMINATIONS:
1. Part III-Theory: 75 Marks

Knowledge Level Section Marks Description Total

K1 A (Answer All) 10 × 1 = 10 MCQ
K2 B (Either or Pattern) 5 × 5 = 25 Short answers 75
K3 & K4 C (Either or Pattern) 5 × 8 = 40 Descriptive/Detailed
2. Practical Examinations: 75 Marks
Section
Knowledge Level Total
Practical Record work
K3
K4 70 05 75
K5

II. CONTINUOUS INTERNAL ASSESSMENT (CIA):

1. Test – I & II: 25 Marks (Theory)

Knowledge Level Section Marks Description Total

K1 A (Answer All) 5×1=5 MCQ
K2 B (Either or Pattern) 2 × 5 = 10 Short answers 25
K3 & K4 C (Either or Pattern) 1 × 10 = 10 Descriptive/Detailed
2. Test –III: Model Exam 75 Marks

Knowledge Level Section Marks Description Total

K1 A (Answer All) 10 × 1 = 10 MCQ
K2 B (Either or Pattern) 5 × 5 = 25 Short answers 75 Marks
K3 & K4 C (Either or Pattern) 5 × 8 = 40 Descriptive/Detailed
3. Practical Internal Assessment: 25 Marks
Section
Knowledge Level Total
Test Lab Performance
K3
K4 15 10 25
K5
Components of Continuous Internal Assessment (CIA)
Allotment of Internal Assessment
Components Marks for a Maximum of 100 Marks
(Converted into 25 Marks)
Two Tests (1 hour) [25+25=50/2] 25
Model Exam 75
CIA Total 5 100
PROGRAMME SPECIFIC OBJECTIVES:
The students, after successful completion of programme, will be able to
1. Gain sound technical foundation in computer technology theory and open source programming
languages and the ability to apply computer related technologies to practical problems.

2. Acquire independent thinking, possess problem-solving skills and become technically competent to
pursue higher studies.

3. Exhibit professional leadership qualities, good communication, team work, social and professional
skills.

4. Utilize emerging technological tools, learn, adapt and successfully write effective procedural coding
meeting the needs of technical and societal challenges.

5. Equip students to critically analyze existing systems at multiple levels and develop innovative
solutions that cater to the dynamic nature of computer technology industries.

PROGRAMME SPECIFIC OUTCOMES (PSO):

PSO1: Understand the computer technology principles and concepts and to apply ethical, legal and social
principles for computer technology professional.

PSO2: Identify theoretical foundations and to model and design the computational systems with appropriate
algorithmic principles.

PSO3: Analyze and formulate the problem, propose feasible solutions using computing facilities and
enhance the skills towards higher education and research.

PSO4: Ability to apply the computer concepts and practices via emerging technologies and software
development tools.

PSO5: Equip students to find, analyze and flourish the field of computer technology at multiple levels for
implementing innovative solutions that cater to the dynamic nature of computer technology
industries.

6
 Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT01 Course Title: Batch: 2023
Programming in C Semester: I
Total Hours: 60 (Common for CS, BCA, IT, CT,
AI&DS) Credits: 4.0
Course Objective
The course aims
 To provide a comprehensive study of the procedure oriented concept using C
programming language.
 To facilitates the students to elaborately study about C programming techniques.
 To implement these techniques to solve the variety of real-time problems.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
Remember and understand the basic data types, operators and to write
K1, K2, K5 CO1 & compile simple programs.
K1, K2, K5 CO2 Understand the conditional statements & loops in programs.
K1, K2, K3, Understand and apply the concept of arrays & functions and design the
CO3 application programs.
K5
K1, K2, K3, Analyze the usage of structures, unions, pointers and make them to
CO4 efficiently access the memory.
K4,K5
Understand and evaluate the file operations and write programs to
K3, K4, K5 CO5 handle the data using files.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS
No. of
Unit Content
Hours
C FUNDAMENTALS: Overview of C, Constants, Variables and Data
I Types, Operators and Expressions, Data Input and Output Operators – 12
Simples Programs.
CONTROL STATEMENTS: If Statements, switch, Conditional
II Operator, While, do..While, for statements, break, continue, Storage 12
Classes – Programs.
ARRAY AND FUNCTIONS: One and Multi dimensional arrays,
III Handling of Character Strings – Programs. USER DEFINED 12
FUNCTIONS: Programs - Simple Function*.

7
 STRUCTURE AND POINTERS: Structures and Unions – Programs.
IV POINTERS: Introduction, Pointer Expressions, Pointers and Arrays, 12
Pointers and Character Strings, Pointers and Functions, Pointers and
Structure – Programs - Simple Pointers*.
FILE AND THE PREPROCESSOR: File Management in C –
V 12
Programs, Concept of Dynamic Allocation of Memory and Linked
List, The Preprocessor.
<-* Self Study->
Text Book:
1. E. Balagurusamy, “Programming in Ansi C”, Second Edition, Tata McGraw Hill Publications,
2003. (Unit – I to V)
Reference Books:
1. Ashok N. Kamthane, “Programming in C”, Second Edition, Pearson, 2006.
2. Herbert Schildt, “C: The Complete Reference”, Fourth Edition, Tata McGraw-Hill, 2008.
3. Shubhnandan S, Jamual, “Programming in C”, First Edition, Pearson, 2014.
4. Subburaj R, “Programming in C”, First Edition, Vikas Publishing, 2012.
E-references:
1. https://www.cprogramming.com/reference/
2. https://en.cppreference.com/w/c/language
3. https://developerinsider.co/best-c-programming-book-for-beginners/

Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 S S M S S
CO2 S S M S S
CO3 S S H S H
CO4 S S S S H
CO5 H S S S H
S-Strong; H-High; M- Medium; L-Low

8
 Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT02 Course Title: Batch: 2023
Digital Computer Fundamentals Semester: I
Total Hours: 60 & Architecture
(Common for CS/CT) Credits: 4.0

Course Objective
The course aims
To know the concepts of number systems and its
conversions. To design the logic circuits for Boolean algebra
and K-maps.
To understand the design of combinational and sequential circuits.
To acquire the knowledge about the internal working of CPU and its instruction
set. To learn about I/O, data-transfer techniques and interrupts.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
K1,K2,K3, K5 Understand the fundamentals of various number systems, complements,
CO1 codes and perform conversions.
K1,K2,K3,K4, Understand the logic gates and the laws of Boolean algebra, remember
CO2 and solve K-maps
K5
K1,K2,K3,K4, CO3 Understand the basics of arithmetic and sequential circuits, apply the
K5 logics for designing circuit diagrams

K1,K2 CO4 Know and realize the important of central processing unit, instruction
formats and various instructions.
Understand the usage of I/O, data-transfer, I/O processor and analyze
K1, K2,K4 CO5 various strategies of interrupts.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS
No. of
Unit Content
Hours
NUMBER SYSTEM: Decimal, Binary, Octal, Hexadecimal – Binary addition,
I Multiplication, Division – Floating point representation, Complements, BCD, 12
Excess3, Gray codes – Convention between Number Systems. (Self-study: Gray
codes)
DIGITAL LOGIC: The Basic Gates – NOR, NAND, XOR Gates –
II COMBINATIONAL LOGIC CIRCUITS: Boolean Algebra, simplification of 12
Boolean functions – Karnaugh map – Canonical form – Don’t care condition –
Product of sum, Sum of products, K- map Computational circuits.
9
 ARITHMETIC CIRCUITS: Half Adder, Full Adder, Parallel Binary Adder, BCD
Adder, Half subtractor, Full subtractor, Parallel binary subtractor. SEQUENTIAL
III CIRCUITS - FLIP-FLOP: RS, JK, D, and T– Multiplexers – 12
Demultiplexers – Decoder – Encoder. (Self-Study: Half Subtractor, D and T Flip-
flop)
CENTRAL PROCESSING UNIT: General Register Organization – Control
IV word– Examples of Micro operations – Stack organization – Instruction formats – 12
Addressing modes – Data Transfer and manipulation program control.
INPUT – OUTPUT ORGANIZATION: input-output interface – i/o bus and
interface – i/o bus versus memory bus – isolate versus memory – mapped i/o –
V example of i/o interface. ASYNCHRONOUS DATA TRANSFER: strobe control 12
and handshaking *– priority interrupt: daisy – chaining priority, parallel priority
interrupt, direct memory access: dma controller, dma transfer. INPUT-OUTPUT
PROCESSOR: CPU – IOP Communication

<*- Self study->

Text Books:
1. V. Vijayendran, “Digital Fundamentals”, S. Viswanathan Publishers Pvt Ltd, 2009. (UNIT - I to
III)
2. M.Morris Mano, “Computer System Architecture”, Prentice Hall of India, Third Edition–
Tenth Impression, 2013. (UNIT - IV to V).
Reference Books:
1. Donald P Leach, Albert Paul Malvino, Goutam Saha, “Digital Priniciples and Applications”, 7th
2. Edition, McGraw Hill, 2011.
3. David A. Patterson, John L.Hennessy, “Computer Organization and Design”, Fourth
Edition, Morgan Kauffmann Publishers, 2011.
4. William Stallings, “Computer Organization and Architecture”, Tenth Edition, Pearson
Education, 2015.
E-references:
1. https://www.studytonight.com/computer-architecture/architecture-of-computer-system
2. https://onlinecourses.nptel.ac.in/noc19_cs03
3. http://www.cs.uwm.edu/classes/cs458/Lecture/HTML/ch01.html
4. https://www.geeksforgeeks.org/computer-organization-and-architecture-tutorials/#idf

Mapping with Programme Specific Outcomes

PSO PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S S S S M
CO2 S S H S S
CO3 S H S S H
CO4 S H H M S
CO5 S S S H S
S - Strong; H - High; M - Medium; L – Low

10
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UBCT01 Course Title: Batch: 2023
Mathematical Foundation for Semester: I
Total Hours: 90 Computer Science
(Common for IT, CT) Credits: 5.0

Course Objective
The course aims
 To provide the students with specific knowledge about matrices and sets.
 To study about concepts of relations, Graphs and the logical operations in Propositional calculus.
 To improve the students with problem solving skills.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
Understand the basic concepts of matrices; remember determinants and
K1,K2,K3,K4 CO1
evaluate inverse matrix.
Understand the basic concepts of set theoryremember the inclusion and
K1,K2,K3,K4 CO2
exclusion principles and apply it to solve the real world problems.
Know the concepts of relations, types, properties, set operations and
K1,K2,K3,K4 CO3
analyze the problems.
Understand and remember the concepts of graphs, subgraphs, analyze,
K1,K2,K3,K4 CO4
apply and evaluate its storage representation in memory.
Learn the concepts of propositional calculus, remember, analyze and
K1,K2,K3,K4 CO5
evaluate simple mathematical logical problems.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate
SYLLABUS
No. of
Unit Content
Hours
MATRICES: Definition – Types of Matrices – Addition & Subtraction of Matrices –
I Scalar multiple of a matrix – Matrix Multiplication – Determinant of a Matrix – Inverse 15
of a matrix.
SET THEORY: Introduction – Sets & its Elements – Set Description – Types of Sets –
II Basic set operations – Laws of set theory – Duality – The inclusion & exclusion 15
principle.
RELATIONS: Introduction – Definition of Cartesian Product of sets – Binary relation
III – Set operations on relations – Types of relations – Partial Order Relation – 15
Equivalence Relations – Composition of relations.

11
 GRAPH THEORY: Introduction – Definition of Graph, Undirected Graph, Multi
IV Graph, Walk, Path, Circuit, Connected Graphs, Distance & Diameter, Cut Points &
15
Bridges – Types of Graphs – Sub graph – Representation of Graphs in Computer
memory*.
MATHEMATICAL LOGIC: Introduction – Propositional calculus – Basic Logical
V Operations: Conjunction, Disjunction, Negation, Conditional Statements, and Bi 15
conditional statements – Tautologies – Contradiction* – Algebra of statements.
<-* Self Study>

Text Books:
1. N. Ch. S. N.Iyengar, “Matrices”, Anmol Publications Pvt. Ltd., First Edition, 1998. (Unit I).
2. J.K Sharma, “Discrete Mathematics”, Macmillan India Ltd., Third Edition, 2013. (Unit II-V).
Reference Books:
1. A.R.Vasishtha, A.K.Vasishtha, “Matrices”, Forty sixth Edition, Krishna Prakashan Media (P) Ltd,
2014.
2. T.Veerarajan, “Discreta Mathematics with Graph Theory and Combinatorics ”, First Edition, Tata
McGraw Hill Education Pvt Ltd., 2007.
3. Seymour Lipschutz, Marc Larsa Lipson, “Discreta Mathematics”, Third Edition, McGraw Hill
Education Pvt Ltd, Third Edition, 2013.
E-references:
1. https://en.wikipedia.org/wiki/The_Matrix
2. https://www.geeksforgeeks.org/set-theory/
3. https://www.cs.odu.edu/~cs381/cs381content/relation/order/order.html
4. https://en.wikipedia.org/wiki/Graph_theory
5. http://www.newworldencyclopedia.org/entry/Mathematical_logic

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S M H M H
CO2 S S S H S
CO3 H M M M H
CO4 M H S H M
CO5 H S H H H
S-Strong; H-High; M- Medium; L-Low

12
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACTP1 Course Title: Batch: 2023
Semester: I
Total Hours: 60 Programming Lab - I: (C)
Credits: 2.0

Course Objective
The course aims
 To provide a comprehensive study of the procedure oriented concept using C programming language.
 To facilitates the students to elaborately study about C programming techniques.
 To implement these techniques to solve the variety of real-time problems.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number

K1, K2, K5 CO1 Remember and understand the basic data types, operators and to write
& compile simple programs.
K1, K2, K5 CO2 To Understand the conditional statements & loops in programs.
K1, K2, K3, To apply the concept of arrays & functions and design the application
CO3
K5 programs.
K1, K2, K3, Analyze the usage of structures, unions, pointers and make them to
CO4
K4, K5 efficiently access the memory.

K3, K4, K5 CO5 To evaluate the file operations and write programs to handle the data
using files.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

SYLLABUS
1. Write a C program to calculate the sum of digits of a given number.
2. Write a C program to find a factorial for given number.
3. Write a C program to print the Fibonacci series.
4. Write a C program to find the Ramanujam number.
5. Write a C program to print the numbers between some interval which divisible by four.
6. Write a C program to find the Maximum and Minimum value in a array.
7. Write a C program to sort a given number.
8. Write a C program to add two matrices.
9. Write a C program for converting numbers into words.

13
 10. Write a C program to find and count number of vowels in a word or string.
11. Write a C program for sorting string in a alphabetical order.
12. Write a C program to find the roots of a Quadratic Equation.
13. Write a C program for swapping two values using pointers.
14. Write a C program to print Electricity Bill using File.
15. Write a C program to Maintain Student Mark List using Structure.
Text Book:
E. Balagurusamy, “Programming in Ansi C”, Second Edition, Tata McGraw Hill Publications, 2003.

Reference Books:
1. Ashok N. Kamthane, “Programming in C”, Second Edition, Pearson, 2006.
2. Herbert Schildt, “C: The Complete Reference”, Fourth Edition, Tata McGraw Hill
Publications, 2008.
3. Shubhnandan S, Jamual, “Programming in C”, First Edition, Pearson, 2014.
4. Subburaj R, “Programming in C”, First Edition, Vikas Publishing, 2012.
E-references:
1. https://www.cprogramming.com/reference/
2. https://en.cppreference.com/w/c/language
3. https://developerinsider.co/best-c-programming-book-for-beginners/

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S S M S S
CO2 S S M S S
CO3 S S H S H
CO4 S S S S H
CO5 H S S S H
S-Strong; H-High; M- Medium; L-Low

14
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT03 Course Title: Batch: 2023
Semester: II
Total Hours: 60 Object Oriented Programming with C++
Credits: 4.0

Course Objective
The course aims
 To learn the basic concept object oriented programming such as tokens, expressions, data types,
variables and applications of OOP.
 To learn the syntax and semantics of C++ language which includes functions, class, constructors,
destructors and inheritance.
 To acquire knowledge to manage console I/O operations and ability to develop application programs.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO Course Outcome
Level Number
To Learn the basic knowledge on Object Oriented programming
K1, K2, K5 CO1 concepts, Expressions and Control Structures.
K1, K2, K5 CO2 Acquire Knowledge of class, objects, functions and arrays.
K1, K2, K3, Gain knowledge the role of constructors, destructors and operator
CO3 overloading.
K5
K1, K2, K3,
CO4 Apply the concept of inheritance and pointers in real time problems.
K4
K3, K4, K5 CO5 Evaluate I/O file and its operations.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

SYLLABUS
No. of
Unit Content
Hours

15
 Principles of Object Oriented Programming: Procedure Oriented
Programming, Object Oriented Programming Paradigm, Basic Concepts of
Object Oriented Programming, Benefits of Object Oriented Programming,
Object Oriented Languages, Application of Object Oriented Programming -
I Beginning With C++: What Is C++, Applications Of C++, Structure of C++ 12
Statement – Tokens, Expressions and Control Structures: tokens, keywords,
identifiers and constants, basic and user defined datatypes, derived datatypes,
variables, Operators in c++, Operator Precedence, Expression and Their
Types, Control Structures.
Function in C++: Main Function, Function Prototyping, Call By Reference,
Return By Reference, Inline Functions, Default Arguments, Function
Overloading – Classes And Objects: Specifying A Class, Defining Member
II functions, Making an Outside Function Inline, Nesting of Member Functions, 12
Private Member Functions, Arrays Within a Class, Memory Allocation For
Objects, Static Data Members and Member Functions Arrays of Objects,
Object As Function Arguments, Friendly Functions, Pointers to Members.
Constructors And Destructors: Constructors, Parameterized Constructors,
Multiple Constructors In A Class, Constructors With Default Arguments,
Copy Constructor, Destructors – Operator Overloading And Type
III 12
Conversions: Defining Operator Overloading, Overloading Unary Operators,
Overloading Binary Operators using Friend, Rules For Overloading
Operators, Type Conversions.
Inheritance: Defining Derived Classes, Single, Multilevel, Multiple,
Hierarchical And Hybrid Inheritance, Virtual Base Classes, Abstract Classes,
IV Constructors in Derived Classes, Nesting Of Classes – Pointers, Virtual 12
Functions And Polymorphism: Pointers To Objects, This Pointer, Pointers
To Derived Classes, Virtual Functions, Pure Virtual Functions.
Managing Console I/O Operations: C++ Streams, C++ Stream Classes,
Unformatted I/O Operations, Formatted Console I/O Operations, managing
Output With Manipulators Working With File: Classes For File Stream
V 12
Operations, Opening And Closing A File Detecting End-Of-File, Open() File
Modes, File Pointers And Their Manipulation , Sequential I/O Operations,
Random Access File, Error Handling During File Operations.

Text Book:
E. Balagurusamy, “Object Oriented Programming With C++”, Six Edition, Tata McGraw Hill, 2013
(Unit I - V).
Reference Books:
1. Ananthi Sheshasaayee, G Sheshasaayee, “Object Oriented Programming With C++ ”, Margham
Publication, First Edition, 2001.
2. Bjarne Stroustrup, “The C++ Programming Language”, 4th Edition, Addison Wesley, 2013
3. Anirban Das, Goutam Panigraphi, “Object Oriented Programming With C++ ”, Second Edition, Vikas
Publishing Pvt Ltd, 2014.
4. M.T. Somashekara, D.S. Guru, H.S.Nagendraswamy and K.S. Mnajunatha, “ Object Oriented
Programming With C++”, Second Edition, Vikas Publishing Pvt Ltd, 2012.
E-references:
1. https://en.cppreference.com/w/
2. https://www.tutorialspoint.com/cplusplus/cpp_references.htm

16
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT04 Course Title: Batch: 2023 3. h
t
Data Structures and Algorithms Semester: II
t
Total Hours: 60 (Common for CS/IT/BCA/CT/AI
Credits: 4.0 p
& DS)
s
://www.javatpoint.com/cpp-tutorial
4. https://beginnersbook.com/2017/08/c-plus-plus-tutorial-for-beginners/

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S H M S L
CO2 S H M S L
CO3 S S H S H
CO4 S S S S H
CO5 H M S S S
S-Strong; H-High; M- Medium; L-Low

Course Objective
The course
aims
To ensure that the student evolves into a competent programmer capable of designing and
analyzing implementations of algorithms and data structures for different kinds of problems.
 To Understand the fundamental Data Structures such as array, stacks, queues, linked-lists and trees.
 Ability to estimate the algorithmic complexity for simple and non-recursive programs.
Course Outcomes (CO)
On the successful completion of the course, students will be able
to
Knowledge CO
Course Outcome
Level Number
To gain knowledge on elementary data structure, notation and
K1, K2 CO1 its complexity.
K2 CO2 Understanding of basic arrays, linked list and its operations.
K3 CO3 Learn and apply stack and queue operations.
K3, K4 CO4 Analyze the applications of tree and graph.
K4, K5 CO5 Illustrate types of sorting algorithms.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

17
 SYLLABUS
No. of
Unit Content
Hours
INTRODUCTION – BASIC TERMINOLOGY: Elementary Data Organization – Data
Structures – Data Structures Operations – Preliminaries – Mathematical Notation and
I Functions – Algorithmic Notation – Control Structure –Complexity of Algorithms 12
– Other Asymptotic Notations for Complexity by Algorithms.

ARRAYS, RECORDS AND POINTERS: Introduction – Linear Arrays –

Representation by Linear Arrays in Memory – Traversing Linear Arrays – Inserting
II and Deleting – LINKED LIST: Introduction Representation of Linked List in 12
Memory– Traversing a Linked List – Searching a Linked List – Memory
Allocation* – Insertion into a Linked List – Deletion from a Linked List.
STACKS, QUEUES, RECURSION: Introduction – Stacks – Arrays Representation of
III Stacks – Linked Representation of Stacks – Arithmetic Expression – Polish Notation 12
– Quick Sort, an Application of Stacks –
Recursion* – Towers of Hanoi –Queues – Linked Representation of Queues.
TREES: Introduction – Binary Trees – Representing Binary Trees in memory –
Traversing Binary Trees – Traversal Algorithms using Stacks – Graphs and their
IV Applications – Graph theory Terminology – SEQUENTIAL REPRESENTATION 12
OF GRAPHS: Adjacency matrix, path matrix, Warshall‟ s Algorithm, Shortest Paths.

SORTING AND SEARCHING: Introduction – Sorting – Insertion Sort – Selection

V Sort – Merging – Merge Sort – Radix Sort – Searching and Data Modification 12
– Hashing.
<* - Self study>
Text Books:
1. Seymour Lipschutz, GA Vijayalakshmi Pai, “Data Structures”, Tata McGraw Hill, Fourth
Edition, 2006. (Unit I – V)
Reference Books:
1. Alfred V.Aho, John E. Hopcroft, Jeffrey D.Ullman, “Data Structures and
Algorithms”, Pearson Education, First Edition, 2005.
2. Ellis Horowitz, Saartaj Sahni, “Fundamentals of Data Structures”, Galgotia
Book Source,Fourth Edition, 1978.
3. Debas is Samanta, “Classic Data Structures”, PHI, Second Edition, 2009.

E-references:
1. https://www.javatpoint.com/data-structure-tutorial
2. https://www.programiz.com/dsa
3. https://www.slideshare.net/PsEditor/data-structures-17664936

Mapping with Programme Specific Outcomes

PSO PSO1 PSO2 PSO3 PSO4 PSO5

CO
CO1 S H S M H
CO2 S M H H S
CO3 H S S M S
CO4 S M H S M
18
 CO5 S H S H S
S - Strong; H - High; M - Medium; L – Low

19
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UBCT02 Course Title: Batch: 2023
Computer Oriented Numerical and Semester: II
Total Hours: 90 Statistical Methods
(Common for IT, CT, BCA) Credits: 5.0
Course Objective
The course aims
To provide students with specific knowledge and skills relevant to their disciplines and careers to
find accurate solution to the given problem.
To accurate solutions for Numerical Integration with various methods.
To understand and work with oriented statistical problems and the various types of measures and
statistical methods.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcomes

Understand the basics of numerical Algebraic and Transcendental

K1,K2,K3,K4 CO1
Equations; remember and solve the problems.

K1,K2,K3,K4 CO2 Remember and solve simultaneous Linear Algebraic Equations using
various methods.
Choose, formulate and implement appropriate numerical methods for
K1,K2,K3,K4 CO3
solving integration problems.

K1,K2,K3,K4 CO4 Understand the basic statistical parameters and calculate Mean,
Median and Mode for the tabulated data.
Analyze the meaning of statistical indicators and calculate Measures of
K1,K2,K3,K4 CO5
Dispersion.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

SYLLABUS
No. of
Unit Content
Hours
THE SOLUTION OF NUMERICAL ALGEBRAIC AND
I TRANSCENDENTAL EQUATIONS:– Bisection method – Iteration Method – 15
Newton-Raphson method – The method of false position.
THE SOLUTION OF SIMULTANEOUS LINEAR ALGEBRAIC
II EQUATION:– Gauss Elimination method – Gauss Jordon Elimination Method 15
*– Triangularization method - Gauss Seidal method – Gauss Jacobi method.
NUMERICAL INTEGRATION: – Trapezoidal rule – Simpson’s One –third
III 15
rule – Simpson’s three – eight rule.
STATISTICS: Definition – Classification and Tabulation of Data –
IV 15
Measures of Central values: Mean – Median – Mode –Their Relationship* –
Problems.

20
 MEASURES OF DISPERSION: Range – Quartile Deviation - Mean
V 15
Deviation – Standard Deviation.
<* - Self study>
Text Books:

1. P. Kandasamy, K.Thilagavathi, K.Gunavathi ,“Numerical Methods”, Chand & Company Ltd, New
Delhi, First Edition, 2005. (Unit I-III).
2. R.S.N.Pillai, Bagavathi, “Statistics”, S.Chand & Company Ltd, New Delhi, Third Edition, 2012.
(UNIT IV,V).
Reference Books:
 V.Rajaraman, “Computer Oriented Numerical Methods”, PHI Learning Private Limited, Third
Edition, 2011.
 S.Sastry, “Introductory Methods of Numerical Analysis”,PHI Learning Private Limited, Fifth
Edition, 2012.
 C.B.Gupta, Vijay Gupta, ''An Introduction to Statistical Methods”, Vikas Publishing House Pvt. Ltd,
Twenty Third Revised Edition, 2013.
E-references:
1. https://onlinecourses.nptel.ac.in/noc18_ma03/preview
2. https://en.wikibooks.org/wiki/Numerical_Methods/Equation_Solving
3. https://www.thoughtco.com/what-is-statistics-3126367
4. https://explorable.com/course/statistics-beginners-guide

Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 S H M S S

CO2 S M H H H

CO3 H H H S H

CO4 S H H S M

CO5 S S H H M
S-Strong; H-High; M- Medium; L-Low

21
 Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACTP2 Course Title: Batch: 2023
Major Core Programming Lab - II: Semester: II
Total Hours: 60 (C++)
Credits: 2.0
Course Objective
The course aims to
 Understand the feature of C++ supporting object oriented programming.
 Develop the knowledge of how to represent real-life entities of problems in system design.
 Implement inheritance and file operations.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO Course Outcome
Level
Number

K1,K2,K3, CO1 Remember the basic knowledge of object oriented concepts and to write
K4, K5 simple programs.

K1,K2,K3, CO2 Understand and develop application programs using operators, loops
K4, K5 and functions.

K1,K2,K3, CO3 Write programs by applying the class structure as fundamental and
K4, K5 modular building block.

K1,K2,K3, CO4 Analyze the role of inheritance, polymorphism and building reusable
K4, K5 code in application programs.

K1,K2,K3, CO5 Write and evaluate the C++ programs with pointers, file and error
K4, K5 handling mechanisms.

K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

Program List

1. Write a C++ program to find the factorial of the given number using recursive function.

2. Write a C++ program for string manipulation using string handling functions.

3. Write a C++ program to find the biggest among the N numbers.

4. Write a C++ program to perform arithmetic operations using inline functions.

5. Write a C++ program for finding area of different shapes using function overloading.

6. Write a C++ program for displaying personal details using array of objects.

7. Write a C++ program for finding the largest number using friend function.

8. Write a C++ program for complex number addition using constructor.

9. Write a C++ program to join two strings using copy constructor.

10. Write a C++ program to perform arithmetic operations using operator overloading.

22
11. Write a C++ program to display product details using virtual functions.

12. Write a C++ program for electricity bill preparation using single inheritance.

13. Write a C++ program employee pay bill calculations using multiple inheritances.

14. Write a C++ program to create student mark sheet using multi level inheritance.

15. Write a C++ program to display bank details.

Text Book:

1. E. Balagurusamy, “Object Oriented Programming with C++”, Sixth Edition, Tata McGraw Hill, 2013.
Reference Books:
1. Ananthi Sheshasaayee, G Sheshasaayee, “Object Oriented Programming with C++”, First Edition,
Margham Publication, 2001.
2. Bjarne Stroustrup, “The C++ Programming Language”, Fourth Edition, Addison Wesley, 2013
3. Anirban Das, Goutam Panigraphi, “ Object Oriented Programming with C++”, Second Edition, Vikas
Publishing Pvt Ltd, 2014.
4. M.T.Somashekara, D.S.Guru, H.S.Nagendraswamy and K.S.Manjunatha, “Object Oriented
Programming with C++”, Second Edition, Vikas Publishing Pvt Ltd, 2012.
E-References:

1. https://en.cppreference.com/
2. https://www.tutorialspoint.com/cplusplus/cpp_references.htm
3. https://www.javatpoint.com/cpp-tutorial
4. https://beginnersbook.com/2017/08/c-plus-plus-tutorial-for-beginners
Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 S H M S S

CO2 S H M S S
CO3 S S H S H
CO4 H S S S H
CO5 S M S S S
S-Strong; H-High; M- Medium; L-Low

23
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT05 Course Title: Batch: 2023
Java Programming Semester: III
(Common for
Total Hours: 75 Credits: 4.0
CS/IT/BCA/CT/AI&DS)
Course Objective
The course aims
 To learn object orient programming fundamentals and the characteristics of java language.
 To learn the syntax, semantics and use of basic java programming language constructs.
 To know the syntax and use of utilities, applets, simple graphics methods and image loader.
 To develop stand alone applications and applet programs in Java.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO Course Outcome
Level Number
K1 CO1 Understand the fundamentals of object-oriented Programming and
basic constructs of Java such as data types, operators and arrays.
K1, K2, K3 CO Understand the syntax and use of control statements, classes and
inheritance to write programs.
K2, K1, K3 CO3 Obtain knowledge about concepts, syntax and use of packages,
interfaces, threads and exception handling for writing programs.
K1, K2 CO4 Learn the use, syntax and implementation of Java utilities.
K3, K4, K5 CO5 Gain knowledge to develop applications using applets and simple
graphics methods.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS
Unit Content No. of
Hours
OBJECT ORIENTED FUNDAMENTALS AND JAVA REVOLUTION:
Object Oriented Programming – Encapsulation – Inheritance – Polymorphism
I – Java Genesis – Characteristics – Java Programming Techniques – Reserved
Words – Identifiers Literals – Operators – Separators – Variables – Types – 15
Arrays – Operator Precedence.
FLOW – CONTROL AND CLASSES: If – Else – Break – Switch – Return
Statements – Looping – While – Do While – For – Comma Statements –
Continue – Classes – Declaration – Object References – Instance Variables –
II New Operator – Method Declaration – Method Calling – this Operator 15
Constructors – Methods Overloading – Inheritance – Super Class – Dynamic
Method Dispatch – Final Static – Abstract Classes.
PACKAGES AND INTERFACES: Packages – The Package Statement –
Import Statement – Interface Statement – Implements Statement –
Constructors: String Creation – String Concatenation – Character Extraction –
Exception Handling Fundamentals – Types – Uncaught Exceptions – Nested
24
 III try Statement. The Java thread Model Priorities – Thread API Summary. 15
UTILITIES AND APPLETS: Dictionary Class – Hash Tables – String
Tokenizer – Runtime – System Class – Comparison – Input and Output – File
IV 15
Directory – Filename Filter- File Streams*.
APPLETS: HTML Applet Tab – Order of Applet initialization – Sizing
Graphics – Simple Graphics Method – Draw line – Draw Arc – Font
V 15
Manipulation – Simple Image Loader –Image Observer* – Summary.
<* - Self study>

Text Book:
1. Partick Naughton, “The Java Hand Book”, Tata McGraw Hill Pvt. Ltd., Fourth Reprint,
1997. (Unit – I – V)

Reference Books:
1. E Balagurusamy, “Programming with Java a Primer”, McGraw Hill Publisher (India), Fifth Edition,
2015.
2. C. Muthu, “Programming with Java”, Tata McGraw Hill Pvt. Ltd (India), Second Edition, 2008.
3. R. Krishnamoorty, S. Prabhu, “Internet and Java Programming”, New Age International Pvt. Ltd.,
First Edition, 2006.
E-references:
 http:/www.edureka.co/blog/java-tutorial/
 https://www.tutorialspoint.com/java/java_basic_syntax.html/
 https://www.geeksforgeeks.org/java-applet-basics/

Mapping with Programme Specific Outcomes

PSO PSO1 PSO2 PSO3 PSO4 PSO5

CO
CO1 S L H M S
CO2 H M S H S
CO3 S H M M S
CO4 M S S H H
CO5 S H S H S
S - Strong; H - High; M - Medium; L – Low

25
 Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT06 Course Title: Batch: 2023
Semester: III
Total Hours: 60 Relational Database Management
Systems Credits: 4.0
(Common for CS/IT/BCA/CT/AI & DS)
Course Objective
The course aims
To educate students with fundamental concepts of RDBMS, models, different database
languages.
To design and develop a relational database system with appropriate functionality to
process data with constraints data integrity to avoid data redundancy.
To learn SQL and use normal forms to reduce anomalies in relations.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcome

Gain good understanding of Database Architecture and entity-relationship

K1, K2 CO1 modeling.
Get knowledge about normalization techniques and relational algebra &
K1, K2, K4 CO2 Calculus to design a relational database system effectively.
K1, K2, K3 CO3 Able to describe and use the basic SQL commands efficiently.
Demonstrate the concept of SQL objects like indexes, sequences, views
K1, K2, K3 CO4 and synonyms in SQL.
K1, K2, K3 CO5 Explore about PL/SQL techniques.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate
SYLLABUS
No. of
Unit Content
Hours
INTRODUCTION: RDBMS Terminology – The Relational Data Structure -
Relational Data Integrity – Codd‟s Rules. s Rules. DATABASE ARCHITECTURE AND 12
I DATA MODELING: Conceptual, Physical and Logical Database Models – Database
Design – Design Constraints – Functional Dependencies. ENTITY RELATIONSHIP
MODELING: E-R Model – Components of an E-R Model, E-R Modeling Symbols.
DATA NORMALIZATION: Introduction – First (1NF), Second (2NF), Third (3NF),
Boyce-Codd Normal Form (BCNF), Fourth (4NF), Fifth (5NF) Normal Forms,
Denormalization, RELATIONAL ALGEBRA AND RELATIONAL 12
II CALCULUS:Relational Algebraic operations: union, intersection, difference,
Cartesian product, select, project, rename, join, division. – Tuple Relational Calculus,
Domain Relational Calculus.
26
 SQL PLUS: Menus – commands – Editing the Command Line – The Describe
Command – The COLUMN Command- Basic SQL: SQL Language Basics – The 12
III SELECT Command – Data Types* – Expressions and operators – Functions – The
INSERT Command – The UPDATE Command – The DELETE Command.
DATA INTEGRITY: Types – Integrity Constraints. CREATING AND
MANIPULATING TABLES: The CREATE TABLE Command – Modifying
Tables– Deleting a Table. INDEXES: Creating Indexes – Changing an Index.
IV SEQUENCES: The create sequence command – Pseudo columns – Deleting, 12
Changing, using Sequence. VIEWS: How a view works? – Creating a View –
Deleting a View – Replacing a View. SYNONYMS: Creating, Renaming and
Removing Synonyms.

PL/SQL: Blocks – Control Structures* – Integrating SQL in a PL/SQL Program.

TRIGGERS: Components – Types – Creating, Modifying, Enabling/Disabling a
V Trigger, Deleting, Replacing a Trigger – STORED PROCEDURES AND 12
FUNCTIONS: Creating, Executing, Deleting a Stored Procedure – Functions, Cursors
– Transactions.
<* - Self Study>

Text Books:
1. Alexis Leon & Mathews Leon, “Database Management Systems”, Vikas Publishing
House Pvt. Ltd., 1999. (Unit I, II)
2. Jose A. Ramalho, “Learn Oracle 8i”, BPB publications, 2000. (Unit III, IV, V)
Reference Books:
1. Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, McGraw
Hill., 2009.
2. Ramez Elmasri, Shamkant B. Navathe, “Database Systems [Models, languages,
Design and Application programming]”, Sixth Edition, Pearson Education, 2013.
3. Ivan Bayross, “SQL, PL/SQL the Programming Language of Oracle”, BPB Publications
Pvt. Ltd., Third Revised Edition, 2005.
4. Rajesh Narang, “Database Management Systems”, PHI Learning Private Ltd.,Second
Edition, 2012.
5. R.Pannerselvam, “Database Management Systems”, PHI Learning Private Ltd., Second
Edition 2011.
E-references:
1. https://www.w3schools.com/sql/sql-intro.asp/beginner-sql-tutorial.com/sql-comands.htm
2. https://www.tutorialspoint.com/sql/sql_tutorial.pdf
3. https://searchsqlserver.techtarget.com/definition/database-management-system

Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 S H M M M
CO2 S S H H M
CO3 S S M H H
CO4 S S H M M
CO5 S S M H M
S-Strong; H-High; M- Medium; L-Low
27
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UBCT03 Course Title: Batch: 2023

Semester: III
Total Hours: 75 Allied Core : Cloud Computing
Credits: 5.0

Course Objective(s)

The student will know Cloud Computing basics and its services which include SaaS, PaaS, and IaaS. It
also deals with different types of cloud storage and its know how the Cloud Computing is changing various
industries.
Course Outcomes (CO)

K1 CO1 Get acquainted with the term Cloud computing.

K2 CO2 Understand various types of free and commercial clouds.

K3 CO3 Understands various types of cloud services like SaaS. PaaS and IaaS.

K4 CO4 Illustrate the fundamental concepts of cloud storage and demonstrate their use in storage
systems.
K5 CO5 To analyze various cloud programming models.

SYALLBUS
No. of
Unit Contents Hours
I CLOUD COMPUTING- An overview: Introduction-History of Cloud 15
Computing- Characteristics of Cloud-Issues and Challenges for Cloud
Computing –Advantages & Disadvantages—Security, Privacy and Trust -
Threats to Cloud Computing-Next Generation of Cloud Computing
II CLOUD COMPUTING ARCHITECTURE: Cloud Architecture - Cloud 15
Computing Models: Service models: SaaS - PaaS - IaaS – HaaS -
DEPLOYMENT MODEL: Public Cloud-Private Cloud-Community Cloud-
Hybrid Cloud-IDAAS
III VIRTUALIZATION IN CLOUD: Virtualization- Implementation- 15
Virtualization support at the OS level- Middleware support for
Virtualization-Advantages – Applications - Implementation Techniques -
Hardware Virtualization-Types - Load Balancing in Cloud Computing
IV WEB SERVICES: Introduction- Amazon Web Services: components and 15
Services- Working of EC2- Benefits of EC2- MICROSOFT AZURE:
Services provided by Azure- Virtual Machines - Storage-Virtual Networks-
SQL Databases-Mobile Services

28
 V CLOUD COMPUTING APPLICATIONS: Business Applications: Benefits 15
- Cloud Applications for Small Business- Finance and Banking
Applications*- Cloud Computing in Education.
<* - Self Study>

Text Book:

1. V.K.Pachehare, “Cloud Computing”, PHI Learning Pvt, Ltd.,2016.

Reference books:

1. Jeremy Allen & Charless Hornberger, “PHP, Apache, Mysql, web development”, Wiley
Publications,
2006.
2. Vikram, Vaswani,”A Beginner's Guide PHP”, Tata McGraw Hill, fourth Edition, 2005.

E-Reference:
1. https://www.w3schools.com/php/
2. https://www.tutorialspoint.com/php/php_introduction.htm
3. https://www.geeksforgeeks.org/php-mysql-database-introduction/
4. https://www.tutorialspoint.com/mysql/mysql-introduction.html

Mapping with Programme Specific Outcomes

PSO PSO5
PSO1 PSO2 PSO3 PSO4
CO

CO1 M S S M H

CO2 S M S H M

CO3 H H M M S

CO4 S M M H H

CO5 S M H S L

S-Strong; H-High, M- Medium, L- Low

29
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACTP3 Course Title: Batch: 2023
Major Core Programming Lab - III: Semester:
Total Hours: 60 (Java Programming) III
(Common for CS/IT/BCA/CT/AI & Credits:
2.0
DS)

Course Objective
The course aims
To gain knowledge about basic Java language syntax and semantics to write Java
programs.
To write programs for the concepts of object oriented programming include classes,
inheritance, packages, interfaces and exception handling and applet programming.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
K1, K2, K5 CO1 Write programs using simple data types.
K1, K2, K5 CO2 Write programs using classes, control statements, arrays and strings.
K1, K2, K3,
CO3 Write programs using inheritance, interface and exception handling.
K5
K1, K2, K3,
CO4 Write programs for thread creation and implementation.
K4, K5
K3, K4, K5 CO5 Write programs for utilities and applets.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

SYLLABUS
1. Write a java program to find the number of odd, even and prime numbers.
2. Write a java program to display Floyd‟s Rules. s triangle upto the given limit.
3. Write a java program to (i) display the number in reverse order (ii) find the sum of the digits.
4. Write a java program to count the number of vowels in the given string.
5. Write a java program to arrange the given set of names in alphabetical order.
6. Write a java program to find matrix multiplication for the given numbers.
7. Write a java program to perform arithmetic and scientific operations.
8. Write a java program to perform stack operation using Interface.
9. Write a java program to display any two subject marks and sports marks of the student and find
the total marks using Interface.
10. Write a java program to handle different Exceptions.
11. Write a java program for i) assigning thread priority ii) executing thread methods yield(), stop()
and sleep().
12. Write a java program for traffic light simulation using Applet.

30
13. Write a java program to display digital clock using Applet.
14. Write a java program to display different fonts using Applet.
15. Write a java program using File to get the string and display it using Byte stream classes.

Text Book:
1. Partick Naughton, “The Java Hand Book”, Tata McGraw Hill Pvt. Ltd., Fourth Reprint, 1997.

Reference Books:
1. E Balagurusamy, “Programming with Java A Primer”, McGraw Hill Publisher (India),
Fifth Edition, 2015.
2. C. Muthu, “Programming with Java”, Tata McGraw Hill Pvt. Ltd (India), Second
Edition, 2008.
3. R. Krishnamoorty, S. Prabhu, “Internet and Java Programming”, New Age International
Pvt. Ltd., First Edition, 2006.
E-references:
1. https://www.edureka.co/blog/java-tutorial/
2. https://www.tutorialspoint.com/java/java_basic_syntax.htm
3. https://www.geeksforgeeks.org/java-applet-basics/
Mapping with Programme Specific Outcomes
PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 S L M H M

CO2 H M S H S

CO3 S H S M graphicS

CO4 H H S M H

CO5 S H S H S
S-Strong; H-High; M- Medium; L-Low

31
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACTP4 Course Title: Batch: 2023
Programming Lab - IV: (RDBMS) Semester: III
Total Hours: 60 (Common for CS/IT/BCA/CT/AI
& DS) Credits: 2.0

Course Objective
The course aims
To understand MYSQL Commands to work with tables in a
database.
To create SQL queries with different features.
To make the students to know about the various concept of PL/SQL.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
Remember the DDL, DML commands and write simple commands using
K1, K2, K5 CO1
them.
K1, K2, K3, Understand foreign key and nested query concepts and apply them for
CO2
K5 tables.
Understand PL/SQL concept and write programs using PL/SQL
K1, K2, K5 CO3
commands.
Analyze Trigger, sequence, exception handling concepts and apply them
K2, K4, K5 CO4
for tables.
K2, K3, K4, CO5 Analyze and write program using functions, stored procedure and tables.
K5
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

SYLLABUS
1. Write SQL commands to create table for employee details, alter table, update and delete values in
that table.
2. Write a SQL command to create table and write queries with built- in functions for the following
constraints.
1. Comparison, logical and set operators
2. Sorting and grouping operators built- in functions for ceil, sysdate

32
 3. Minus, square, round, length, count and sum.
3. Create a table called „product‟s Rules. with the following details:
S.No Field Name Date made of Constraints

1 Product code First Characters,,P’’ other Should not be empty and should be made
3 characters are digits of unique values
2 Product name Alphabets Should not be empty

3 Qty on hand 9999 Should not be empty

4 Cost price (RS) 9999.99 Format Should not be empty

1. Insert at least 15 records for that table.

2. List of all products having „a‟s Rules. as the second letter in their names.
3. List the Product codes and names where the Cost price is greater than Rs.100/-
4. List the Product codes where the quantity on hand is more than 50.
List the Product Name, Qty on hand, Cost price and the Total cost price of each product.
4. Create a table SSLC mark (Regno, Name, Tamil mark, English mark, Maths mark, Science mark,
Social science mark) with the necessary integrity constraints. Write SQL statements to
1. Find the topper in the class.
2. Find the names of the students who have scored more than 90 percent marks in each
subject.
3. Find the Names of student who have scored centum in Maths.
4. List the Names and total marks of students who have scored more than 75 in the Maths and
Science subjects put together.
5. List the names of the students and their marks in the language who have scored more than 60%
5. in each of the language papers.
Create two tables one called EMP and another called DEPT with EMP having Employee
Number,
Employee Name, Department Number, Salary, Commission, Manager Number and the DEPT
table with Department Number, Department Name and Department Location.
Write SQL queries to:
1. List the names of all the employees having salary of atleast Rs.5000/-
2. List the names of employees and also the names of their managers.
3. List the names of all employees with manager name as “Ram”.
4. List the names of all employees whose total earning is more than Rs.7500/-
5. List the details of employees working in the production department.
6. List all the programmers working in Chennai.
7. List the names of all employees whose salary is greater than the average salary of their
department.
8. List the names of all the managers.
9. List the names of the Accounts department whose salary is either Rs.2500 or Rs.5000/-
10. List the names, salaries of employees of the Accounts department who are not earning any
commission

6. Write a PL/SQL program to find and display the number of ones, tens, hundreds and thousands in
the given number.
7. Write a PL/SQL program to find the number of occurrences of a character in the given string.
8. Write a PL/SQL program to check Armstrong number condition for 3 digits numbers and
Ramanujam number condition for 4 digits number.
9. Write a PL/SQL program to display names of the employees in the employee table whose names
are palindrome.

33
10. Write a PL/SQL program with recursive concept to create a set of value for ROLL NO using a
sequence and store the generated ROLL NO in the ROLL NO field of the student table.

11. Write a Trigger to store the deleted records of the Department table in to a record table.
12. Write a PL/SQL program to raise divide by Zero Exception.
13. Write a PL/SQL program for fixing the salaries of employee using functions.
14. Write a PL/SQL program to calculate the commission payable to employee of the employee table
using stored procedures.
15. Write a PL/SQL program to split the SSLC mark sheet table into two tables with one containing
the names of passed students and the other one containing the names of failed students.

Text Books:
1. Alexis Leon & Mathews Leon, “Database Management Systems”, Vikas Publishing
House Pvt. Ltd., 1999.
2. Jose A. Ramalho, “Learn Oracle 8i”, BPB publications, 2000.
Reference Books:
1. Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, McGraw
Hill., 2009.
2. Ramez Elmasri, Shamkant B. Navathe, “Database Systems [Models, languages, Design
and Application programming]”, Pearson Education, Sixth Edition, 2013.
3. Ivan Bayross, “SQL, PL/SQL the Programming Language of Oracle”, Third Revised
Edition, BPB Publications Pvt Ltd, 2005.
E-references:
1. http://www.leon-leon/ds/edbms
2. http://www/pearsoned.co.in/Atulkahate
3. https://www.w3schools.com/sql/sql-intro.asp/beginner-sql-tutorial.com/sql-comands.htm
Mapping with Programme Specific Outcomes
PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 H S M M S
CO2 S S H H M
CO3 M S H S H
CO4 H M H M S
CO5 S S M H S
S-Strong; H-High; M- Medium; L-Low

34
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT07 Course Title: Batch: 2023
Semester: IV
Total Hours: 60 Visual Programming
(Common for IT & CT) Credits: 4.0

Course Objective
The course aims
To introduce computer programming using the visual basic programming language
with object oriented programming concepts.
To emphasis is on event driven programming methods, including creating and
manipulating objects, classes, and using object oriented tools such as the class debugger.
To upon completion, students should be able to design, code, test and debug at a
beginning level.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
K1, K2, K4 CO1 Able to learn visual programming basics and its components.
K1, K2, K3, To Learn Windows Forms, common controls, design-view, code view,
CO2 class diagram view
K4, K5
K1, K2, K3, Cover visual programming skills needed for modern software
CO3 development.
K5
K1, K2, K3, Learn the Visual Basic syntax, program structure, properties, modules,
CO4 procedure, functions with the event-driven programming model.
K5
K1, K2, K3,
CO5 Make familiar with Database connectivity and Window Programming.
K5
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate
SYLLABUS
No. of
Unit Content
Hours
INTRODUCTION TO VISUAL BASIC: Introduction – Features of VB –
Visual Basic Concept- Visual basic environment – Properties, Methods and
I Events – Debugging – Difference between .Exe And .Dll file. VB 12
PROGRAMMING BASICS: Introduction – Keyword – Data Types – Variables
– Literals – Operators in VB – Some useful Function.
WORKING WITH CONTROLS: Introduction – Intrinsic and Container
II Control – Working with Controls – Create Event Procedure – Manipulating 12
Forms – Basic Controls – Control Arrays – Some useful Events – ActiveX
Control – Object Linking and Embedding (OLE) – Dialog box.

35
 CONTROL STRUCTURE: Introduction – Control flow – Decision Structures
– If...Then Statement – Select...Case Statement – Looping Structure – For...next
III – Do loop Structure – While...Wend – Problems with loop – Arrays – 12
Dimension of an Array – Declaring Array – Static and Dynamic Array – Arrays
within UDTs – Array within another Array.
PROCEDURES, FUNCTIONS AND MODULES: Introduction – Procedures
IV – Sub Procedures(Sub-routines) – Function Procedure – Passing Parameters to 12
Procedures – Property Procedure – Code module –Library Function*.
VB INTERFACE STYLE: Introduction – Interface Style – Creating Menus –
Designing Menus – Popup Menus. ERROR HANDLING AND FILE
HANDLING: Introduction – Types of Error – Handling Errors – Trap the Error
V – Handle the Error – File Handling. DATABASE CONNECTIVITY AND 12
VISUAL DATABASE TOOLS: Introduction – DB Concepts – Data access
mechanism – DB Engine – VB Data Control – Company Database – Visual
Database Tools*.
<* - Self study>

Text Book:
1. Dr.Narendra Kumar, Shilpi Srivastava, Rajesh Chadhary, Hariom Pancholi. “Visual
Basic”, Vayu
Education of India, First Edition, 2011. (Unit I – V)

Reference Books:
1.Mohammed Azam, “Programming with Visual Basic 6.0”, Vikas Publishing House Pvt. Ltd,
First Reprint, 2009.
2.Gray Cornell, “Visual Basic 6.0 from the Ground up”, Tata McGraw Hill, 2013.
3.N.Krishnan, N.Saravanan, “Mastering Visual Basic 6.0 In 30 Days”, SciTech Publications
Pvt. Ltd, Reprint, 2012.
4.Hasit Mehta, Radhika Raval, “Visual Basic Applications & Programming”, Acme Learning
Pvt. Ltd, First Edition, 2010.
E-references:
1. https://lecturenotes.in/materials/17698-note-of-visual-basic-by-magesh-kid
2. https://www.scribd.com/doc/24339321/Visual-Basic-6-0-Notes-short
3. https://www.uotechnology.edu.iq/appsciences/filesPDF/material/lectures/2c/5-
Computer1.pdf
4. https://www.vbtutor.net/vb6/vb6_preview.pdf
Mapping with Programme Specific Outcomes
PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 H S H S H
CO2 S H S S S
CO3 H S S H S
CO4 S H M S H
CO5 S H S H H
S-Strong; H-High; M- Medium; L-Low

36
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT08 Course Title: Batch: 2023
Semester: IV
Total Hours: 60 Web Technology
Credits: 4.0

Course Objective
The course aims
• To learn the syntax, semantics and applications of web design languages which include
HTML, JAVASCRIPT and DHTML.
• To learn the syntax and use of XML documents.
• To develop static and dynamic websites
. Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcome
K1, K2, K3, Obtain knowledge to create website using the various elements of
K5 CO1 HTML which include text, list, table, image, hyperlink and form tags.
K1, K2, K3,
K4 CO2 Develop a website using the programming constructs of JavaScript.
Gain knowledge about Form, String, Math & Date objects, User defined
K2, K3, K4 CO3 objects of JavaScript.
Create dynamic and attractive WebPages using CSS properties of
K2, K3, K4 CO4 dynamic HTML.
K1, K2, K3, Gain knowledge about XML for describing data using DTD, CSS and
K5 CO5 XSL style sheets.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

SYLLABUS
No. of
Unit Content
Hours
INTRODUCTION TO HTML - Hyper Text Markup Language, HTML Tags,
Structure of HTML program, Titles and Footers, Text Formatting, Heading Styles,
I Text styles and other text effects. Lists - Adding Graphics to HTML documents - 12
Tables - Linking documents - Frames - Forms - Sample programs.

INTRODUCTION TO JAVASCRIPT - JavaScript in web pages, Advantages of Java

script, Writing Java script into HTML, Basic Programming Techniques, Operators
II and expressions in Java script, Java Programming Constructs, Condition Checking, 12
Loops*, Built-in and User Defined Functions, Placing text in a Browser, Dialog
boxes
- Sample programs.

37
 THE FORM OBJECT - Methods, Properties & methods of Form elements, Text,
Password, Button, Submit, Reset, Checkbox, Radio, TextArea, Select & Option
III elements. Built-in objects in JavaScript - String, Math & Date objects. User defined 12
objects- creating a user defined object, Instances, Objects within Objects.

DYNAMIC HTML - Cascading Style Sheets (CSS) - Font attributes*, Color and
background attributes, Text attributes, Border attributes, Margin attributes, List
IV 12
attributes - Class - using the <SPAN> tag-External style sheets - using the <DIV>
tag
- Sample programs.
INTRODUCTION TO XML – Introduction, XML Fundamentals, Document Type
Definitions, XML Parsers, Entities. Document Type Definitions (DTD) – Internal
V DTD, External DTD, Element declarations, Attributes, Creating Attribute Lists, DTD 12
symbols, Entities. XML Style Sheets (XSL) – Introduction, Cascading Style Sheets,
eXtensible Style Sheet Language (XSL), Presenting Data in the Tabular Format.
Sample programs.
<* - Self Study>

Text Books:
1. Ivan Bayross, “Web Enabled Commercial Application Development Using HTML,
JavaScript, DHTML and PHP”, BPB Publications, Fourth Edition, 2010. [UNITS – I -
IV]
2. A.K.Saini and Sumit Tuli, “Mastering XML”, EXCEL BOOKS Pvt. Ltd., First Edition,
2002. [UNIT V]
Reference Books:
1. Ravinder Singh, Amit Gupta, “Magic with HTML, DHTML & JAVASCRIPT”,
University Science Press, First Edition, 2009.
2. C. Xavier, “World Wide Web Design with HTML”, Tata McGraw Hill Education Pvt.
Ltd., Thirteenth Reprint, 2010.
3. Ann Navarro, Chuck White, “Mastering XML”, BPB Publication, First Indian Edition,
2000. E-references:
1. https://www.w3schools.com/
2. https://www.tutorialspoint.com/xml/xml_overview.htm
3. https://www.javatpoint.com/javascript-tutorial

Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5
CO1 H L H H M
CO2 H M S H S
CO3 S M S H S
CO4 S H S M H
CO5 S H S H S
S-Strong; H-High; M-Medium; L-Low

38
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACTP5 Course Title: Batch: 2023
Programming Lab -V : Semester: IV
Total Hours: 60 (Visual Programming)
(Common for IT & CT) Credits: 2.0

Course Objective
The course aims
 To understand the structure of visual programming.
 To learn usage of basic concepts of visual programming.
 To know how to use Lists, Database Connectivity, Functions in visual programming
programs.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcome

K1, K2, K5 CO1 Construct and execute basic programs in Visual programming.
K1, K2, K5 CO2 Identify and repair coding errors in a program.

K1, K2, K3, K5 CO3 Use primitive data types, control statements, functions to write Programs.

K1, K2, K3, K4,

CO4 Use of controls in Visual programming.
K5
K1, K2, K3, K4, Develop programs to solve a variety of problems in science, business, and
K5 CO5 games.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

S. No. SYLLABUS
1 Write a VB equivalent Program to find the sum of digits of the given number. Write
2 a VB equivalent Program to exchange items among two list boxes.
3 Write a VB equivalent Program to change the text foreground color and textbox Background color
using scroll bar.
4 Write a VB equivalent Program to check whether the given string is palindrome or not.
5 Write a VB equivalent Program to replace the given character and to find the number of
occurrences of the given character.
6 Write a VB equivalent Program to find the factorial value and generate the Fibonacci series for the
given number.
7 Write a VB equivalent Program to move the text in the label box using slider control. Write a
8 VB equivalent Program to change the size of an image in a picture box.
9 Write a VB equivalent Program to use the various options of the common dialog boxes.

39
 10 Write a VB equivalent Program for moving an image randomly within a window using timer control.
11 Write a VB equivalent Program to design a calculator for performing arithmetic Operations. Write a
12 VB equivalent Program to draw different shapes using menu editor.
13 Write a VB equivalent Program to view the employee details stored in a database table using
MYSQL.
14 Write a VB equivalent Program to generate a telephone bill stored in a database table using
MYSQL.
15 Write a VB equivalent Program to generate student mark sheet stored in a database table using
MYSQL.

Text Book:
1. Dr.Narendra Kumar, Shilpi Srivastava, Rajesh Chadhary, Hariom Pancholi. “Visual
Basic”, Vayu
Education of India, First Edition, 2011.

Reference Books:
1. Mohammed Azam, “Programming with Visual Basic 6.0”, Vikas Publishing House Pvt
Ltd, First Reprint, 2009.
2. Gray Cornell, “Visual Basic 6.0 from the Ground up”, Tata McGraw Hill, 2013.
3. N.Krishnan, N.Saravanan, “Mastering Visual Basic 6.0 In 30 Days”, SciTech Publications
Pvt. Ltd, Reprint, 2012.
4. Hasit Mehta, Radhika Raval, “Visual Basic Applications & Programming”, Acme
Learning Pvt. Ltd, First Edition, 2010.
E-references:
1. https://lecturenotes.in/materials/17698-note-of-visual-basic-by-magesh-kid
2. https://www.scribd.com/doc/24339321/Visual-Basic-6-0-Notes-short
3. https://www.uotechnology.edu.iq/appsciences/filesPDF/material/lectures/2c/5-Computer1.pdf
4. https://www.vbtutor.net/vb6/vb6_preview.pdf

Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 S S M S S
CO2 S S M H S
CO3 S S H S H
CO4 S M S S H
CO5 H S S S H
S-Strong; H-High; M- Medium; L-Low

40
 Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACTP6 Course Title: Batch: 2023
Programming Lab - VI : Semester: IV
Total Hours: 60 (Web Technology)
Credits: 2.0

Course Objective
The course aims
 To develop static web design using HTML.
 To develop dynamic web design using DHTML and JavaScript Language.
 To develop XML programs using CSS and XSL style sheets.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcome

Create static web pages using HTML text level, list, table,
K3, K4 CO1 hyperlinks, frames and forms Tags.
Develop scripting programs using simple JavaScript programming
K3, K4, K5 CO2 constructs.
K3, K5 CO3 Write JavaScript program using objects.
Add various styles in web documents using Internal & External
K3, K4, K5 CO4 style sheets.
Develop XML applications to structure the document using DTD,
K3, K4, K5 CO5 CSS and XSL style sheets.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

SYLLABUS
HTML
1. Write a HTML program to design an invitation card using text level tags.
2. Write a HTML program to display transfer certificate application form using list tag.
3. Write a HTML program to display a student mark sheet using table tag.
4. Write a HTML program to design Gobi Arts & Science College website using hyperlinks.
5. Write a HTML program to design a website for product advertisement using frames.
6. Write a HTML program to design student Bio-data using forms tag.

41
 JAVASCRIPT
7. Write a JavaScript program to display stars based on the user input.
8. Write a JavaScript program to ask a question & accept an answer using Dialog Boxes.
9. Write a JavaScript program to display Current Date and Time.

DHTML
10. Write a DHTML program to design a webpage for super market offers using Internal Style Sheet.
11. Write a DHTML program to design a web page for company profile using External Style Sheet.
12. Write a DHTML program to display dynamic content based on the mouse place operations.

XML
13. Write a XML program to display bank details using XSL style sheet.
14. Write a XML program to display employee details using CSS style sheet.
15. Write a XML program to display book details using CSS style sheet.

42
Text Books:
1. Ivan Bayross, “Web Enabled Commercial Application Development Using HTML,
JavaScript, DHTML and PHP”, BPB Publications, Fourth Edition, 2010.
2. A.K.Saini and Sumit Tuli, “Mastering XML”, EXCEL BOOKS Pvt. Ltd., First Edition, 2002.
Reference Books:
1. Ravinder Singh, Amit Gupta, “Magic with HTML, DHTML & JAVASCRIPT”, University
Science Press, First Edition, 2009.
2. C. Xavier, “World Wide Web Design with HTML”, Tata McGraw Hill Education Pvt.
Ltd., Thirteenth Reprint, 2010.
3. Ann Navarro, Chuck White, “Mastering XML”, BPB Publication, First Indian Edition,
2000.
E-references:
1. https://www.w3schools.com/
2. https://www.tutorialspoint.com/xml/xml_overview.htm
3. https://www.javatpoint.com/javascript-tutorial
Mapping with Programme Specific Outcomes
PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 M H M M H
CO2 S S S H S
CO3 H M M M H
CO4 S H S H M
CO5 H S H H H
S-Strong; H-High; M-Medium; L-Low
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT09 Course Title: Batch: 2023

Python Programming Semester: V

Total Hours: 60
(Common for CS/IT/BCA/CT/AI&DS) Credits: 4.0

Course Objective
The course aims
 To learn core Python scripting elements such as variables and flow control structures.
 To acquire programming and Object Oriented Skills in Python.
 To learn file handling concepts and exception handling in Python.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcome
K1, K2, K5 CO1 Explain the basic principles of Python programming language.
K1, K2, K5 CO2 Express different Decision Making statements, Arrays and Strings.
K1, K2, K3,
K5 CO3 Describe the Functions, List, Tuples and Dictionaries.
K1, K2, K3,
K4, K5 CO4 Implement the concept of Object Oriented Programming.
K1, K2, K3, Understand and design Interfaces, Exceptions and different File
K4, K5 CO5 handling operations.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate
SYLLABUS
No. of
Unit Content
Hours
INTRODUCTION TO PYTHON: Python, Features of Python, Execution of
Python program, Python Virtual Machine (PVM) DATATYPES IN PYTHON:
Comments in Python, DocStrings, How Python sees Variables, Datatypes in
I Python, Built-in Datatypes, bool Datatype, Sequences in Python, Sets, Literals in 12
Python, Determining the Datatype of a Variable, What about Characters, User-
defined Datatypes, Constants in Python, Identifier and Reserved words, Naming
Conventions in Python. Operators in Python, Input and Output.

CONTROL STATEMENTS: Control Statements, The if Statement, A Word on

Indentation, The if...else Statement, The if...elif...else Statement, The while Loop,
The for Loop, Infinite Loops, Nested Loops, The else Suite, The break Statement,
The continue Statement, The pass Statement, The assert Statement, The return
Statement, ARRAYS IN PYTHON: Array, Advantages of Arrays, Creating an
II Array, Importing the Array Module, Indexing and Slicing on Arrays, Processing 12
the Arrays, Types of Arrays, STRING AND CHARACTERS: Creating Strings,
Length of a Sting, Indexing in Strings, Slicing the Strings, Repeating the Strings,
Concatenation of Strings, Checking Membership, Comparing Strings, Removing
spaces from a String, Finding SubStrings, Counting Substrings in a String, Strings
are Immutable, Replacing a String with another String, Splitting and Joining
Strings, Changing Case of a String, Checking Starting and Ending of a String,
String Testing Methods.
 FUNCTIONS: Difference between a Function and a Method, Defining a Function,
Calling a Function, Returning Results from a Function, Returning Multiple Values
from a Function, Functions are First Class Objects, Pass by Object Reference,
III Formal and Actual Arguments, Positional Arguments, Keyword Arguments, 12
Default Arguments, Variable Length Arguments, Local and Global Variables, The
Global Keyword, Passing a Group of Elements to a Function, Recursive Functions.
Lists and Tuples, Dictionaries.

INTRODUCTION TO OOPS: Classes and objects- Creating a Class, The self

IV Variable, constructor, Types of Variables, Namespace, Types of Methods, Passing 12
Members of One Class to Another Class, Inner Class. Inheritance and
Polymorphism.
ABSTRACT CLASSES AND INTERFACES: Method and class, Interfaces in
Python, Abstract classes Vs Interfaces, Exceptions- Errors in a python programs,
Exceptions, Exception Handling, Types of Exceptions, FILES IN PYTHON-
V Files, Types of File in Python, Opening a File, Closing a File, Working with 12
Text Files Containing Strings, Knowing Whether a File Exists or Not, Working
with Binary Files, The With Statement, The seek() and tell() Methods, Random
Accessing of Binary Files*.
<* - Self study>

Text Book:
1. Dr. R. Nageswara Rao, “Core Python Programming”, Second Edition, Dreamtech
Press, 2018. (Unit – I to V)
Reference Books:
1. B. Nagesh Rao, “Learning Python”, CyberPlus Infotech Pvt. Ltd., 2016-17.
2. Mike McGrath, “Python – in easy steps”, McGraw Hill Education (India) Private
Limited, 2013.
3. Ashok Namdev Kamthane, Amit Ashok Kamthane, “Programming and Problem Solving
with PYTHON”, McGraw Hill Education (India) Private Limited, 2018.
4. Reema Thareja, “Problem Solving and Programming with Python”, Oxford University
Press, 2018.
E-references:
1. https://www.tutorialspoint.com/python/index.htm
2. https://www.learnpython.org/
3. https://www.geeksforgeeks.org/python-programming-examples/
Mapping with Programme Specific Outcomes
PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5
CO1 S S S S H
CO2 S S S S H
CO3 S S S S H
CO4 S S S S H
CO5 S S S S H
S-Strong; H-High; M-Medium; L-Low
Programme Code: B.Sc Programme Title: Computer Technology
Course Code: 23UACT10 Course Title: Batch: 2023
Semester: V
Total Hours: 60 Big Data with R
Credits: 4.0

Course Objective
The course aims
 To explore the concepts of huge data complexities and the need of big data with R.
 To provide basic understanding on Hadoop framework and Map Reduce.
 To Understand the R basic data types, structures, commands and visualize the results of
statistical functions.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcome

Understand the basics of big data, various types of analytics and

K2 CO1 applications of big data in business context.
Understand the limitations of traditional approaches and the need of
K1, K2 CO2 Hadoop framework and Map Reduce for analyzing big data.

K1, K2, K3 CO3 Understand the NOSQL databases and Spark architecture

K1, K2, K3, Gaining Knowledge about basic R commands and advanced data
CO4 structures.
K4, K5
K1, K2, K3, Apply group manipulation and statistical techniques, design and
CO5 develop R programs for big data.
K4, K5
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate
SYLLABUS
No. Of
Unit Content Hours
Wholeness of Big Data: Introduction-Understanding Big Data-Capturing Big
Data-Benefitting from Big Data. Big Data Sources and Applications: Big Data
I Sources-M2M communication-Big Data Applications. Big Data Architecture: 12
Standard Big Data Architecture.

DISTRIBUTED COMPUTING USING HADOOP: Hadoop Framework -HDFS

design goals- Master-Slave Architecture-YARN. PARALLEL PROCESSING
II WITH MAP REDUCE: Map Reduce Overview – Map Reduce Jobs Execution- 12
Hadoop Streaming-Hive Language – Pig Language.
NOSQL DATABASES: RDBMS Vs NoSQL* –Types of NoSQL Databases-
III Architecture of NoSQL. STREAM PROCESSING WITH SPARK: Spark 12
Architecture-Spark for Big Data Processing.
BASICS OF R: Basic Math-Variables-Data Types-Vectors-Missing data.
IV
ADVANCED DATA STRUCTURE: Data frames-Lists-Matrices*-Arrays.
12
WRITING R FUNCTIONS: Function Arguments-Return Values-do.call.
CONTROL STATEMENTS: if and else-switch-ifelse-Compound Tests.
V 12
 LOOPS: for-while-Controlling Loops. GROUP MANIPULATION: Apply
Family-Aggregate-plyr.
<* - Self study>

Text Books:
1. Anil Maheshwari,Big Data,Mc Graw Hill Education(Units I-III).
2. Jared P.Lander, R for Everyone - Advanced Analytics and Graphics, Addison Wesley Data &
Analytics Series, Pearson india Education Services, Second Edition, 2019 (Units IV - V).
Reference Books:
1. Dr. Mark Gardener, Beginning R- The Statistical Programming Language, Wiley Publications, 2014.
2. Big Data Black Book, DT Educationl Services, Dreatech Press, 2016
E-references:
1. https://www.tutorialspoint.com/r/index.htm
2. https://www.w3schools.com/r/default.asp
3. https://www.datamentor.io/r-programming/examples/

Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 S M H L S
CO2 S H S M M
CO3 H M S S S
CO4 H H S S S
CO5 M H H S S
S-Strong; H-High; M- Medium; L-Low
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT11 Course Title: Batch: 2023
Software Engineering Semester: V
Total Hours: 60
(Common for CS/IT/CT) Credits: 4.0
Course Objective
The course aims
 To make the students to understand the basic concepts of software engineering and software
development process.
 To understand the concept of project management and project planning activities.
 To know the concept of software requirements and software maintenance.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
K1, K2 CO1 Remember and understand the software engineering process.
Understand and describe the concept of project management process
K1, K2 CO2
and planning estimation.
Remember the building block of software requirements and
K1, K2, K3 CO3
software design process.
K1, K2, K3 CO4 Describe the concept of software implementation and software testing.
Understand the concepts of software quality, software maintenance
K1, K2, K3 CO5
process.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS
No. of
Unit Content
Hours
INTRODUCTION TO SOFTWARE ENGINEERING: Software – Software
Crisis– What is software Engineering? – Evolution of Software Engineering
I Methodologies – Software Engineering Challenges – SOFTWARE PROCESS: 12
Software Process – Phased Development Life Cycle – Software Development
Process Models.
SOFTWARE PROJECT MANAGEMENT: Project Management Essentials –
What is Project Management? – Project Management Team – Project Life Cycle
II – Project Management Process – PROJECT PLANNING AND ESTIMATION: 12
Project Planning Activities – Software Metrics and Measurements – Project Size
Estimation – Effort Estimation Techniques – Staffing and Personnel Planning –
Project Scheduling and Milestones-Task Identification-Work Breakdown
Structure.
REQUIREMENTS ENGINEERING: Software Requirements – Requirement
Engineering Process – Requirement Analysis – Requirements Specification –
III Requirement Validation. SOFTWARE DESIGN: Software Design Process – 12
Characteristic of Good Software Design –Design Principles – Modular Design –
Software Architecture – Design Methodologies – Structured Design.
IMPLEMENTATION: Coding Principles – Coding Styles – Coding Errors –
IV SOFTWARE TESTING: Testing Fundamentals – Black Box Testing – White 12
Box Testing* – Levels of Testing.
 SOFTWARE QUALITY AND RELIABILITY: Software Quality Concepts –
Software Quality Factors – Verification and Validation - Software Quality
V Assurance– Quality Control – Best Practices of Software Engineering – Software 12
Reliability. SOFTWARE MAINTENANCE: Software Change – Software
Evolution – Software Maintenance* – Maintenance Cost – Software Reuse.
<* - Self study>

Text Book:
1. Ugrasen Suman, “Software Engineering Concepts and Practices”, Cengage Learning, First
Edition, 2013. (Unit I - V).
Reference Books:
1. Roger S. Pressman, “Software Engineering: A Practitioners Approach”, Tata McGraw Hill
Publications, Fourth Edition, 1997.
2. Timothy C.Lethbridge & Robert Laganière, “Object-Oriented Software Engineering: Practical
Software Development using UML and Java”, Tata McGraw-Hill, Second Edition, 2005.
3. P. Jalote, “An Integrated Approach to Software Engineering”, Narosa Publication House,
Third Edition, 2008.
E-references:
 https://www.guru99.com/what-is-software-engineering.html
 https://en.wikipedia.org/wiki/Software_engineering
 https://www.tutorialspoint.com/software_engineering
Mapping with Programme Specific Outcomes
PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S M H M H
CO2 H M S H L
CO3 M S S S L
CO4 M S M M S
CO5 H H H H H
S-Strong; H-High; M-Medium; L-Low
 Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT12 Course Title: Batch: 2023
Client Server Computing Semester: V
Total Hours: 60
(Common for CS/IT/CT) Credits: 4.0

Course Objective
The course aims
 To learn specific knowledge of client/server concept.
 To know about the types and architecture of client/server.
 To understand the components and processing model of client/server.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcome

K1 CO1 Remember the basic knowledge on server types and building blocks.
K2 CO2 Understand the concept of SQL database servers and data warehouse.
K3 CO3 Apply on transaction processing models and TP monitors.
K4 CO4 Analyze knowledge about groupware.
K5 CO5 Evaluate distributed objects and components.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate
SYLLABUS
No. of
Unit Content
Hours
INTRODUCTION TO CLIENT/SERVER COMPUTING: What is client/server?,
File Servers, Database Servers, Transaction Servers, Groupware Servers,
I Object/Servers, Web Servers, Middleware, Fat Servers, Fat Clients, 2-tier versus 12
3-tier. CLIENT/SERVER BUILDING BLOCKS: Operating Systems, Base
Services, Extended Services, Server Scalability - Remote Procedure Call (RPC),
Messaging and Queuing.

SQL DATABASE SERVERS: SQL and Relational Databases, SQL Database

Server Architecture, Stored Procedures, Triggers and Rules DATA
II WAREHOUSE: OLTP, Information Hounds, DSS, EIS, Elements Of Data 12
Warehousing, Warehouse Hierarchies, Replication Versus Direct Access, The
Mechanics Of Data Replication.
CLIENT/SERVER TRANSACTION PROCESSING: The ACID
III Properties,Transaction Models, TP MONITORS: TP Monitors, Transactions 12
Management Standards.
CLIENT/SERVER GROUPWARE: Importance of Groupware,
IV 12
Groupware,Components of Groupware*.
DISTRIBUTED OBJECTS AND COMPONENTS: Benefits of distributed
objects, From Distributed Objects to components, 3- tier Client/Server, Object
V Style – CORBA – Distributed Objects, CORBA style, OMG's Object 12
Management Architecture, Object Request Broker (ORB), Anatomy of a CORBA
2.0 ORB, CORBA Object Services, CORBA Common Facilities*.
<* - Self study>
Text Book:
1. Robert Orfali, Dan Harkey and Jeri Edwards, “The Essential Client/Server Survival
Guide”, Galgotia Publications Pvt. Ltd., Third Edition, 2001. (Unit I-V)
Reference Books:
1. Steve Bobrowski, “Oracle 7.0 and Client/Server Computing”, BPB Publications, Second
Edition, 1996.
2. Patrick Smith, Steve Guengerich, “Client/Server Computing”, PHI Learning, Second
Edition, 2012.
3. Dawna Travis Dewire, “Client/Server Computing”, Tata McGraw Hill, First Edition, 2003.
4. Dr.A.Murugan, Dr.K.Shyamala, T.Sunitha Rani, “Client/Server Computing”, Margham
Publications, First Edition, 2016.
E-references:
1. https://www.webopedia.com/Computer_Science/Client_Server_Computing
2. https://simple.wikipedia.org/wiki/Client-server
Mapping with Programme Specific Outcomes
PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 S H M M M
CO2 S S H M M
CO3 M H S S H
CO4 H S S H H
CO5 M M H H S
S-Strong; H-High; M- Medium; L-Low
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACTP7 Course Title: Batch: 2023
Programming Lab - VII : Semester: V
Total Hours: 60 (Python Programming)
Credits: 2.0
(Common for CS/IT/BCA/CT/ AI&DS)
Course Objective
The course aims
 To learn core Python scripting elements such as variables and flow control structures.
 To acquire programming and Object Oriented Skills in Python.
 To learn file handling concepts and exception handling in Python.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
CO
Knowledge Level Number Course Outcome
K1, K2, K5 CO1 Explain the basic principles of Python programming language.
K1, K2, K5 CO2 Express different Decision Making statements, Arrays and Strings.
K1, K2, K3, K5 CO3 Describe the Functions, List, Tuples and Dictionaries.
K1, K2, K3, K4,
K5 CO4 Implement the concept of Object Oriented Programming.
K1, K2, K3, K4, Understand and design Interfaces, Exceptions and different File
K5 CO5 handling operations.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate
S. No. SYLLABUS
1. Write a Python program to print prime numbers.
2. Write a Python program to check the given string is palindrome or not.
3. Write a Python program to print Fibonacci series.
4. Write a Python program to find the factorial value for a given number using recursive function.
5. Write a Python program to count the total number of vowels, consonants and words in a text
sentence.
6. Write a Python program to perform stack operations using list.
7. Write a Python program to perform queue operations using list.
8. Write a Python program to perform built in functions of list manipulation.
9. Write a Python program to create a file.
10. Write a Python program to read and displays file content.
11. Write a Python program to print the calendar.
12. Write a Python program to display student details using simple class.
13. Write a Python program to implement the concept of constructor.
14. Write a Python program to perform operator overloading.
15. Write a Python program to implement the concept of single inheritance.

Text Book:
1. Dr. R. Nageswara Rao, “Core Python Programming”, Second Edition, Dreamtech Press, 2018.
(Unit – I to V)
Reference Books:
1. B. Nagesh Rao, “Learning Python”, CyberPlus Infotech Pvt. Ltd., 2016-17.
2. Mike McGrath, “Python – in easy steps”, McGraw Hill Education (India) Private Limited,
2013.
3. Ashok Namdev Kamthane, Amit Ashok Kamthane, “Programming and Problem Solving with
PYTHON”, McGraw Hill Education (India) Private Limited, 2018.
4. Reema Thareja, “Problem Solving and Programming with Python”, Oxford University Press,
2018.
E-references:
1. https://www.tutorialspoint.com/python/index.htm
2. https://www.learnpython.org/
3. https://www.geeksforgeeks.org/python-programming-examples/

Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5
CO1 S S S S H
CO2 S S S S H
CO3 S S S S H
CO4 S S S S H
CO5 S S S S H
S-Strong; H-High; M-Medium; L-Low
 Programme Code: B.Sc Programme Title: Computer Technology
Course Code: 23UACTP8 Course Title: Batch: 2023
Programming Lab- VIII : Semester: V
Total Hours: 60 (Big Data using R) Credits: 2.0

Course Objective
The course aims
 To explore the concepts of huge data complexities and the need of big data with R.
 To provide basic understanding on Hadoop framework and Map Reduce.
 To Understand the R basic data types, structures, commands and visualize the results of statistical
functions.

Course Outcomes (CO)

On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcome

Understand the basics of big data, various types of analytics and

K2 CO1 applications of big data in business context.
Understand the limitations of traditional approaches and the need of
K1, K2 CO2 Hadoop framework and Map Reduce for analyzing big data.
Understand the NOSQL databases and Spark architecture
K1, K2, K3 CO3

K1, K2, K3, Gaining Knowledge about basic R commands and advanced data
K4, K5 CO4 structures.
K1, K2, K3, Apply group manipulation and statistical techniques, design and
K4, K5 CO5 develop R programs for big data.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS
1. Write a R program to take input from the user (name and age) and display the value also print
the version of R installation.
2. Write a R program to create a sequence of numbers from 20 to 50 and find the mean of numbers
from 20 to 60 and sum of numbers from 51 to 91.
3. Write a R program to create a simple bar plot of five subjects marks.
4. Write a R program to append value to a given empty vector.
5. Write a R program to multiply two vectors of integers type and length 3.
6. Write a R program to create three vectors a,b,c with 3 integers. Combine the three vectors to
become a 3x3 matrix where each column represents a vector .print the content of the matrix.
7. Write a R program to concatenate two given matrices of same column but different rows.
8. Write a R program to merge two given lists into one list.
9. Write a R program to create a frame from four given vectors.
10. Write a R program to find the levels of factor of a given vector.
11. Write a R program to find whether given number is positive, negative or zero.
12. Write a R program to find factorial to given number using while loop.
13. Write a R program to find sum of digits of a number using for loop.
14. Write a R program to create an ordered factor from data consisting of the names of months.
15. Write a R program to read number and print corresponding day name in a week.
Text Books:
1. Anil Maheshwari,Big Data,Mc Graw Hill Education.
2. Jared P.Lander, R for Everyone - Advanced Analytics and Graphics, Addison Wesley Data &
Analytics Series, Pearson india Education Services, Second Edition, 2019.
Reference Books:
1. Dr. Mark Gardener, Beginning R- The Statistical Programming Language, Wiley Publications,
2014.
2. Big Data Black Book, DT Educationl Services, Dreatech Press, 2016
E-references:
 https://www.tutorialspoint.com/r/index.htm
 https://www.w3schools.com/r/default.asp
 https://www.datamentor.io/r-programming/examples/

Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 S M H L S
CO2 S H S M M
CO3 H M S S S
CO4 H H S S S
CO5 M H H S S
S-Strong; H-High; M- Medium; L-Low

Programme Code: B.Sc. Programme Title: Computer Technology

Course Code: 23UACT13 Course Title: Batch: 2023
 Major Core : Programming with PHP Semester: VI
Total Hours: 75 (Common for CS/IT/BCA/CT) Credits: 4.0
Course Objective
The course aims
1. To understand the syntax and semantics of the PHP Scripts and MYSQL Database.
2. To develop and implement various types of dynamic web pages in the PHP Scripts.
3. To apply the PHP Scripts in the appropriate applications.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO Course Outcome
Level Number
Remember the PHP Scripts along with MySQL and understand the
K1, K2 CO1
components of PHP and various operators.
Understand the various techniques of scripts, functions and how it
K2, K3, K5 CO
is implemented in website developing.
Working with Date and Time functions in PHP and also investigate
K2 CO3
the object and String functions.
Be aware of the dynamic web page with HTML Forms and
K2, K3, K5 CO4
PHP Script.
Know about the Files, directories and creating and using Images
K2, K3, K4 CO5
in PHP Scripts.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate
SYLLABUS
No. of
Unit Content
Hours
INTRODUCTION OF PHP: What is PHP? Advantages of PHP –PHP
Language structure: The Building blocks of PHP – Variables – Data types –
I type casting – Operator and Expressions – Constants - INTRODUCTION TO 15
MYSQL: Data types – table creation - insert, select, replace, update and delete
commands – using where in your Queries.
FLOW CONTROL FUNCTION IN PHP: Switching Flow–Loops*–code
block and browser output. Working with Arrays: Array definition-Creating
II Arrays–Array Related Functions–WORKING WITH FUNCTION: Definition- 15
Calling functions- Defining a function-returning values from user defined
functions-variable scope-static statement-more about arguments-testing for
existence of a function.
WORKING WITH STRINGS, DATE AND TIME: Formatting strings with
III PHP – Investigating strings in PHP – Manipulating strings with PHP – using 15
Date and Time functions– Working with objects: Creating an object –
properties of object – object methods – constructors - Object Inheritance.
WORKING WITH FORMS: Creating a simple input form * – Accessing
form – combining HTML and PHP code on a single page – using hidden fields
to save state – redirecting the user – sending mail on form submission -
IV working with file uploads – WORKING WITH COOKIES AND USER 15
SESSIONS: Introducing cookies – setting a cookies– Deleting a cookie –
session function – starting a session - working with session variables – passing
session IDs - Destroying sessions and unsetting variables.
 WORKING WITH FILES AND DIRECTORIES: Including files with
include() – validating files - Creating and Deleting file – opening a file
for writing, reading and appending – reading from files – Writing or
V appending to a file - WORKING WITH DIRECTORIES - Opening pipes to 15
and from processes using popen()- Running commands with exec(), system()
or passthru() – Working with images: Image creation process – Drawing a
new image – Creading pie charts – modifying existing images – using
images created by scripts.
<* - Self study>

Text Book:
1. Julie C. Meloni, “PHP, MYSQL and Apache”, Dorling Kindersley (India) Pvt. Ltd., 2005.
(Unit I – V)
Reference Books:
1. Jeremy Allen & Charles Hornberger, “PHP, Apache, MySQL Web development”,
Wiley Publications, First Edition, 2006.
2. Vikram Vaswani, “A Beginner’s Guide PHP”, Tata McGraw Hill Education Pvt.
Ltd., Fourth Edition, 2005.
3. Steven Holzner, “PHP: The Complete Reference”, Tata McGraw Hill Education Pvt.
Ltd., First Edition, 2008.
4. Sheldon Moes, “Beginning MYSQL”, Wiley Publications, Fourth Edition, 2005.
E-references:
1. https://www.www3schools.com
2. http://www.spoken-tutorial.org
3. https://www.studytonight.com

Mapping with Programme Specific Outcomes

PSO PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S H L M S
CO2 S S M M L
CO3 H S H H H
CO4 S S S S M
CO5 S S M S H
S-Strong; H-High; M-Medium; L-Low
 Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACT14 Course Title: Batch: 2023
Computer Networks Semester: VI
Total Hours: 75
(Common for CS/IT/BCA/CT) Credits: 4.0
Course Objective
The course aims
• To acquire basic knowledge in networking environments and its applications in the area of
business and others.
• To learn about how to use network software and hardware with network environment.
• To learn about networks layers.
• To learn about network protocol and internet using networks.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcome
Understand the basics knowledge about computer networks and
K2, K4 CO1 public switched telephone networks.
Understand the fundamentals of elementary data link protocol and
K2, K3 CO2 sliding window protocols.
K1, K2, K3,
K5 CO3 Know about various operations of algorithms in networks.
K2, K3, K4 CO4 Learn about various types of protocol and layers.
Acquire knowledge about computer networks domain name system
K2, K4, K5 CO5 and electronic mail using internet.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS
No. of
Unit Content
Hours
INTRODUCTION – Uses of Computer Networks – Network Hardware –
I Network software – Reference models –PHYSICAL LAYER – Guided 15
transmission media, the Public switched telephone network.
DATA LINK LAYER – Data link layer design Issues – Elementary data
II link protocols – Sliding window protocols. 15
NETWORK LAYER – Network layer design issues – Routing algorithms –
III Congestion control algorithms. 15

TRANSPORT LAYER – The transport service* – Elements of transport

IV 15
protocols
– The internet transport protocols: UDP
THE APPLICATION LAYER – Domain Name System – Electronic Mail* –
V 15
The World Wide Web.
<* - Self study>
Text Book:
1. Andrew S. Tanenbaum, “Computer Networks”, Prentice Hall of India, Fourth Edition, 2007.
( UNITS I – V)
Reference Books:
1. Larry Peterson & Bruce S.Davie, “Computer Networks a Systems Approach”, Elsevier,
Fourth Edition, 2007.
2. Douglas E.Comer, “Computer Networks and Internets", Pearson Education, Fourth Edition,
2004.
3. William Stallings, “Computer Networking with Internet Protocols and Technology", Pearson
Education, First Impression, 2007.
4. Uyless Black, “Computer Networks”, PHI learning private limited, Second Edition, 2010.
E-references:
1. https://www.geeksforgeeks.org/computer-network-tutorials
2. https://www.tutorialspoint.com/data_communication_computer_network/index.html
3. https://www.softwaretestinghelp.com/computer-networking-basics

Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5
CO1 M H H M H
CO2 H H S H S
CO3 S S M M M
CO4 H S M H S
CO5 H S H S M
S-Strong; H-High; M-Medium; L-Low
 Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UECT01 Course Title: Batch: 2023
Major Skill Based Paper : Semester: VI
Total Hours: 90 Computer Graphics
Credits: 4.0
(Common for CS/IT/BCA/CT)
Course Objective
The course aims
• To provide comprehensive introduction about computer graphics system.
• To design algorithms and two dimensional transformations.
• To facilitate the students elaborately know about computer graphics techniques in C
programming.
• To implement the computer graphics techniques to solve the variety of graphics problems.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO Course Outcome
Level Number
K1, K2, K3, CO1 Design algorithms and two dimensional transformations.
K5
Familiar with techniques of clipping, three dimensional graphics
K1, K2, K3 CO
and three dimensional transformations.
K1, K2, K4, Actively involving in design, development and testing of
CO3
K5 modeling, rendering, shading and animation.
Implement various graphics drawing algorithms, 2D-
K2, K4 CO4
3D transformations and clipping techniques.
K1, K2, K3, Practical knowledge about color modeling and its application
CO5
K5 procedures.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate
SYLLABUS
No. of
Unit Content
Hours
OVERVIEW OF GRAPHICS SYSTEMS: Video Display Devices – Input
I Devices. Output Primitives: Points & Lines – Line Drawing Algorithm – 18
DDA Algorithm – Bresenham's Line Algorithm – Circle Generating
Algorithms.
TWO DIMENSIONAL GEOMETRIC TRANSFORMATIONS: Basic
Transformations - Matrix Representations & Homogeneous Co-ordinates -
Composite Transformations: Translations, Rotations, Scalings – General
II Pivot-Point Rotation, Fixed Point Scaling - Reflection and Shear 18
Transformations.
TWO DIMENSIONAL VIEWING: The Viewing Pipeline – Window to
Viewport Coordinate Transformation. Clipping Operations – Point Clipping –
Line Clipping – Cohen-Sutherland Line Clipping – Polygon Clipping:
Sutherland- Hodgeman Polygon – Curve Clipping – Text Clipping – Exterior
Clipping. Interactive Picture Construction Techniques.
THREE DIMENSIONAL CONCEPTS: Three Dimensional Display Methods.
Three Dimensional Object Representations: Polygon Surfaces - Curved Lines
III and Surfaces. THREE DIMENSIONAL GEOMETRIC AND MODELLING 18
TRANSFORMATIONS: Translation – Rotation – Coordinate Axes Rotations
– General Three Dimensional Rotations – Scaling - Reflection and Shear
Transformations.
 VISIBLE-SURFACE DETECTION METHODS: Classification of Visible-
Surface Detection Algorithm – Back-Face Detection – Depth-Buffer Method -
IV 18
Scan-Line Method- Depth-Sorting Method - Area-Subdivision Method -
Octree Method - Curved Surfaces*.
COLOR MODELS AND COLOR APPLICATIONS: Properties of Light -
Standard Primaries and the Chromaticity diagram - Intuitive Color Concepts -
V 18
RGB Color Model – YIQ Color Model – CMY Color Model* - HSV
Color Model – HLS Color
Model.
<* - Self study>

Text Book:
1. Donald Hearn & M. Pauline Baker, “Computer Graphics”, Prentice Hall of India, Second
Edition, 2003.
Reference Books:
1. Roy A.Plastock, Gorden Kalley, “Theory & Problems of Computer Graphics”, Schaum's
Outline Series, 1987.
2. R.K.Chauvan, Abhishek Taneja, “Computer Graphics & Multimedia”, Galgotia
Publications Pvt. Ltd, 2009.
3. D.P.Mukherjee, Debasish Jana, “Computer Graphics Algorithms and Implementations”,
PHI Learning Private Ltd, 2010.
4. Edward Angel, “Interactive Computer Graphics – A Top Down Approach using
OpenGL”, Pearson Publications, Fifth Edition, 2013.

E-references:
1. https://www.tutorialspoint.com/computer_graphics/index.htm
2. https://www.javatpoint.com/computer-graphics-tutorial
3. https://www.programmingsimplified.com/c-graphics-programming-tutorial

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S H H H M
CO2 S S H S S
CO3 H H S S H
CO4 H M S S H
CO5 S M H M H
S-Strong; H-High; M-Medium; L-Low
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UACTP9 Course Title: Batch: 2023
Major Core Programming Lab - IX: Semester: VI
Total Hours: 60 (Programming with PHP)
Credits: 2.0
Course Objective
The course aims
1. To understand the syntax and semantics of the PHP Scripts and MYSQL Database.
2. To develop and implement various types of dynamic web pages in the PHP Scripts.
3. To apply the PHP Scripts in the appropriate applications.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Level Number Course Outcome
Remember the PHP Scripts along with MySQL and understand the
K1,K2 CO1 components of PHP and various operators.
Understand the various techniques of scripts and how it is implemented
K2,K3,K5 CO2 in website developing.
Working with Date and Time functions in PHP and also investigate
K2 CO3 the object and String functions.
K2,K3,K5 CO4 Be aware of the dynamic web page with combining HTML and PHP.
K2,K3,K4 CO5 Learn about the File manipulation, directories and Images in PHP
Scripts.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

SYLLABUS
1. Write a PHP program to validate the text box.
2. Write a PHP program to draw different shapes.
3. Write a PHP program to perform the string manipulation.
4. Write a PHP program to perform the file uploading.
5. Write a PHP program to perform the user registration form using HTML tags.
6. Write a PHP program to display the date and time using AJAX.
7. Write a PHP program to check the user login.
8. Write a PHP program to create a college website.
9. Write a PHP program for cookies and session concepts.
10. Write a PHP program to perform the file read, write, open and append operation.
11. Write a PHP program to create a library information using inheritance.
12. Write a PHP program for online examinations.
13. Write a PHP program to send the mail using mail concept.
14. Write a PHP program for supermarket.
15. Write a PHP program for online recharging.

Text Book:
1. Julie C. Meloni, “PHP, MYSQL and Apache”, Dorling Kindersley (India) Pvt. Ltd., 2005.

Reference Books:
 1. Jeremy Allen & Charles Hornberger, “PHP, Apache, MySQL Web development”, Wiley
Publications, First Edition, 2006.
2. Vikram Vaswani, “A Beginner’s Guide PHP”, Tata McGraw Hill Education Pvt. Ltd., Fourth
Edition, 2005.
3. Steven Holzner, “PHP: The Complete Reference”, Tata McGraw Hill Education Pvt. Ltd.,
First Edition, 2008.
4. Sheldon Moes, “Beginning MYSQL”, Wiley Publications, Fourth Edition,
2005. E-references:
1. https://www.www3schools.com
2. http://www.spoken-tutorial.org
3. https://www.studytonight.com
Mapping with Programme Specific Outcomes
PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5
CO1 S H L M S
CO2 S S M M L
CO3 H S H H H
CO4 S S S S M
CO5 S S M S H
S-Strong; H-High; M-Medium; L-Low
Programme Code: B.Sc. Programme Title: Computer Technology
Course Code: 23UECTP1 Course Title: Batch: 2023
Major Skill Based Practical : Semester:
Programming Lab - X : VI
(Computer Graphics)
Total Hours: 60
(Common for IT & CT) Credits: 2.0

Course Objective
The course aims
• To provide a comprehensive study of graphics concepts using C programming language.
• To facilitate the students elaborately know about computer graphics techniques in C
programming.
• To implement the computer graphics techniques to solve the variety of graphics problems.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Number Course Outcome
Level
K3, K4 CO1 Apply and Analyze the core concepts of computer graphics.
Analyze interactive computer graphics using C graphics packages
K3, K5 CO2 and apply graphics primitives and attributes.
Evaluate the coordinate attributes and apply with coordinate spaces,
K3, K5 CO3 coordinate conversion and transformations of graphics objects.
Apply, Analyze and Evaluate 2D & 3D geometrical transformations
K3, K4, K5 CO4 and its representations.
K3, K5 CO5 Apply and Analyze the color models and its applications.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

SYLLABUS
1. Write a C program to plot a Line using DDA Line Drawing Algorithm.
2. Write a C program to plot a Line using Bresenham’s Line Drawing Algorithm.
3. Write a C program to plot a Circle using Bresenham’s Circle Drawing Algorithm.
4. Write a C program to plot a Circle using Mid-Point Circle Drawing Algorithm.
5. Write a C program to display a Man Walking using Stick Simulation.
6. Write a C program to Clip a Line Using Line Clipping Algorithm.
7. Write a C program for Flag Hoisting.
8. Write a C program for Text Animation.
9. Write a C program to display different shapes.
10. Write a C program for Eye Blinking.
11. Write a C program to display a Chess Board.
12. Write a C program to display a clock.
13. Write a C program for 2D Translation.
14. Write a C program for 2D Rotation about fixed point.
15. Write a C program for 2D Scaling about fixed point.
Text Book:
1. Donald Hearn & M. Pauline Baker, “Computer Graphics”, Prentice Hall of India,
Second Edition, 2003.
Reference Books:
1. Roy A.Plastock, Gorden Kalley, “Theory & Problems of Computer Graphics”,
Schaum's Outline Series, 1987.
2. R.K.Chauvan, Abhishek Taneja,“Computer graphics & Multimedia ”, Galgotia
Publications Pvt. Ltd, 2009.
3. D.P.Mukherjee, Debasish Jana, “Computer Graphics Algorithms and Implementations”,
PHI Learning Private Ltd, 2010.
4. Edward Angel, “Interactive Computer Graphics – A Top Down Approach using
OpenGL”, Pearson Publications, Fifth Edition, 2013.
E-references:
1. https://www.tutorialspoint.com/computer_graphics/index.htm
2. https://www.javatpoint.com/computer-graphics-tutorial
3. https://www.programmingsimplified.com/c-graphics-programming-tutorial
Mapping with Programme Specific Outcomes

PSO
CO PSO1 PSO2 PSO3 PSO4 PSO5

CO1 H H M S M
CO2 H S S S S
CO3 S S H M S
CO4 S S S S H
CO5 M H M M L
S-Strong; H-High; M-Medium; L-Low

65
 Question Paper Pattern
(Common for Major, Allied, Allied Optional and Major Optional Papers)

For EOS Examinations: 75 Marks

The Question Paper is to be divided into THREE Sections.

Section-A Carries 10 Marks, Section-B Carries 25 Marks and Section-C Carries 40 Marks.

Section-A Contains 10 Multiple Choice Questions. (10 x 1 = 10 Marks)

Two Questions from each unit. (Q. No: 1 to 10)

Section-B Contains 5 Either or Choice Questions. (5 x 5 = 25)

Each Question carries 5 Marks. Both (a) and (b) from the same unit.
Q. No.: 11 (a) or (b) to 15 (a) or (b)

Section-C Contains 5 Either or Choice Questions. (5 x 8 = 40)

Each Question carries 8 Marks. Both (a) and (b) from the same unit.
Q. No.: 16 (a) or (b) to 20 (a) or (b)

For CIA Examinations: 25 Marks

CIA Test I and II Question Paper Pattern: (25 Marks)

Section-A: Five Multiple Choice Questions. (5 x 1 = 5)

Section-B: Two Questions with internal choice. (either or type) (2 x 5 = 10)

Section-C: One Question with internal choice. (either or type). (1 x 10 = 10)

Components of Continuous Internal Assessment (CIA)

Allotment of Internal Assessment

Components Marks for a Maximum of 100 Marks
(Converted into 25 Marks)
Two Tests (1 hour) [25+25=50/2] 25
Model Exam 75
CIA Total 100

66
Programme Code: ALL U.G. Programme Title: Allied Optional
Course Code: 23UDCS01 Course Title: Batch: 2023
Semester: IV
Total Hours: 90 Principles of Information Technology
Credits: 5.0
Course Objective
The course aims
 To understand the fundamental of computers.
 To gain knowledge about software terminologies.
 To know about the networks and internet concepts.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
K2,K3 CO1 Understand the fundamentals of computers and its applications.
K1,K4 CO2 Master the function of each element of a memory hierarchy.
K1,K2 CO3 Be familiar with input and output devices.
K3,K4,K5 CO4 Gain knowledge on Categories of Software.
K2,K4 CO5 Identify the basics of networks and to get familiar with internet concepts.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 - Evaluate

SYLLABUS
No. of
Unit Content
Hours
Computer Basics : Introduction – Characteristics of Computers – Evolution of
Computers – Generations of Computers – First Generation – Second Generation –
I Third Generation – Fourth Generation – Fifth Generation–Classification of Computers 18
–Micro computers – Minicomputers – Mainframes – Supercomputers – The Computer
Systems - Components of a Computer System – Applications of Computers.
Memory and Storage Systems: Introduction – Memory Representation – Random
II Access Memory – Static RAM – Dynamic RAM - Read only Memory – 18
Programmable ROM - Electrically Erasable PROM – *Flash ROM.
Input Devices: Introduction – Keyboard – Pointing Devices: Mouse – Trace ball –
Light pen – Joystick – Touch Screen. Output Devices: Introduction – Display
III 18
Monitors - Printers: Impact Printers - Dot Matrix Printers – Daisy Wheel Printers –
Drum Printers - Non-Impact Printers – Ink-jet Printers – *Laser Printers.
Computer Software: Introduction – Software: Definition – Relationship between
Software & Hardware –Categories of Software – System Software – Application
IV 18
Software - Installing and Uninstalling Software – Software Piracy – Types of Software
Piracy – Preventing Software Piracy – Software Terminologies.

67
 Computer Network : Types of Computer Networks –Network Topologies – Bus
Topology – Ring Topology – Star Topology – Tree Topology – Mesh Topology
- Communication Protocol – The OSI Model – The Internet : Introduction– Evolution
of Internet –Basic Internet Terms – Getting Connected to the Internet – Internet
V Applications - Electronic Mail (E-mail) - File Transfer Protocol (FTP) - Telnet – 18
Internet Relay Chat (IRC) - Chatting and Instant – Messaging – Internet Telephony –
Video Conferencing - Commerce through the Internet – Newsgroups (Usenet) -
Mailing Lists (Listserver) -Data Over the Internet – Static Component – Dynamic
component.
<* - Self Study>

Text Books:
1. “Introduction to Information Technology”, ITL Education Solutions Limited, PEARSON Education,
2008. (Unit I, IV, V)
2. Balagurusamy E, “Fundamentals of Computers”, McGraw Hill Publications Pvt Ltd, 2011. (Unit II,
III)
Reference Books:
1. Rizwan P. Ahmed, “Introduction to Information Technology”, Marghan Publications, 2016.
2. Saravanakumar R, Parameshwaran R, Jayalakshmi T, “ A TextBook of Information Technology”,
S.Chand & Company Ltd., 2007.
E-references:
1. https://www.tutorialspoint.com/fundamentals_of_science_and_technology/
information_technology.htm
2. https://www.geeksforgeeks.org/basics-of-computer-and-its-operations/

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S M H S H
CO2 S S M M H
CO3 S H S M S
CO4 S S H H M
CO5 S H M S S
S - Strong; H - High; M - Medium; L – Low

68
Programme Code: ALL U.G. Programme Title: Major Optional
Course Code: 23UFCT01 Course Title: Batch: 2023
Semester: V
Total Hours: 60 Print Media Technology
Credits: 3.0
Course Objective
The course aims
 To provide a basic study of Working with objects of Libre Office draw application.
 To facilitate the understanding of tools of Libre Office.
 To provide idea to work with shapes of CorelDraw.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
K1, K2 CO1 Remember and Understand the objects and its properties.
K1, K2 CO2 Remember and Understand the basic tools of CorelDraw.
Understand and Apply the basics of Open Office writer interface, find and
K2, K3 CO3
replace option, auto spell check options.
Remember, Apply and Analyze the basic commands for formatting the
K1, K3, K4 CO4
document.
Understand, Apply and Evaluate the CorelDraw tools, basic designs and
K2, K3, K5 CO5
shapes.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate
SYLLABUS
No. of
Unit Content
Hours
Creating and Modifying Objects Using Draw: Working with Objects -Creating &
Selecting an Object-Changing Outline & Fill Properties of an Object-Working with
I 12
Slides-Saving the Draw Document-Modifying Objects-Working on a Group-Quiting
the Application.
Tools: Knife Tool-Eraser Tool-Smudge Tool-Cloning objects-working with Artistic
II 12
Text-Paragraph Text-Text and Styles.
Exploring the Openoffice.org Writer Interface: Working with a Document-Editing
Document in Writer-Write Document-Exploring Selection Modes-Making Changes to
III a Document-Find and Replace Features-Autocorrect Context menu and Word 12
Completion Features-Spelling & Grammar Checker-Hyperlinks-Merging & Saving to
a Document.
Formatting the Document: Setting Page Margins-Headers and Folders working with a
IV Table-Formatting a Text in a Document*-Working with Graphics Templates- 12
Designing & Navigating the Document-Styles-Previewing & Printing a Document.
Creating Basic Shapes: Rectangle-Ellipse and Polygon-Using the Artistic Media Tool-
V Applying Preset to Lines-Drawing with Brushes-Applying the Sprayer-Combining 12
Objects*-Converting Objects to Curves.
<* - Self study>

69
Text Books:
 Vikas Gupta, ''Comdex Linux and Open Office Course Kit'', Dreamtech Press, First Edition 2010.
[Unit I, III, IV].
 Steve Bain, ''CORELDRAW 12:The Official Guide'', Dreamtech Press, First Edition, 2004. [Unit II,
V].
Reference Books:
 Andy Channelle, ''Beginning Open Office3'', Apress, First Edition, 2009.
 Shalini Gupta, Adity Gupta, ''Coreldraw 12 In Simple Steps'', Dreamtech Press, First Edition, 2006.
 A.K.Lodha, ''Coreldraw 12'', Law Point, First Edition, 2004.
E-references:
 http://www.spoken-tutorial.org
 https://www.tutorialsforopenoffice.org/category_index/wordprocessing.html
Mapping with Programme Specific Outcomes
PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S H H H S
CO2 S S S S H
CO3 H H L S H
CO4 H S M H M
CO5 H M M S S
S - Strong; H - High; M - Medium; L – Low

70
Programme Code: ALL U.G. Programme Title: Major Optional
Course Code: 23UFCTP1 Course Title: Batch: 2023
Semester: V
Total Hours: 60 Print Media Technology (Lab)
Credits: 1.0

Course Objective
The course aims
1. To provide a basic study of Working with objects of Libre Office draw application.
2. To facilitate the understanding of tools of Libre Office.
3. To provide idea to work with shapes of Libre Office Draw.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
K3, K4 CO1 Apply and Analyze the objects and its properties.
K3 CO2 Apply the basic tools of CorelDraw.
Apply and Evaluate the basics of Open Office writer interface, find and
K3, K5 CO3
replace option, auto spell check options.
K3, K4 CO4 Apply and Analyze the basic commands for formatting the document.
K3, K5 CO5 Apply and Evaluate the CorelDraw tools, basic designs and shapes.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate

S. No. SYLLABUS

1. Design a Blinking Text by using LibreOffice Draw.

2. Create a Invitation Card using LibreOffice Draw.
3. Create a Christmas Tree using a LibreOffice Draw.
4. Design a Logo by using LibreOffice Draw.
5. Design a National Flag using LibreOffice Draw.
6. Design a Natural Scenery by using LibreOffice Draw.
7. Design Traffic Signal by using LibreOffice Draw.
8. Design a Book Cover by using LibreOffice Draw.
9. Design a Flower by using LibreOffice Draw.
10. Design an General Advertisement by using LibreOffice Draw.

Text Books:
1. Vikas Gupta, ''Comdex Linux and Open Office Course Kit'', Dreamtech Press, First Edition 2010.
[Unit I, III, IV].
2. Steve Bain, ''CORELDRAW 12:The Official Guide'', Dreamtech Press, First Edition, 2004. [Unit
II, V].

71
Reference Books:
1. Andy Channelle, ''Beginning Open Office3'', Apress, First Edition, 2009.
2. Shalini Gupta, Adity Gupta, ''Coreldraw 12 In Simple Steps'', Dreamtech Press, First Edition, 2006.
3. A.K.Lodha, ''Coreldraw 12'', Law Point, First Edition, 2004.
E-references:
 http://www.spoken-tutorial.org
 https://www.tutorialsforopenoffice.org/category_index/wordprocessing.html

Mapping with Programme Specific Outcomes

PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 S H H H S
CO2 S S S S H
CO3 H H L S H
CO4 H S M H M
CO5 H M M S S
S - Strong; H - High; M - Medium; L – Low

72