Central University of Karnataka

ಕರ್ನಾಟಕ ಕೇಂದ್ರೀಯ ವಿಶ್ವವಿದ್ಯಾಲಯ

कर्नाटक कें द्रीय विश्वविद्यालय

B.Sc.-(CS)
Bachelor of Science (Computer Science/Mathematics)

Course Structure and CBCS Syllabus

(Draft)

Department of Computer Science

School of Computer Science

_________________________________________
Kadaganchi, Kalaburagi – 585 367, Karnataka State, INDIA
 CENTRAL UNIVERSITY OF Department of Computer Science
KARNATAKA School of Computer Science
(Established by an Act of the Parliament in 2009) Kadaganchi, Aland Road,
Kadaganchi, Kalaburagi – 585367, INDIA Kalaburagi District– 585367

Bachelor of Science ( Computer Science/Mathematics)

ABOUT PROGRAM
This is a Bachelor of Science program with Mathematics and Computer Science as major
courses and one minor course, which will be opted by a student of his/her choice prepared
as per the guidelines of NEP. The students study minor courses upto second year and in
third year there will be courses related to the Computer Science only for the students
opting Computer Science subject. There will be an exit option after completion of each year.
Selected students based on merit will have a chance to enter into the fourth year of the
programme.

ELIGIBILITY FOR ADMISSION

Students who have passed PU/Plus Two examination with 50% marks (45% for OBC {NON
CREAMY LAYER}, SC, ST, PWD and Kashmiri Migrant and non migrant pandits) and having
studied Physics, Chemistry and Mathematics). Depending on the subject taken in the third
year by merit-cum-choice, B.Sc. (Mathematics) or B.Sc. (Computer Science) degree will be
awarded.

DURATION OF COURSE
4 years (1 year Award of certificate + 2 year Award of diploma + 3 year Award Of Bachelor
Degree in Computer Science/ Mathematics + 4 year Bachelor Of Science In Research With
Computer Science/ Mathematics as MAJOR)

MEDIUM OF INSTRUCTION
The medium of instruction shall be English.

PASSING AND CLASSIFICATION

The minimum marks for passing and classification for the award of the Bachelor of Science
(Computer Science/Mathematics) Degree shall be as per the existing norms of other UG
degree courses of Central University of Karnataka, Kalaburagi.

OTHER PROVISIONS
All the other provisions relating to attendance, reappearance in examinations, repeal and
saving clauses, removal of difficulties, etc., shall be as per the existing norms of other UG
degree courses of Central University of Karnataka, Kalaburagi.

2
VISION STATEMENT:
To be a global center of excellence for teaching and research in mathematics and
computing science for the growth of science and technology.

MISSION STATEMENTS:
MS-1. To provide a stimulating teaching and research environment in mathematics
and computer science through updated curriculum, effective teaching and research
learning process.
MS-2. To inculcate innovative skills and ethical practices among students so as to
meet societal expectations.
MS-3. To provide the best possible facilities and produce the professionally
competent, socially committed students through quality education and research.

MS-4. Build highly skilled IT professionals.

MS-5. To groom the students to become technically competent and skilled
intellectual professionals to address the challenges in the current computing areas.

Qualification Descriptors (QDs)

QD-1: Ability to understand the use of various mathematical concepts for problem
solving and interpretation.
QD-2: Develop the specialized skills suited to newer domains with the usage of
Mathematica, Matlab, Maple and other open source software.
QD-3: Building the professional competence in terms of applying the mathematics
knowledge in interdisciplinary projects and research.
QD-4: To develop academically competent and professionally motivated personnel,
equipped with an objective.
QD-5: Ability to adapt critical thinking, right moral and ethical values that
compassionately
foster the scientific temper with a sense of social responsibility.
QD-6: An ability to design, implement and evaluate a computer-based system, process,
component, or Programme to meet stakeholder needs.

3
 Mapping Qualification Descriptors (QDs) with Mission Statements (MS)

MS-1 MS-2 MS-3 MS-4 MS-5

QD-1 3 2 3 1 3
QD-2 3 3 2 3 2
QD-3 2 3 1 1 3
QD-4 2 3 2 2 2
QD-5 2 2 3 2 3
QD-6 3 1 2 3 1

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

Program Learning Outcomes (PLOs)

PLO-1: Develop logical and critical thinking ability and solve mathematical problems
through analytical techniques.
PLO-2: Ability to formulate, analyze, and solve problems through semi-analytical and
numerical techniques and perform the computations to solve the problems.
PLO-3: Ability to use mathematical ideas and apply them to other disciplines when
appropriate.
PLO-4: Explain the knowledge of contemporary issues in applied sciences and crack the
competitive exams.
PLO-5: Perform research in conjunction with others as well as individually.
PLO-6: To develop computing and technological advances to the appropriate societal
problems.
PLO-7: Ability to provide solutions for the real time software product and hardware.
PLO-8: Explain the software and hardware knowledge and its issues in science and
engineering.
PLO-9: The ability to function effectively in teams to accomplish a common goal.
PLO-10: Bridge the gap between industry and academia.

4
 Mapping of Program Learning Outcomes (PLOs)
with Qualification Descriptors (QDs)

QD-1 QD-2 QD-3 QD-4 QD-5 QD-6

PLO-1
PLO-2
PLO-3
PLO-4
PLO-5
PLO-6 3 2 3 3 3 3
PLO-7 2 2 1 1 3 1
PLO-8 3 2 2 2 3 2
PLO-9 2 1 1 2 3 3
PLO-10 3 2 1 3 2 2

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

5
 Structure of the Syllabus – B.Sc. (UMACS)

Semester I
Co Dur
S In T Cr Duration End
urs atio IA
L Sl Sub / Course e sem. Total
e Title n of Exam (40
N N Code P Type di L+T+P Exam Marks
o typ (Hr (Min.) %)
o * ts (60 %)
e s)
0 UCSCC101 Discipline DSC Programming
01 T 6 4+4 4+0+2 180 60 90 150
1 00 Specific Core -1 using C/C++
0 Discipline DSC
02 T Mathematics-I 6 4+4 4+0+2 180 60 90 150
2 Specific Core -1
0 UCSTD101 MD Computer
03 T Generic Elective 3 3 3+0+0 120 30 45 75
3 00 C Fundamentals
0 UCSTM101 Web Designing
04 T Minors M1 3 2+2 2+0+1 120 30 45 75
4 00 Fundamentals
Ability
0 Enhancement AEC
05 T Language 2 2 2+0+0 90 20 30 50
5 Compulsory -1
Courses
0 Value Addition VAC Value Addition
06 T 2 2 2+0+0 90 20 30 50
6 Courses -1 Courses
2
27 550
2

6
 Semester II
Co Duratio
S In T End
urs Durat n of IA
L Sl Sub / Course Cred sem. Total
e Title ion L+T+ (40%
N N Code P Type its Exam Exam Marks
o typ (Hrs) P )
o * (Min.) (60 %)
e
0 UCSCC201 Discipline DSC
01 T Data structures 6 4+4 4+0+2 180 60 90 150
6 01 Specific Core 2
0 Discipline DSC
02 T Mathematics-II 6 4+4 4+0+2 180 60 90 150
7 Specific Core -2
0 UCSTD201 GE- Office
03 T Generic Elective 3 3 3+0+0 120 30 45 75
8 01 2 Automation
0 UCSCM201 Advanced Web
04 T Minors M-2 3 2+2 2+0+1 120 30 45 75
9 01 designing
Ability
1 Enhancement AEC Environmental
05 T 2 2 2+0+0 90 20 30 50
0 Compulsory -2 Science
Courses
Skill 3
1 UCSTS203 Enhancement SEC- Big Data
06 T courses 3 3+0+0 90 20 30 50
1 01 1 Analytics

22 27 550

7
 Semester II (Revised)
Co Duratio
S In T End
urs Durat n of IA
L Sl Sub / Course Cred sem. Total
e Title ion L+T+ (40%
N N Code P Type its Exam Exam Marks
o typ (Hrs) P )
o * (Min.) (60 %)
e
0 UCSCC200 Discipline DSC
01 T Data structures 6 4+4 4+0+2 180 60 90 150
6 02 Specific Core 2
Minor
0 DSC
02 T (Discipline Mathematics-II 6 4+4 4+0+2 180 60 90 150
7 Specific Core)
-2
Multi
0 UCSTG202 GE- Office
03 T Disciplinary 3 3 3+0+0 120 30 45 75
8 02
Course (GE)
2 Automation
Ability (Skill) Language
0 UCSTM201 2(+0+1 20(30
04 T Enhancement M-2 (Advanced Web 2(3) 2(+2) 90(120) 30(45) 50(75)
9 02
Courses designing) ) )
Value Added
Course (Ability Environmental
1 AEC
05 T Enhancement Science or 2 2 2+0+0 90 20 30 50
0 Compulsory
-2
Others
Courses)
1 UCSTS203 SEC (Minor) SEC- Big Data
06 T 2 2 2+0+0 90 20 30 50
1 01 1 Analytics

22 27 550

VAC:1: Yoga and Health; VAC:2.:Ethics and Human Values; VAC:3 Personal Development; VAC:4.Introduction to Indian
Knowledge System; VAC:5.Soft Skills; VAC. 6. Professional Development; VAC. 7. Employability Skills; VAC. 8.

8
Entrepreneurship Development; VAC:9 Community Engagement;

Semester III
Co Dur
S In T T Duration End
urs Cr atio IA
L Sl Sub / Course it sem. Total
e ed n of Exam (40
N N Code P Type l L+T+P Exam Marks
o typ its (Hr (Min.) %)
o * e (60 %)
e s)
1 Discipline DSC
01 T OOP using JAVA 6 4+4 4+0+2 180 60 90 150
2 Specific Core 3
1 Discipline DSC
02 T Mathematics-III 6 4+4 4+0+2 180 60 90 150
3 Specific Core -3
Computer
1 GE-
03 T Generic Elective Networks and 3 3 3+0+0 120 30 45 75
4 3
internet
1 M- Web designing
04 T Minors 3 2+2 2+0+1 120 30 45 75
5 2 using PHP
Skill
1 Enhancement SEC- Mathematical
06 T 2 2 2+0+0 90 20 30 50
6 courses 2 Logic

1 Value Addition VAC Android

07 T 2 1+2 1+0+1 90 20 30 50
7 Courses -2 Programming
2
28 550
2

9
 Semester IV
Co Dur
S In T Cr Duration End
urs T atio IA
L Sl Sub / Course e sem. Total
e it n of Exam (40
N N Code P Type di L+T+P Exam Marks
o typ le (Hr (Min.) %)
o * ts (60 %)
e s)
Computer
1 Discipline DSC Organization
01 T 6 4+4 4+0+2 180 60 90 150
8 Specific Core 4 and
Architecture
1 Discipline DSC Mathematics-
02 T 6 4+4 4+0+2 180 60 90 150
9 Specific Core -4 IV
Discipline
2 DSE Python
03 T Specific 4 4 4+0+0 150 40 60 100
0 Elective
-1 Programming

2 Generic GE- Basics of

04 T 2 2 2+0+0 90 20 30 50
1 Elective 4 Multimedia
2 M- Web designing
05 T Minors 2 1+2 1+0+1 90 20 30 50
2 4 using DJANGO
Skill
Python
2 Enhancement SEC
06 P Programming 2 4 0+0+2 90 20 30 50
3 courses -3
Lab

2
29 550
2

10
11
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science / Mathematics)

Course Code: Title of the Course: Programming using C/C++

L-T-P: 4-0-2 Credits: 6

Prerequisite Course / Knowledge (If any):

● The students should hold fundamental knowledge of Computers.

● The students should hold the skill set of basic Mathematics.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Describe about the variables and constants. (Level 2: Understand)
CO-2: Apply the concept of pointers and structures for execution of programs(Level 3:
Apply)
CO-3: Demonstrate the object oriented concepts. (Level 3: Apply)
CO-4: Discuss on file handling in c/c++. (Level 2: Understand)
CO-5: Explain the concept of exception handling. (Level 2: Understand)

Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)

PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 3 2 2 3 2 2 1 1 2 2
CO2 2 2 2 3 2 2 2 2 3 3
CO3 2 2 2 2 2 2 1 3 3 3
CO4 1 1 1 3 1 1 1 2 2 2
CO5 3 2 2 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

12
 Programming using C/C++

Credits: 6 IA: 60 Marks

Contact Hrs (L:T:P): 6 (4:0:2) End Exam: 90 Marks
Unit 1 (15 hrs)
Basics of programming: What is C/C++, started with c/c++, constants, variables, keywords, First
c and c++ program

Unit 2 (15 hrs)

Compilation and Execution, data types, operators and expressions, managing input and output
operations, Decision Making and Looping, Arrays, pointer, Structure.

Unit 3 (15 hrs)

Procedural vs Object Oriented Technology: Introduction, functions, types of functions,
principles of object oriented programming, classes and objects, Constructors and Desctructors,
Operator overloading, Inheritance, Virtual Functions, polymorphism.

Unit 4 (15 hrs)

Working with files: Introduction, File managing in C, Managing Console I/O Operations, Classes
for files operations, Exception Handling.

Reference Books:
1. E Balagurusamy, "Object Oriented Programming with C++",4th Edition, McGraw-Hill, 2001
2. E Balagurusamy, "Programming in ANSI C",5th Edition, McGraw-Hill, 2007

13
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science/ Mathematics)

Course Code: Title of the Course: Computer Fundamentals

L-T-P: 3-0-0 Credits: 3
Prerequisite Course / Knowledge (If any):
● Students should have basic knowledge of electronics.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Describe the basics and applications of computers. (Level 2: Understand)
CO-2: Explain the network system and its types. (Level 2: Understand)
CO-3: Discuss on features of windows operating system. (Level 2: Understand)
CO-4: Identify the services of the internet and its applications. (Level 2: Understand)
CO-5: Discuss types of Operating systems. (Level 2: Understand)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 3 3 3 3 2 2 1 1 2 2
CO2 3 2 2 3 2 2 2 3 2 2
CO3 2 2 3 2 2 2 3 2 2 2
CO4 3 1 2 3 1 1 2 3 1 1
CO5 3 3 3 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

14
 Computer Fundamentals
Credits: 3 IA: 30 Marks
Contact Hrs (L:T:P): 3 (3:0:0) End Exam: 45 Marks
Unit 1 (15 hrs)
Basics of Computer: Definition, Characteristics of Computers, Applications of Computer,
Generations of computers, Components of Computer System: Central Processing Unit (CPU),
Input/output Devices, Computer Memory: primary and secondary memory, magnetic and
optical storage devices, Concepts of Hardware and Software.

Unit 2 (15 hrs)

Network and Internet: History and evolution of Computer Network, Types of network (LAN,
MAN & WAN), Search engines, Types of Search engines, Internet, architecture of internet,
advantages and disadvantages of internet and its applications.

Unit 3 (15 hrs)

Operating system and Microsoft Windows: Definition & functions, basics of Windows,
components of windows, icons, types of icons, taskbar, activating windows, title bar, running
applications, exploring computer, managing files and folders, copying and moving files and
folders, Control panel – display properties, adding and removing software and hardware,
setting date and time, screensaver and appearance, windows accessories.

Reference Books:
1. P.B.Kottur (2009), Computer Concepts & C Programming, Sapna Book House.
2. V. Rajaraman (2008), Computer Fundamentals, Prentice Hall of India.
3. P.K. Sinha (1992), Computer Fundamental, Prentice Hall of India.

15
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science / Mathematics)

Course Code: , Title of the Course: Web Designing Fundamentals

L-T-P: 2-0-1 Credits: 3
Prerequisite Course / Knowledge (If any):
● The students should have basic knowledge of computers.

● The students should be well versed in operating the web sites.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Explain features for the Internet and World Wide Web. (Level 2: Understand)
CO-2: Demonstrating HTML concepts on portal design. (Level 3: Apply)
CO-3: Demonstration of client and server interface(Level 3: Apply)
CO-4: Practice the HTML and CSS features on real time requirements. (Level 3: Apply)
CO-5: Apply the logic for the creation of forms and frames (Level 3: Apply)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 3 3 3 3 2 2 1 1 2 2
CO2 2 3 2 3 2 2 2 2 3 3
CO3 3 3 3 2 2 2 1 3 3 3
CO4 2 2 2 3 1 1 1 2 2 2
CO5 3 3 3 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

16
 Web Designing Fundamentals
Credits: 3 IA: 30 Marks
Contact Hrs (L:T:P): 3 (2:0:1) End Exam: 45 Marks
Unit 1 (15 hrs)
Introduction to Internet: Definition, History of the Internet, Internet Service Providers,
Connection Types, Modems, DNS Servers, Internet connection using Dial-up Networking,
Routers, Internet Addresses, Protocols of Internet

Unit 2 (15 hrs)

World Wide Web: Introduction, URL, web pages, web clients, web server, webSite
Development, Web Content Authoring, Web Programming, Search Engines, Plug-ins, FTP
Applications.

Unit 3 (15 hrs)

Basics of HTML: Introduction, History of HTML, Structure of HTML Document: Text Basics,
HTML Elements, Attributes HTML Headings, Paragraphs, HTML Formatting, Fonts, Styles,
Images, Multimedia, Lists, Links, Document Layout, Creating Forms, Frames and Tables.

Reference Books:
1. Satish Jain, Shashank Jain (2010), Internet Technology and Web Design, BPB Publication.
2. Thomas Powell (2017), The Complete Reference: HTML & CSS, 5th Edition, McGraw Hill.
3. Lemay Laura (2016), Mastering HTML, CSS & Java Script, BPB Publications.
4. Deborah J. Miller (2001), Careers with Internet Service Providers, Rosen Publishing Group.
5. Bryan Sullivan, Vincent Liu (2012), Web Application Security, A Beginner's Guide, McGraw
Hill.

17
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science / Mathematics)

Course Code:, Title of the Course: Data structures

L-T-P: 4-0-2 Credits: 6

Prerequisite Course / Knowledge (If any):

● The students should hold fundamental knowledge of Computers.

● The students should hold the skill set of basic Mathematics.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Describe representation and functions of arrays. (Level 2: Understand)
CO-2: Analyze an algorithm for searching and sorting techniques in terms of time
complexity (Level 4: Analyze)
CO-3: Use stacks, linear lists and queues. (Level 3: Apply)
CO-4: Describe the Linked List (Level 2: Understand)
CO-5: Demonstrate the data structure concepts using ‘C’ programming. (Level 3: Apply)

Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)

PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 3 3 3 3 2 2 1 1 2 2
CO2 3 2 2 3 2 2 2 2 3 3
CO3 3 3 3 2 2 2 1 3 3 3
CO4 3 2 2 3 1 1 1 2 2 2
CO5 3 3 3 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

18
 Data structures
Credits: 6 IA: 60 Marks
Contact Hrs (L:T:P): 6 (4:0:2) End Exam: 90 Marks
Unit 1 (15 hrs)
Introduction and Array: Definition of data structure, data structure operations. Linear arrays,
Representation of linear arrays in memory, Address calculation of using row and column major
ordering, Traversing linear arrays, Inserting and Deleting, Multidimensional arrays:
Representation of Two-Dimensional arrays in memory.

Unit 2 (15 hrs)

Sorting & Searching: Introduction to Algorithm, Analysis of Time complexity of Selection,
Bubble, Merge, Quick, Heap Sort, and Sequential Search & Binary Search.

Unit 3 (15 hrs)

Stacks: Introduction, Array representation of stacks, Linked representation of stacks, Polish
notation, Evaluation of a Postfix Expression, Transforming Infix Expressions into Postfix
Expressions.

Unit 4 (15 hrs)

Queues and Linked List: Definition, Array representation of Queues, Linked representation of
Queues, Circular queues, Priority Queue and D-Queue. Linked Lists, Representation of Linear
Lists in memory, Traversing a Linked List, Searching a linked List, Insertion into a linked list,
Deletion from linked list.

Reference Books:
1. Seymour Lipchutz (1986), Theory and Problems of Data Structures, Tata Mc Grew.
2. Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J. Augenstein (2005), Data structure using
C and C++, II Edition, PHI Publications.
3. Jean – Paul Tembley and Paul G. Sorension (1983) An Introduction to Data Structures with
Applications, II Edition, Tata Mc Graw Hill.
4. Srivastava S K (2011), Data Structures Through C, IInd Edition, BPB.
5. Reema Thareja (2015), Introduction to C Programming, IInd Edition, Oxford publication.

19
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science / Mathematics)

Course Code:, Title of the Course: Office Automation

L-T-P: 3-0-0 Credits: 3

Prerequisite Course / Knowledge (If any):

● Students should have knowledge of operating computers.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Demonstrate the examples on MS-Word features. (Level 3: Apply)
CO-2: Describe the features of MS-Excel. (Level 2: Understand)
CO-3: Identify the operations for preparing presentations. (Level 2: Understand)
CO-4: Discuss on table creation in word file(Level 2: Understand)
CO-5: Explain data analysis features of MS-Excel(Level 2 : Understand)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 2 1 2 2 2 2 1 1 2 2
CO2 2 2 2 3 2 3 2 2 3 2
CO3 2 1 3 2 2 2 1 2 2 3
CO4 2 2 2 2 1 1 1 2 2 2
CO5 1 3 1 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

20
 Office Automation
Credits: 3 IA: 30 Marks
Contact Hrs (L:T:P): 3 (3:0:0) End Exam: 45 Marks
Unit 1 (15 Hrs)
Word Processing application: Working with Documents -Opening & Saving files, Editing text
documents, Formatting page & setting Margins, Importing & Exporting documents, Using
Toolbars, Ruler, Using Icons, Formatting Documents, Setting Page style, Creating Tables,
Drawing, Tools, Printing Documents – Shortcut keys.

Unit 2 (15 Hrs)

Spreadsheet application: Spread Sheet & its Applications, Formula Editing, Formatting,
Toolbars Spreadsheet types. Spreadsheet addressing, Inserting Data Data from external files,
Inserting Functions, Formatting Spreadsheets, Formatting layout for Graphics, Clipart, Working
with sheets: Sorting, Filtering, Validation, Consolidation, and Subtotal. Creating Charts:
Drawing. Printing. Using Tools – Error checking, Formula Auditing, Creating & Using Templates,
Pivot Tables, Tracking Changes, Security, Customization.

Unit 3 (15 Hrs)

Presentation application: Presentation, Different presentation templates, setting backgrounds,
selecting presentation layouts. Creating a presentation: Setting Presentation style, Adding text
to the Presentation. Formatting a Presentation, Adding Effects to the Presentation.

Reference Books:
1. Libreoffice - Getting started 6.0: Libreoffice team, www.libreoffice.org.
2. Use Libreoffice base: Thomas Ecclestone
3. Openoffice for Dummies.

21
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science)

Course Code:, Title of the Course: Advanced Web Designing

L-T-P: 2-0-1 Credits: 3

Prerequisite Course / Knowledge (If any):

● Students should have basic knowledge of web designing

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Apply CSS features on creation of web pages. (Level 3: Apply)
CO-2: Discuss on different types of CSS Selectors(Level 2: Understand)
CO-3: Describe web graphics operations for web designing (Level 2: Understand)
CO-4: Design a form based on real time requirements using form features (Level 3:
Apply)
CO-5: Describe CSS Grid Layout operations (Level 2 : Understand)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 2 1 2 2 2 3 1 1 2 2
CO2 2 2 2 3 2 2 2 2 3 3
CO3 3 1 1 2 2 3 1 1 2 3
CO4 3 2 2 2 1 1 1 2 2 2
CO5 2 3 3 2 2 2 1 3 3 1

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping

22
 Advanced Web designing
Credits: 3 IA: 30 Marks
Contact Hrs (L:T:P): 3 (2:0:1) End Exam: 45 Marks
Unit 1 (15 hrs)
Cascading Style Sheets Basics: Cascading Style Sheets Overview, Selectors and Declarations,
Syntax for Color Values, Configure Inline CSS, Configure Embedded CSS, Configure External CSS,
CSS Selectors: Class, Id,and Descendant, Span Element, Practice with CSS, The Cascade, Practice
with the Cascade, CSS Syntax Validation.

Unit 2 (15 hrs)

Graphics & Text Styling Basics: Web Graphics, Image Element, CSS Interactivity with Pseudo-
Classes, Practice with CSS Two-Column Layout, CSS for Print, CSS Sprites, Positioning with CSS,
Practice with Positioning, Fixed Position Navigation Bar.

Unit 3 (15 hrs)

Form Basics: Form Overview, Text Box, Submit Button and Reset Button, Checkbox and Radio
Button, Hidden Field and Password Box, Textarea Element, Select Element and Option Element,
Label Element, Fieldset Element and Legend Element , Style a Form with CSS, CSS Grid Layout
Form, Server-Side Processing, Practice with a Form, More Text Form Controls, Datalist Element,
Slider and Spinner Controls, Calendar and Color-Well Controls.

Reference Books:
1. Terry Ann Felke-Morris, Basics of Web Design HTML5 and CSS, 5th Edition, Pearson.
2. Satish Jain, Shashank Jain (2010), Internet Technology and Web Design, BPB Publication.
3. Thomas Powell (2017), The Complete Reference: HTML & CSS, 5th Edition, McGraw Hill.
4. Lemay Laura (2016), Mastering HTML, CSS & Java Script, BPB Publications.
5. Deborah J. Miller (2001), Careers with Internet Service Providers, Rosen Publishing Group.
6. Bryan Sullivan, Vincent Liu (2012), Web Application Security, A Beginner's Guide, McGraw
Hill.

23
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science / Mathematics)

Course Code: UCSTS20301, Title of the Course: Big Data Analytics

L-T-P: 2-0-0 Credits: 2

Prerequisite Course / Knowledge (If any):

● Students should have basic knowledge of Big Data concepts

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Explain BigData challenges and its working protocol (Level 2: Understand)
CO-2: Discuss on types of Data namely structured and unstructured (Level 2:
Understand)
CO-3: Describe Big Data analytics and its scope (Level 2: Understand)
CO-4: Discuss on analytical architecture (Level 2: Understand)
CO-5: Demonstration of Google analytics (Level 3 : Apply)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 2 2 3 2 2 2 3 3 2 2
CO2 3 2 2 3 2 3 2 2 3 2
CO3 2 3 1 2 2 2 3 3 3 3
CO4 2 2 2 3 1 3 1 2 2 2
CO5 3 3 3 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

24
 UCSTS20301-Big Data Analytics
Credits: 2 IA: 20 Marks
Contact Hrs (L:T:P): 2 (2:0:0) End Exam: 30 Marks

Unit 1 (15 hrs)

Defining Big Data, Evolution of Data Management, architectural foundation, The cycle of big
data management, Waves of Managing Data, Defining Structured Data, Exploring sources of big
structured data, the role of relational databases in big data, Unstructured Data.

Unit 2 (15 hrs)

Big Data Analytics: Big Data Overview, State of the Practice in Analytics, Current Analytical
Architecture, Data Analytics Lifecycle, Background and Overview of Data Analytics Lifecycle,
Data Preparation, case study: google analytics.

Reference Books :
1. Judith Hurwitz, Alan Nugent, Fern Halper, Marcia Kaufman, "Big Data for Dummies",John
Wiley & Sons, Inc, 2013.
2. David Dietrich, Barry Heller, Beibei Yang, "Data Science and Big Data Analytics", EMC
Education Services, Wiley Publication, 2015
3. Justin Cutroni, Google Analytics, O'reilly

25
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science)

Course Code: , Title of the Course: OOP’s using JAVA

L-T-P =4-0-2 Credits: 6
Prerequisite Course / Knowledge (If any):
● Students should have the knowledge of procedure oriented programming.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Distinguish between object oriented paradigm and the procedure oriented
paradigm. (Level 2: Understand)
CO-2: Explain the basic principles of object-oriented design. (Level 2: Understand)
CO-3: Write Java application programs using OOP principles and proper program
structuring. (Level 3: Apply)
CO-4: Create packages and interfaces. (Level 6: Create)
CO-5: Apply practical experience gained in designing and constructing data models
using java programming. (Level 3: Apply)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 2 2 3 2 3 3 1 2 2 2
CO2 1 2 2 3 2 3 2 2 3 1
CO3 1 1 3 2 2 2 3 3 2 2
CO4 2 2 2 1 1 1 2 2 2 2
CO5 3 1 3 2 2 2 1 3 2 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

26
 OOP’s using Java
Credits: 6 IA: 60 Marks
Contact Hrs (L:T:P): 6 (4:0:2) End Exam: 90 Marks

Unit1 (15 hrs)

The History and Evolution of Java, C++: The Next Step,The Creation of Java, The Bytecode, The
Java Buzzwords, Object-Oriented concepts, The Evolution of Java. Object-Oriented
Programming, A First Simple Program,

Unit 2 (15 hrs)

Variables and data types, Control Statements, Identifiers, Literals The Java Keywords, The Java
Class Libraries. Introducing Classes, Class Fundamentals, A Simple Class, Declaring Objects,
Assigning Object Reference Variables, Introducing Methods, Returning a Value, Constructors,
Garbage Collection, The finalize( ) Method.

Unit 3 (15 hrs)

Inheritance Basics, Member Access and Inheritance, Using super, Creating a Multilevel
Hierarchy, Method Overriding, Using Abstract Classes, Using final with Inheritance, Using final
to Prevent Overriding, Using final to Prevent Inheritance.

Unit 4 (15 hrs)

Packages and Interfaces, nested interfaces, variable in interfaces, Exception handling, exception
types.

Reference Books:
1. E. Balaguruswamy, Programming with Java, A primer, 4th Edition, Tata McGraw-Hill
Publications.
2. Herbet Schildt, The Complete Reference Java, Seventh Edition, MCGrawHill
3. Paul Deital & Harvey Deital (2015), Java: How to Program, 10th Edition, Pearson Education.
4. Robert Lafore (2002), Object Oriented Programming in C++, 4th Edition, Galgotia
publications.
5. Herbert Schildt (2002), JavaTM2 the Complete Reference, 5th Edition,Tata McGraw-Hill.

27
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science/ Mathematics)

Course Code: , Title of the Course: Computer Networks and internet

L-T-P =3-0-0 Credits: 3
Prerequisite Course / Knowledge (If any):
● Students should have the knowledge of procedure oriented programming.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Explain OSI reference model and TCP/IP model. (Level 2: Understand)
CO-2: Distinguish between Guided Transmission Media and Wireless Transmission,
(Level 2: Understand)
CO-3: Demonstrate Digital Modulation And Multiplexing, (Level 3: Apply)
CO-4: Describe Network Service Model (Level 2: Understand))
CO-5: Demonstration on Routing Algorithms(Level 3: Apply)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 3 3 3 3 2 2 1 1 2 2
CO2 3 2 2 3 2 2 2 2 3 3
CO3 3 3 3 2 2 2 1 3 3 3
CO4 3 2 2 3 1 1 1 2 2 2
CO5 3 3 3 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

28
 Computer Networks and internet
Credits: 3 IA: 30 Marks
Contact Hrs (L:T:P): 3 (3:0:0) End Exam: 45 Marks

Unit 1 (15 hrs)

Internet: Introduction, History of internet, applications of internet, Network, Uses Of Computer
Networks, Mobile Users, Social Issues, Network Hardware, Types of Networks, Network
software, Connection-Oriented Versus Connectionless Service, The OSI Reference Model, The
TCP/IP Reference Model.

Unit 2 (15 hrs)

The Physical Layer, Guided Transmission Media, Wireless Transmission, Infrared
Transmission, Communication Satellites, Digital Modulation And Multiplexing, The Public
Switched Telephone Network.

Unit 3 (15 hrs)

Introduction and Network Service Model, virtual circuits & datagrams, what is inside the
router? Internet protocol (IP), Forwarding & Addressing in internet, Routing Algorithms,
Routing in the internet, Broad & Multicast Routing.

Reference Books:
1. Data Communications & Networking Fourth Edition, Behrouz A Forouzan
2. Computer Networking” Third Edition, James F. Kurose, Keith W. Ross
3. Tanenbaum, Wethrall, Computer Networks 5th edition, Prentice Hall

29
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science/Mathematics)

Course Code: Title of the Course: Web designing using PHP

L-T-P: 2-0-1 Credits: 3

Prerequisite Course / Knowledge (If any):

● The students should have basic knowledge of computers.

● The students should be well versed in operating the web sites.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Discuss the types of variables and operators. (Level 2: Understand)
CO-2: Demonstrate on control flow statements. (Level 3: Apply)
CO-3: Describe arrays and functions in PHP. (Level 3: Apply)
CO-4: Practice the PHP features on real time requirements. (Level 3: Apply)
CO-5: Discuss Form handling controls. (Level 2: Understand)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 3 3 3 3 2 2 1 1 2 2
CO2 3 2 2 3 2 2 2 2 3 3
CO3 3 3 3 2 2 2 1 3 3 3
CO4 3 2 2 3 1 1 1 2 2 2
CO5 3 3 3 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

30
 Web designing using PHP
Credits: 3 IA: 30 Marks
Contact Hrs (L:T:P): 3 (2:0:1) End Exam: 45 Marks

Unit 1 (15 hrs)

Essential PHP: Introduction, Creating your development environment, creating first PHP page,
types of variables, operators.

Unit 2 (15 hrs)

Operators and flow controls: assignment operators, string operators, bitwise operators, if
statement, comparison operators, logical operators, ternary operators, loops: for loop, while
loop, do-while loop, foreach loop.

Unit 3 (15 hrs)

Array and Function: creating and handling array, sorting array, function creation, list,
references.
Reading Data in web pages: Web pages to communicate with php, handling form control: text
fields, text area, check box, radio button, list boxes, image maps, file upload, button.

Reference Books :
1. Stevan Holzner, PHP: The complete reference, McGrawHill, PHP5.
2. Learning PHP, MySQL, books by ‘ O’ riley Press

31
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science/Mathematics)

Course Code: , Title of the Course: Android Programming

L-T-P: 1-0-1 Credits: 2
Prerequisite Course / Knowledge (If any):
● Students should have basic knowledge of computers

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Describe the basics of Android programming. (Level 2: Understand)
CO-2: Identify Hardware tools and software tools. (Level 2: Understand)
CO-3: Discuss the procedure for Installing and configuring support tools.
(Level 2: Understand)
CO-4: Explain the project structure for the android app. (Level 2: Understand)
CO-5: Apply user interface for app development (Level 3: Apply)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 3 3 3 3 2 2 1 1 2 2
CO2 3 2 2 3 2 2 2 2 3 3
CO3 3 3 3 2 2 2 1 3 3 3
CO4 3 2 2 3 1 1 1 2 2 2
CO5 3 3 3 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

32
 Android Programming
Credits: 2 IA: 20 Marks
Contact Hrs (L:T:P): 2 (1:0:1) End Exam: 30 Marks

Unit 1 (15 hrs)

Introduction, Getting started with your First android application, Why develop for android?,
Android development basics, Hardware tools, software tools. Installing and configuring support
tools.

Unit 2 (15 hrs)

Building and publishing your first application: Running the hello android app, understanding
project structure, Creating the user Interface.

Reference Books :

1. Michael Burton, Android App Development For Dummies 3rd Edition, Kindle Edition
2. John Horton, Android Programming for Beginners, Packet

33
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science / Mathematics)

Course Code: , Title of the Course: Computer Organization and Architecture

L-T-P: 4-0-2 Credits: 6

Prerequisite Course / Knowledge (If any):

● The students should hold basic knowledge of Computers.

● The students should hold the skill set of basic Algebra.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Describe the concepts of Number system, Boolean algebra and Logic gates. (Level 2:
Understand)
CO-2: Discuss Basic theorem and Properties of Boolean algebra
(Level 2: Understand)
CO-3: Demonstration on Simplification of Boolean functions. (Level 3: Apply)
CO-4: Describe the don’t care condition, and Tabulation method. . (Level 2: Understand)
CO-5: Demonstrate the Combinational and Sequential Circuits. (Level 3: Apply)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 3 3 3 3 2 2 1 1 2 2
CO2 3 2 2 3 2 2 2 2 3 3
CO3 3 3 3 2 2 2 1 3 3 3
CO4 3 2 2 3 1 1 1 2 2 2
CO5 3 3 3 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

34
 Computer Organization and Architecture
Credits: 6 IA: 60 Marks
Contact Hrs (L:T:P): 6 (4:0:2) End Exam: 90 Marks

Unit 1 (15 hrs)

Number System: Introduction, Decimal, Binary, Octal, Hexadecimal, 1’s and 2’s Complements,
Inter conversion of numbers, Codes: BCD Code, Character codes – ASCII, EBCDIC and Gray code.
Binary Addition, Binary Subtraction, Signed Numbers, Addition /Subtraction of numbers in 2’s
compliment notation, Binary Multiplication, Binary division, Floating point representation of
numbers, Arithmetic operations with normalized floating point numbers.
Unit 2 (15 hrs)
Boolean Algebra and Logic Gates: Introduction, Basic definition, Axiomatic Definition, Basic
theorem and Properties of Boolean algebra, Minterms and Maxterms, Logic Operations, Digital
logic gates, IC digital logic families.
Unit 3 (15 hrs)
Simplification of Boolean functions: Introduction, Different types of map method, product of
sum simplification, NAND or NOR implementation, don’t care condition, Tabulation method.
Unit 4 (15 hrs)
Combinational and Sequential Circuits: Introduction, Adders, Subtractors, Code conversion,
Universal Gates, Multiplexer, Demultiplexer, Flip-flops (SR, JK & D), Triggering of Flip–Flops,
Design of counters and Design of state equations.
Reference Books:
1. M. Morris Mano (2007), Computer System Architecture, Prentice Hall.
2. William Stallings (2015), COArchitecture Designing for Performance, Pearson.
3. John P Hayes (1998), Computer Architecture and Organization, Tata McGraw Hill.
4. Bartee, T.C. (2001), Digital Computer Fundamentals, MCGraw Hill.
5. Mathur A.P. (1995), Introduction to Microprocessors, Tata Mc Graw Hill.

35
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science / Mathematics)

Course Code: , Title of the Course: Python Programming

L-T-P: 4-0-0 Credits: 4

Prerequisite Course / Knowledge (If any):

● The students should have basic knowledge of Computers.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Describe the concepts of Software development in python (Level 2: Understand)
CO-2: Discuss the Language component and data types(Level 2: Understand)
CO-3: Demonstration on Control Flow statements. (Level 3: Apply)
CO-4: Describe the functions and modules. (Level 2: Understand)
CO-5: Demonstrate the Objects and Classes. (Level 3: Apply)

Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)

PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 3 2 2 1 2 2 1 1 2 2
CO2 3 2 2 2 3 2 2 2 3 3
CO3 2 2 2 3 3 2 1 3 3 3
CO4 3 1 1 2 2 1 1 2 2 2
CO5 2 2 2 3 3 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

36
 Python Programming
Credits: 4 IA: 40 Marks
Contact Hrs (L:T:P): 4 (4:0:0) End Exam: 60 Marks
Unit 1 (15 hrs)
Introduction to Python Language: History of Python, What is Python mainly used for?, Strengths
and Weaknesses, IDLE, Dynamic Types, Naming Conventions.
The Context of Software Development: Software, Learning Programming with Python. Values
and Variables-Integer and String Values-Identifiers-User Input-String Formatting, String Values,
String Operations, String Slices, String Operators,
Unit 2 (15 hrs)
Data Collections and Language Component: Numeric Data Types, Conversions, Built-in
Functions, Expressions and Arithmetic- Expressions, Arithmetic Examples.
Unit 3 (15 hrs)
Control Flow and Syntax: Indenting, if Statement, If Else Statement, elif Statement, For Loops
While Loops, While True Loops.
Unit 4 (15 hrs)
Functions and Modules: Introduction, Defining Your Own Functions, Parameters, Function
Documentation, Keyword and Optional Parameters, Passing Collections to a Function, Variable
Number of Arguments, Scope, Functions - "First Class Citizens", Passing Functions to a Function.
Objects and Classes: Classes in Python, Principles of Object Orientation, Creating Classes,
Instance Methods.
Reference Books:
1. Charles Dierbach (2015), Introduction to Computer Science using Python, Wiley,1st Edition
ISBN-10: 81265560132015
2. John Zelle (2010), Python Programming: An Introduction to Computer Science, 2nd Edition.
3. Zed A.Shaw (2017), Learn Python the Hard Way Paperback, Pearson Education, 3rd Edition
ISBN-10: 9332582106.
4. Felix Alvaro, PYTHON, Easy Python Programming for Beginners, Your Step-By-Step Guide to
Learning Python Programming.
5. Paul Barry (2010), Head First Python, O' Reilly Publishers, 1st Edition, ISBN: 1449382673.

37
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science / Mathematics)

Course Code: , Title of the Course: Basics of Multimedia

L-T-P: 2-0-0 Credits: 2

Prerequisite Course / Knowledge (If any):

● The students should have basic knowledge of Computers.
● The students should have basic knowledge recording devices.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Summarize the Meaning and multimedia usage. (Level 5: Evaluate)
CO-2: Analyze the Multimedia System Sounds and Digital Audio(Level 4: Analyze)
CO-3: Prepare a 3D Drawing & rendering. (Level 3: Apply)
CO-4: Describe the basic concepts Animation Techniques, Animation File Formats. (Level
2: Understand)
CO-5: Discuss the structure of Multimedia Software Tools. (Level 2: Understand)
Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)
PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 2 1 1 3 2 2 1 1 2 2
CO2 2 2 2 3 2 2 2 2 3 3
CO3 2 1 3 2 2 2 1 3 3 3
CO4 1 1 2 3 1 1 1 2 2 2
CO5 2 1 3 2 2 2 1 3 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

38
 Basics of Multimedia
Credits: 2 IA: 20 Marks
Contact Hrs (L:T:P): 2 (2:0:0) End Exam: 30 Marks

Unit 1 (15 hrs)

Multimedia: Meaning and its usage, Stages of a Multimedia Project & Multimedia Skills required
in a team Text: Fonts & Faces, Sound: Multimedia System Sounds, Digital Audio, Audio
Recording. Voice Recognition & Response. Images, Vector Drawing, 3D Drawing & rendering,
Natural Light & Colors, Image File Formats.

Unit 2 (15 hrs)

Animation: Principle of Animations. Animation Techniques, Animation File Formats. Video,
Digital Video, Video recording & Shooting Videos, Video Editing, Optimizing Video files for CD-
ROM, Digital display standards, Multimedia Software Tools.

Reference Books:
1. Frederick P. Brooks, Jr., Kenan Professor of Computer Science, The Mythical Man-Month:
Essays in Software Engineering, University of North Carolina at Chapel Hill.
2. K. Andleigh and K. Thakkar, Multimedia System Design, PHI, PTR. Steve Rimmer (2000),
Advanced Multimedia Programming, MHI.
3. Tay Vaughan, Multimedia Making it work, Seventh Edition, Tata McGraw-Hill Education
Private Ltd

39
 School of Computer Sciences
Department of Computer Science

Name of the Academic Program: Bachelor of Science (Computer Science)

Course Code: , Title of the Course: Web designing using DJANGO

L-T-P: 1-0-1 Credits: 2

Prerequisite Course / Knowledge (If any):

● The students should have basic knowledge of Computers.
● The students should have basic knowledge of web server and HTML, CSS and Web
designing principles.

Course Outcomes (COs)

After completion of this course successfully, the students will be able to
CO-1: Prepare the Creating of virtual Environment for python development. (Level 3:
Apply)
CO-2: Analyze the data structure of python and website (Level 4: Analyze)
CO-3: Prepare the web template for the website . (Level 3: Apply)
CO-4: Describe the basic concepts website and Django. (Level 2: Understand)
CO-5: Discuss the structure django tokens (Level 2: Understand)

Mapping of Course Outcomes (COs) with Program Learning Outcomes (PLOs)

PLO1
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9
0
CO1 3 1 3 – 2 2 1 1 2 2
CO2 2 2 2 3 2 2 2 2 3 3
CO3 3 3 2 2 2 2 1 3 3 3
CO4 2 2 2 1 1 1 1 2 2 2
CO5 3 1 3 2 2 2 1 – 3 3

Write ‘3’ in the box for ‘High-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’
mapping.

40
 Web designing using DJANGO
Credits: 2 IA: 20 Marks
Contact Hrs (L:T:P): 2 (1:0:1) End Exam: 30 Marks

Unit 1 (15 hrs)

Installing Python and Django, Creating virtual Environment, Starting Project, Creating a
Database, Django's Models: Defining model in Python, Basic Data Access, Retrieving Records.

Unit 2 (15 hrs)

Templates: Creating site Template, Loading static files, listing base html and main css, Accessing
the Django Admin site, Managing users in the admin, Django's Forms

Reference Books:
1. Nigel George , Mastering Django, GNW publication 2020
2. Ben Shaw, Saurabh Badhwar, Andrew Bird, Bharath Chandra K S, Web Development
with Django: Learn to build modern web applications with a Python-based framework,
2021

41
 Python Programming Lab
Credits: 2 IA: 20 Marks
Contact Hrs (L:T:P): 2 (0:0:2) End Exam: 30 Marks

Faculty should conduct a python programming lab on the following contents using a suitable
python environment.
Minimum 20 Programs
Contents:
Installation of python, creation of python environment, first python program, demonstration of
data types, Numeric Data Types, Conversions, Built-in Functions, Expressions and Arithmetic-
Expressions, Control Flow , Indenting, if Statement, If Else Statement, elif Statement, For Loops
While Loops, While True Loops, Functions and Modules, Classes in Python,Creating Classes,
Instance Methods.

42