1

KARNATAK UNIVERSITY, DHARWAD

B.Sc. Programme
KARNATAK UNIVERSITY, DHARWAD
***
04 - Year B.Sc. (Hons.) Program
DRAFT SYLLABUS FOR
***
CHEMISTRY
SYLLABUS
DISCIPLINE SPECIFIC COURSE (DSC) and
Subject: Computer Science
DISCIPLINE SPECIFIC ELECTIVE(DSE)
[Effective from 2021-22]
UNDER

NATIONAL EDUCATION POLICY(NEP)

DISCIPLINE SPECIFIC CORE COURSE (DSCC) FOR SEM I & II,
*****
OPEN ELECTIVE COURSE (OEC) FOR SEM I & II and
Effective from 2021-22
SKILL ENHANCEMENT COURSE (SEC) FOR SEM I

AS PER N E P - 2020

2
 Karnatak University, Dharwad
Four Years Under Graduate Program in Computer Science for B.Sc. (Hons.)
Effective from 2021-22

Total Summat
Instruction Formative ive
Sem Type of Theory/ Course Subject Title hours of Duration Total
hour per Assessme Assess Credits
Course Practical Code Syllabus of Exam nt Marks ment Marks
week / Sem Marks

Problem solving
DSCC 1 Theory CS –T -1.1 techniques and 04hrs 56 02 hrs 40 60 100 04
Algorithms
Practical CS –P- 1.2 Algorithm Lab-I 04 hrs 52 03 hrs 25 25 50 02
I Fundamentals of
OEC-1 Theory CSOEC -1.3 Computer 03 hrs 42 02 hrs 40 60 100 03
Concepts
Fundamentals of
*SEC-1 Practical CSSEC. -1.4 03 hrs 30 02 hrs 25 25 50 02
digital Logic
Theory CS -2.1 Data Structures 04 hrs 56 02 hrs 40 60 100 04
DSCC2 Data Structure
Practical CS.-2.2 04 hrs 52 03 hrs 25 25 50 02
Lab-II
Fundamentals of
II Computer
OEC-2 Theory CSOEC-2.4 Network and 03 hrs 42 02 hrs 40 60 100 03
Mobile
Communications

Details of the other Semesters will be given later

* Student can opt digital fluency as SEC or the SEC of his/ her any one DSCC selected

3
 Name of Course (Subject): Computer Science
Programme Specific Outcome (PSO):
On completion of the 03/ 04 years Degree in Computer Science students will be able to:

PSO 1 : Understand basic concepts involved in computing.

PSO 2 : Apply the knowledge in computer techniques to solve real world problems.

PSO 3 : Think of new approaches for solving problems in different domains.

PSO 4 : Follow ethics in designing software with team members.

PSO 5 : Develop research oriented skills

PSO 6 : Understand good lab practices

4
 B.Sc. Semester – I
Subject: Computer Science
Discipline Specific Course (DSC)

The course Computer Science in I semester has two papers (Theory Paper –I for 04 credits & Practical Paper
-II for 2 credits) for 06 credits: Both the papers are compulsory. Details of the courses are as under.

Course No.1 (Theory): Title of the Course (Theory): Problem solving techniques and Algorithms

Course Type of Theory / Credits Instruction Total No. of Duration Formative Summative Total
No. Course Practical hour per Lectures/Hours of Exam Assessment
Assessmen Marks
week / Semester Marks
t Marks

Course-
01
DSCC Theory 04 04 56 hrs 2hrs 40 60 100

Course Outcome (CO):

After completion of course (Theory), students will be able to:

CO 1 : Familiarize with fundamental concepts and computer programming.

CO 2 : Learn fundamental concepts of programming by developing and executing programs in C.

CO 3 : Focuses on the structured program.

CO 4 : Various constructs and their syntax.

Syllabus- Course 1(Theory): Title- Problem solving techniques and Algorithms Total Hrs: 56
Unit-I 14 hrs
Basics of Programming- Definition and Characteristics of Computer, Block diagram of
Computer, Compiler, Interpreter, Linker, Loader, Algorithm, Flowchart, Testing and
Execution. Examples of flow charts and algorithms Largest of three numbers,
reversing the digits of an integer, GCD of two integers, generating prime numbers,
computing nth Fibonacci numbers, finding Even and Odd numbers.

Programming Tokens: Keywords, Identifiers, Constants, Variables, Data types,

defining symbolic constants, Simple Programs.
Unit-II 14 hrs
Programming Concepts: Operators & Expression: Arithmetic, relational, logical,
bitwise, unary, assignment, shorthand assignment operators, conditional operators and
increment and decrement operators, Special operators, Type Conversion in expressions,
Operator precedence, Mathematical functions.
Input/output Functions: Unformatted & formatted I/O functions.

5
Branching and Looping: Simple ‘if’ statement, Nested if Statement, Ladder ‘if–else’
statement. The ‘Switch’ statement, GOTO statement. Looping: for, while, do-while
loop, Nested loops and jumps in loops - break, continue statement.
Unit-III 14 hrs
Arrays, Strings and Functions: Definition, types, initialization, processing an array,
passing arrays to functions, Array of Strings. Strings: String constant and variables,
Declaration and initialization of string, Input/output of string data, String Handling
Functions: strlen, strcat, strcmp, strcpy, strrev. Functions: Definition, types of user
defined functions, prototype, Local and global variables, passing parameters, recursion.
Unit-IV 14 hrs
Advanced Algorithms: Introduction, the problem solving aspects, Top-down design,
Implementation of Algorithms. Exchanging the values of two variables, Counting,
Summation of set of Numbers, Factorial Computation, Generation of Fibonacci
Sequence, Array Order Reversal, Array Counting, Finding the Maximum Number in a
Set, Removal of Duplicates from an Ordered Array, Partitioning an Array, Finding the
Smallest Element.

Books recommended.
Text Books

1. Balaguruswamy: Programming in ANSI C, Tata Mc Graw-Hill.

2. Brain W.Karningham and Dennis Ritchie: The C Programming Language, PHI.
3. R.G.Dromey: How to Solve it by Computer, Pearson Education, ISBN 978-81-317-0562-9.

References

1. V. Rajaraman: Fundamentals of Computers, PHI (EEE).

2. Kamthane, Programming with ANSI and Turbo C, Pearson Education, Asia.
3. Herbert Schildt: C. The complete reference, 4th edition.
4. Yeshwant Kanetkar: Let us C, BPB.

6
 B.Sc. Semester – I
Subject: Computer Science
Discipline Specific Course (DSC)

Course No.1 (Practical): Title of the Course (Practical): Algorithm Lab

Course Type of Theory / Credits Instruction Total No. of Duration Formative Summative Total
No. Course Practical hour per Lectures/Hours of Exam Assessment
Assessmen Marks
week / Semester Marks
t Marks

Course- Practic
01 DSCC 02 04 52 hrs 3hrs 25 25 50
al

Course Outcome (CO):

After completion of course (Practical), students will be able to:

CO 1 : Understand the basics of programming by executing the simple programming

CO 2 : Be able to design & execution of code.

CO 3 : Have practical knowledge of arrays, strings & functions

List of the Experiments for 52 hrs / Semesters

1. Find the area of a circle and area of a triangle given three sides.
2. Largest of three numbers.
3. Reversing the digits of an integer.
4. GCD of two integers.
5. Generating prime numbers.
6. Computing nth Fibonacci numbers.
7. Finding Even and Odd numbers.
8. Exchanging the values of two variables.
9. Counting: Print number from 100 to 200 which are divisible by 7 and display their sum and count using
for loop.
10. Summation of set of Numbers.
11. Factorial Computation.
12. Generation of Fibonacci sequence.
13. Array Order Reversal.
14. Finding the Maximum Number in a Set.
15. Removal of Duplicates from an Ordered Array.
16. Partitioning an Array.
17. Finding the Smallest Element.
18. Read N (minimum 5) students marks and find number of students passed and fail depending on the
marks.
19. Count the number of vowels, consonants and special characters in a given sentence.
20. To find the addition and subtraction of two matrices using function.

7
General instructions:

Implement all the programs using C Language

Scheme of Practical Examination (distribution of marks): 25 marks for Semester end

examination

1. 7 Marks ( Program 1 + Execution without error)

2. 7 Marks ( Program 2 + Execution without error)

3. Viva 6 Marks

4. Journal 5 Marks

Total 25 marks

Note: Same Scheme may be used for IA ( Formative Assessment) examination

8
 B.Sc. Semester – I
Subject: Computer Science
Open Elective Course (OEC-1)
(OEC for other students)

OEC-1: Title of the Course : FUNDAMENTALS OF COMPUTER CONCEPTS

Course Type of Theory / Credits Instruction Total No. of Duration Formative Summative Total
No. Course Practical hour per Lectures/Hours of Exam Assessment
Assessmen Marks
week / Semester Marks
t Marks

OEC-1
OEC Theory 03 03 42 hrs 2hrs 40 60 100

Course Outcome (CO):

After completion of course, students will be able to:

CO 1 : Understanding the basic concepts Computer.

CO 2 : Paperless environment.

CO 3 : To develop word processor abilities of students.

CO 4 : To develop numerical abilities of students using electronic spread sheet.

CO 5 : To acquire practical skills related to Presentation Software.

Syllabus- OEC: Title- FUNDAMENTALS OF COMPUTER CONCEPTS Total Hrs: 42

Unit-I 14 hrs
Introduction To Computer: Definition of Computer, History, Characteristics of
Computer, Basic Applications of Computer, Components of Computer System:
Central Processing Unit: Keyboard, mouse and VDU, Input devices, Output devices,
Computer Memory, Concept of Hardware and Software, Application Software,
Systems software, Programming Languages, Representation of Data/Information,
Concept of Data processing, Multimedia and Entertainment, Introduction to
Operating System: Definition, Basics of popular operating systems: Windows &
Linux, User Interface: Task Bar, Icons, Start Menu, Running an Application,
Changing System Date And Time, Changing Display Properties, To Add Or
Remove A Windows Component, Changing Mouse Properties, Adding and
removing Printers, File and Directory Management, Types of files.
Unit-II 14 hrs
Word Processors: Definition of Word Processing, Examples of Word Processors,
Opening Word Processing Package, Menu Bar, Using the Help, Using the Icons
below Menu Bar, Opening and closing Documents, Save and Save As, Page Setup,
Print Preview, Printing of Documents, Text Creation and manipulation, Document
Creation, Editing Text, Text Selection, Cut, Copy and Paste, Font and Size
selection, Alignment of Text, Formatting the Text, Paragraph, Indenting, Bullets
and Numbering, Changing case, Table Manipulation, Draw Table, Changing cell
width and height, Alignment of Text in cell, Delete / Insertion of row and column,
Border and shading, Short-cut keys wherever applicable.
9
Unit-III 14 hrs
Electronic Spreadsheet: Elements of Electronic Spread Sheet, Examples of
Electronic Spreadsheets, Workbook Vs Worksheet, Opening of Spread Sheet,
Addressing of Cells, Printing of Spread Sheet, Saving Workbooks, Manipulation of
Cells, Entering Text, Numbers and Dates, Creating Text, Number and Date Series,
Editing worksheet Data, Inserting and Deleting Rows, Column, Changing Cell
Height and Width, Using Formulas, Function, Charts, Short-cut keys wherever
applicable.
Presentation Software: Opening A PowerPoint Presentation, Saving A
Presentation, Creation of Presentation, Creating a Presentation, Using a Template,
Creating a Blank Presentation, Entering and Editing Text, Inserting And Deleting
Slides in a Presentation, Preparation of Slides, Inserting Word Table or An Excel
Worksheet, Adding Clip Art Pictures, Inserting Other Objects, Resizing and Scaling
an Object, Enhancing Text Presentation:

Books recommended.
Text Books

1. Computer Fundamentals - P K Sinha, BPB Publications.

References

1. Fundamentals of Computers, M. Abid, M. Amjad, Willey

2. Computer Fundamentals, D.P. Nagpal, S.Chand.

10
 B.Sc. Semester - I
Subject: Computer Science
SKILL ENHANCEMENT COURSE (SEC)-I
Title of Paper: FUNDAMENTALS OF DIGITAL LOGIC

Theory / Credits Instruction Total No. of Mode of Duration of Formative Summative Total
Type of
Course Practical hour per Lectures/Hours Examina Exam Assessment
Assessmen Marks
week / Semester tion Marks
t Marks

Theory + 2hr
SEC-I 02 03hrs 30 Practical 25 25 50
Practical

Course Outcome (CO):

After completion of Skill Enhancement course, students will be able to:

CO 1 : To teach the basics involved in data representation and digital logic circuit.

CO 2 : It includes the general concept in digital logic design.

CO 3 : To make better understanding of logic used in combinational circuit design.

B.SC. -1.5 (SEC – 1): FUNDAMENTALS OF DIGITAL LOGIC 30 Hrs

Unit –1 10
Number Representation: Positional representation of numbers, decimal, binary,
octal, Hexadecimal number systems, general radix system, numbers, conversions,
complements, binary codes, Fixed point representation, floating point
representation, representation for numeric data , arithmetic with signed unsigned
numbers, addition, subtraction. Introduction to array correction and array detection.
Introduction to logic circuits-variables and functions, truth tables, logic gates and
networks, Boolean algebra, synthesis using AND, OR and NOT gates, NAND and
NOR logic networks.

Unit – 2 10
Optimized implementation of logic functions-karnaugh map, stragegy for
minimization, minimization of product of sums forms, incompletely specified
functions, multiple output circuits, multilevel synthesis, a tabular method for
minimization, cubical technique for minimization, practical considerations.

Unit – 3 10
Combinational logic- design procedures, adders, subtractors, design of arithmetic
circuits, multiplexers, demultiplexers, encoders, decoders, code converters, verilog
for combinational circuits.

11
 List of the Experiments for 52 hrs / Semesters

1. Introduction to digital Electronics lab (Simulators)

i. Nomenclature of digital I/C’s, Specifications

ii. Tools required-Simulators

Gates:

2. AND

3. NOT

4. OR
5. NAND

6. NOR

7. XOR

Implement of given Boolean function using logic gates

8. SOP: A.B+A.B

9. POS: (A+B) (B+C) (A+C)

Draw the logic circuit diagram & truth table, test the output in the simulator

General instructions:

Scheme of Practical Examination (distribution of marks): 25 marks for Semester end

examination

1. 7 Marks ( Program 1 + Execution without error)

2. 7 Marks ( Program 2 + Execution without error)

3. Viva 6 Marks
4. Journal 5 Marks

Total 25 marks

Note: Same Scheme may be used for IA ( Formative Assessment) examination

Books recommended.
Text Books
1. Fundamental of digital logic with Verilog Design by Stephen Brown & ZVONKO VRANESIC, Tata
McGrawHill.
2. Digital Design by M. Morris Mano, Pearson.

References
1. Computer System Architecture, M. Morris Mano, Third edition, Pearson Eduction.
2. Computer Organization and Architecture, W. Stallings, Pearson Education.

12
 Details of Formative assessment (IA) for DSCC theory/OEC: 40% weight age for total marks

Type of Assessment Weight age Duration Commencement

Written test-1 10% 1 hr 8th Week
Written test-2 10% 1 hr 12th Week
Seminar 10% 10 minutes --
Case study / Assignment 10% ------ --
/ Field work / Project
work/ Activity
Total 40% of the maximum
marks allotted for the
paper

Faculty of Science
04 - Year UG Honors programme: 2021-22

GENERAL PATTERN OF THEORY QUESTION PAPER FOR DSCC/ OEC

(60 marks for semester end Examination with 2 hrs duration)

Part-A
1. Question number 1-06 carries 2 marks each. Answer any 05 questions : 10marks

Part-B

2. Question number 07- 11 carries 05Marks each. Answer any 04 questions : 20 marks

Part-C

3. Question number 12-15 carries 10 Marks each. Answer any 03 questions : 30 marks

(Minimum 1 question from each unit and 10 marks question may have sub
questions for 7+3 or 6+4 or 5+5 if necessary)

Total: 60 Marks

Note: Proportionate weight age shall be given to each unit based on number of hours
prescribed.

13
 B.Sc. Semester – II
Subject: Computer Science
Discipline Specific Course (DSC)

The course Computer Science in II semester has two papers (Theory Paper –I for 04 credits & Practical
paper-II for 2 credits) for 06 credits: Both the papers are compulsory. Details of the courses are as under.

Course No.2 (Theory): Title of the Course (Theory): DATA STRUCTURES

Course Type of Theory / Credits Instruction Total No. of Duration Formative Summative Total
No. Course Practical hour per Lectures/Hours of Exam Assessment
Assessmen Marks
week / Semester Marks
t Marks

Course-
02
DSCC Theory 04 04 56 hrs 2hrs 40 60 100

Course Outcome (CO):

After completion of course (Theory), students will be able to:

CO 1 : To impart the basic concepts of data structures and algorithms.

CO 2 : To familiar with data structural algorithms such as sorting & searching, stack & queue, linked
list and trees.

CO 3 : To be familiar with some graph algorithms such as binary tree representation of tree and
operations on trees.

CO 4 : To understand the basic concepts of tree traversal.

CO 5 : How to use basic data structure for program implementation.

Syllabus- Course 2(Theory): Title- DATA STRUCTURES Total Hrs: 56

Unit-I 14 hrs
Structure and Pointers: Structure Definition, Initialization, Array as structure, Array
within structure, Union. Understanding pointers, Declaring and initializing pointers,
accessing a variable through its pointer, static and dynamic memory allocation.
Data Structures: Definition, Classification of Data Structure: Primitive and Non-
Primitive, Operations on Data Structure, Review of Array.

Unit-II 14 hrs
Searching and Sorting: Searching Definition, Searching Techniques: Sequential
search, Binary search. Comparison Between sequential and binary searching. Sorting
Definition, Sorting Techniques: Bubble sort, Merge sort, Selection sort, Quick sort,
Insertion Sort.

14
Unit-III 14 hrs
Stack and Queue: Definition of stack, Array Representation of Stack, Linked List
Representation of stack, Operation Performed on Stack, Infix, Prefix, Postfix notations,
Conversion of arithmetic expressions, Application of stack. Definition of Queue, Array
Representation of Queue, Types of Queue: Simple queue, Circular queue, Double ended
queue, Priority queue, Operations on all types of queue.
Unit-IV 14 hrs
Linked List: Definition, Representation of linked lists in Memory, Types of linked list:
Singly linked list, Doubly linked list and Circular linked list. Operations on
linked list: Creation, Insertion, Deletion, Search, Display and Traversing. Advantages
and disadvantages of linked list.
Trees: Definitions, Tree terminology, Binary tree, Complete binary tree. Operations
on Binary Trees, Representation of binary tree.

Books recommended.
Text Books
1. Kamthane: Introduction to Data Structure in C. Pearson education 2005.
2. Fundamentals of Data structures in C, 2nd Edition, E.Horowitz, S.Sahni and Susan Anderson-Freed,
Universities Press.

References
1. Data Structures using C, A.M.Tanenbaum, Y. Langsam, M.J.Augenstein, Pearson.
2. Data structures and Program Design in C, 2 nd edition, R.Kruse, C.L.Tondo and B.Leung, Pearson.
3. Data structures A Programming Approach with C, D.S.Kushwaha and A.K.Misra, PHI.
4. E. Balaguruswamy, Programming in ANSI C, Tata Mc Graw-Hill.

15
 B.Sc. Semester – II
Subject: Computer Science
Discipline Specific Course (DSC)

Course No.2 (Practical): Title of the Course (Practical): Data Structures Lab

Course Type of Theory / Credits Instruction Total No. of Duration Formative Summative Total
No. Course Practical hour per Lectures/Hours of Exam Assessment
Assessmen Marks
week / Semester Marks
t Marks

Course- Practic
02 DSCC 02 04 52 hrs 3hrs 25 25 50
al

Course Outcome (CO):

After completion of course (Practical), students will be able to:

CO 1 : Be able to design & implement list data structure using

i. Stack & Queue

ii. Linked list

iii. Singly & doubly linked list

CO 2 : Design & implement searching and sorting by applying various operations.

CO 3 : Design & implement basic operation on trees.

List of the Experiments for 52 hrs / Semesters

1. Write a Program to create, Initialize and access a pointer variable.

2. Write a Program to Calculate the length of the string using a pointer.
3. Write a Program to swap numbers using pointer.
4. Write a program in C to print all permutations of a given string using pointers.
5. Write a Program to store n student’s information using structure.
6. Write Program to implement Push, Pop and Traverse operation on STACK.
7. Write Program to convert infix notation to postfix notation.
8. Write Program to convert Infix notation to prefix notation.
9. Write a program to convert Prefix notation to postfix notation.
10. Write Program to perform the operation Insert, Delete and Display on Queue.
11. Write Program to implement Circular queue.
12. Write Program to implement Double ended queue.
13. Write Program to implement Priority queue.
14. Write a Program to search an element using Linear search.
15. Write a Program to sort given Array using Insertion sort technique.
16. Write a Program to sort given Array using Bubble sort technique.
17. Write a Program to sort given Array using Quick sort technique.
18. Write a Program to sort given Array using selection sort technique.
19. Write Program to implement Singly Linked List.
20. Write Program to implement Double Linked List.

16
General instructions:

Implement using C Language

Scheme of Practical Examination (distribution of marks): 25 marks for Semester end

examination

1. 7 Marks ( Program 1 + Execution without error)

2. 7 Marks ( Program 2 + Execution without error)

3. Viva 6 Marks

4. Journal 5 Marks

Total 25 marks

Note: Same Scheme may be used for IA ( Formative Assessment) examination

17
 B.Sc. Semester – II
Subject: Computer Science
Open Elective Course (OEC-2)
(OEC for other students)

OEC-2: Title of the Course : FUNDAMENTALS OF COMPUTER NETWORK AND MOBILE

COMMUNICATIONS

Course Type of Theory / Credits Instruction Total No. of Duration Formative Summative Total
No. Course Practical hour per Lectures/Hours of Exam Assessment
Assessmen Marks
week / Semester Marks
t Marks

OEC-2
OEC Theory 03 03 42 hrs 2hrs 40 60 100

Course Outcome (CO):

After completion of course, students will be able to:

CO 1 : Understand broad range of computer networks and data communication technology.

CO 2 : Introducing basic knowledge, basic communication fundamentals.

CO 3 : Understand the network models such as OSI and TCP/IP.

CO 4 : Understand cellular and satellite networks.

Syllabus- OEC: Title- FUNDAMENTALS OF COMPUTER NETWORK AND Total Hrs: 42

MOBILE COMMUNICATIONS
Unit-I 14 hrs
Data Communications: Components, Data Representation, Data Flow. Networks:
Distributed Processing, Network Criteria, Physical Structures, Network Models,
Categories of Networks, Interconnection of Networks, Internetwork. The internet: A
Brief History, The Internet Today. Protocols and standards: Protocols, Standards,
Standards Organizations, Internet Standards.
Unit-II 14 hrs
Network Models: layered tasks, Sender, Receiver and Carrier, Hierarchy, the OSI
model: Layered Architecture, Peer-to-Peer Processes, Encapsulation. Layers in the OSI
model: Physical Layer, Data Link Layer, Network Layer, Transport Layer, Session
Layer, Presentation Layer, Application Layer. TCP/IP protocol suite: Physical and Data
Link Layers, Network Layer, Transport Layer, Application Layer. Addressing: Physical
Addresses, Logical Addresses, Port Addresses, Specific Addresses.
Unit-III 14 hrs
Cellular Telephony: Frequency-Reuse Principle, Transmitting, Receiving, Roaming
First Generation, Second Generation, Third Generation.
Satellite Networks: Orbits, Footprint, Three Categories of Satellites, GEO Satellites,
MEO Satellites, LEO Satellites.

18
Books recommended.
Text Books

1. Introduction to Data Communications & Networking, Behrouz Ferouzan, 4th edition. TMH.

References

1. Communication Networks- Fundamental Concepts & Key Architecture, Alberto Leon-Garcia &
Indra Widjaja, Mc.Graw Hill.

2. Data and Computer Communications, W. Stalling, 7th edition, Pearson Education.

19
 Details of Formative assessment (IA) for DSCC theory/OEC: 40% weight age for total marks

Type of Assessment Weight age Duration Commencement

Written test-1 10% 1 hr 8th Week
Written test-2 10% 1 hr 12th Week
Seminar 10% 10 minutes --
Case study / Assignment / Field 10% ------ --
work / Project work/ Activity
Total 40% of the maximum marks
allotted for the paper

Faculty of Science
04 - Year UG Honors programme:2021-22

GENERAL PATTERN OF THEORY QUESTION PAPER FOR DSCC/ OEC

(60 marks for semester end Examination with 2 hrs duration)

Part-A
1. Question number 1-06 carries 2 marks each. Answer any 05 questions : 10marks

Part-B

2. Question number 07- 11 carries 05Marks each. Answer any 04 questions : 20 marks

Part-C

3. Question number 12-15 carries 10 Marks each. Answer any 03 questions : 30 marks

(Minimum 1 question from each unit and 10 marks question may have sub
questions for 7+3 or 6+4 or 5+5 if necessary)

Total: 60 Marks

Note: Proportionate weight age shall be given to each unit based on number of hours
prescribed.

20