Government of Karnataka

Department of Technical Education

Bengaluru

Course Title: Programming with C

Course Code:
Scheme (L:T:P) : 4:0:0 Total Contact Hours: 52
15CS31T
Type of Course: Lectures, Self Core/ Elective:
Credit :04
Study & Student Activity Core
CIE- 25 Marks SEE- 100 Marks

Prerequisites

Knowledge of basic mathematics and IT skills..

Course Objectives

Understand the syntax of data types, analyze various formatting styles for input/output and
appreciate the use of arrays, strings and functions to write C programs.

Course Outcome

On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked PO Teaching
Course outcome
Hours
Illustrate syntax rules for numerical constants and 10
CO1
variables, data types, arithmetic operators and
R,
expressions and Articulate them with different 1,2,3,4,8,9,10
U
types of input/output formats using simple
problems.
CO2 Discuss different branching and looping statements U, 14
1,2,3,4,8,9,10
and experiment using simple programs. A
CO3 Discuss different types of functions and write U, 06
A 1,2,3,4,8,9,10
simple programs.
CO4 Explain different types of arrays and write simple U, 08
1,2,3,4,8,9,10
programs. A
CO5 Describe preprocessor and Discuss different types U, 06
A 1,2,3,4,8,9,10
of string functions.
CO6 Describe and differentiate between structure and U, 08
1,2,3,4,8,9,10
unions to write simple programs. A
Total sessions 52

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Directorate Of Technical Education Karnataka State CS&E 15CS31T

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
Programming with C 3 3 3 3 - - - 3 3 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

Course Content and Blue Print of Marks for SEE

Unit Hour Questions to be Marks Marks

No Unit Name set for Weightage Weightage
SEE (%)
R U A A
I Introduction to 'C' 10 5 12 10 27 19.24
Language

II Decision making- 14 - 15 23 38 26.9

Branching and Looping
III Functions 06 - 10 10 20 11.54

IV Arrays 08 - 07 15 22 15.39

V Strings & Pre-processor 06 - 06 10 16 11.54

VI Structures & Unions 08 - 12 10 22 15.39

Total 52 5 62 78 145 100

UNIT I: Introduction to 'C' Language 10 Hrs

Character set, Variables and Identifiers, Built-in Data Types, Variable Definition,
Declaration, C Key Words-Rules & Guidelines for Naming Variables. Arithmetic operators
and Expressions, Constants and Literals, Precedence and Order of Evaluation. Simple
assignment statement, Basic input/output statement, Simple 'C' programs.
Algorithms – Definition and Characteristics. Simple algorithms. Flow chart – Type of flow
chart. Simple flow charts

UNIT II: Decision making- Branching and Looping 14 Hrs

Conditions, Relational Operators, Logical Operator. if statement, if-else statement, nested if-
else, if-else ladder, Switch, Break, Continue, Goto and Labels. Looping statements – while,
do-while, for and nested for loop.
2

Directorate Of Technical Education Karnataka State CS&E 15CS31T

UNIT III: Functions 06 Hrs
Definition of Function, Standard Library of C functions, function prototype, Formal
parameter list, Return Type, Function call, Block structure, Passing arguments to a Function:
call by value.

UNIT IV: Arrays 08Hrs

What is an Array? Declaring an Array, Initializing an Array. One dimensional arrays: Array
manipulation; Finding the largest/smallest element in array; Searching & Sorting of element
from an array; Declaring & Initialization of Two dimensional arrays, Addition/Multiplication
of two matrices, Transpose of a square matrix; Null terminated strings as array of characters,
arrays as function arguments

UNIT V: Strings and Pre-processors 06 Hrs

Strings - Introduction, Declaring & Initializing string variables, Reading & writing strings
from variables, Arithmetic operations & characters, Putting strings together, Comparison of
two strings, String handling functions

Pre-processors - Introduction, Macro substitution, File inclusion..

UNIT VI: Structures and Unions 08 Hrs

Basic of Structures, Structures variables, initialization, structure assignment, nested structure,

structures and arrays: arrays of structures, Unions, Size of structures, Structure as function
arguments

®Text books
Programming with ANSI-C, E. Balaguruswamy, Sixth Edition, Tata Mcgraw Hill.

References
1. Programming with ANSI & Turbo C, Ashok Kamthane, Second Edition, Pearson
Education.
2. Let us C, Yashavant P Kanetkar, 14th Edition, BPB publication, ISBN
9788183331630
3. Programming in C and Data Structure, P.B.Kotur, Sapna Book house
4. http://spoken-tutorial.org/tutorial-
search/?search_foss=C+and+Cpp&search_language=English
5. http://www.tutorialspoint.com/cprogramming/
6. http://www.indiabix.com/online-test/c-programming-test/

Suggested student activities

Directorate Of Technical Education Karnataka State CS&E 15CS31T

Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
1. Each group should do any one of the following type activity or any other similar
activity related to the course and before conduction, get it approved from concerned course
coordinator and programme coordinator.
2. Each group should conduct different activity and no repeating should occur

1 Explore and analyze topics to improve the level of creativity and analytical skill by
taking Quiz tests / assignments. Documents have to be maintained as a record.
2 Create a power point presentation on the topic relevant to course or advanced topic
as an extension to the course to improve the communication skills. Documents have
to be maintained as a record
3 Visit different sites relevant to topics. Listen to the lectures and submit a
handwritten report

Course Delivery

The course will be delivered through lectures and Power point presentations/ Video

Course Assessment and Evaluation Scheme

Method What To When/Where Max Evidence Course

who (Frequency in Marks collected outcomes
m the course)
CIE IA Three IA tests
(Average of
20 Blue books 1 to 6
three tests will
be computed)
Students
Direct Assessment

Student
05 Report 1 to 6
activities
Total 25
SEE End End of the Answer scripts
100 1 to 6
Exam course at BTE
Student Feedback Middle of the 1,2,3
on course course Feedback forms Delivery of
course
End of Course End of the 1 to 6
Students

Survey course Effectiveness

Indirect Assessment

of Delivery
of
Questionnaires
instructions
&
Assessment
Methods
Note: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off

to the next higher digit.

Directorate Of Technical Education Karnataka State CS&E 15CS31T

 Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 45
3 Application 45

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (20 marks)
2. Student suggested activities report for 5 marks
3. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.

FORMAT OF I A TEST QUESTION PAPER (CIE)

Test/Date and Time Semester/year Course/Course Code Max Marks

Ex: I test/6 th weak of I/II SEM

20
sem 10-11 Am
Year:
Name of Course coordinator : Units:__
CO’s:____

Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal Choice may be given in each CO at the same cognitive level (CL).

MODEL QUESTION PAPER (CIE)

Test/Date and
Semester/year Course/Course Code Max Marks
Time

Ex: I test/6 th weak III SEM Programming with C

20
of sem 10-11 AM Year: 2015-16 Course code:15CS31T
Name of Course coordinator :
Units:1,2 Co: 1,2
Note: Answer all questions
Questio C
Question CL PO
n no O

1 What is variable? Write the rules and guidelines for naming variable? R 1 1,2
(5)
OR
Evaluate the expression (a + b) * (c + d) + e – f/g*h + 3.25, where a=5,
b=3, c=-2, d=7, e=1, f=6, g=8, h=1
5

Directorate Of Technical Education Karnataka State CS&E 15CS31T

2 Define algorithm? Explain its characteristics (5) U 1 1,2
OR
Write a flow chart and C program to find the sum and average of three A
numbers
3 Give the general syntax and an example of do.....while loop statement. U 2 1,2
Why it is called as "exit-controlled" loop? (5)
4 Explain printf() statement with an example. A 2 1,2

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS31T

MODEL QUESTION PAPER Code: 15CS31T
Diploma in Computer science & Enginnering
III- Semester
Course Title: Programming with C
Time: 3 Hours Max Marks: 100
PART-A
Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks

1) What is a variable? Write the rules and guidelines for naming variable?
2) Explain scanf() statement with an example
3) Compare while and do....while statement.
4) Explain Relational and Logical operators
5) Write a short note on C library functions
6) What are the advantages of functions?
7) List string handling functions.
8) Define a structure. Give general syntax of a structure. Explain with an example.
9) Compare array versus structures.
PART-B
Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks
1. Explain the data types of C language
2. Write a C program to swap the values of two variables without using third variable
3. Explain the switch statement with syntax with an example.
4. Write a program to find the sum of n natural numbers.
5. Explain If......else statements with an example.
6. Explain the following:
i. Passing argument to a function
ii. Returning value from a function
7. a) List the advantages and disadvantages of an array.
b) What is an array? How are arrays declared and initialized?
8. Write a program to find the transpose of a matrix.

9. Explain the following function with an example:

Directorate Of Technical Education Karnataka State CS&E 15CS31T

 i. getchar() ii. strrev() iii. strcmp() iv. strcat() v. strcpy()
10. Write a program to create structure with an employee details & display the same.

MODEL QUESTION BANK

Diploma in Computer Science & Engineering
III Semester
Course Title: Programming with C

CO Question CL Marks
What is a token? Give example for each type of token. R
What is a constant? Explain different types of C constants. R
What is variable? Write the rules and guidelines for naming variable? R
Define the term Identifier. Give an example. R
List the basic data types with byte specification U
List the hierarchy (precedence ) rules of arithmetic operators. U
Evaluate the expression 2 + 1 * 3 - 4 % 3 * 1 + 16 / 2 % 5 and smilar U
type expressions to be solved having arithmetic, relational and logical 05
operators also
List the important features of C language. U
Give a general form of ternary operator, Explain with an example. A
Explain simple assignments in C. Give an example. U
List input and output functions U
Explain printf() statement with an example. A
Explain scanf() statement with an example. A
Define algorithm? Explain its characteristics U
I Define flow chart? List the symbols used in flow-chart U
Write a algorithm and C program to find the sum and average of three A
numbers
With general syntax explain formatted input-output statements. Give U
example for each.
Define the following with an example: U
i. Increment Operator. ii. Decrement Operator
1. Explain the basic data types of C language. U
Define the following with an example: U
i. C Keyword. ii. Variable.
iii. Constants. iv. Format Specifier
v. Arithmetic Expression.
Define the following terms. Give one example each. U
i. Constant. ii. Keyword. 10
iii. Relational Expression. iv. Assignment statement.

Directorate Of Technical Education Karnataka State CS&E 15CS31T

 v. Conditional operator.
Write a flow chart and C program to swap the values of two variables A
without using third variable.
Explain the basic structure of C program. U
Write an algorithm and C program to find the largest of three numbers A
using conditional operators.
Write an algorithm and flow chart to compute sum of n numbers A
Write an algorithm and C program to find area and circumference of a A
circle (circum=2πr and Area= πr2

Explain different logical operators with examples. U

Explain different relational operators with examples. U
Write the general syntax of if & if-else statement. U
Compare while and do....while statement. U
Compare if and if-else statement. U
Illustrate and explain nested if –else statement. U
state and explain if –else ladder statement. U
Write a program to find the largest of three numbers. A 05
With general syntax, explain the significance of break and continue U
statement in loops..
Define the following U
i. break.
ii. goto.and label
iii. continue.
II
List and explain any two unconditional statements/jumping statements. U
Explain Relational and Logical operators. U
With general syntax, explain the need of break statement in Switch. U
Give the general syntax and an example of do.....while loop statement. U
Why it is called as "exit-controlled" loop?
Differentiate between break and continue statements. U
Write a C program to check whether the given number is odd or even. A
Explain the logical operators with example. U
Explain relational operators with example. U
Explain for statement with an example. U
Explain If......else statements with an example. A
Explain nested for loop with the general syntax. U
Write a program to find roots of quadratic equation using switch A
statement.
Explain the switch statement with syntax, with an example. A
Explain entry controlled and exit controlled loop with an example. A
Write a program to find the numbers and sum of all numbers greater A
than 150 and less than 250 which are divisible by 8.
Write a program to find the largest of 3 numbers using if....else A
statement. 10
Write a program to find smallest of three numbers using nested if.....else A
statement.
Write a program to check whether the given number is prime or not. A
9

Directorate Of Technical Education Karnataka State CS&E 15CS31T

 Write a program to generate Fibonacci series. A
Write a program to find the sum of n natural numbers. A
Write a program to find the reverse of a given numbers. A
Write a program to count even and odd from n natural numbers. A
Define function. List different types of functions. U
What are the advantages of functions? U
List the difference between actual parameters and formal Parameters. U
Explain scope and lifetime of a variable in a function. U
What do you mean by user defined function? Explain. U
Write a short note on C library functions. U
Write a user defined function great() that computes greatest of two A 05
III numbers and return the largest number to function main().
Write the block structure of a function. U
Define the following U
1. Formal parameter
2. Actual parameter
3. Return type
4. Function call
What is a function prototype give an example. U
Write a program to find the factorial of a given number using function. A
Write a program to find the GCD of a given number using function. A
Explain Call by Value with an example. U
Explain the following with a example: A 10
i. Passing argument to a function
ii. Returning value from a function
What is an array? Explain how to declare and initialize a single U
dimension array?
With an example, explain declaration & initialization of two U
dimensional array.
Compare one dimensional array with two dimensional array. U
Explain multidimensional array with an example. A
Write an algorithm to search a given key in the array of elements. A
Discuss one dimensional array with example. U 05
Explain different operations on arrays. U
Write a program in C to store 25 elements (integers) in two-dimensional A
array called "temp" in 5-rows and 5-columns. The program should also
IV
display these numbers in a matrix format.
Write a program to transpose the given matrix. A
List the advantages and disadvantages of an array. U
Write a C program to find the sum of principle diagonal elements of a A
matrix.
Write a program to search an element in an array. A
Write a program to find the sum and number of positive numbers and A
negative numbers in an array
Write a program to sort 'N' elements of an array using simple sort. A
Define the following: U
a. Array b. Searching c. Sorting
10

Directorate Of Technical Education Karnataka State CS&E 15CS31T

 Write a program to find the sum of two matrices. A 10
Write a C function to compute trace and norm of a matrix. A
Write C function to compute largest of N numbers. A
Define string. How to Declare & Initialize string variables with an U
example.
Write a program to concatenate two strings using in-built string A
function.
Explain how to read the string from the terminal and write a string to the U
terminal with an example.
Explain with an example the Null-terminated strings as "Array of U
Characters".
V Write a C program to check whether the given string is a palindrome or A
not. 05
List string handling functions. U
Write a program to compare any two strings using string functions A
List the advantages of preprocessor directives. A

Explain briefly how to use #define directive. A

Write a short note on File inclusion. U
Explain with Example the #include preprocessor directive. A
How do you define symbolic constants? Illustrate with an example A
Explain the following function with an example: U 10
i. getchar() ii. strrev()
iii. strcmp() iv. strcat()
v. strcpy()
Define a macro. Explain macro substitution with an example. U

Define string. Give an example. Explain the various string handling U

functions with an example.
Write a C program to verify that the given string is palindrome or not A
using iterative method.
Write a program to find the area of a circle using macros. A
Write a note on the following:
a. Pre-processor directive U
b. Macro substitution
Define a structure. Explain with an example, the general syntax of a U 5
structure.
What are structure variables? Explain how to declare and initialize a U
structure variable.
Define a union. Explain with an example, the general syntax of a union. U
List the difference between Union and Structure. U
Compare Arrays versus Structures. U
VI
Define array of structure. Give an example. U
Explain array variable as a structure member with an example. U
Explain array of structure with an example. U 10
Explain the need of structure within a structure (nested structure) with U
an example

11

Directorate Of Technical Education Karnataka State CS&E 15CS31T

 Write a program to read 'N' student information and display it. A
Write a program to create structure with an employee details & display A
the same

12

Directorate Of Technical Education Karnataka State CS&E 15CS31T

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title: Computer Organization

Course Code:
Scheme (L:T:P) : 4:0:0 Total Contact Hours: 52
15CS32T
Type of Course: Lectures, Self Core/ Elective:
Credit :04
Study & Student Activity. Core
CIE- 25 Marks SEE- 100 Marks

Prerequisites

Fundamentals of Digital electronics and basics of Computers and its peripherals.

Course Objectives

Understand the organization of a computer with its various processing units, memory and
peripherals.

Course Outcome

On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked PO Teaching
Course outcome
Hours

CO1 Recognize and explain the functional units

R 1,2,10 02
of computers
CO2
Describe assembly languages and machine U,
instructions by analyzing how the data is 1,2,3,4,8,10 10
A
stored and fetched from memory.
CO3 Explain the execution of complete U 2,8,9,10 08
instruction and bus organizations.
CO4 Identify various interrupt handling U, 1,2,3,8,9,10 10
mechanism and buses. A
CO5 Differentiate between different types of U, 1,2,3,4,5,6,7,8,9,10 14
memories. A
CO6 Discuss core architecture and pipelined
U 2,10 08
concept.
Total sessions 52

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
Computer Organisation 3 3 2 2 1 1 1 3 3 3
1

Directorate Of Technical Education Karnataka State CS&E 15CS32T

 Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

Course Content and Blue Print of Marks for SEE

Unit Hour Questions to be Marks Marks

No Unit Name set for Weightage Weightage
SEE (%)
R U A A
I Basic Structure Of 02 5 - - 5 4
Computers
II Machine Instructions 10 - 20 8 28 18
and Programs
III Basic Processing Unit 08 - 22 - 22 15

IV Input/Output 10 - 18 10 28 18
Organization
V The Memory system 14 - 20 18 38 30

VI Processors and 08 - 24 - 24 15
Pipelining
Total 52 5 104 36 145 100

UNIT I : Basic Structures of Computers 02 Hrs

Functional Units, Input Unit, Memory Unit, Arithmetic and Logic Unit, Output Unit, Control
Unit, Basic Operational Concepts, Bus Structures.

UNIT II: Machine Instructions & Programmes 10 Hrs

Memory Locations and Addresses , Byte Addressability, Big Endian and Little Endian
Assignments, Word Alignment, Accessing numbers, characters and character strings,
Memory Operations, Instruction and Instruction sequencing, Register Transfer notation,
Assembly Language notation, Basic instruction types, Instruction execution and straight line
sequencing, Branching, Condition codes, Addressing modes, Implementation of variables and
constants, Indirection and pointers, Indexing and arrays, Relative addressing, Additional
modes, Assembly Language, Assembler directives, Assembly and execution of programs,
Basic Input- Output Operations.

UNIT III: Basic Processing Unit 08 Hrs

Some Fundamental Concepts, Register transfers, Performing an Arithmetic or Logic

operation, Fetching a word from memory, Storing a word in memory, Execution of a
complete Instruction, Branch instructions, Multiple Bus Organization, Hardwired
2

Directorate Of Technical Education Karnataka State CS&E 15CS32T

Control(basic block diagram only), A complete processor, Basic organization of Micro
programmed Control Unit.

UNIT IV: Input Output Organization 10 Hrs

Accessing I/O Devices, Interrupts, Interrupt Hardware, Enabling and Disabling Interrupts,
Handling Multiple Devices, Controlling Device requests, Exceptions, Direct Memory Access,
Bus arbitration, Buses, Synchronous bus, Asynchronous bus, Interface Circuits, Parallel port
and Serial port (Basic concept only), Standard I/O Interfaces (Basic concepts only),
Peripheral Component Interconnect (PCI) Bus , SCSI Bus( Basic concepts only), Universal
Serial Bus (USB) ( Basic concepts only)

UNIT V: The Memory System 14 Hrs

Some Basic Concepts, Semiconductor RAM Memories, Internal Organization of memory

chips, Static Memories, Asynchronous DRAMs, Synchronous DRAMs, Structure of larger
memories, Memory system consideration, Rambus memory, Read-Only Memories- ROM,
PROM, EPROM, EEPROM, Flash Memory, Speed, Size and Cost, Cache Memories...

UNIT VI: Processors and Pipelining 08 Hrs

Processor- Introduction, Advanced processor technology, instruction set architectures, CISC

scalar processor, RISC scalar processor, comparison CISC and RISC, super scalar processor
(basic concept only), VLIW architecture, comparison of super scalar and VLIW, Multi core
architecture
Pipelining- Introduction, pipeline principles-linear pipeline processor-Asynchronous model,
synchronous model, Non linear pipeline processor, classification of pipeline processor

® Text Books
1. Computer Organization, Carl Hamacher, zvonko Vranesic and Safwat Zaky, McGraw
Hill, 5th edition ( Chapters 1, 2, 4, 5, 7, for UNIT I to UNIT V )

2. Advanced Computer Architecture (A practical approach ), Rajiv Chopra, S. Chand,

Revised edition, reprint 2014, ISBN8121930774 - for UNIT VI page no 133 to 138 ,
143 to 145 , 192 to 194 , 218 to 219 , 221 to 223

References
1. http://elearning.vtu.ac.in/06CS46.html
2. http://nptel.ac.in/courses/Webcourse-contents/IIT-%20Guwahati/comp_org_arc/web/
3. William Stallings, “Computer Organization and Architecture: Designing for
Performance”, Eighth Edition, Pearson.
4. Computer architecture and organization , 4th edition , P Chakraborty , JAICO
publishers
5. http://www.srmuniv.ac.in/downloads/computer_architecture.pdf
6. http://www.dauniv.ac.in/downloads/CArch_PPTs/CompArchCh06L01PipeLine.pdf

Suggested list of student activities

Note: The following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)
3

Directorate Of Technical Education Karnataka State CS&E 15CS32T

Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
1. Each group should do any one of the following type activity or any other similar activity
related to the course and before conduction, get it approved from concerned course co-
ordinator and programme co-ordinator
2. Each group should conduct different activity and no repeating should occur.

1 Conduct a survey on various types of processors available with their features and
submit a report.
2 List out the features of 8086 microprocessor and 8051 micro controller with
respect to architecture and working.
3 Submit a report on hardware and software interrupts.
4 A Case study on Moore’s Law about the processors and submit a report.
5 Conduct a survey on types of memories and also about the cost and speed of
various memories with comparison.

Course Delivery

The course will be delivered through lectures and Power point presentations/ Video

Course Assessment and Evaluation Scheme

Method What To When/Where Max Evidence Course

who (Frequency in Marks collected outcomes
m the course)
CIE IA Three IA tests 1 to 6
(Average of
20 Blue books
three tests will
be computed)
Students
Direct Assessment

Student activity 1 to 6
05 Report
Total
25
SEE End End of the Answer scripts 1 to 6
100
Exam course at BTE
Student Middle of the 1,2,3
Feedback on course Feedback forms Delivery of
course course
End of Course End of the 1 to 6
Students

Survey course Effectiveness

Indirect Assessment

of Delivery
of
Questionnaires
instructions
&
Assessment
Methods
Note: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off

to the next higher digit.

Directorate Of Technical Education Karnataka State CS&E 15CS32T

 Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 50
3 Application 40

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (20 marks)
2. Student suggested activities report for 5 marks
3. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.
FORMAT OF I A TEST QUESTION PAPER (CIE)
Test/Date and Time Semester/year Course/Course Code Max Marks

Ex: I test/6 th weak of I/II SEM

20
sem 10-11 Am
Year:
Name of Course coordinator : Units:__
CO’s:____

Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal Choice may be given in each CO at the same cognitive level (CL).

MODEL QUESTION PAPER (CIE)

Test/Date and
Semester/year Course/Course Code Max Marks
Time

Ex: I test/6 th weak III SEM Computer Organization

20
of sem 10-11 AM Year: 2015-16 Course code:15CS32T
Name of Course coordinator :
Units:1,2 Co: 1,2
Note: Answer all questions
Questio C
Question CL PO
n no O
1 Describe the role of MAR, MDR , PC and IR. (5) R 1 1,2
2 Explain the role of buffer registers (5) R 1 1,2

3 Describe the Big-endian and Little-endian addressability (5) U 2 1,2

4 Explain straight line sequencing (5) U 2 1,2
OR
Describe register and absolute addressing mode.

Directorate Of Technical Education Karnataka State CS&E 15CS32T

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS32T

MODEL QUESTION PAPER Code: 15CS32T
Diploma in Computer science & Engineering
III- Semester
Course Title: Computer Organization
Time: 3 Hours Max Marks: 100
PART-A
Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks
1) Explain the basic functional unit of a Computer.
2) Describe register and absolute addressing mode.
3) Write a note on register transfers.
4) Explain the concept of micro programmed control .
5) Explain how to enable and disable an interrupt.
6) Explain the use of PCI bus in the computer system.
7) Explain the Double-data-rate SDRAM concept.
8) Explain the concept of flash drives.
9) Compare super scalar verses VLIW.

PART-B
Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks
1. 1. Explain with examples one-address, two-address and three-address instruction
types.
2. Describe program-controlled I/O operation.
3. Illustrate with diagram arithmetic and logic operation.
4. Describe the working of DMA.
5. Explain the serial port interface.
6. Explain the operation asynchronous DRAM.
7. Describe the features of PROM, EPROM and EEPROM.
8. Illustrate with diagram memory hierarchy with respect to speed, size and cost.
9. Explain CISC scalar and RISC scalar processor.
10. Describe Arithmetic, Instruction and processor pipelining.

Directorate Of Technical Education Karnataka State CS&E 15CS32T

 MODEL QUESTION BANK
Diploma in Computer Science & Engineering
III Semester
Course Title: Computer Organization

CO Question CL Marks
Explain the basic functional unit of a Computer. R
Describe the role of MAR, MDR , PC and IR. R
I Explain in brief the basic operation concept between processor and the R 05
memory.
Explain the significance of single bus structure. R
Explain the role of buffer registers. R
Explain byte addressability. U
Describe the Big-endian and Little-endian addressability. U
Explain the basic memory operation. U
Explain straight line sequencing. U 05
Write a note on conditional codes. U
Describe register and absolute addressing mode. U
Write a note on relative addressing. U
Explain with examples one-address, two-address and three-address U
II instruction types.
Illustrate Branching concept with Example. A
Illustrate with examples Indirect addressing. A
Describe Indexed addressing with examples. A 10
Explain different assembler directives. U
Explain the execution of assembly language program. U
Describe program controlled I/O operation. U
Explain the significance of auto-increment and auto-decrement U
addressing mode
Explain the different phases for instruction execution . U
Write a note on register transfers. U
Explain how a complete instruction is executed. U 05
Write a note on Hardwired control unit. U
Explain the concept of micro programmed control unit. U
III Explain single bus organization. U
Illustrate with diagram arithmetic and logic operation. U
Describe fetching a word from memory. U 10
Explain multiple bus organization. U
With block diagram explain complete processor. U
Explain the memory-mapped I/O concept. U
Illustrate program controlled I/O. U
Write a note on interrupts. U
Explain how to enable and disable an interrupts. U
Write a note on vectored interrupts. U
Explain the exception concepts with respect to I/O. U 05
8

Directorate Of Technical Education Karnataka State CS&E 15CS32T

 Explain bus arbitration logic. U
List the activities of an I/O interface. U
Explain the use of PCI bus in the computer system. A
Write a note on SCSI bus. A
IV Explain the universal serial bus concept. U
Illustrate with examples interrupt service routine. A
Explain implementation of prioritized interrupts. U
Describe the working of DMA. U 10
Explain synchronous and asynchronous bus. U
Explain with example parallel port connectivity. A
Explain serial port interface. A
Illustrate how to implement a static RAM memory cell. A
Illustrate how to implement CMOS memory. A
Explain the Double-data-rate SDRAM concept. U
Write a note on Ram bus memory. U 05
Explain the configuration of ROM cell. U
Write a note on flash memory. A
Explain the concept of flash drives. A
V Explain the significance of cache memory. U
Explain the internal organization of memory chips. U
Explain the operation of asynchronous DRAM. U
Explain the operation of synchronous DRAM. U
Explain static and dynamic memory system. U 10
Explain the use of memory controller with diagram. A
Describe types of ROM A
Illustrate with diagram memory hierarchy with respect to speed, size U
and cost
Explain the working of cache memory operations. U
Explain Architecture of RISC machine. U
Compare CISC verses RISC. U
Explain super scalar processor. U
Compare super scalar verses VLIW. U 05
List advantages of multi core architecture. U
List the applications of multi core architecture. A
VI Explain Non-linear pipeline processor. U
Explain VLIW Architecture. U
Explain CISC scalar and RISC scalar processor . U
With neat diagram explain Multi core architecture. U 10
Explain Asynchronous and synchronous model of linear pipeline U
processor.
Describe Arithmetic, Instruction and processor pipelining. U

Directorate Of Technical Education Karnataka State CS&E 15CS32T

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title:
Database Management Systems
Course Code:
Scheme (L:T:P) : 4:0:0 Total Contact Hours: 52
15CS33T
Type of Course: Lectures, Self Core/ Elective:
Credit :04
Study & Student Activity Core
CIE- 25 Marks SEE- 100 Marks

Prerequisites
Knowledge of programming language.

Course Objectives

1. Understand database concepts, applications, data models, schemas and instances.

2. Implement the relational database design and data modelling using entity-relationship
(ER) model.
3. Demonstrate the use of constraints and relational algebra operations.
4. Use of SQL in querying the database
5. Demonstrate Normalization process.
6. Learn the new emerging Technologies and Applications in database.

Course Outcome

On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked PO Teaching
Course outcome
Hours

CO1
Identify the characteristics of database and
R,
describe the architecture and languages of 1,2,5,6,7,8,9,10 08
U
Database system.
CO2
Identify the elements used in Entity- U,
Relationship diagram and sketch a simple 1,2,3,4,5,6,7,8,9,10 08
A
diagram.
CO3 Summarize relational model concept and U,
A 1,2,3,4,5,6,7,8,9,10 08
illustrate the relational constraints.
CO4 Describe Structured Query Language
A 1,2,3,4,5,6,7,8,9,10 10
(SQL) and apply to query a database.
CO5 Recognize and interpret normalization for U, 1,2,3,4,5,6,7,8,9,10 08
relational databases. A
CO6 Visualize the features of NOSql and 10
A 1,2,3,4,5,6,7,8,9,10
identify the database applications.
Total sessions 52

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Directorate Of Technical Education Karnataka State CS&E 15CS33T

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
Computer Organisation 3 3 3 3 3 3 3 3 3 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

Course Content and Blue Print of Marks for SEE

Unit Hour Questions to Marks Marks

No Unit Name be set for Weightage Weightage
SEE (%)
R U A A
I Identify the characteristics of 10 12 - 22 15.38
database and describe the
08
architecture and languages of
Database system.
II Identify the elements used in 6 10 6 22 15.38
Entity-Relationship diagram and 08
sketch a simple diagram.
III Summarize relational model 5 10 7 22 15.38
concept and illustrate the 08
relational constraints.
IV Describe Structured Query - 5 25 30 19.24
Language (SQL) and apply to 10
query a database.
V Recognize and interpret - 24 - 24 15.38
normalization for relational 08
databases.
VI Visualize the features of NOSql - 15 10 25 19.24
and identify the database 10
applications.
Total 52 21 76 48 145 100

UNIT I : Databases and Data Base Users 08 Hrs

Introduction, An Example, Characteristics of the database approach, Actors on the scene,

Workers behind the scene, Advantages of using the DBMS Approach, A Brief History of
Database Applications, When Not to use a DBMS
Database System Concepts and Architecture - Data Models, Schemas, and Instances,
Three-Schema Architecture and Data Independence, Database Languages and Interfaces, The
Database System Environment, Centralized and Client /Server Architectures for DBMSs,
Classification of database Management System.
UNIT II: Data Modelling Using the Entity-Relationship(ER) Model 08 Hrs

Directorate Of Technical Education Karnataka State CS&E 15CS33T

Using High-Level Conceptual Data Models for Database Design, An example Database
Application, Entity Types, Entity Sets, attributes and keys, Relation Types, Relationship
Sets, roles and structural constraints, Weak Entity Types, Refining the ER Design for the
Company Database, ER Diagrams, naming, conventions and design issues, Relationship
Types of Degree Higher Than Two.

UNIT III: Relational Data Model and Relational Data Base Constraints 08 Hrs
Relational Model concepts, Relational Model Constraints and relational database schemas,
Update Operation, Transaction and Dealing with constraints violations.

UNIT IV: SQL: Schema Definition, constraints, queries and views 10 Hrs

SQL Data Definition and data types, Specifying constraints in SQL, Schema Change
statement in SQL, Basic queries in SQL, More Complex SQL queries, INSERT, DELETE
and UPDATE statements in SQL, Specifying constraints and Assertions and Triggers,
Views(Virtual Tables) in SQL

UNIT V: Functional Dependencies and normalization for relational databases 08 Hrs

Informal Design guidelines for relation schemas, Functional dependencies, Normal forms
based on primary keys, General Definition of second and third normal forms, Boyce-codd
Normal form.
UNIT VI: Fundamentals of Data Base Transaction Processing 10 Hrs
Introduction to transaction processing, transaction and system concepts, desirable properties
of transactions.
NoSQL – Introduction, Distributed Systems, Advantages & Disadvantages of Distributed
Computing, Scalability, What is NoSQL? Why NoSQL? RDBMS vs. NoSQL, Brief history
of NoSQL, CAP theorem (Brewer’s Theorem), NoSQL pros/cons, NoSQL Categories,
Production deployment.
®Text books
1. Fundamentals of Database Systems, Sixth edition, 2014, Ramez Elmasri, Shamkan B.
Navathe, Pearson Education, ISBN- 9788131792476
2. http://www.w3resource.com/mongodb/nosql.php --for NoSQL - UNIT VI

References
1. Fundamentals of Database Management Systems, Mark L. Gillenson, 2009, Wiley
India
2. Database Management Systems – Raghu Ramakrishnan and Johannes Gehrke – 3rd
Edition, McGraw-Hill, 2003
3. DBMS a practical approach , by E R Rajiv Chopra, S Chand publications.
4. http://elearning.vtu.ac.in/10CS54.html
5. http://www.tutorialspoint.com/dbms/
6. http://www.indiabix.com/technical/dbms-basics/
7. http://beginner-sql-tutorial.com/sql.htm
Suggested list of student activities

Note: The following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
3

Directorate Of Technical Education Karnataka State CS&E 15CS33T

1. Each group should do any one of the following type activity or any other similar activity
related to the course and before conduction, get it approved from concerned course co-
ordinator and programme co-ordinator
2. Each group should conduct different activity and no repeating should occur.

1 Identify and do a case study on relationship types of degree higher than two in ER
data modelling
2 Design E-R diagrams for the following databases with all constraints specifications.
a) Hospital Management b) Hotel Management c) Student Database
3 Conduct a survey on various applications of database and submit a report of 3 to 4
pages.
4 Conduct a case study on any one Online Transaction Processing System (OLTP)
and submit a report of 3 to 4 pages. Ex: Online Banking , Online Reservation (Bus,
Train, Airlines)

Course Delivery
The course will be delivered through Lectures and Power point presentations/ Video
Course Assessment and Evaluation Scheme

Method What To When/Where Max Evidence Course outcomes

who (Frequency in Marks collected
m the course)
CIE IA Three IA tests 1 to 6
(Average of
20 Blue books
three tests will
be computed)
Students
Direct Assessment

Student 1 to 6
05 Report
activities
Total 25
SEE End End of the Answer scripts 1 to 6
100
Exam course at BTE
Student Feedback Middle of the 1,2,3 Delivery of
Feedback forms
on course course course
Students
Assessment

End of Course End of the 1 to 6

Survey course Effectiveness of
Indirect

Questionnaires Delivery of
instructions &
Assessment Methods
Note: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off

to the next higher digit.

Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 15
2 Understanding 50
3 Application 35

Directorate Of Technical Education Karnataka State CS&E 15CS33T

 Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (20 marks)
2. Student suggested activities report for 5 marks
3. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.

FORMAT OF I A TEST QUESTION PAPER (CIE)

Test/Date and Time Semester/year Course/Course Code Max Marks

Ex: I test/6 th weak of I/II SEM

20
sem 10-11 Am
Year:
Name of Course coordinator : Units:__
CO’s:____

Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal choice may be given in each CO at the same cognitive level (CL).

MODEL QUESTION PAPER (CIE)

Test/Date and
Semester/year Course/Course Code Max Marks
Time

Ex: I test/6 th week III SEM Data Base Management Systems 20

Directorate Of Technical Education Karnataka State CS&E 15CS33T

 of sem 10-11 AM Year: 2015-16 Course code:15CS33T

Name of Course coordinator :

Units:1,2 Co: 1,2

Note: Answer all questions

Questio C
Question CL PO
n no O

1 Define the following. (5) R 1 1,2

1. Data Model 2. Database Schema/Intension 3. Database
State/Extension 4. Data Sublanguage 5. DML.
2 Define data independence and explain different types of it. (5) R 1 1,2

3 Explain the different cardinality ratios for binary relationship types. (5) U 2 1,2

4 Explain with suitable examples 1:1 and M:N relationship types. (5) A 2 1,2
OR
Develop an E-R diagram for a company database.

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Directorate Of Technical Education Karnataka State CS&E 15CS33T

 Collection of Does not Collects Collects Collects Collects a 3
data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

MODEL QUESTION PAPER Code: 15CS33T

Diploma in Computer science & Engineering
III- Semester
Course Title: Data Base Management Systems
Time: 3 Hours Max Marks: 100

Directorate Of Technical Education Karnataka State CS&E 15CS33T

 PART-A
Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks
1. What is database? List the important characteristics of database approach.
2. Explain with examples Entity Integrity Constraints and referential Integrity
Constraint.
3. Explain the characteristics of Relations.
4. With examples write a note on CREATE and DROP command.
5. Differentiate Having and Where clause with example.
6. Explain the Boyce-Codd normal form with example.
7. Explain the generation of spurious tuples and how to overcome the same.
8. Discuss the advantages of NoSql versus RDBMS.
9. What is scaling. Explain the types of scaling.

PART-B
Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks
1. Discuss the advantages of DBMS Approach.
2. Define the following.
a) Data Model b) Database Schema/Intension c) Database State/Extension
d) Data Sublanguage. e) DML.
3. With a neat diagram explain the different phases of database design.
4. Identify the entities, relationships and develop an E-R diagram for a company database.
5. Explain with example the different Constraints that are violated during UPDATE and
DELETE operations
6. Consider the following schema & write the SQL queries.
SAILORS (sid, sname, rating, age)
BOATS (bid, bname, color)
RESERVES (sid, bid, day)
a. Retrieve names of sailors who reserved green boat.
b. Retrieve the colors of boats reserved by ‘ramesh’.
c. Retrieve the names of sailors who have reserved a red or a green boat.
d. Retrieve the sid of sailors with age over 20 who have not reserved a red boat.
e. Retrieve the names of sailors who have reserved all boats called ‘Interlake’.
7. List and explain the different data types used in SQL.
8. Discuss the informal design guidelines for relational schema.
9. Draw a state diagram and discuss the typical states during transaction execution.
10. Explain the need for concurrency control.

MODEL QUESTION BANK

Diploma in Computer Science & Engineering
III Semester
Course Title: Data Base Management Systems

CO Question CL Marks

Directorate Of Technical Education Karnataka State CS&E 15CS33T

 What is database? List the important characteristics of database R
approach.
What do you mean by data model? List and explain the different R
types of data model.
What is Data Independence? Differentiate between logical & U
physical Data Independence.
Define the following. R
1. Data Model 2. Database Schema/Intension 3. Database
State/Extension 4. Data Sublanguage 5. DML. 05
Explain the functions of database administrators and database U
designers.
Briefly explain the different types of End Users. U
Define data independence and explain different types of it. U
I List the various DBMS languages and explain each. R
List the various DBMS interfaces and explain each. R
Explain the functions of different Database utilities. U
Explain the important characteristics of database approach. U
Explain the actors on the scene and workers behind the scene. U
Discuss the advantages of DBMS Approach. U
Explain the two-tier client/server architecture for DBMS with neat U 10
diagram.
Explain the DBMS components modules with neat diagram. U
Write a note on classification of DBMS. U
What is E-R diagram? List out the notations used for E-R diagram. R
Explain the different cardinality ratios for binary relationship types. U
Differentiate between a) an attribute and value set U 5
b) stored and derived attributes.
Explain the structural constraints of relationship type. U
Explain with suitable examples 1:1 and M:N relationship types. A
With a neat diagram explain the different phases of database design. U
What is a Weak entity type, explain with an example how the entities U
II are identified in a Weak entity.
Define the following term with examples:- R
a) Entity b) Entity set c) Multi-valued attribute
d) Composite attribute e)Derived attribute 10
Identify the entities, relationships and develop an E-R diagram for a A
company database.
Identify the entities, relationships and develop an E-R diagram for a A
Hospital database.
Compare entity integrity and referential integrity constraints. U
Classify the constraints on databases and give examples for each of U
them. 5
Explain the characteristics of Relations. U
Explain with examples Entity Integrity Constraints and referential A
III Integrity Constraint
Differentiate i) Key and super Key ii) degree and cardinality U
Define the following term with examples:- R

Directorate Of Technical Education Karnataka State CS&E 15CS33T

 a) Domain b) Attribute c) Tuple d) Relation schema (R)
e) Relation (r) 10
Explain the insert, delete and update operation with examples. A
Explain with example the different constraints that are violated U
during UPDATE and DELETE operations
Write a note on different data types supported by SQL. R
Write the general syntax of specifying Check constraint and default R
constraint while creating a table.
Differentiate Having and Where clause with example. A
Write a note on aggregate functions in SQL. U
Discuss the strategies for View Implementation. U 5
With examples write a note on CREATE and DROP command. A
Define view. How to create it? Give example. U,A
Explain UPDATE and ALTER command with example. U,A
Write a note on basic queries in SQL. U
IV Explain the different schema change statements in SQL with A
example.
List and explain the different data types used in SQL. U
Explain different constraints available in SQL with example. U
List and explain the different aggregate functions available in SQL A
with example.
Explain the following with examples: A
a) Insert b) Delete c) Distinct d) Order by e) Where
Explain the following Operators with examples: A
a) ANY b) ALL c) IN d) LIKE e) BETWEEN 10
Consider the following schema & write the SQL queries. A
SAILORS (sid, sname, rating, age)
BOATS (bid, bname, color)
RESERVES (sid, bid, day)
a) Retrieve names of sailors who reserved green boat.
b) Retrieve the colors of boats reserved by ‘ramesh’.
c) Retrieve the names of sailors who have reserved a red or a
green boat.
d) Retrieve the sid of sailors with age over 20 who have not
reserved a red boat.
e) Retrieve the names of sailors who have reserved all boats
called ‘Interlake’.

And Similar databases to be considered with different set of queries.

Explain the generation of spurious tuples and how to overcome the U
same.
Differentiate between U
i) prime attribute and non prime attribute
ii) Full functional dependencies and partial dependencies with
examples. 5
Explain the functional dependencies with examples. U
Explain second normal form with an example. U
V Explain third normal form with an example. U

10

Directorate Of Technical Education Karnataka State CS&E 15CS33T

 Explain the Boyce-Codd normal form with example. U
Explain the different UPDATE anomalies of tables. U
Discuss the informal design guidelines for relational schema. U 10
What is normalization? Explain the different types of normal forms U
with examples.
Explain the following terms: transaction, concurrency control. U
Explain the desirable properties of a transaction. U
Write a note on System Log. U
Write a note on commit point of a transaction. U
Discuss the advantages of NoSql versus RDBMS. U 5
Explain CAP theorem. U
VI Explain the advantages of distributed computing. U
What is scaling. Explain the types of scaling. U
Differentiate between ACID and BASE. U
Bring out the advantages and disadvantages of Nosql. U
Draw a state diagram and discuss the typical states during transaction A
execution.
Discuss the different types of failures that occur during transaction A 10
execution.
Explain the need for concurrency control. A
Explain the categories of NoSql. U
Explain Column store and Row store with suitable examples. A

11

Directorate Of Technical Education Karnataka State CS&E 15CS33T

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title: Computer Network

Course Code:
Scheme (L:T:P) : 4:0:0 Total Contact Hours: 52
15CS34T
Type of Course: Lectures, Self Core/ Elective:
Credit :04
Study & Student Activity. Core
CIE- 25 Marks SEE- 100 Marks

Prerequisites
Basic Knowledge of Computers and Communication

Course Objectives:

1. Discuss basic concepts, the need, and the various components in Networking
2. Learn the types of network topologies used in a network.
3. Discuss the importance of LAN components, protocols and addressing schemes.
4. Learn the basic concepts of WAN connectivity and its devices.

Course Outcome

On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked Teaching
Course outcome
PO Hours
CO1 Define various data communication components R, 1,2,10 06
in networking. U
CO2 Describe networking with reference to different types R,
1,2,10 06
of models and topologies. U
CO3 Summarize the concepts related to error detection, R,
2,3,4,5,10 08
correction and error control techniques. U

CO4
Recognize the importance of LAN components,
U,
protocols that enable multiple computers to 2,3,4,8,10 14
A
communicate with one another.
CO5 Identify the features of the different IP address R,
2,3,4,10 06
classes. A
CO6 Explain different connectivity and devices related U,
2,3,4,5,8,10 12
to WAN. A
Total sessions 52

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Directorate Of Technical Education Karnataka State CS&E 15CS34T

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
Computer Network 3 3 2 2 2 - - 2 3 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

Course Content and Blue Print of Marks for SEE

Unit Hour Questions to Marks Marks
No Unit Name be set for Weightage Weightage
SEE (%)
R U A A
I Introduction to Data 05 11 - 16 11.53
06
Communication
II Introduction to - 08 08 16 11.53
Networking and 06
Topologies
III Error Detection and Error - 13 10 23 15.38
08
Correction
IV LAN Components and - 15 25 40 27
14
Protocols
V Network Addressing 06 - 16 - 16 11.53
VI Wide Area Networks 12 15 19 34 23.03
Total 52 05 78 62 145 100

UNIT I: Introduction to Data Communication 06 Hrs

Data communication: Components, Data representation, Data flow, Networks – Categories of
networks, Internetwork – Internet and Protocols, Analog and Digital Signals, Periodic and
Non-Periodic Signals, Sine Wave, Phase, Wavelength, Digital Signals, Bit-rate, Bit-length,
Transmission Impairment – Attenuation, Distortion and Noise, Performance - Bandwidth,
Throughput, Latency, Jitter (Basic concepts only). Transmission Modes – Parallel and Serial
Transmission, Asynchronous and Synchronous Transmission
UNIT II: Introduction to Networking and Topologies 06 Hrs
Overview of Networking, Need for Networking, Hardware and Software components,
Network Communication Standards, OSI Reference Model, TCP/IP Model, Overview of
network topologies, Basic topologies- bus, ring, star, mesh and hybrid

UNIT III: Error Detection and Correction 08 Hrs

Introduction, Types of Errors, Redundancy, Detection versus Correction, Forward Error
Correction versus Retransmission, Coding, Block Coding, Error Detection, Error Correction,
Cyclic Codes, Cyclic Redundancy Check, Polynomials, Advantages of Cyclic Codes, Flow
Control, Error Control, Multiple Access - CSMA, CSMA/CD, Controlled Access –
Reservation, Polling, Token Passing
2

Directorate Of Technical Education Karnataka State CS&E 15CS34T

UNIT IV: LAN Components and Protocols 14Hrs

LAN Cables – Co-axial, twisted pair, optical fibre, LAN connectors- co-axial cable, and
twisted pair cable, optical fibre, LAN devices – repeaters, hubs, switches, NIC, WLANs.
Lower Layer Protocols - ARCnet, Ethernet, Ethernet Communication, Fast Ethernet, Gigabit
Ethernet, Token Ring, Token Ring Frame format, Fault Management and tolerance, FDDI,
Middle Layer Protocols- TCP/IP, Higher Layer Protocols- HTTP,FTP, SMTP, IMAP.

UNIT V: Network Addressing 06 Hrs

Introduction, TCP/IP addressing scheme- Components of IP addressing, IP address classes,

Limitations of IP address classes, IP subnetting - Creating subnets in networks,
Communication across subnets, Subnetting Considerations, Subnetting Limitations, IPv6.

UNIT VI: Wide Area Networks 12 Hrs

Overview, WAN Connectivity- POTS, Leased Lines, ISDN-Features and Working, VSAT-
Devices, Networks, Architecture, Access Technologies, Microwave, Radio, Infrared, VPNs-
Working of VPN, Protocols-PPTP,L2TP,IPSec.
WAN Devices – Bridges -Transparent and Source Routing, Routers –Routing Mechanics,
Routing Table, Routing Protocols – RIP,OSPF, Gateways, WAN Protocols-
PPP,X.25,FrameRelay and ATM ,Internet Tools and Services- Domain Name System ,
Windows Internet Naming Service, Dynamic Host Configuration Protocol.

®Text Books
1. Data Communications and Networking - Behrouz A Forouzan, Tata McGraw-Hill, 5th
edition, ISBN: 9780070634145 for Unit I and III.
2. Basics of Networking, PHI learning Pvt. Ltd. 2013, ISBN: 978-81-203-2489 for Unit
II, IV, V and VI.

References
1. http://www.tutorialspoint.com/data_communication_computer_network/index.htm
2. http://www.e-tutes.com/lesson1/networking_fundamentals_lesson1_1.htm
3. http://www.techiwarehouse.com/engine/d9e99072/Basic-Networking-Tutorial
4. http://www.nptel.com
5. http://www.w3schools.com/

Suggested list of student activities

Note: The following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
1. Each group should do any one of the following type activity or any other similar activity
related to the course and before conduction, get it approved from concerned course co-
ordinator and programme co-ordinator
2. Each group should conduct different activity and no repeating should occur.

1 Prepare a report on Significance of computer networks and its evolution specifying

its advantages and disadvantages of computer networking
3

Directorate Of Technical Education Karnataka State CS&E 15CS34T

 2 Prepare a presentation on Sending Email via Telnet
3 Prepare a report on File sharing between computers using LAN connectivity
4 Prepare a report on Setting up a Wireless LAN
5 Prepare a report on Securing a Wireless LAN
6 Prepare a presentation on use of ping program to test your own computer

Course Delivery

The course will be delivered through lectures and Power point presentations/ Video

Course Assessment and Evaluation Scheme

Method What To When/Where Max Evidence Course

who (Frequency in Marks collected outcomes
m the course)
CIE IA Three IA tests
(Average of
20 Blue books 1 to 6
three tests will be
Direct Assessment

computed)
Students

Student activities Activity

05 1 to 6
Reports
Total 25
SEE End End of the Answer scripts
100 1 to 6
Exam course at BTE
Student Middle of the
Feedback 1,2,3 Delivery
Feedback on course
forms of course
Indirect Assessment

course
Students

End of Course End of the course 1 to 6

Survey Effectiveness
of Delivery of
Questionnaires
instructions &
Assessment
Methods
Note: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off

to the next higher digit.

Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 20
2 Understanding 45
3 Application 35

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (20 marks)
2. Student suggested activities report for 5 marks
3. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.

Directorate Of Technical Education Karnataka State CS&E 15CS34T

 FORMAT OF I A TEST QUESTION PAPER (CIE)
Test/Date and Time Semester/year Course/Course Code Max Marks

Ex: I test/6 th weak of I/II SEM

20
sem 10-11 Am
Year:
Name of Course coordinator : Units:__
CO’s:____

Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal choice may be given in each CO at the same cognitive level (CL).

MODEL QUESTION PAPER (CIE)

Test/Date and
Semester/year Course/Course Code Max Marks
Time

Ex: I test/6 th week III SEM Computer Networks

20
of sem 10-11 AM Year: 2015-16 Course code:15CS34T

Name of Course coordinator :

Units:1,2 Co: 1,2

Note: Answer all questions

Questio C
Question CL PO
n no O

1 Define the following terms – (5) R 1 1,2

a. Data communication.
b. Phase.
c. Wavelength.
d. Bandwidth.
e. Throughput.
2 Discuss different forms of data representation (5) U 1 1,2
OR
Explain briefly the components of Data communication, with a diagram
3 Explain the need for networking. (5) A 2 1,2

4 Explain TCP/IP reference model. (5) U 2 1,2

Directorate Of Technical Education Karnataka State CS&E 15CS34T

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS34T

MODEL QUESTION PAPER Code: 15CS34T
Diploma in Computer science & Engineering
III- Semester
Course Title: COMPUTER NETWORK

Time: 3 Hours Max Marks: 100

PART-A
Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks

1) Define the following terms –

a. Data communication.
b. Phase.
c. Wavelength.
d. Bandwidth.
e. Throughput.
2) Explain the functions of physical and data link layers of OSI model.
3) Illustrate block coding with example.
4) Mention some standard CRC Polynomials.
5) Write a note on optical fibre cable.
6) Explain broadcasting in Ethernet network.
7) Discuss different subnetting considerations.
8) Describe the content of Routing table.
9) Explain the working of ISDN.
.

PART-B
Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks
1. Explain briefly the components of Data communication with diagram.
2. Explain OSI reference model with neat diagram.
3. Explain with an example design of CRC encoder and decoder.
4. List and explain coaxial twisted pair and optical fibre connectors.
5. Illustrate with diagram media access in Token Ring.
6. Compare SMTP verses POP.
7. Explain the features of IP address classes.
8. Describe VSAT network architecture and access technologies.
9. Explain briefly transparent bridge.
10. Explain ATM reference model with diagram.

Directorate Of Technical Education Karnataka State CS&E 15CS34T

 MODEL QUESTION BANK
Diploma in Computer Science & Engineering
III Semester
Course Title: Computer Network

CO Question CL Marks
Define the following terms – R
a. Data communication.
b. Phase.
c. Wavelength.
d. Bandwidth.
e. Throughput.
Define the following terms – R
f. Periodic signal.
g. Non-periodic signal. 05
h. Latency.
i. Jitter.
j. Bit rate.
Illustrate different types of data flow. R
I Explain briefly the components of Data communication, with a diagram. R
Discuss different forms of data representation. U
Mention and explain the fundamental characteristics of data U
communication system.
Explain the different categories of networks. U
Explain briefly the components of Data communication, with a diagram. U
Mention and explain the fundamental characteristics of data U
communication system. 10
Explain the different categories of networks. U
Explain the need for networking. A
Explain the function of physical and data link layers of OSI model. U
Explain the function of presentation and application layers of OSI U
model.
Explain the function of Transport layer and Session layers of OSI U
5
model.
Explain TCP/IP reference model. U
List different network topologies. Explain with a diagram Ring A
Topology.
II Classify types of hardware and software network components. A
Explain OSI reference model with neat diagram. U
Compare OSI and TCP/IP Reference Models. U 10
Compare Bus and Star Topologies with diagram. A
Compare Mesh and Hybrid Topologies with diagram. A
Explain the terms – U
a. Error detection.
b. Error correction.
c. Redundancy.
d. Forward error correction.
e. Re-transmission.
Illustrate with examples different types of errors. U
Illustrate block coding with example. A 5
8

Directorate Of Technical Education Karnataka State CS&E 15CS34T

 Mention some standard CRC Polynomials. U
Discuss the advantages of Cyclic Codes. A
Explain briefly CSMA protocol. U
III Write a note on CSMA/CD. A
Explain with a diagram and an example, the process of error detection A
using block coding method.
With a diagram and an example, explain the structure of encoder and A
decoder in error correction.
Illustrate with a block diagram process of error detection in block A
10
coding.
Explain the design of CRC encoder and decoder, with an example. A
With an example, explain CRC division with polynomials. A
Discuss Controlled Access methods. U
Describe the important factors to be considered when transmitting signal U
between two computers.
Explain coaxial cable with a diagram. A
Write a note on optical fibre cable. A
Explain multimode transmission of optical fibre. U
Explain single mode transmission of optical fibre. U
Describe the role of switches. A
Explain the role of NIC. A
List the benefits of WLAN verses Conventional LAN. A 5
List and explain the uses of WLAN. A
List the disadvantages of ARCNet. A
IV Explain ARCNet data frame format. U
Explain broadcasting in an Ethernet network. A
Explain the features of Fast Ethernet. A
Explain TCP/IP middle layer protocol. A
Describe SMTP protocol. A
Write a note on IMAP. A
Explain different types of twisted pair cable with advantages and A
disadvantages.
List and explain coaxial, twisted pair and optical fibre connectors. A
Explain with a diagram Repeaters and Hubs. A
Describe Wireless LAN with a diagram. A
Illustrate with a neat diagram media access in Ethernet. A
10
Describe the Token Ring Data frame format. U
Illustrate with a diagram media access in Token Ring. A
Explain FDDI Lower layer protocol. A
Explain HTTP and FTP Higher layer protocols. A
Compare SMTP verses POP. A
Explain the components of an IP address. U
Explain the limitation of IP address classes. U 5
Discuss different sub netting considerations. U
V Explain the limitations of sub netting. U
Explain the features of IP address of classes. U
Explain the process of dividing a network into subnets. U 10
Explain communication across subnets with examples. U
Differentiate between LAN and WAN technologies. U
Explain the features of POTS. U
9

Directorate Of Technical Education Karnataka State CS&E 15CS34T

 Explain the advantages and disadvantages of Leased lines. A
Explain the working of ISDN. U
Describe the components of VSAT network. A
Identify and explain the different factors to be considered to access U
charges in WAN connectivity.
List the features of microwave connectivity. U
Describe the content of Routing table. U 5
Differentiate between Node–based Routing and Router–based Routing. A
Explain briefly Routing Protocols. U
Discuss frame relay protocol. A
VI Illustrate the working of VPN with a neat diagram. A
Describe VSAT network architecture and Access technologies. A
Compare the features of Radio and Infrared waves. U
Compare PPTP and IPSec. U
Explain briefly transparent bridge. U
Explain briefly Source Route Bridge. U
Describe different type of Gateways. A
Discuss PPP and X.25 Protocol. U 10
Explain ATM reference model with a diagram. A
Illustrate the working of DNS with a diagram. A
Illustrate the working of WINS with a diagram. A
Illustrate the working of DHCP with a diagram. A

10

Directorate Of Technical Education Karnataka State CS&E 15CS34T

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title: Programming with C lab

Course Code:
Scheme (L:T:P) : 0:2:4 Total Contact Hours: 78
15CS35P
Type of Course: Tutorial and Credit :03 Core/ Elective:
Practical’s Core
CIE- 25 Marks SEE- 50 Marks

Prerequisites

Knowledge of Computer Operation.

Course Objectives

1. Apply the specification of syntax rules for numerical constants and variables, data
types.
2. Usage of Arithmetic operator, Conditional operator, logical operator and relational
operators and other C constructs.
3. Write C programs using decision making, branching and loop constructs.
4. Apply and Write C programs to implement one dimensional and two dimensional
arrays.
5. Writing programs using functions.

Course Outcome

On successful completion of the course, the students will be able to attain CO:
Experiment CL Linked Teaching
Course Outcome PO Hrs
linked
CO1 1 to 3 12
Demonstrate branching statements A 1 to 10
CO2 4 to 7 1 to 10 18
Demonstrate looping statements A
CO3 8&9 A 1 to 10 12
Experiment on functions
CO4 10 to 12 1 to 10 18
Construct programs on arrays A
CO5 13 & 14 1 to 10 12
Solve programs on structures
CO6 Write program on Preprocessor directive 15 1 to 10 06
A
#define
Total sessions 78

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Directorate Of Technical Education Karnataka State CS&E 15CS35P

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
Programming with C lab 3 3 3 3 3 3 3 3 3 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

List of Graded Practical Exercises

Sl.No Practical/Exercise
1 WAP to swap the values of two variables without using third variable.
2 WAP to find the largest/smallest of 3 numbers (if-else).
3 WAP to calculate the roots of a quadratic equation (using switch).
4 WAP to sum & reverse a given integer (while loop).
5 WAP to detect the Armstrong numbers in three digits from 100 to 999.
(do-while).
6 WAP to check whether the given number is prime or not (for loop).
7 WAP to find the number of and sum of all integers greater than 100 and less than
200 that are divisible by 7 for loop).
8 WAP to calculate factorial of a given number using function.
9 WAP to find GCD of two numbers using function
10 WAP to search for a given number in an array
11 WAP to find the transpose of a given matrix
12 WAP to addition two matrices
13 WAP to create a structure with employee details and display the same
14 WAP to process student structure containing roll number, class and age as members.
The program must read 5 student record in an array of structure and display the
details of a student who is eldest. Use a function to find the eldest for which array of
structure is an argument.
15 WAP to demonstrate # define function.

Reference

Programming with ANSI-C, E. Balaguruswamy, Sixth Edition, Tata Mcgraw Hill.

Suggested list of student activities

Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5 students.
1. Each group should do any one of the following type activity or any other similar
activity related to the course and before conduction, get it approved from concerned
course co-ordinator and programme co-ordinator.
2. Each group should conduct different activity and no repeating should occur.
∑ Customer billing System Project, Cricket Score Board Project, Calendar,
Application Project, Employee Record System Project, Student Record

Directorate Of Technical Education Karnataka State CS&E 15CS35P

 System Project, Cyber Management System Project, College billing System
Project, Customer billing system, Phone book application, etc.

Course Delivery

The course will be delivered through Demonstration and Practices

Course Assessment and Evaluation Scheme

When/Where
To (Frequency Max Evidence Course
Method What
whom in the Marks collected outcomes
course)
IA Students Two tests 10 Blue books 1,2,3,4,5
(average of
two tests)
CIE Record 10 Record 1,2,3,4,5
Direct Assessment

(Continuous
Internal Student 05
Evaluation) activity. Report.

Total 25

SEE End End of the 50 Answer scripts 1,2,3,4,5

(Semester Exam course at BTE
End
Examination)
Student Feedback on Students Middle of the Feedback 1,2,3
course course forms Delivery of
course
Indirect Assessment

End of Course End of the Questionnaires 1,2,3, 4 & 5

Survey course Effectiveness
of Delivery
of
instructions
&
Assessment
Methods
*CIE – Continuous Internal Evaluation *SEE – Semester End Examination
Note:
1. I.A. test shall be conducted as per SEE scheme of valuation. However obtained marks
shall be reduced to 10 marks. Average marks of two tests shall be rounded off to the next
higher digit.
2. Rubrics to be devised appropriately by the concerned faculty to assess Student activities.

Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 20
3 Application 70

Directorate Of Technical Education Karnataka State CS&E 15CS35P

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (10 marks)
2. Record (10 marks)
3. Student suggested activities report for 5 marks
4. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS35P

 Scheme of Valuation for End Examination

1 Writing two programs 10+10=20

2 Executing any one program with result 20

3 Viva Voice 10

Total 50

**Evaluation should be based on the screen output only. No hard copy required.
**Change of question is allowed only once. Marks of 05 should be deducted in the given
question.
Resource requirements for Programming with C Lab
(For an Intake of 60 Students [3 Batches])

Sl. No. Equipment Quantity

1
PC systems (latest configurations with speakers) 20
2
Laser Printers 01
3
Networking (Structured) with CAT 6e / wireless 03
24 Port switches / Wireless Router
I/O Boxes for networking(as required)
4 Broad Band Connection 01
**Open Source Software should be encouraged

MODEL QUESTION BANK

1 WAP to swap the values of two variables without using third variable.
2 WAP to find the largest/smallest of 3 numbers (if-else).
3 WAP to calculate the roots of a quadratic equation (using switch).
4 WAP to sum & reverse a given integer (while loop).
5 WAP to detect the Armstrong numbers in three digits from 100 to 999.
(do-while).
6 WAP to check whether the given number is prime or not (for loop).
7 WAP to find the number of and sum of all integers greater than 100 and less than 200
that are divisible by 7 for loop).
8 WAP to calculate factorial of a given number using function.
9 WAP to find GCD of two numbers using function
10 WAP to search for a given number in an array
11 WAP to find the transpose of a given matrix
12 WAP to addition two matrices
13 WAP to create a structure with employee details and display the same
14 WAP to process student structure containing roll number, class and age as members. The
program must read 5 student record in an array of structure and display the details of a
student who is eldest. Use a function to find the eldest for which array of structure is an
argument.
15 WAP to demonstrate # define function.

Directorate Of Technical Education Karnataka State CS&E 15CS35P

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title: DBMS and GUI lab

Course Code:
Scheme (L:T:P) : 0:2:4 Total Contact Hours: 78
15CS36P
Type of Course: Tutorial and Credit :03 Core/ Elective:
Practical’s Core
CIE- 25 Marks SEE- 50 Marks

Prerequisites

Knowledge of basics DBMS theoretical concepts

Course Objectives

1. Provide strong formal foundation in database concepts.

2. Understand relational data model and systematic database design approach including
conceptual design and logical design using data modelling tool.
3. Learn the techniques of query processing using SQL engines.
4. Develop a database application using any of the GUI application products.

Course Outcome

On successful completion of the course, the students will be able to attain CO:
Experiment CL Linked Teaching
Course Outcome PO Hrs
linked
Explain the underlying concepts of 1,2,3
CO1 database technologies. Design and 03
U, A 1 to 10
implement a database schema for a
given problem-domain.
CO2 1,2,3 1 to 10 03
Apply Normalization to a database. U, A
Illustrate and query a database using 1 to 17 1 to 10
CO3
SQL DML/DDL commands To motivate
the students to relate all these to one or A 48
more commercial product environments
as they relate to the developer tasks
CO4
Design, create, build, and debug 18 1 to 10
Gambas /Visual Basic Database A 24
applications.
Total sessions 78

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Directorate Of Technical Education Karnataka State CS&E 15CS36P

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
DBMS and GUI lab 3 3 3 3 3 3 3 3 3 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

List of Graded Practical Exercises

1. Using any open source data modelling tool (MySQL/Rational Rose/ERwin), design and
develop a ER diagram for the following Library database. Specify relevant Referential
constraints.

BOOK_AUTHORS
BOOK_ID AUTHOR_NAME

PUBLISHER
NAME ADDRESS PHONE

BOOK_COPIES
BOOK_ID BRANCH_ID NO_COPIES

BOOK_LOANS
BOOK_ID BRANCH_ID CARD_NO DATE_HIRED DUE_DATE

LIBRARY_BRANCH
BRANCH_ID BRANCH_NAME ADDRESS

BORROWER
CARD_NO NAME ADDRESS PHONE

2. Consider a GRADE_BOOK database in which instructors within an academic department

record point earned by individual students in theory classes. The data requirements are
summarised as follows:
∑ Each student is identified by a unique identifier, first and last name and an email address.
∑ Each instructor teaches certain courses each term. Each course is identified by a course
number, a section number and the term in it is taught. For each course he or she teaches,
the instructor specifies the minimum number of points required in order to earn letter
grades, A, B, C, D and F. For Ex. 90 points for an A, 80 points for a B, 70 points for a C
and so forth.
∑ Students are enrolled in each course taught by the instructor.
∑ Each course has a number of grading components (such as mid-term exam, final exam,
project and so forth). Each grading component has a maximum number of points (100 or

Directorate Of Technical Education Karnataka State CS&E 15CS36P

 50) and a weight (20% or 10%). The weight of all the grading components of a course is
100.
∑ Finally, the instructor records the points earned by each student in each of the grading
components in each course. For Ex. The student 1234 earns 84 points for a mid-term
exam, grading component of the section 2 course CS 2310 in the fall term of 2009. The
mid-term exam grading component may have been defined to have a maximum of 100
points and a weight of 20% of the course grade.

3. Create the following tables for a COMPANY database

EMPLOYEE
Fname Minit Lname Ssn Bdate Address Sex Salary Super_ssn Dno

DEPARTMENT
Dname Dnumber Mgr_ssn Mgr_start_date

DEPT_LOCATIONS
Dnumber Dlocation

PROJECT
Pname Pnumber Plocation Dnum

WORKS_ON
Essn Pno Hours

DEPENDENT
Essn Dependent_name Sex Bdate Relationship

4 Illustrate the use of constraints

NOT NULL
PRIMARY KEY
UNIQUE
CHECK
DEFAULT
REFERENCES
5 DATA MANIPULATION : INSERTING VALUES INTO A TABLE
6 Illustrate the use of SELECT statement
7 Conditional retrieval - WHERE clause
8 Query sorted - ORDER BY clause
9 Grouping the result of query - GROUP BY clause and HAVING clause
10 Aggregate functions in SQL (Count, Sum, Max, Min, Avg)
11 SQL operators(And, Or, Like, Between, In)
12 Query multiple tables using JOIN operation.
13 Write nested and complex queries using multiple tables.
14 Perform UPDATE, ALTER, DELETE, DROP operations on tables
15 Illustrate the use of CREATE VIEW command and manipulating
16 Use COMMIT and ROLL BACK commands
17 Use SAVEPOINT commands
18. GUI

Directorate Of Technical Education Karnataka State CS&E 15CS36P

 1. To study about various Gambas/Visual Basic (front end) or any other front
end tool
2. Design a form to use various tools like label, text, combo box, list boxes,
check box, option box, horizontal and vertical scroll bars, etc. Illustrate the
above with an example such as survey form, registration form for an event or
another other example.
3. Design a menu driven form to process student’s results or a shopping list or
any other example.
4. Generate a report for student’s results or employee details or shopping list or
any other example.
5. Based on any database specified in Question No. 1, 2 or 3. The application
must be menu driven having suitable active controls with database
connectivity. Generate different reports as per user requirements.

References

1. Fundamentals of Database system 5th Edition, Ramez Elmasri,Shamkan B. Navthe,

Pearson Education
2. Visual Basic 6 How to program by Deitel & Associates
3. http://www.tutorialspoint.com/dbms/sql_overview.htm
4. http://www.sql-tutorial.net/
5. http://www.visualbasicbooks.com/vb6introtutorial.html
6. http://gambas.sourceforge.net/
7. http://gambasdoc.org/help

Suggested list of student activities

Note: The following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5 students.
1. Each group should do any one of the following type activity or any other similar activity
related to the course and before conduction, get it approved from concerned course co-
ordinator and programme co-ordinator.
2. Each group should conduct different activity and no repeating should occur.
∑ Build DBMS application for processing students details such as personal details,
results, attendance etc. Use minimum 3-4 tables
∑ Build DBMS application for maintain a mini library of CD’s. Use minimum 3-4
tables
∑ Using any ER diagram modelling tool demonstrate modelling of any database
containing 3-4 tables.

Course Delivery
The course will be delivered through Demonstration and Practices

Directorate Of Technical Education Karnataka State CS&E 15CS36P

Course Assessment and Evaluation Scheme

When/Where
To (Frequency Max Evidence Course
Method What
whom in the Marks collected outcomes
course)
IA Students Two tests 10 Blue books 1,2,3,4
(average of
two tests)
CIE
Record 10 Record
Direct Assessment

(Continuous
Internal
Student 05 Report 1,2,3,4
Evaluation)
activity
Total 25

SEE End End of the 50 Answer scripts 1,2,3,4

(Semester Exam course at BTE
End
Examination)
Student Feedback on Students Middle of Feedback 1,2,3(half
course the course forms session)
Delivery of
Indirect Assessment

course
End of Course End of the Questionnaires 1,2,3, 4
Survey course Effectiveness
of Delivery
of
instructions
&
Assessment
Methods
*CIE – Continuous Internal Evaluation *SEE – Semester End Examination
Note:
1. I.A. test shall be conducted as per SEE scheme of valuation. However obtained marks
shall be reduced to 10 marks. Average marks of two tests shall be rounded off to the next
higher digit.
2. Rubrics to be devised appropriately by the concerned faculty to assess Student activities.

Questions for CIE and SEE will be designed to evaluate the various educational components
(Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 20
3 Application 70

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (10 marks)
2. Record (10 marks)

Directorate Of Technical Education Karnataka State CS&E 15CS36P

 3. Student suggested activities report for 5 marks
4. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.
Format for Student Activity Assessment

DIMENSIO Unsatisfactor Developin Satisfactor Good Exemplary Score

N y g y 4 5
1 2 3
Collection of Does not Collects Collects Collects Collects a 3
data collect any very some basic relevant great deal
information limited information information of
relating to the information ; refer to ; concerned information
topic ; some the topic to the topic ; all refer to
relate to the the topic
topic
Fulfill team’s Does not Performs Performs Performs
Performs 4
roles & perform any very little nearly all all duties
all duties of
duties duties duties duties assigned
assigned to team roles
the team role with
presentatio
n
Shares work Always relies Rarely Usually Does the Always 3
equally on others to does the does the assigned does the
do the work assigned assigned job without assigned
work; often work; having to work
needs rarely be without
reminding needs reminded. having to
reminding be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.2=
4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS36P

 Scheme of Valuation for End Examination

1 Creating and inserting records for minimum two tables. 10

Use minimum 2 constraints
2 Executing minimum 3 queries 15

3 Build a GUI program for the table created with data 15

grid view and options such as Add, Delete, Modify etc.
4 Viva-Voce 10

Total 50

**Evaluation should be based on the screen output only. No hard copy required.
**Change of question is allowed only once. Marks of 05 should be deducted in the given
question.

Resource requirements for DBMS & GUI Lab

(For an Intake of 60 Students [3 Batches])

Sl. No. Equipment Quantity

1 PC systems (latest configurations with speakers) 20
2 Laser Printers 01
3 Networking (Structured) with CAT 6e / wireless 03
24 Port switches / Wireless Router
I/O Boxes for networking(as required)
4 Broad Band Connection 01
**Open Source Software should be encouraged

Directorate Of Technical Education Karnataka State CS&E 15CS36P

 MODEL QUESTION BANK

1. a) Create table Employee and Dependent as per the following schema: Identify the Primary
and referential constraints on the table. Specify suitable constraint on the salary column such
that 12000 < Salary < 120000.
i) Employee Table

Fname Lname ssn Bdate Address Sex Salary Super Dno

ssn

ii) Dependent Table

Essn Dependent_name Sex Bdate

b) Insert records into the above tables.

c). Queries to be executed
∑ Add another column Relationship to dependent Table
∑ Retrieve all female dependents of the employees who have joined service after 31-01-
2010
∑ Retrieve the no. Of employees and total salary drawn by the employees belonging to
department no. 10.
d) Create a GUI to show any one of the table contents(include data grid view and perform
operations such as add, delete, modify etc)

2. a) Create table BOOK ,BOOK_AUTHORS and PUBLISHER with following Schema.

Identify the Primary and referential constraints on the tables. Specify default constraint on
gender column of BOOK _AUTHOR table.

i) BOOK
Book_id Title Publisher_name

ii) BOOK_AUTHOR
Book_id Author_name Gender
iii) PUBLISHER
Name Address Phone

b) Insert records into the above tables.

c) Queries to be executed
∑ Retrieve the book details of all the books authored by “Sharma”.
∑ Delete the record for the publisher by name “sapna”.
∑ For each publisher retrieve the total number of book titles published.
d) Create a GUI to show any one of the table contents(include data grid view and perform
operations such as add, delete, modify etc).

Directorate Of Technical Education Karnataka State CS&E 15CS36P

3. a) Create table EMPLOYEE,PROJECT and WORKS_ON as per the following schema:
Identify the Primary and referential constraints on the table.
i) Employee Table
Fname Lname Ssn Bdate Address Sex Salary Super Dno
ssn

ii) Project table

P_name Pno P_location
iii) Works_On
Essn Pno Hours

b) Insert records into the above tables.

c) Queries to be executed
∑ Retrieve employee name, address and salary with all employee names first
letter in capital.
∑ For each employee retrieve the total projects and total no. of hours he/she
works on.
∑ Illustrate the use of Save point, Rollback and Commit transaction commands.
d) Create a GUI to show any one of the table contents (include data grid view and perform
operations such as add, delete, modify etc).

4. a). Create table BOOK,BOOK_BORROWED and BOOK_BORROWER as per the following

schema: Identify the Primary and referential constraints on the table.
i) Book

Book_id Title Publisher_name

ii) Book_Borrowed
Book_id Card_No Date_out Due_Date

iii) Book_Borrower
Card_No Name Address Phone

b) Insert records into the above tables.

c) Queries to be executed
∑ Retrieve the names of people who have borrowed “Computer Network” book.
∑ Retrieve the number of days permitted to borrow “Computer Organization” by
“Cherry”.
∑ Illustrate the use of any four numeric functions.
d) Create a GUI to show any one of the table contents (include data grid view and perform
operations such as add, delete, modify etc).

5. a) Create table CUSTOMER , ACCOUNT, LOAN as per the following schema: Identify the
Primary and referential constraints on the table.
i) Customer

Directorate Of Technical Education Karnataka State CS&E 15CS36P

 Account_no Name Address Phone
ii) Account

Account_no. Transaction_type Amount Balance

iv) Loan

Loan _no Account_no Amount Loan_type Interest_rate

b) Insert records into the above tables.

c) Queries to be executed
∑ Retrieve all customers who have availed the loan amount of more than 5 lakhs.
∑ Create a view with the following attributes: Customer name, bank balance and loan
amount.
∑ Illustrate the use of Grant and Revoke commands.
d) Create a GUI to show any one of the table contents (include data grid view and perform
operations such as add, delete, modify etc).

6. a) Create table ART_OBJECT, PAINTING and STATUE as per the following schema:
Identify the Primary and referential constraints on the table.
i) Art_object
Id_no Artist_ Name Year_ Created Title Art_ type Description
Art type can either Painting or Statue

ii) PAINTING
Paint_ type Base_ Material Style Price
Paint type can be oil or water colour or organic colour
Base material can be paper, canvas or wood
Style can be Modern or Abstract
iv) Statue
Material_type Height Weight Style Price
Material tyoe can be stone, wood, glass
Style can be Modern or Abstract
b) Insert records into the above tables.
c) Queries to be executed
∑ Retrieve the details of the costliest painting using nested queries.
∑ Retrieve the names of the artist who have worked on Abstract style
∑ Delete all the records pertaining to the artist by name “Sahithya”.

d) Create a GUI to show any one of the table contents (include data grid view and perform
operations such as add, delete, modify etc).

Directorate Of Technical Education Karnataka State CS&E 15CS36P

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title: Network Administration lab

Course Code:
Scheme (L:T:P) : 0:2:4 Total Contact Hours: 52
15CS37P
Type of Course: Practical’s & Core/ Elective:
Credit :03
Student Activity Core
CIE- 25 Marks SEE- 50 Marks

Prerequisites
Knowledge of computer operation.

Course Objectives:

1. Learn basic fault detection, assembly and disassembly of PC

2. Learn and understand OS installation and network services.

Course Outcome

On successful completion of the course, the students will be able to attain CO:
Experiment CL Linked Teaching
Course Outcome PO Hrs
linked
CO1 Identify the different faults related to 1 to 4 18
U, A 1 to 10
CPU and RAM
CO2 Demonstrate the skills for assembly and 5-6 1 to 10 12
A
disassembly of a PC and install OS
CO3 Demonstrate the skills for computer 7-11 A 1 to 10 48
networking and its services.
Total sessions 78

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
Network Administration
3 3 3 3 3 3 3 3 3 3
Lab
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

Directorate Of Technical Education Karnataka State CS&E 15CS37P

List of Graded Practical Exercises

1. Study and measure voltages of SMPS

2. Drawing the motherboard layout (any latest processor) and studying the chipset
through data books or Internet
3. CMOS setup of any latest PC
4. Fault findings: (a) Problems related to CPU (b) Problems related to RAM
5. Disassembly and Assembling of PC and Installation of Operating System
a) Windows b) Linux. Perform dual booting also.
6. Learn parallel port, serial port and USB port testing and Installation of Scanner,
Printers and ADSL/DSL Modems
7. Crimping of RJ45: Straight and Cross.
a) Punching Cat 6 cable to I/O Box. Use punching tool.
b) Check connectivity using LAN tester.
8. Install a Switch and Wireless router
9. Study different IP class (A, B, C) addressing. (Manual & Dynamic). Check
connectivity for peer-to-peer and client-server
10. Windows Server & also install the following services
a) Active directory b) DNS c) DHCP
11. Visit any industry / institutes (Engineering colleges, university campuses, etc) and
study the following
i) Type and Configuration of client PC’s and OS (Eg: Linux, Windows, MAC
etc.)
ii) Type and Configuration of Servers and Domains used
iii) Type of networking (Topology and media used)
iv) Different network devices used (switch, routers, access points etc)
v) Different types of peripheral devices used (Eg: printers, scanner, web cam etc.)
vi) Applications used by the users.
Prepare a report of about 3 to 4 (A4 size) pages and include in the lab record.

E-learning content
1. http://www.howtogeek.com/
2. http://www.infotechguyz.com/
3. http://www.rebeladmin.com/2011/03/step-by-step-guide-to-setup-active-directory-
windows-server-2008/

Suggested list of student activities

Note: The following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
1. Each group should do any one of the following type activity or any other similar
activity related to the course and before conduction, get it approved from concerned
course co-ordinator and programme co-ordinator
2. Each group should conduct different activity and no repeating should occur

Suggested activities
1 Study and prepare a comparative report about the make, model, configuration,
etc., of different types of Printers.
2 Study and prepare a comparative report about the make, model, configuration,
etc., of different types of Scanners.
Directorate Of Technical Education Karnataka State CS&E 15CS37P
 3 Study and prepare a comparative report about the make, model, configuration,
etc., of different types of computer systems / laptops etc.
4 Study and prepare a comparative report about the make, model, configuration,
etc., of different network components and devices such as router, switches, etc.
5 Video conferencing using skpye etc.

Course Delivery
The course will be delivered through practical’s and presentations

Course Assessment and Evaluation Scheme:

Method What To When/Where Max Evidence Course

whom (Frequency in Marks collected outcomes
the course)
CIE IA Students Twice test 10 Blue books
Direct Assessment meth

(average of
two tests)
Record 10 Record 1,2,3
Student 05 Report
activity
Total 25
SEE End End of the 50 Answer scripts 1,2,3
Exam course at BTE
Student Students Middle of the Feedback 1,2
Feedback on course forms Delivery of
Indirect Assessment

course course
End of End of the Questionnaires 1,2,3
Course course Effectiveness
Survey of Delivery of
instructions &
Assessment
Methods
*CIE – Continuous Internal Evaluation *SEE – Semester End Examination
Note:
1. I.A. test shall be conducted as per SEE scheme of valuation. However obtained marks
shall be reduced to 10 marks. Average marks of two tests shall be rounded off to the next
higher digit.
2. Rubrics to be devised appropriately by the concerned faculty to assess Student activities.

Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 20
3 Application 70

Directorate Of Technical Education Karnataka State CS&E 15CS37P

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (10 marks)
2. Record (10 marks)
3. Student suggested activities report for 5 marks
4. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS37P

 Scheme of Examination

1 Writing Procedure for two experiments (One each from Part A & Part B) 10+10=20
2 Conduction any ONE 20
3 Viva-Voce 10
Total 50
**Evaluation should be based on the screen output only. No hard copy required.
**Change of question is allowed only once. Marks of 05 should be deducted in the given
question.

Resource requirements for Network Administration Lab

(For an Intake of 60 Students [3 Batches])

Sl. No. Equipment Quantity

1 Servers 02
2 PC systems (latest configurations with speakers) 20
3 Laser Printers 02
4 Scanners 02
5 Web cameras
6 Crimping Tools 10
7 Mulitmeter 10
8 I/O box Punching tool 10
9 LAN Tester 10
10 Wireless Router 04
11 CAT 6e cable As Required
12 24 Port switches 04
13 I/O Boxes for networking As required
14 RJ 45 connector As required
15 Broad Band Connection 01
16 Windows server software 10 user licence
**Open Source Software should be encouraged

Directorate Of Technical Education Karnataka State CS&E 15CS37P

 MODEL QUESTION BANK
Part-A

1. Conduct an experiment to measure voltages of SMPS.

2. Conduct an experiment to study the CMOS setup of any latest PC.
3. Conduct an experiment to for parallel port, serial port and USB port testing.
4. Conduct an experiment to install Scanner.
5. Conduct an experiment to install Printer.
6. Conduct an experiment for Fault finding, problems related to CPU.
7. Conduct an experiment for Fault finding, problems related to RAM.
8. Conduct an experiment to Disassembly PC.
9. Conduct an experiment to Assemble PC.
10. Conduct an experiment to install Windows Operating System.
11. Conduct an experiment to install Linux Operating System.

Part-B

12. Conduct an experiment to perform crimping of RJ45 for Straight cabling and Check
connectivity using LAN tester.
13. Conduct an experiment to perform crimping of RJ45 for Cross cabling Check
connectivity using LAN tester.
14. Conduct an experiment to have manual IP addressing and check connectivity.
15. Conduct and experiment to install Windows Server & Active directory. Check
connectivity using either peer-to-peer / Client-server
16. Conduct and experiment to install Windows Server & DNS. Check connectivity using
either peer-to-peer / Client-server
17. Conduct and experiment to install Windows Server & DHCP. Check connectivity
using either peer-to-peer / Client-server

Directorate Of Technical Education Karnataka State CS&E 15CS37P

 3£Éà ¸É«Ä¸ÀÖgï PÀ£ÀßqÀ-1 (PÀ£ÀßqÉÃvÀgÀjUÉ PÀ£ÀßqÀ ¥ÀjZÀAiÀÄ)

Course: Course Code:15KA3NT

3rd Kannada Kali-1 (2016-17)
Semester No. of Credits:02 No. of teaching hours/week:02
No. of teaching
hours/Semester:26

Mode of Assessment and Maximum Marks: 50 (CIE only)

Evaluation: Minimum Passing marks:20
Continuous Internal (IA Tests + Student activities)
Evaluation (CIE)only.
I.A Tests:30 Marks (3 Tests)
Student activities: 20 Marks

GzÉÝñÀ:

1. PÉüÀĪÀÅzÀÄ, UÀ滸ÀĪÀÅzÀÄ, ¤gÀUÀð¼ÀªÁV ªÀÄvÀÄÛ ¸ÀàµÀÖªÁV NzÀĪÀ ªÀÄvÀÄÛ ªÀiÁvÀ£ÁqÀĪÀ (C©üªÀåQÛ¸ÀĪÀ)

¸ÁªÀÄxÀåðªÀ£ÀÄß ¨É¼É¸ÀĪÀÅzÀÄ.
2. eÁÕ£Ádð£É, ¸Á»vÁå©ügÀÄa, aAvÀ£É ªÀÄvÀÄÛ D£ÀAzÀPÁÌV ¸ÀévÀAvÀæªÁV NzÀ®Ä, §gÉAiÀÄ®Ä ªÀÄvÀÄÛ ªÀiÁvÀ£ÁqÀ®Ä
¸ÀªÀÄxÀðgÁUÀĪÀAvÉ ªÀiÁqÀĪÀÅzÀÄ.
3. ¥ÀzÀ ¸ÀA¥ÀvÀÛ£ÀÄß ºÉaѹPÉÆAqÀÄ ¸ÀàµÀÖ GZÁÑgÀuÉAiÉÆqÀ£É °TvÀ ªÀÄvÀÄÛ ªÀiËTPÀ ZÀlĪÀnPÉUÀ¼À£ÀÄß ªÀiÁr¹,
¸ÀévÀAvÀæªÁV ¨sÁµÉAiÀÄ §¼ÀPÉ ªÀiÁqÀĪÀÅzÀÄ.
4. £ÁqÀÄ-£ÀÄr, ¸ÀA¸ÀÌøw ªÀÄvÀÄÛ ¸Á»vÀåUÀ¼À ¥ÀjZÀAiÀÄ ªÀÄvÀÄÛ DwäAiÀÄ ¨sÁªÁ©üªÀiÁ£ÀªÀ£ÀÄß ¨É¼É¸ÀĪÀÅzÀÄ.
5. QæAiÀiÁvÀäPÀ ZÀlĪÀnPÉUÀ½AzÀ ¨sÁµÁ P˱À®åzÀ ¸ÀgÀ¼À ¥ÀæAiÉÆÃUÀ ªÀiÁr¸ÀĪÀÅzÀÄ./PÀ°¸ÀĪÀÅzÀÄ.
(QæAiÀiÁvÀäPÀ ZÀlĪÀnPÉ JAzÀgÉ, ªÀtðªÀiÁ¯É ¥ÀjZÀAiÀÄ, ªÁåPÀgÀtzÀ ¸ÀgÀ¼À ¥ÀjZÀAiÀÄ, UÀÄtÂvÁPÀëgÀ,
¸ÀAAiÀÄÄPÁÛPÀëgÀUÀ¼ÀÄ, £ÁªÀÄ¥ÀzÀ, °AUÀ, ªÀZÀ£À, ¥ÀævÀåAiÀÄUÀ¼ÀÄ, ªÁPÀågÀZÀ£É (PÀvÀÈ, PÀªÀÄð, QæAiÀiÁ¥ÀzÀ) EvÁå¢)

¥ÀoÀåPÀæªÀÄ ªÀÄvÀÄÛ ¸ÀgÀ¼À ¨sÁµÁ P˱À®å

(PÀ£ÀßqÀ PÀ°-¥ÀoÀå¥ÀĸÀÛPÀ -²æà °AUÀzÉêÀgÀÄ ºÀ¼ÉêÀÄ£É – PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦ ¥ÀæPÁ±À£À)
¨sÁUÀ-1
¥ÁoÀUÀ¼À ¸ÉªÉĸÀÖgï ¨ÉÆÃzsÀ£À DªÀ¢ü
PÀæªÀiÁAPÀ ¥ÀoÀåªÀ¸ÀÄÛ«£À «ªÀgÀ - Curriculum Content Total no.of
Lesson Classes /Sem
No
PÀ£ÀßqÀ ¨sÁµÉAiÀÄ ¥ÀjZÀAiÀÄ/ªÀtðªÀiÁ¯É/’PÀ£ÀßqÀ PÀ°’AiÀÄĪÀ «zsÁ£À PÀÄjvÀ ªÀiÁ»w 02
1 Introducing each other Personal Pronouns, 03
Possessive forms and Interrogative words
1. £ÁªÀÅ ªÀÄvÀÄÛ ¨sÁµÉ 2. CPÀëgÀUÀ½AzÀ ¥ÀzÀUÀ¼ÀÄ
2 Introducing each other Personal Pronouns, 02
Possessive forms – Yes/No Type Interrogative
3 About Ramayana. Possessive forms of nouns, 02
dubitive question, Relative nouns.
¥ÀzÀUÀ½AzÀ ªÁPÀåUÀ¼ÀÄ
4 Enquiring about college. Qualitative and 02
quantitative adjectives.
5 Enquiring about room. Predicative forms, 02

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 1

 locative case.
6 Vegetable Market. Dative case, basic numerals. 02
7 About Medical college. Ordinal numerals, plural 02
markers.
8 In a cloth shop. Color adjectives, defective 02
verbs
9 Plan to go for picnic - imperative, permissive 02
and hortative
10 Enquiring about one’s family, Verb iru, and 02
corresponding negation
PÀ£ÀßqÀ avÀæ¥ÀlUÀ¼À°è£À CPÀëgÀUÀ¼À£ÀÄß UÀÄgÀÄw¹ N¢
¢£À¥ÀwæPÉ NzÀĪÀ ºÀªÁå¸À--¸ÀAªÀºÀ£À ªÀiÁzsÀåªÀÄzÀ §UÉÎ ¥ÀjZÀAiÀÄ
DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ¥ÀjÃPÉëUÀ¼ÀÄ 03
MlÄÖ UÀAmÉUÀ¼ÀÄ 26
¸ÀÆZÀ£ÉUÀ¼ÀÄ:
 F ¥ÀoÀåzÀ ªÀÄÆ® GzÉÝñÀ PÀ£ÀßqÉÃvÀgÀ «zÁåyðUÀ¼ÀÄ ¸ÀgÀ¼À PÀ£ÀßqÀ ¨sÁµÉAiÀÄ°è ªÀåªÀºÀj¸ÀĪÀAvÉ
ªÀiÁqÀĪÀÅzÁVzÉ. “PÀ£ÀßqÀ PÀ°” ¥ÀĸÀÛPÀzÀ ªÉÄð£À ¥ÁoÀUÀ¼À eÉÆvÉUÉ “QæAiÀiÁvÀäPÀ ZÀlĪÀnPÉ”¬ÄAzÀ
UÀ½¸ÀĪÀ CPÀëgÀ eÁÕ£À¢AzÀ ¥ÀzÀ ¸ÀA¥ÀvÀÄÛ ºÉaѹ, ¥ÀzÀUÀ½AzÀ ¸ÀéAvÀ ªÁPÀåUÀ¼À gÀZÀ£É ªÀiÁr¸ÀĪÀÅzÀÄ. (CªÀÄä,
ªÉƨÉʯï, PÀ£ÀßqÀ ¨sÁµÉ, PÀ«UÀ¼ÀÄ, £ÁlPÀ, d£À¥ÀzÀ PÀ¯É, £Ár£À ¥Àæ¹zÀÞ ªÀåQÛUÀ¼ÀÄ, ¸ÀºÉÆÃzÀgÀ, ¸ÉßûvÀ,
vÀgÀPÁj, zÉÆøÉ, wAr, ¤zÉÝ, ©¹, ZÀ½, DPÁ±À, NzÀÄ, EvÁå¢ ¤vÀå §¼ÀPÉAiÀÄ ¸ÀgÀ¼À ¥ÀzÀUÀ½AzÀ
ªÁPÀågÀZÀ£É ªÀÄvÀÄÛ 25-50 ¥ÀzÀUÀ¼À QgÀÄ ¯ÉÃR£À gÀZÀ£É).
 vÀgÀUÀw ZÀlĪÀnPÉUÀ¼À ¥ÀĸÀÛPÀzÀ°è (PÁè¸ï C¸ÉÊ£ïªÉÄAmï) PÀ£ÀßqÀ ªÀtðªÀiÁ¯ÉAiÀÄ ¸ÀégÀ, ªÀåAd£ÀUÀ¼À CPÀëgÀUÀ¼À
§gÀªÀtÂUÉ C¨sÁå¸À, ªÀåAd£ÀUÀ½UÉ ¸ÀégÀUÀ¼À£ÀÄß ¸ÉÃj¸ÀÄ«PÉ, CPÀëgÀUÀ½AzÀ ¥ÀzÀgÀZÀ£É, ¥ÀzÀUÀ½UÉ ¥ÀævÀåAiÀÄUÀ¼À£ÀÄß
¸ÉÃj¸ÀĪÀÅzÀÄ(UÉ, ¬ÄAzÀ, C£ÀÄß, C°è, UÀ¼ÀÄ, JAzÀÄ.....EvÁå¢ ¥ÀoÀåzÀ°è §gÀĪÀ ¥ÀzÀUÀ½UÉ ¤vÀå §¼ÀPÉAiÀÄ
¥ÀævÀåAiÀÄUÀ¼À£ÀÄß ¸ÉÃj¸ÀĪÀÅzÀÄ) ¥ÀzÀUÀ½AzÀ ªÁPÀå gÀZÀ£É. ªÀiÁqÀĪÀÅzÀÄ. ªÀÄvÀÄÛ ¥ÁoÀ 1-10gÀ ¥ÀoÁåAvÀåzÀ°è §gÀĪÀ
C¨sÁå¸ÀUÀ¼À°è Dj¹zÀ C¨sÁå¸À ¨sÁUÀUÀ¼À£ÀÄß §gɸÀĪÀÅzÀÄ. ªÀÄvÀÄÛ ¥ÁoÀ-20 gÀ ¹Ìç¥ïÖ- C£ÀÄß DzsÁgÀªÁVlÄÖPÉÆAqÀÄ
C¨sÁå¸À ªÀiÁr¸ÀĪÀÅzÀÄ.
DPÀgÀ UÀæAxÀUÀ¼ÀÄ:
1. PÀ£ÀßqÀ PÀ°-²æà °AUÀzÉêÀgÀÄ ºÀ¼ÉêÀÄ£É – PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦.
2. ¥ÁæxÀ«ÄPÀ ±Á¯ÉAiÀÄ PÀ£ÀßqÀ ¥ÀoÀå¥ÀĸÀÛPÀUÀ¼ÀÄ
3. ¸ÀgÀ¼À PÀ£ÀßqÀ ªÁåPÀgÀt ¥ÀĸÀÛPÀUÀ¼ÀÄ- JA.« £ÁUÀgÁdgÁªï/EvÀgÉ ¯ÉÃRPÀgÀÄ.
4. ¥ÀæAiÉÆÃUÀ ¥Àætw-¥ÀæxÀªÀÄ ¦AiÀÄĹ ¥ÀÆgÀPÀ ¥ÀoÀå.
5. ¸ÀgÀ¼À ¥ÀvÀæªÀåªÀºÁgÀzÀ ¥ÀĸÀÛPÀUÀ¼ÀÄ

¥ÀjÃPÉë ªÀÄvÀÄÛ ªÀiË®åªÀiÁ¥À£À «zsÁ£À (3£Éà ¸É«Ä¸ÀÖgï)

¤gÀAvÀgÀ CAvÀjPÀ ªÀiË®åªÀiÁ¥À£À- Continuous Internal Evaluation (CIE) only.
PÀæ.¸ÀA. ZÀlĪÀnPÉUÀ¼ÀÄ «ªÀgÀ UÀjµÁ×APÀ GwÛÃtðvÉUÉ
PÀ¤µÁ×APÀ
01 DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ªÀÄÆgÀÄ DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ¥ÀjÃPÉëUÀ¼ÀÄ 30
(I A Tests) (¸ÀgÁ¸Àj CAPÀUÀ¼À£ÀÄß ¥ÀjUÀt¸ÀĪÀÅzÀÄ)
02 PÀ£ÀßqÀ ¨sÁµÁ P˱À¯Áå©üªÀÈ¢Ý ªÀÄÆgÀÄ ZÀlĪÀnPÉUÀ¼ÀÄ 20
ZÀlĪÀnPÉUÀ¼ÀÄ (¸ÀgÁ¸Àj CAPÀUÀ¼À£ÀÄß ¥ÀjUÀt¸ÀĪÀÅzÀÄ)
(Student Activities)
MlÄÖ CAPÀUÀ¼ÀÄ 50 20

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 2

 Course outcome:
1. Developing listening and speaking skills.
2. Easy Interaction with peers.
3. Students can use the language at ease in daily life situations

DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ¥ÀjÃPÉëUÀ¼À ªÀiÁzÀj ¥Àæ±ÉߥÀwæPÉUÀ¼ÀÄ:

¤gÀAvÀgÀ DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ¥ÀjÃPÉëUÀ½UÉ F PɼÀV£À ªÀiÁzÀjAiÀÄ°è ¥Àæ±ÉߥÀwæPÉAiÀÄ£ÀÄß

¹zÀÞ¥Àr¹ £ÀqɸÀĪÀÅzÀÄ ªÀÄvÀÄÛ “PÀ£ÀßqÀ PÀ°” ¥ÀoÀåzÀ PÀ°PÉ «ªÀgÀuÉ (¨sÁµÁ¨sÁå¸À) ¸ÀA¨sÁµÀuÁ ¨sÁUÀUÀ¼ÀÄ
ªÀÄvÀÄÛ CAvÀåzÀ°è C¨sÁå¸À ¥ÀĸÀÛPÀzÀ°è §gÀĪÀ ¥Àæ±ÉßUÀ¼À «zsÁ£ÀªÀ£ÀÄß ¥ÀAiÀiÁðAiÀĪÁV §¼À¹PÉÆAqÀÄ
¥Àæ±ÉߥÀwæPÉUÀ¼À£ÀÄß vÀAiÀiÁj¹PÉƼÀÀÄzÀÄ.

r¥ÉÆèêÀiÁ 3£Éà ¸É«Ä¸ÀÖgï-PÀ£ÀßqÀ PÀ°-1 (PÀ£ÀßqÉÃvÀgÀjUÉ PÀ£ÀßqÀ ¥ÀjZÀAiÀÄ)

DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ¥ÀjÃPÉë

¸ÀªÀÄAiÀÄ: 60 ¤«ÄµÀUÀ¼ÀÄ CAPÀ: 30

---------------------------------------------------------------------
I. Fill in the blanks using the appropriate words.(Any FOUR) 1X4=04
i) nimma raajya.......................?
ii) adu..............pustaka?
iii) avana ............. hesaru suratkal injiniyaring kaaleju.
iv) ondu ruupaayige..............paise.
v) aval.ige hindustaani sanita tumba..................
vi) nanage ninna sahavaasa khanDitaa.................
vii) avanu nimma ................. ....?
II. Use the following words (any FOUR) in your own sentences. 1X4=04
1.adhyaapaki 2.snehita 3. Vyaapaara 4.keTTa 5. Hasiru 6.angadi 7.taaja

III. Answer the following questions (any FOUR) 1X4=04

(a) nimma uuru yaavudu?
(b) nivu diploma vidyaarthinaa?
(c) nimma pennige estu ruupaaye?
(d) nimma maatrubhaashe yaavudu?
(e) nimage tingalige eshtu ruupaayi beeku?
(f) nimma mane/ruumu elli ide?

IV. Translate the following sentence in Kannada. (any FOUR) 4X2=08

1. Kannada is the language of Karnataka.
2. My book is in my house.
3. We have two houses in Bangalore.
4. How much is this Pumpkin weighs?
5. I want two packets of biscuits.
6. How much do you pay rent for your room?
7. What else do you want?

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 3

 V. PɼÀV£ÀªÀÅUÀ¼À£ÀÄß ºÉÆA¢¹ §gɬÄj. (Match the following) 1X4=04
1. ¤ÃªÀÅ AiÀiÁªÁUÀ ªÀÄ£ÉAiÀÄ°è 1.EzÉ
2. ¥ÀĸÀÛPÀ ªÉÄÃf£À ªÉÄÃ¯É 2.eldest son
3. Jaaga-eÁUÀ 3.EwÃðj
4. Hiri maga 4.space

VI. (1) Change into interragative using the underlined word. (Any Three) 1X3=03

1. Ivattu guruvaara.
2. evattu hattanee taariku
3. Aval hesaru liila.
4. Avara maatrabhaashe telagu alla.
5. Vavige ippttaydu ruupaayei beeku.
6. Adu maalatiya mane.

(2) change into Interrogate. (Any THREE) 1X3=03

1.ºËzÀÄ, EzÀÄ ¥ÀĸÀÛPÀ.
2. DUÀ°, ºÉÆÃUÉÆÃt.
3. FUÀ MAzÀƪÀgÉ UÀAmÉ.
4. CªÀgÀÄ ªÀÄ£ÉUÉ §gÀÄvÁÛgÉ.
5. £Á« ªÀÄ£ÉUÉ ºÉÆÃUÉÆÃt.
6. CªÀgÀÄ ªÀÄ£ÉUÉ ºÉÆÃUÀ°.

PÀ£ÀßqÀ ¥ÀoÀåPÀæªÀÄ gÀZÀ£Á ¸À«Äw

 ¸ÀA¥ÁzÀQÃAiÀÄ ¸À«Äw:

1. ²æà n J¯ï gÀ«ÃAzÀæ, G¥À£Áå¸ÀPÀgÀÄ, ¸ÀPÁðj f.Dgï.L.¹.¦ ¨ÉAUÀ¼ÀÆgÀÄ.

2. ²æà n. wªÀÄä¥Àà, G¥À£Áå¸ÀPÀgÀÄ(DAiÉÄÌ ±ÉæÃtÂ), AiÀiÁAwæPÀ «¨sÁUÀ, ¸ÀPÁðj ¥Á°mÉQßPï, vÀĪÀÄPÀÆgÀÄ.

 ¸À®ºÁ ¸À«ÄwAiÀÄ ¨ÁºÀå ¸ÀA¥À£ÀÆä® ªÀåQÛUÀ¼ÀÄ.

1. ¥ÉÆæ. (qÁ.) r. ¥ÁAqÀÄgÀAUÀ ¨Á§Ä, PÀÄ®¸ÀaªÀgÀÄ, PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦.

2. ¥ÉÆ.æ (qÁ.) C±ÉÆÃPï PÀĪÀiÁgï gÀAdgÉ, ¥ÁæzsÁå¥ÀPÀgÀÄ, ¥Àæ¸ÁgÁAUÀ «¨sÁUÀ,
PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦.
3. ¥ÉÆæ. (qÁ.) PÉ ªÉÊ £ÁgÁAiÀÄt ¸Áé«Ä, ¸ÀºÀ ¥ÁæzsÁ å¥ÀPÀgÀÄ, ¸ÁßvÀPÉÆÃvÀÛgÀ «¨sÁUÀ ,
¸ÀPÁðj PÀ¯Á PÁ¯ÉÃdÄ, ¨ÉAUÀ¼ÀÆgÀÄ.
4. ¥ÉÆæ. (qÁ.) eÉ ¨Á®PÀȵÀÚ, ¥ÁæzsÁå¥ÀPÀgÀÄ ºÁUÀÄ ªÀÄÄRå¸ÀÜgÀÄ, PÀ£ÀßqÀ ¨sÁµÁ CzsÀåAiÀÄ£À «¨sÁUÀ,
PÀȶ «±Àé«zÁå®AiÀÄ, (fPÉ«PÉ) ºÉ¨Áâ¼À, ¨ÉAUÀ¼ÀÆgÀÄ.

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 4

 KARNATAKA STATE BOARD OF TECHNICAL EXAMINATION, BENGALURU.
TEACHING AND EXAMINATION SCHEME FOR KANNADA COURSE IN DIPLOMA PROGRAME
SEMESTER: III COMMON TO ALL DIPLOMA PROGRAMMES C-15 Curriculum
SL.N0 COURSE Teaching scheme Examination scheme
/QP CODE Contact hours

Department
COURSE NAME TH TU PR TOTAL Credit Exam End exam Maximum Minimum

Teaching
paper Max Min CIE Marks Marks for
duration marks marks passing.
in Hrs (IA+SA ) (IA + SA)
THEORY
1 KANNADA KALI-1 KA 15KA3NT 2 - - 2 2 - - - 50 20

2 TANTRIKA KA 15KA3KT 2 - - 2 2 - - - 50 20
KANNADA -1
CIE- Continuous Internal Examination: SEE-Semester End Examination: IA-Internal Assessment Tests: SA- Student Activity.
Note: 1. Candidates studied Kannada as one subject in 10th standard shall take Tantrika Kannada 1 &2. Others may take “Kannada Kali-1&2”.
2. In 3rd Semester- Assessment is only by CIE and no SEE. Average marks of three I A tests shall be rounded off to the next higher digit. Rubrics to
be devised appropriately to assess student activity.

KARNATAKA STATE BOARD OF TECHNICAL EXAMINATION, BENGALURU.

TEACHING AND EXAMINATION SCHEME FOR KANNADA COURSE IN DIPLOMA PROGRAME
SEMESTER: IV COMMON TO ALL DIPLOMA PROGRAMMES C-15 Curriculum
SL.N0 COURSE Teaching scheme Examination scheme
/QP CODE Contact hours
Department

COURSE NAME TH TU PR TOTAL Credit Exam Sem End Exam Maximum Minimum
Teaching

paper Max Min CIE Marks Marks for

duration Exam Passing passing.
in Hrs Marks Marks (IA+SA ) (IA + SA)
THEORY
1 KANNADA KALI-2 KA 15KA4NT 2 - - 2 2 2 50 20 - -

2 TANTRIKA KA 15KA4KT 2 - - 2 2 2 50 20 - -
KANNADA -2
CIE- Continuous Internal Examination: SEE-Semester End Examination: IA-Internal Assessment Tests: SA- Student Activity.
Note: In 4th Semester- Assessment is only by SEE and no CIE. To award diploma certificate, passing in Kannada course is mandatory. However
Kannada course is not included in the eligibility criteria for promotion to the higher semester.

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ PÀ£ÁðlPÀ ¸ÀPÁðgÀ r¥ÉÆèªÀiÁ PÀ£ÀßqÀ ¥ÀoÀåPÀæªÀÄ Page 1

 r¥ÉÆèêÀiÁ-vÁAwæPÀ PÀ£ÀßqÀ-1 ( PÀ£ÀßqÀ §®èªÀjUÁV)
3£Éà ¸É«Ä¸ÀÖgï - vÁAwæPÀ PÀ£ÀßqÀ -1 ( ¸Á»vÀå ªÀÄvÀÄÛ ¨sÁµÁ P˱À®å ¥ÀæAiÉÆÃUÀ)
¥ÀoÀåPÀæªÀÄ
Course: Course Code:15KA3KT
vÁAwæPÀ PÀ£ÀßqÀ -1 (2016-17)
3rd No. of Credits:02 No. of teaching hours/week:02
Semester No. of teaching
hours/Semester:26

Mode of Assessment and Maximum Marks: 50 (CIE only)

Evaluation: Minimum Passing marks:20
Continuous Internal (IA Tests + Student activities)
Evaluation (CIE)only.
I.A Tests:30 Marks
(3 Tests)
Student activities:
20 Marks

¥ÀoÀå ¥ÀæPÁgÀ ¥ÁoÀ ¥ÀoÀåzÀ ºÉ¸ÀgÀÄ/¯ÉÃRPÀgÀÄ/¥ÀæPÀluÉ ¸É«Ä¸ÀÖgï

¨ÉÆÃzsÀ£ÁªÀ¢ü
UÀAmÉUÀ¼ÀÄ
EwºÁ¸À 1 ‘¸ÀA¸ÀÌøw’- zÉÃ.eÉ.UË (£Álå ¸ÀA¸ÀÌøw-zÉÃ.eÉ.UË) 02
¸ÀA¸ÀÌøw 2 £ÀªÀÄUÉ ¨ÉÃPÁVgÀĪÀ EAVèµï- PÀĪÉA¥ÀÄ 02
¥Àj¸ÀgÀ 3 D£É ºÀ¼ÀîzÀ°è ºÀÄqÀÄVAiÀÄgÀÄ - © f J¯ï ¸Áé«Ä 02
QæÃqÉ/fêÀ£ÀPÀ¯É 4 ¸ÉÆïÉA§ÄzÀÄ C®à«gÁªÀÄ - £ÉëÄZÀAzÀæ 02
AiÀıÉÆÃUÁxÉ/ªÀåQÛavÀæt 5 §zÀÄPÀ£ÀÄß ¦æÃw¹zÉ ¸ÀAvÀ - JZï.Dgï.gÁªÀÄPÀȵÀÚ (PÀ¯ÁAgÀ 02
ªÀåQÛ avÀæ)
vÀAvÀæeÁÕ£À 6 ªÀÄAUÀ¼À£À CAUÀ¼ÀzÀ°è – eÉ.¨Á®PÀȵÀÚ 02
¨sÁµÁ P˱À®å 7 *ªÀiËTPÀ C©üªÀåQÛ: ¸ÀºÀd ¨sÁµÁ §¼ÀPÉ: 06
ZÀlĪÀnPÉUÀ¼ÀÄ .D±ÀÄ ¨sÁµÀt> ««zsÀ gÀZÀ£ÁvÀäPÀ/zÉÊ£ÀA¢£À §¼ÀPÉ ªÀ¸ÀÄÛ,
ªÀåQÛ, ¨sÁªÀ£ÉUÀ¼À ªÉÄïÉ.
MAzÀÄ ¸ÀtÚ KPÁAPÀ (5-10 ¤«ÄµÀ) £ÁlPÀ.
ªÀiÁzÀj ¸ÀAzÀ±Àð£À (£ÉêÀÄPÁwUÁV ¸ÀAzÀ±Àð£À)

°TvÀ ZÀlĪÀnPÉUÀ¼ÀÄ 8 «¸ÀÛgÀuÉ: £ÀÄrUÀlÄÖUÀ¼ÀÄ-¥ÀzÀUÀ¼À£ÀÄß §¼À¹PÉÆAqÀÄ ¸ÀtÚ 06

ªÁPÀåUÀ¼À gÀZÀ£É
¥ÀAiÀiÁðAiÀÄ ¥ÀzÀUÀ¼À£ÀÄß §gÉAiÀÄĪÀÅzÀÄ(GzÁ:
§¼À¸ÀÄ=G¥ÀAiÉÆÃV¸ÀÄ, PÁAiÀÄÄ= ¤jÃQë¸ÀÄ,
aAw¸ÀÄ=AiÉÆÃa¸ÀÄ, PÀÆr¸ÀÄ«PÉ=¸ÉÃj¸ÀÄ«PÉ.......EvÁå¢)
DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ¥ÀjÃPÉëUÀ¼ÀÄ 02
MlÄÖ UÀAmÉUÀ¼ÀÄ 26

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 1

 vÁAwæPÀ PÀ£ÀßqÀ-1
3£Éà ¸É«Ä¸ÀÖgï r¥ÉÆèêÀiÁzÀ PÀ£ÀßqÀ ¥ÀoÀå ( PÀ£ÀßqÀ §®èªÀjUÁV)

1. ¥ÀoÀågÀZÀ£Á ¸À«Äw
2. ¤zÉÃð±ÀPÀgÀ ªÀÄÄ£ÀÄßr
3. ¥ÀoÀå gÀZÀ£Á ¸À«Äw ªÀiÁvÀÄUÀ¼ÀÄ
4. ¥ÀoÀåPÀæªÀÄ
¥Àj«r

UÀzÀå «ºÁgÀ
1. £Álå ¸ÀA¸ÀÌøw (EwºÁ¸À) - zÉ.eÉ.UË
2. £ÀªÀÄUÉ ¨ÉÃPÁVgÀĪÀ EAVèµï (¸ÀA¸ÀÌøw) _ PÀĪÉA¥ÀÄ
3. ¸ÉÆïÉA§ÄzÀÄ C®à«gÁªÀÄ (QæÃqÉ/fêÀ£ÀPÀ¯É) - £ÉëÄZÀAzÀæ
4. D£É ºÀ¼ÀîzÀ°è ºÀÄqÀÄVAiÀÄgÀÄ (¥Àj¸ÀgÀ) _ ©.f.J¯ï.¸Áé«Ä
5. §zÀÄPÀ£ÀÄß ¦æÃw¹zÀ ¸ÀAvÀ (AiÀıÉÆÃUÁxÉ/ªÀåQÛavÀæt) – JZï.Dgï.gÁªÀÄPÀȵÀÚ
6. ªÀÄAUÀ¼À£À CAUÀ¼ÀzÀ°è..... - qÁ:eÉ.¨Á®PÀȵÀÚ
¨sÁµÁ P˱À®å-ZÀlĪÀnPÉUÀ¼ÀÄ
7. ªÀiËTPÀ C©üªÀåQÛ ZÀlĪÀnPÉUÀ¼ÀÄ
8. °TvÀ C©üªÀåQÛ ZÀlĪÀnPÉUÀ¼ÀÄ

Course outcome:
1. Developing listening and speaking skills.
2. Easy Interaction with peers.
3. Students can use the language at ease in daily life situations

¥ÀjÃPÉë ªÀÄvÀÄÛ ªÀiË®åªÀiÁ¥À£À «zsÁ£À (3£Éà ¸É«Ä¸ÀÖgï)

¤gÀAvÀgÀ CAvÀjPÀ ªÀiË®åªÀiÁ¥À£À- Continuous Internal Evaluation (CIE) only.
PÀæ.¸ÀA. ZÀlĪÀnPÉUÀ¼ÀÄ «ªÀgÀ UÀjµÁ×APÀ GwÛÃtðvÉUÉ
PÀ¤µÁ×APÀ
01 DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ªÀÄÆgÀÄ DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ¥ÀjÃPÉëUÀ¼ÀÄ 30
(I A Tests) (¸ÀgÁ¸Àj CAPÀUÀ¼À£ÀÄß ¥ÀjUÀt¸ÀĪÀÅzÀÄ)
02 PÀ£ÀßqÀ ¨sÁµÁ P˱À¯Áå©üªÀÈ¢Ý ªÀÄÆgÀÄ ZÀlĪÀnPÉUÀ¼ÀÄ 20
ZÀlĪÀnPÉUÀ¼ÀÄ (vÁAwæPÀ ¥Àæ§AzsÀ/C±ÀĨsÁµÀt/ZÀZÉð/vÁAwæPÀ PÉëÃvÀæUÀ¼À°è£À
(Student Activities) C«µÁÌgÀUÀ¼À §UÉÎ «±ÉèõÀuÉ EvÁå¢.)
(¸ÀgÁ¸Àj CAPÀUÀ¼À£ÀÄß ¥ÀjUÀt¸ÀĪÀÅzÀÄ)
MlÄÖ CAPÀUÀ¼ÀÄ 50 20

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 2

 ¸ÀÆZÀ£É:
¨sÁµÁ ZÀlĪÀnPÉUÀ½UÁV vÀgÀUÀw ZÀlĪÀnPÉUÀ¼À ¥ÀĸÀÛPÀzÀ°è (vÀgÀUÀwAiÀÄ ¥ÀæUÀw¥ÀgÀ ªÀiË®åªÀiÁ¥À£À). UÁzÉUÀ¼À
«¸ÀÛgÀuÉ, £ÀÄrUÀlÄÖUÀ¼ÀÄ, ¸ÀA¨sÁµÀuÉ ªÀiÁzÀjUÀ¼ÀÄ ªÀÄvÀÄÛ ¥ÀoÀåzÀ ¸Á»vÀå ¨sÁUÀzÀ ¥ÁoÀUÀ¼À ªÉÄÃ¯É ¥Àæ±ÉßUÀ½UÉ GvÀÛgÀ-
n¥Ààt ªÀÄvÀÄÛ ±À¨ÁÝxÀðzÀ°è §gÀĪÀ ¥ÀzÀUÀ½AzÀ ªÁPÀå gÀZÀ£É ªÀiÁr¸ÀĪÀÅzÀÄ.

 ªÀiÁzÀj ¥Àæ±ÉߥÀwæPÉ
3£Éà ¸É«Ä¸ÀÖgï- vÁAwæPÀ PÀ£ÀßqÀ-1 (PÀ£ÀßqÀ§®è «zÁåyðUÀ½UÉ)

¸ÀªÀÄAiÀÄ: 1.00 UÀAmÉ CAPÀUÀ¼ÀÄ:30

¸ÀÆZÀ£É: PɼÀV£À ¥Àæ±ÉßUÀ½UÉ ¸ÀÆZÀ£ÉUÀ¼À ¥ÀæPÁgÀ ªÁåPÀgÀtzÉÆõÀ«®èzÀAvÉ GvÀÛj¹.

****
1. F PɼÀV£À 04 ¥Àæ±ÉßUÀ½UÉ MAzÀÄ ¥ÀÆtð ªÁPÀåzÀ°è GvÀÛj¹. 1*4=04
(C) £Álå AiÀiÁªÁUÀ ºÀÄnÖPÉÆArvÀÄ?
(D) D£É ºÀ¼ÀîzÀ PÁr£À°è £Á¥ÀvÉÛAiÀiÁzÀ ºÀÄqÀÄVAiÀÄgÀ ºÉ¸ÀgÀÄUÀ¼À£ÀÄß w½¹.
(E) gÁµÀÖç¥ÀwAiÀiÁV DAiÉÄÌAiÀiÁzÁUÀ PÀ¯ÁA CªÀgÀÄ ªÉÆzÀ®Ä ºÉýzÀ ªÀiÁvÀÄUÀ¼ÉãÀÄ?
(F) ªÀÄAUÀ¼À£À CAUÀ¼À vÀ®Ä¦zÀ ªÉÆzÀ® CAvÀjPÀë £ËPÉ AiÀiÁªÀÅzÀÄ?
(G) ‘ºÀUÀ®ÄUÀ£À¸ÀÄ’ £ÀÄrUÀlÖ£ÀÄß §¼À¹ ¸ÀéAvÀ ªÁPÀåªÀ£ÀÄß gÀa¹.
(H) ‘¹»PÀ»’ eÉÆÃqÀÄ¥ÀzÀªÀ£ÀÄß MAzÀÄ ªÁPÀåzÀ°è §¼À¹.

2. PɼÀV£À AiÀiÁªÀÅzÉà £Á®Ä ¥Àæ±ÉßUÀ½UÉ PÀ¤µÀÖ LzÁgÀÄ ªÁPÀåUÀ¼À°è GvÀÛj¹. 4*4=16

(1) PÀĪÉA¥ÀÄ CªÀgÀÄ EAVèµ ï PÀ°AiÀÄĪÀªÀgÀ£ÀÄß JµÀÄÖ «¨sÁUÀªÁV ºÉÃUÉ «AUÀr¹zÁÝgÉ?
(2) PÀ¯ÁA CªÀgÀ AiÀıÀ¹ì£À ªÀÄAvÀæUÀ¼ÉãÀÄ?
(3) UÁzÉUÀ¼À ªÀĺÀvÀéªÉãÀÄ? ¤ªÀÄUÉ UÉÆwÛgÀĪÀ AiÀiÁªÀÅzÉà JgÀqÀÄ UÁzÉUÀ¼À£ÀÄß ºÉ¸Àj¹.
(4) ¸ÀAªÀºÀ£À ¸ÀAzÀ¨sÀðzÀ°è §¼À¸ÀĪÀ ¨sÁµÉ ºÉÃVgÀ¨ÉÃPÀÄ?
(5) £ÉëÄZÀAzÀægÀ ‘¸Á«£ÀvÀÛ MAzÀÄ ºÉeÉÓ……’ PÀvÉ N¢zÀ ºÀÄqÀÄV vÀ£Àß ¸ÉÆð¤AzÀ ºÉÆgÀUÉ §AzÀzÀÄÝ ºÉÃUÉ?
(6) ¸ÀAzÀ±Àð£À JAzÀgÉãÀÄ? «ªÀj¹.

3. AiÀiÁªÀÅzÉ JgÀqÀÄ ¥Àæ±ÉßUÀ½UÉ GvÀÛj¹. 2*5=10

(1) £ÁlåPÀ¯ÉAiÀÄ°è AiÀÄPÀëUÁ£À PÀ¯É ¥ÀæªÀÄÄRªÁzÀÄzÀÄ. EzÀgÀ ºÀÄlÄÖ ªÀÄvÀÄÛ ªÁå¦Û §UÉÎ w½¹.
(2) ªÀÄAUÀ¼ÀAiÀiÁ£ÀzÀ ªÀÄÄRå GzÉÝñÀUÀ¼ÉãÀÄ?
(3) ‘ªÀiÁ£À«ÃAiÀÄ ªÀiË®åUÀ¼ÀÄ’, CAvÀgÀeÁ® - JgÀqÀgÀ°è MAzÀPÉÌ ¸ÀĪÀiÁgÀÄ MAzÀÄ ¥ÀÄlzÀµÀÄÖ
¥Àæ§AzsÀ §gɬÄj.
(4) GzÉÆåÃUÀzÀ ¸ÀAzÀ±Àð£ÀPÉÌ ºÉÆÃUÀĪÁUÀ ªÀiÁrPÉƼÀî¨ÉÃPÁzÀ ¥ÀƪÀð¹zÀÞvÉUÀ¼ÉãÀÄ?.

PÀ£ÀßqÀ ¥ÀoÀåPÀæªÀÄ gÀZÀ£Á ºÁUÀÄ ¥ÀoÀå¥ÀĸÀÛPÀ ¸À«Äw

 ¸ÀA¥ÁzÀQÃAiÀÄ ¸À«Äw:

1. ²æà n J¯ï gÀ«ÃAzÀæ, G¥À£Áå¸ÀPÀgÀÄ, ¸ÀPÁðj f.Dgï.L.¹.¦ ¨ÉAUÀ¼ÀÆgÀÄ.

2. ²æà n. wªÀÄä¥Àà, G¥À£Áå¸ÀPÀgÀÄ(DAiÉÄÌ ±ÉæÃtÂ), AiÀiÁAwæPÀ «¨sÁUÀ, ¸ÀPÁðj ¥Á°mÉQßPï, vÀĪÀÄPÀÆgÀÄ.

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 3

  ¸À®ºÁ ¸À«ÄwAiÀÄ ¨ÁºÀå ¸ÀA¥À£ÀÆä® ªÀåQÛUÀ¼ÀÄ.

1. ¥ÉÆæ. (qÁ.) r. ¥ÁAqÀÄgÀAUÀ ¨Á§Ä, PÀÄ®¸ÀaªÀgÀÄ, PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦.

2. ¥ÉÆ.æ (qÁ.) C±ÉÆÃPï PÀĪÀiÁgï gÀAdgÉ, ¥ÁæzsÁå¥ÀPÀgÀÄ, ¥Àæ¸ÁgÁAUÀ «¨sÁUÀ,
PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦.
3. ¥ÉÆæ. (qÁ.) PÉ ªÉÊ £ÁgÁAiÀÄt ¸Áé«Ä, ¸ÀºÀ ¥ÁæzsÁå¥ÀPÀgÀÄ, ¸ÁßvÀPÉÆÃvÀÛgÀ «¨sÁUÀ,
¸ÀPÁðj PÀ¯Á PÁ¯ÉÃdÄ, ¨ÉAUÀ¼ÀÆgÀÄ.
4. ¥ÉÆæ. (qÁ.) eÉ ¨Á®PÀȵÀÚ, ¥ÁæzsÁå¥ÀPÀgÀÄ ºÁUÀÄ ªÀÄÄRå¸ÀÜgÀÄ, PÀ£ÀßqÀ ¨sÁµÁ CzsÀåAiÀÄ£À «¨sÁUÀ,
PÀȶ «±Àé«zÁå®AiÀÄ, (fPÉ«PÉ) ºÉ¨Áâ¼À, ¨ÉAUÀ¼ÀÆgÀÄ.

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 4

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title: Data Structures using C

Course Code:
Scheme (L:T:P) : 4:0:0 Total Contact Hours: 52
15CS41T
Type of Course: Lectures, Self Core/ Elective:
Credit :04
Study & Student Activity. Core
CIE- 25 Marks SEE- 100 Marks

Prerequisites:

Knowledge of C programming.

Course Objectives

To study the concepts of derived data types and data structures such as linked list, stack,
queue, sorting and searching techniques.

Course Outcome

On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked Teaching
Course outcome
PO Hours

CO1 Illustrate the concepts of pointers and dynamic 1 to 4 and 08

memory allocation with programs. U,A
7 to 10
Discuss different types of file operations and 06
CO2 command line arguments to develop simple 1 to 4 and
U,A
program. of lists and apply various operations on 7 to 10
them.
CO3 Describe data structures and different types of 1 to 4 and 10
linked list U,A
7 to 10
CO4 Construct stacks and queues using the concept of 1 to 4 and 10
Arrays and Linked lists. U,A
7 to 10
CO5 Illustrate the use of Binary Trees and its 1 to 4 and 08
operations. U,A
7 to 10
CO6 Explain sorting and searching techniques with 1 to 4 and 10
associated programs. U,A
7 to 10
Total sessions 52

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
1

Directorate Of Technical Education Karnataka State CS&E 15CS41T

Data Structures using C 3 3 3 3 - - 3 3 3 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

Course Content and Blue Print of Marks for SEE

Unit Hour Questions to be Marks Marks

No Unit Name set for Weightage Weightage
SEE (%)
R U A A
I Pointers and Dynamic 08 - 07 15 22 15.39
Memory allocation
II Files 06 - 07 10 17 11.53
III Introduction to data 10 05 07 16 28 19.23
structures & Linked
lists
IV Stack & Queues 10 - 08 20 28 19.23

V Trees 08 - 07 15 22 15.39
VI Sorting, Searching and 10 - 08 20 28 19.23
Application of Data
Structures
Total 52 05 44 96 145 100

UNIT I : Pointers and Dynamic Memory allocation 08 Hrs

Pointers - Concept of pointers, Declaring and initializing pointers, Accessing variables using
pointers, Pointer arithmetic, Pointers and arrays, Pointers and character strings, Pointers and
functions, Pointer as a function argument, Pointers to function, Pointers and structures.

Dynamic Memory allocation – Introduction, Dynamic memory allocation, Allocating a

block of memory: Malloc, Allocating multiple blocks of memory: Calloc, Releasing the
used space: Free Altering the size of memory: Realloc

UNIT II: Files 06 Hrs

Introduction, Defining and opening a file, closing a file, Input / Output operations on files,
Error handling during I/O operations, Random Access to files, Command line arguments

UNIT III: Introduction to data structures & Linked lists 10 Hrs

Introduction to data structures – Introduction, Characteristics, Types of data structures,

data structure operations.

Directorate Of Technical Education Karnataka State CS&E 15CS41T

Linked lists – Introduction, Basic concept, linked list implementation, Types of linked lists,
Circular linked list (no implementation), doubly linked list (no implementation).

UNIT IV: Stack & Queues 10 Hrs

Stack – Introduction, Stacks, Stack operations, stack implementations.

Queues – Introduction, Basic concept, queue operations, queue implementations, circular

queue (no implementation), priority queues (no implementation), double ended queues (no
implementation).

UNIT V: Tree 08 Hrs

Introduction, Basic concept, Binary tree, Binary tree representation, Binary tree traversal.

UNIT VI: Sorting, Searching and Application of Data Structures 08 Hrs

Sorting – Introduction, sorting techniques – selection sort, insertion sort, bubble sort, quick
sort (no implementation), merge sort (no implementation).

Searching – Introduction, Linear search, binary search.

Application of data structure – Introduction, Applications of stack, Infix to postfix

conversion, Evaluation of a postfix expression, Recursion, factorial, GCD, List application of
queues, linked lists and trees.

®Text books
1. Programming with ANSI-C, E. Balaguruswamy, Sixth Edition, Tata Mcgraw Hill for
Unit I and II
2. Data Structures using C, E. Balagurusamy, Tata Mcgraw Hill for Unit III,IV,V,VI

References
1. Programming with ANSI & Turbo C, Ashok Kamthane, Second Edition, Pearson
Education.
2. Let us C, Yashavant P Kanetkar, 14th Edition, BPB publication, ISBN
9788183331630
3. Data structures A Programming Approach with C Second Edition , PHI publication,
Dharmender Singh Kushwaha, Arun Kumar Misra.
4. Programming in C and Data Structure, P.B.Kotur, Sapna Book house
5. http://spoken-tutorial.org/tutorial-
search/?search_foss=C+and+Cpp&search_language=English
6. http://www.tutorialspoint.com/cprogramming/
7. http://www.indiabix.com/online-test/c-programming-test/

Suggested list of student activities

Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.

Directorate Of Technical Education Karnataka State CS&E 15CS41T

1. Each group should do any one of the following type activity or any other similar
activity related to the course and before conduction, get it approved from concerned course
coordinator and programme coordinator.
2. Each group should conduct different activity and no repeating should occur

1 Implementation of Double linked list and circular linked list

2 Implementation of Circular Queue
3 Implementation of function pointers
4 Design and implement the Applications of Stack
5 Quiz

Course Delivery

The course will be delivered through lectures and Power point presentations/ Video

Course Assessment and Evaluation Scheme

Method What To When/Where Max Evidence Course

who (Frequency in Marks collected outcomes
m the course)
CIE IA Three IA tests 1 to 6
(Average of
Direct Assessment

20 Blue books
three tests will
be computed)
Students

Student 1 to 6
05 Report
activities
Total 25
SE End End of the Answer scripts 1 to 6
100
E Exam course at BTE
Middle of the 1, 2, 3 Delivery
Indirect Assessment

Feedback forms
course of course
End of End of the 1 to 6
Students

Course course Effectiveness of

Survey Delivery of
Questionnaires
instructions &
Assessment
Methods
Note: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off

to the next higher digit.

Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 50
3 Application 40

Directorate Of Technical Education Karnataka State CS&E 15CS41T

 Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (20 marks)
2. Student suggested activities report for 5 marks
3. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.

FORMAT OF I A TEST QUESTION PAPER (CIE)

Test/Date and Time Semester/year Course/Course Code Max Marks

Ex: I test/6 th weak of I/II SEM

20
sem 10-11 Am
Year:
Name of Course coordinator : Units:__
CO’s:____

Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal choice may be given in each CO at the same cognitive level (CL).

MODEL QUESTION PAPER (CIE)

Test/Date and
Semester/year Course/Course Code Max Marks
Time

Ex: I test/6 th week IV SEM Data Structures Using C

20
of sem 10-11 AM Year: 2015-16 Course code:15CS41T

Name of Course coordinator :

Units:1,2 Co: 1,2

Note: Answer all questions

Questio C
Question CL PO
n no O

1 How is a pointer to an array different from an array of pointers? U 1 1,2

Explain with an example (5)
2 Write C program to swap two numbers using pointers. (5) A 1 1,2
OR
Give the difference between call-by-value and call-by-reference
methods.
3 Explain different file accessing modes. U 2 1,2
OR
With an example, explain how to handle errors during I/O operations
4 Write a program to copy contents of one file to another. A 2 1,2

Directorate Of Technical Education Karnataka State CS&E 15CS41T

.
Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS41T

MODEL QUESTION PAPER Code: 15CS41T
Diploma in Computer science & Engineering
IV- Semester
Course Title: Data Structures Using C
Time: 3 Hours Max Marks: 100
PART-A
Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks
1. Explain fseek() and ftell() functions.
2. Define Data structures. Mention different types of data structures.
3. Write the advantages and disadvantages of a Linked List.
4. Define stack. Explain how to represent a stack in C.
5. Write a note on dequeue.
6. Define the following a)internal node b) sibling c) degree of the tree d) depth of a tree
e) path
7. Define the following a) root node b) leaf node c) level of tree d) child node e)parent
node.
8. Write a recursive C program to find the GCD of two numbers.
9. List the application of Linked List.

PART-B
Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks
1. a)Define Pointer. Write its advantages and disadvantages.
b)Explain pointer to structure with example.
2. List and explain Dynamic Memory allocation functions in C.
3. Write a program to copy contents of one file to another. Use command line arguments
to specify the file names.
4. Write the c functions to perform insert at front and delete operations on Singly Linked
List.
5. Define Circular Linked List. Give its c representation.
6. Write C program to implement push and pop operation of stack.
7. Define Priority queue. Write the C implementation Priority Queue.
8. Construct a binary tree for the following values and traverse the tree in preorder,
inorder and postorder:
46, 76, 36, 26, 16, 56, 96
9. Write a c program to implement Binary Search.
10. List the application of stack. Write an algorithm to convert infix to postfix expression.

Directorate Of Technical Education Karnataka State CS&E 15CS41T

 MODEL QUESTION BANK
Diploma in Computer Science & Engineering
IV Semester
Course Title: Data Structures Using C

CO Question CL Marks
Define Pointer. Write its advantages and disadvantages. A
Explain the declaration and initialization of pointer variable with an U
example.
Discuss the use of address operator and indirection operator with U
pointers.
Explain the array of pointers with an example. U
Give the difference between call-by-value and call-by-reference U
methods.
Differentiate between pointers as function arguments and pointers to A
function.
How is a pointer to an array different from an array of pointers? Explain U
with an example 05
Explain pointers and array using example. U
Explain how an array can be passed to a function? A
Explain in brief the different parameter passing mechanisms. A
Explain pointer to structure with example. A
Write C program to swap two numbers using pointers. A
Define Dynamic Programming in C and its advantages. A
Give the difference between malloc() and calloc() functions. U
I
Explain free(). What are its advantages? U
Explain character pointer as an argument to a function with an example. U
Discuss pointer as a function argument. With an example explain call- A
by-reference method.
With an illustration program explain pointers to structures. A
With an illustration program explain pointers to arrays. A
Write a program to illustrate pointer arithmetic’s. A
Write C program to compare 2 strings to check whether they are equal A
or not using pointer. 10
What are the advantages of pointer? Write a program using pointers to A
compute the sum of all elements stored in an array.
Explain Dynamic Memory allocation in C using memory map. A
List and explain Dynamic Memory allocation functions in C. A
Writ a program to illustrate memory allocation using malloc() function. A
Writ a program to illustrate memory allocation using calloc() function. A
Writ a program to illustrate reallocation of memory using realloc() A
function.
How are static and dynamic memory allocations different? Write a A
program to sort 10 numbers using malloc().
What is a file? Explain how to open and close a file. U
Distinguish between the following functions: R
i. getc and getchar
8

Directorate Of Technical Education Karnataka State CS&E 15CS41T

 ii. printf and fprintf 05
With an example, explain how to handle errors during I/O operations. U
Explain fseek() and ftell() functions. U
Differentiate between following functions: U
i. feof and ferror
ii. printf and fprintf
iii. getc and getw
II 10
Write a program to copy contents of one file to another. A
Use command line arguments to specify the file names. U
List and explain Input /Output functions of file. U
Explain different file accessing modes. U
Define Data structures. Mention different types of data structures. R
What are primitive data types? Explain U
Distinguish between linear and non-linear data structures. R
Explain data structure operations. U
Define Linked List. Mention the different types of Linked list. R
Explain the representation of a Linked List in memory with a help of an U 05
illustration.
III Explain the operations that are performed on Singly Linked List. U
Write the advantages and disadvantages of a Linked List. U
Compare Singly Linked List with Circular Linked List. U
Compare Singly Linked List with Doubly Linked List. U

Write the c functions to perform insert at end and display operations on A

Singly Linked List.
Write the c functions to perform insert at front and delete operations on A
Singly Linked List.
10
Write the c functions to perform insert at a given position operations on A
Singly Linked List.
Define Circular Linked List. Give its C representation. A
Define Doubly Linked List. Give its C representation. A
Define stack. Explain how to represent a stack in C. U
Explain push and pop operations of stack. A
Define queue. Explain the sequential representation of queue U 05
Write a note on queue. U
Define Priority queue. Differentiate ascending ord descending priority A
queue
IV Write C program to implement push and pop operation of stack. A
Define queue. List and explain types of queues. U
Write a program to implement queue in C. A
Write an algorithm to perform Queue insertion and deletion. A 10
Define Circular queue. Write the C implementation Circular Queue. A
Define Priority queue. Write the C implementation Priority Queue. A
Define Double Ended queue. Write the C implementation Double Ended A
Queue double.
Define Binary tree. Explain the method of representing binary trees. U

Directorate Of Technical Education Karnataka State CS&E 15CS41T

 Explain with an example how to perform deletion A
operation on a binary tree.
Define the following a) root node b) leaf node c) level of tree d) child R
node e)parent node.
Define the following a)internal node b) sibling c) degree of the tree d) R 05
depth of a tree e)path
Construct a binary tree for the following data, A
V
16, 3, 8, 11, 1, 6, 9, 14, 2, 10, 17, 7 13
Explain Strictly Binary tree and Complete Binary Tree, with an A
example.
Explain Perfect Binary tree and Balanced Binary Tree, with an example. A
What is binary tree traversing? Explain type of traversal with example. A
Develop a recursive algorithm to traverse a binary tree in the following A
order i.e Inorder, Preorder and Post order. 10
Construct a binary tree for the following values and traverse the tree in A
preorder, inorder and postorder:
46, 76, 36, 26, 16, 56, 96
Define tree traversal. List and explain types of tree traversal. A
Explain with an example the working of the merge sort. A
Explain the concept of straight selection sort. U
Write a note on simple insertion sort. U
Explain Quick sort with example. A
Explain Bubble sort with an example. A
Explain the concept of Linear Search. U
Explain the concept of Binary Search. U 05
Write a recursive C program to find the GCD of two numbers. A
Write a recursive C program to find the Factorial of a number. A
What is recursion? Explain the properties of recursive definition U
List the application of Queues. A
VI List the application of Linked List. A
List the application of Trees. A
Develop a C program to implement bubble sort method. A
A
Write a program to implement Insertion sort.
Write a program to implement Selection sort. A
Write a c program to implement Linear Search. A
Write a c program to implement Binary Search. A
List the application of stack. Write an algorithm to convert infix to A 10
postfix expression.
Give the postfix and prefix forms for the following expression. U
(a / b) * c – (d + g) $ f
Give the postfix and prefix forms for the following expression. U
a $ b * c – d + e / f / (g + h)
Evaluate the given postfix expression with the stack content, U
3+4*2/(9-5) ^ 4

10

Directorate Of Technical Education Karnataka State CS&E 15CS41T

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title: OOP With Java

Course Code:
Scheme (L:T:P) : 4:0:0 Total Contact Hours: 52
15CS42T
Type of Course: Lectures, Self Core/ Elective:
Credit :04
Study & Student Activity. Core
CIE- 25 Marks SEE- 100 Marks

Prerequisites
Knowledge of programming concepts.

Course Objectives

To learn and implement object-oriented features such as encapsulation, inheritance

and polymorphism along with error-handling techniques using Java.

Course Outcome

On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked Teaching
Course outcome
PO Hours

CO1
Discuss the OOP’s concept and Apply the concepts 8
U,
to design, implement, compile, test and execute 2,3,4,8,10
A
simple Java programs.
Explain the concepts related to classes and Use 14
CO2 U,
built-in methods of String and String Buffer 2,3,4,8,10
A
classes.
CO3 Define Inheritance and Discover Interface with U, 6
2,3,4,8,10
programs A
CO4 Illustrate Packages and articulate with simple U, 8
2,3,4,8,10
programs A
CO5 Illustrate multithreading concepts by U, 8
2,3,4,8,10
experimenting with programs A
CO6 Interpret different types of Exceptions by solving U, 8
2,3,4,8,10
programs. A
Total sessions 52

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Directorate Of Technical Education Karnataka State CS&E 15CS42T

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
OOP With Java - 3 3 3 - - - 3 - 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

Course Content and Blue Print of Marks for SEE

Unit Hour Questions to be Marks Marks

No Unit Name set for Weightage Weightage
SEE (%)

R U A A
I Introduction of Java 8 5 10 7 22 15.38
II Classes, Objects and 14 - 18 10 38 27.00
Methods; Strings and
String Buffer Classes
III Interface: Multiple 6 - 6 10 16 11.53
Inheritance
IV Packages: Putting 8 - 13 10 23 15.38
Classes Together
V Multithreaded 8 - 13 10 23 15.38
Programming
VI Managing Errors and 8 - 13 10 23 15.38
Exceptions
Total 52 5 73 57 145 100

UNIT I: Introduction of Java 06 Hrs

Fundamentals of Object Oriented Programming- Introduction, Object oriented Paradigm,

Basic Concepts of OOP, Benefits of OOP, Applications of OOP.

Java Evolution - Java history, Java Features, How Java Differs from C and C++, Java and
World Wide Web, Java Environment, Simple Java Program, An Application with Two
Classes, Java Program Structure, Java Tokens, Java Statements, Implementing a Java
Program, Java Virtual Machine, Command Line Arguments, Programming Style, Constants,
Variables, Data Types, Scope of Variables, Symbolic Constants, Type Casting, Standard
Default Values, Special Operators, Mathematical Functions, Labelled Loops (break &
Continue) Operators and Expressions, Decision Making, Branching & Looping.

Directorate Of Technical Education Karnataka State CS&E 15CS42T

UNIT II: Classes, Objects and Methods; Strings and String Buffer Classes 14Hrs

Classes, Objects and Methods - Introduction, Defining a Class, Fields Declaration, Methods
Declaration, Creating Objects, Accessing Class Members, Constructors, Methods
Overloading, Static Members, Nesting of Methods, Inheritance: Extending a Class,
Overriding Methods, Final Variables and Methods, Final Classes, Finalize Methods, Abstract
Methods and Classes, Methods with Variable arguments (Varargs),Visibility Control.
Strings and String Buffer Classes - Strings, Vectors, Wrapper classes, Enumerated Types,
Annotations.
UNIT III: Interface: Multiple Inheritance 10Hrs
Introduction, Defining Interfaces, Extending Interfaces, Implementing Interfaces, Accessing
Interface Variables.

UNIT IV: Packages: Putting Classes Together 08Hrs

Introduction, Java API Packages, Using System Packages, Naming Conventions, Creating
Packages, Accessing a Package, Using a Package, Adding a Class to a Package, Hiding
Classes, Static Import.
UNIT V: Multithreaded Programming 06 Hrs

Introduction, Creating Threads, Extending the Thread Class, Stopping and Blocking a
Thread, Life Cycle of a Thread, Using Thread Methods, Thread Exceptions, Thread Priority,
Synchronization, Implementing the ‘Runnable’ Interface, Inter-thread Communication.

UNIT VI: Managing Errors and Exceptions 08 Hrs

Introduction, Types of Errors, Exceptions, Syntax of Exception Handling Code, Multiple

Catch Statements, Using Finally Statement, Throwing Our Own Exceptions.

®Text books
Programming with Java, 6th edition, Balagurusamy, Mc Graw Hill, ISBN 13- 9789351343202
ISB 10- 9351343200

References
1. Complete Reference Java J2se, Herbert Schildt, Tata McGraw Hill, ISBN
9780070598782
2. Java 6 Programming – Black Book Wiley India Pvt ltd
3. Programming in JAVA2 – Dr. K. Somasundaram Jaico Publish
4. Programming in JAVA – S.S. Khandare – S. Chand Publish
E-learning resources

http://www.Javatpoint.com/Java-tutorial
http://www.tutorialspoint.com/Java/
http://www.indiabix.com/technical/core-Java/

Suggested list of student activities

Note: The following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)
3

Directorate Of Technical Education Karnataka State CS&E 15CS42T

Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
1. Each group should do any one of the following type activity or any other similar activity
related to the course and before conduction, get it approved from concerned Course
coordinator and Program Coordinator
2. Each group should conduct different activity and no repeating should occur.
∑ Hotel Management System, E-Bill Board, Online insurance, Online Mobile,
Contributor, Online Restaurant, Public Distribution System, SECURE E-banking
security,
District medical data center, Visit different sites relevant to topics. Listen to the lectures and
submit a handwritten report, etc.

Course Delivery

The course will be delivered through lectures and Power point presentations/ Video

Course Assessment and Evaluation Scheme

Method What To When/Where Max Evidence Course

who (Frequency in Marks collected outcomes
m the course)
CIE IA Three IA tests
(Average of
20 Blue books 1 to 6
three tests will be
Direct Assessment

computed)
Students

Student activities Activity

05 1 to 6
Reports
Total 25
SEE End End of the Answer scripts
100 1 to 6
Exam course at BTE
Student Middle of the
Feedback 1 to 3 Delivery
Feedback on course
forms of course
Indirect Assessment

course
Students

End of End of the course 1 to 6

Course Effectiveness
Survey of Delivery of
Questionnaires
instructions &
Assessment
Methods
Note: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off

to the next higher digit.

Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 30
3 Application 60

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
4

Directorate Of Technical Education Karnataka State CS&E 15CS42T

 1. Blue books (20 marks)
2. Student suggested activities report for 5 marks
3. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.

FORMAT OF I A TEST QUESTION PAPER (CIE)

Test/Date and Time Semester/year Course/Course Code Max Marks

Ex: I test/6 th weak of I/II SEM

20
sem 10-11 Am
Year:
Name of Course coordinator : Units:__
CO’s:____

Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal choice may be given in each CO at the same cognitive level (CL).

MODEL QUESTION PAPER (CIE)

Test/Date and
Semester/year Course/Course Code Max Marks
Time

Ex: I test/6 th week IV SEM OOP With Java

20
of sem 10-11 AM Year: 2015-16 Course code:15CS42T

Name of Course coordinator :

Units:1,2 Co: 1,2

Note: Answer all questions

Questio C
Question CL PO
n no O

1 Define the following OOPS concepts (5) U 1 1,2

a. Inheritance b. Polymorphism
2 Illustrate Java communication with a web page (5) A 1 1,2

3 Explain any five string buffer methods (5) U 2 1,2

4 Write a Java Programme to illustrate to illustrate vectors. (5) 2 1,2

Directorate Of Technical Education Karnataka State CS&E 15CS42T

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS42T

MODEL QUESTION PAPER Code: 15CS42T
Diploma in Computer science & Engineering
IV- Semester
Course Title: OOP With Java Programming

Time: 3 Hours Max Marks: 100

PART-A
Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks

1. List any five major differences between C++ and Java.

2. Distinguish between Inheritance &Polymorphism.
3. Define constructors. List its special properties.
4. Compare arrays and vectors.
5. Explain how to add a class to a package with an example.
6. Explain the various forms of interface implementation.
7. Explain yield(),sleep() and stop() methods of a thread.
8. List the Java exceptions.
9. Illustrate with an example nested try statement.
.

PART-B
Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks
1. Explain the features of Java.
2. Explain class definition with fields and method declaration.
3. Define static member. Write a program to illustrate static members.
4. Define inheritance. Explain different forms of inheritance.
5. Write a program to implement interfaces
6. Explain Java API packages
7. Write a Package program to demonstrate basic arithmetic operators

8. Explain the life cycle of thread.

9. Explain with an example thread creation by implementing runnable

Interface..
10. Write a program for throwing your own exception.

Directorate Of Technical Education Karnataka State CS&E 15CS42T

 MODEL QUESTION BANK

Diploma in Computer Science & Engineering

IV Semester
Course Title: OOP with Java

CO Question CL Marks
Give the definition of object oriented programming and how it is U
different from procedure-oriented programming
Explain the organization of data and methods in an object U
oriented programming.
List the unique advantages of an object oriented programming U
Give the definition of object and classes. Explain representation U
of an object with an example.
Define the following U
(i) Data abstraction (ii) Data encapsulation
Define the following OOPS concepts U
b. Inheritance
c. Polymorphism
Distinguish between objects and classes U
Distinguish between Data abstraction & Data encapsulation U
Distinguish between Inheritance &Polymorphism U
Distinguish between Dynamic binding & message passing. U
I Explain Dynamic binding & message passing U 05
List any five advantages of OOP A
List any five areas of application of OOPS technology A
Java is platform independent language. Justify U
Discuss how Java is more secured than other language U
List any features of Java. A
List any five major differences between C and Java. U
List any five major differences between C++ and Java U
Discuss the contributions of Java to the world wide web. A
Illustrate Java communication with a web page A
Explain the process of building and running Java application A
programs
Explain Java run time environment U
Write a simple Java program and explain A
Write a simple Java program to illustrate the use of A
mathematical functions
List the different sections of Java program structure U
List the advantages of OOPS. U
Discuss OOPs areas of application. A
Define the following. R
I a. Data abstraction.
b. Data encapsulation.
c. Inheritance.
Define the following. R

Directorate Of Technical Education Karnataka State CS&E 15CS42T

 a. Polymorphism.
b. Dynamic binding.
c. Message Communication. 10
List and explain Java features. A
Discuss how Java differs from C & C++. U
Explain the contributions of Java to the world wide web. With a U
figure illustrate how Java communicates with a web page.
Write a Java program to illustrate an application with two A
classes
Explain Java program structure with a diagram U
Explain the features of Java. A
List and explain Java statements. U
Describe in detail the steps involved in implementing a U
standalone program
Explain Java virtual machine. U
Discuss command line arguments in Java with an example U
program
With general syntax explain formatted input-output statements. U
Give example for each.
Define constructors. List its special properties U
Define object. Explain object creation from a class U
Define multilevel inheritance with an example U
Define hierarchical inheritance with an example U
Describe the syntax of single inheritance in Java U
Compare and contrast overloading and overriding methods U
Define subclass constructor and the use of keyword super U
Define final classes and finalize methods U 05
Define abstract methods and classes U
Write the visibility control of Java classes. U
Compare arrays and vectors U
Explain any five string methods. U
Explain any five string buffer methods U
II
Explain the use of wrapper class in Java U
Differentiate between interfaces and classes U
Explain class definition with fields and methods declaration U
Discuss object creation in Java. U
With an example explain accessing of class members A
Write a program to illustrate constructor A
Discuss the process of method overloading U
Define static member. Write a program to illustrate static 10
A
members.
Write a program to illustrate method overloading A
Write a program to sort N elements of an array. A
Write a program to illustrate vectors. A
Write a program to illustrate wrapper classes A
Differentiate between interfaces and classes U
Write the general syntax of creating an interface and explain U
III Explain the various forms of interface implementation U 05
Explain how to access interface variables with an example
Write the similarities between class and interfaces U
9

Directorate Of Technical Education Karnataka State CS&E 15CS42T

 Explain how to extend interfaces with an example A
With an example explain how to support multiple inheritance A 10
Write a program to implement interfaces. A
Define a package. List Java API packages U
How to create and implement a package U
Explain the naming convention of a package with an example U
Explain how to access packages with an example A
Explain how to add a class to a package with an example A 05
Discuss the various levels of access protection available for U
packages
IV Explain how to hide classes in a package U
Explain static import and how is it useful U
Explain Java API packages. U
Write a program to add a class to a package. A
Write a Package program to demonstrate basic arithmetic A 10
operators
Write a program to use inbuilt packages to calculate square root A
of a number
Define thread. R
Differentiate between multithreading and multitasking U
Explain how to create thread by extending Thread class with an U
example
Explain how to stop and block a thread U
Describe complete life cycle of a thread U
05
Explain yield(),sleep() and stop() methods of a thread U
Write a note on thread exceptions U
How do we set priorities for threads? U
How to create a runable thread? U
Define synchronization? When do we use it U
Differentiate between suspending and stopping a thread U
V
Explain the different methods of creating threads U
Write a program to create a threads using a thread class A
Explain thread creation by implementing runnable interface with A
an example
Write a note on inter- thread communication U
Write a program to create threads by extending thread class A 10
Write a program to create threads by implementing runnable A
interface
Write a program to set priorities for threads A
Write a program to implement yield(),sleep() and stop() methods A
of a thread
Explain the life cycle of thread. U
Define exception and explain its purpose U
Explain types of errors with suitable examples U
List the compile time errors U
List the run time errors U
VI 05
Illustrate compile time errors with an example A
Illustrate run time errors with an example A
Explain the syntax of exception handling U
Write a program to illustrate nested try statements A
10

Directorate Of Technical Education Karnataka State CS&E 15CS42T

 Explain nested try statements with an example A
Explain multiple catch blocks with an example A
How many catch blocks can be used with one try block.,explain U
Create a try block that is likely to generate three types of A
exception and then incorporate necessary catch block to catch
and handle them appropriately
Explain the finally block. When and how it is used with a U
suitable example
Explain how exception handling mechanism can be used for A
debugging a program
Define an exception called “No MatchException”that is thrown A
when a string is not equal to “ Ïndia”.Write a program that uses
this exception
Explain how to throw our own exceptions U
Write a program to implement “ Throwing our own exceptions” A
Write a program to illustrate multiple catch blocks A
Write a program to use multiple catch block statement. A
10
Write a program to illustrate nested try statement. A
Write a program for throwing your own exception A

11

Directorate Of Technical Education Karnataka State CS&E 15CS42T

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title: Operating System

Course Code:
Scheme (L:T:P) : 4:0:0 Total Contact Hours: 52
15CS43T
Type of Course: Lectures, Self Core/ Elective:
Credit :04
Study & Student Activity. Core
CIE- 25 Marks SEE- 100 Marks

Prerequisites

Basic Computer Concepts

Course Objectives

1. Understand the services of an operating system provides to its users and system itself.
2. Apply various CPU scheduling algorithms and recognize the classic synchronization
problems.
3. Compare methods for handling deadlocks and apply various memory management
techniques.
4. Describe file systems.

Course Outcome

On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked Teaching
Course outcome
PO Hours
CO1 Describe operating system operations and 08
U 1,2,9,10
operating system structures.
CO2 Understand process management and apply U, 2,3,9,10 12
process scheduling algorithms A
CO3 Recognize Synchronization and discover the U, 2,3,9,10 08
methods for handling deadlocks. A
CO4 U, 2,3,9,10 08
Explain the memory management techniques.
A
CO5 Discover the concepts related to virtual memory U, 2,3,9,10 08
management A
CO6 U, 2,3,9,10 08
Identify file systems concepts.
A
Total sessions 52

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Directorate Of Technical Education Karnataka State CS&E 15CS43T

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
Operating System - 3 3 - - - - - 3 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

Course Content and Blue Print of Marks for SEE

Unit Hour Questions to be Marks Marks

No Unit Name set for Weightage Weightage
SEE (%)
R U A A
I Introduction to 8 - 22 - 22 15.38
operating systems
II Process management 12 - 22 10 32 23.10
III Synchronization & 08 - 12 10 22 15.38
Deadlocks
IV Memory management 08 - 14 10 24 15.38

V Virtual memory 08 - 13 10 23 15.38

management
VI File system 08 - 12 10 22 15.38

Total 52 - 95 50 145 100

UNIT I : Introduction to Operating System 08 Hrs

What operating systems do? Computer System architecture, Operating System structure,
Operating System operations, Process management, Memory management, Storage
management, Protection and security, Distributed system, Special-purpose systems,
Computing environments, Open-source Operating Systems..

UNIT II: Process Management 12 Hrs

Process concept, Process scheduling, Operations on processes, Inter-process communication,

Process Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms.

UNIT III: Synchronization & Deadlocks 08 Hrs

Synchronization – Background, The critical section management and semaphores

(Concepts only)
Deadlocks- System model, Deadlock characterization, Methods for handling deadlocks,
Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery from deadlock

Directorate Of Technical Education Karnataka State CS&E 15CS43T

UNIT IV: Memory Management Strategies 08 Hrs

Background, Swapping, Contiguous memory allocation, Paging, Structure of page table,

Segmentation
UNIT V: Virtual Memory Management 08 Hrs

Background, Demand paging, Copy-on-write, Page replacement, Allocation of frames .

UNIT VI: File System 08 Hrs

File concept, Access methods, Directory and disk structure, File system mounting, File
Sharing , Protection.

®Text books
1. Operating System Principles – Abraham Silberschatz, Peter Baer Galvin, Greg
Gagne, 8th edition, Wiley-India. (Chapters-1, 3, 5, 6, 7, 8, 9, 10 and 11)
ISBN- 9788126520510
References
1. Operating Systems, I. Chandra Mohan, PHI, 2013, ISBN – 9788120347267
2. http://www.tutorialspoint.com/operating_system/
3. http://courses.cs.vt.edu/~csonline/OS/Lessons/index.html
4. http://www.nptel.ac.in
Suggested list of student activities
Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
1. Each group should do any one of the following type activity or any other similar
activity related to the course and before conduction, get it approved from concerned course
coordinator and programme coordinator.
2. Each group should conduct different activity and no repeating should occur
1 How to install and Uninstall an Operating System on a New Computer
2 How to Remove a Second Operating System from a PC
3 A Survey of recent Operating System
4 Case study on real time deadlock situation
5 A case study on real time process synchronization
6 Comparison of OS working in single core and multi core environment
7 Comparison of 32 bits and 64 bits OS
8 Operating system is responsible for following activities in connection
with management of memory:
∑ Allocation and de allocation of memory as and when needed
∑ Keeping track of used and unused memory space.
∑ Deciding what process to be loaded into memory in case space becomes
available.
9 For secondary space management:
∑ Swap space and free space management
∑ Disk scheduling
3

Directorate Of Technical Education Karnataka State CS&E 15CS43T

 ∑
Allocating space to the data and programs onto the secondary
storage device.
10 For process management:
∑ Creation, deletion of both user and system process.
∑ Handling process synchronization.
∑ Deadlock handling.

Course Delivery
The course will be delivered through lectures and Power point presentations/ Video

Course Assessment and Evaluation Scheme

Method What To When/Where Max Evidence Course

who (Frequency in Marks collected outcomes
m the course)
CIE IA Three IA tests 1,2,3,4
(Average of
20 Blue books
three tests will
Direct Assessment

be computed)
Students

Student 1,2,3,4
05 Report
activities
Total 25
SE End End of the Answer scripts 1,2,3,4
100
E Exam course at BTE
Student Middle of the
1 & 2 Delivery
Feedback course Feedback forms
of course
Indirect Assessment

on course
Students

End of End of the 1,2,3,4

Course course Effectiveness of
Survey Delivery of
Questionnaires
instructions &
Assessment
Methods
Note: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off

to the next higher digit.

Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 20
2 Understanding 50
3 Application 30

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (20 marks)
2. Student suggested activities report for 5 marks
3. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.
4

Directorate Of Technical Education Karnataka State CS&E 15CS43T

 FORMAT OF I A TEST QUESTION PAPER (CIE)
Test/Date and Time Semester/year Course/Course Code Max Marks

Ex: I test/6 th weak of I/II SEM

20
sem 10-11 Am
Year:
Name of Course coordinator : Units:__
CO’s:____

Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal choice may be given in each CO at the same cognitive level (CL).

MODEL QUESTION PAPER (CIE)

Test/Date and
Semester/year Course/Course Code Max Marks
Time

Ex: I test/6 th week IV SEM Operating System

20
of sem 10-11 AM Year: 2015-16 Course code:15CS43T

Name of Course coordinator :

Units:1,2 Co: 1,2

Note: Answer all questions

Questio C
Question CL PO
n no O

1 Explain OS in user’s view and system’s view. (5) U 1 1,2

2 Explain the computer system architecture (5) U 1 1,2

3 Consider the following set of process with the length of the CPU burst A 2 1,2
time given in milliseconds
Process Burst time Priority
P1 9 3
P2 11 1
P3 3 3
The processes are assumed to have arrived in the order P1, P2, P3 all at
time 0. What is the waiting time and turnaround time of each process
for FCFS & PRIORITY scheduling algorithms? (5)
4 What is a process? Draw and explain the state transition diagram of a U 2 1,2
process.

Directorate Of Technical Education Karnataka State CS&E 15CS43T

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS43T

MODEL QUESTION PAPER Code: 15CS43T
Diploma in Computer science & Engineering
IV- Semester
Course Title: Operating System
Time: 3 Hours Max Marks: 100
PART-A
Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks
1. Write a note on client/server computing.
2. Explain the contents of PCB with neat diagram.
3. Explain the different scheduling criteria.
4. Write a note on critical-section problem and the solution to solve it.
5. How deadlock can be avoided using resource allocation graph? Explain
6. What is fragmentation? Differentiate between internal and external fragmentation.
7. Explain swapping technique with a neat diagram
8. Write a note on Copy-on-write.
9. Discuss briefly client-server model of file sharing

PART-B
Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks
1. What are the different operating system operations.

2. Different activities in connection with process management, memory management

and storage management

3. Consider the following set of process with the length of the CPU burst time given in
milliseconds

Process Burst Time Priority

P1 10 3
P2 13 1
P3 3 3
P4 8 4

The processes are assumed to have arrived in the order P1, P2, P3 & P4 all at time 0.

a. Draw the Gantt chart for FCFS and PRIORITY scheduling algorithms.
b. What is the waiting time and turnaround time of each process for FCFS & PRIORITY
scheduling algorithms.
c. Calculate the average waiting time and average turnaround time for FCFS & PRIORITY
scheduling algorithms.
7

Directorate Of Technical Education Karnataka State CS&E 15CS43T

 4. Explain the different operations on processes.
5. Explain the banker’s algorithm.

6. List and explain different structure of the page table with a neat diagram

7. Explain the contiguous memory allocation.

8. Consider the following reference string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many

page faults would occur for the following page replacement algorithm assuming 3 page
frames: 1) LRU 2) FIFO 3) Optimal Page Replacement.

9. List out common file types with their extension and functions

10. Explain Tree-structured directory and Acyclic-graph directory with a neat diagrams

Directorate Of Technical Education Karnataka State CS&E 15CS43T

 MODEL QUESTION BANK
Diploma in Computer Science & Engineering
IV Semester
Course Title: Operating System

CO Question CL Marks
Write a note on protection and security. U
Write a note on client/server computing. U
Discuss time sharing system. U
Explain distributed system. U 05
Explain the peer-to-peer computing. U
Explain OS in user’s view and system’s view. U
List the advantages and disadvantages of multiprogramming system U
I
What is an operating system? Explain the computer system architecture. U
What are the different operating system operations? U
Compare process management and memory management. U
Explain the special-purpose systems. U 10
Explain clustered system. U
Different activities in connection with process management, memory U
management and storage management.
What is a process? Draw and explain the state transition diagram of a U
process.
Explain the contents of PCB with neat diagram. U
05
Compare long-term, short-term and medium-term scheduler. U
Explain the different scheduling criteria. U

Explain the different operations on processes. U

What is inter-process communication (IPC). Explain the two models of U
IPC with neat diagram.
Consider the following set of process with the length of the CPU burst A
time given in milliseconds
II Process Burst time priority
P1 10 3
P2 13 1
P3 3 3 10
The processes are assumed to have arrived in the order P1, P2, P3 all at
time 0.
a. Draw the Gantt chart for FCFS and PRIORITY scheduling
algorithms.
b. What is the waiting time and turnaround time of each process
for FCFS & PRIORITY scheduling algorithms?
c. Calculate the average waiting time and average turnaround
time for FCFS & PRIORITY scheduling algorithms.
Similar Problems
Write a note on semaphores. U
III Explain the 3 requirements for the solution to critical-section problem. A 05
Write a note on critical-section problem and the solution to solve it. A

Directorate Of Technical Education Karnataka State CS&E 15CS43T

 What is deadlock? What are the necessary conditions for deadlock? U
How deadlock can be prevented? Explain. U
How deadlock can be avoided using resource allocation graph? Explain. A
Explain how to recover from deadlock. U
How deadlock can be detected? Explain. U
Explain the banker’s algorithm. U 10
Explain resource-allocation graph with deadlock and without deadlock A
with examples.
Write a note on shared pages. U
Explain First-fit, Best-fit and Worst-fit strategies for memory allocation. U
What is fragmentation? Differentiate between internal and external U
fragmentation.
Explain basic concept of memory allocation using paging U 05
Explain how memory is protected in paging with a neat diagram. U
IV Differentiate between logical and physical address space U
Explain address binding with a neat diagram. U
Explain swapping technique with a neat diagram. U
Explain the contiguous memory allocation. U
Explain hardware implementation of page table with a neat diagram A
10
List and explain different structure of the page table with a neat diagram. A
What is segmentation? Draw and explain its hardware support. A
Explain the virtual memory concept with a neat diagram U
Explain virtual address space with a neat diagram. U
Explain demand paging with a neat diagram. U
Explain the steps for handling page fault with a neat diagram. U
05
Write a note on Copy-on-write. U
V Explain the need for page replacement. U
How frames are allocated? Explain. U
Explain the steps involved in the basic page replacement with diagram. U
Consider the following reference string: A
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many page faults would occur
10
for the following page replacement algorithm assuming 3 page frames: 1)
LRU 2) FIFO 3) Optimal Page Replacement. Similar Problems
Briefly explain the operations that can be performed on files. U
What are the different operations performed on a directory. U
05
Write a note on remote file systems. U
Discuss briefly client-server model of file sharing. U
Define file and explain the different file attributes. U
VI List out common file types with their extension and functions. U
Differentiate between sequential access and direct access methods. U
Explain Single-level directory and Two-level directory with a neat A 10
diagram.
Explain Tree-structured directory and Acyclic-graph directory with a A
neat diagram.

10

Directorate Of Technical Education Karnataka State CS&E 15CS43T

 Government of Karnataka
Department of Technical Education
Board of Technical Examinations, Bangalore
Course Title: PROFESSIONAL ETHICS & INDIAN CONSTITUTION
Scheme (L:T:P) : 4:0:0 Total Contact Hours: 52 Course Code:
15CS44T

Type of Course: Lectures, Self Core/ Elective:

Credit :04
Study& Quiz Core
CIE- 25 Marks SEE- 100 Marks

Prerequisites: Enthusiasm to learn the subject

Course Objectives:

1. To create an awareness on Engineering Ethics and Human Values.

2. To instill Moral and Social Values and Loyalty.
3. Create awareness among engineers about their social responsibilities
4. Appreciate the Ethical issues
5. To Know the Human rights and concept of women empowerment
6. To know features of our constitution.

Course Outcomes:

On successful completion of the course, the students will be able to attain CO:
Course Outcome CL Linked PO Teaching Hrs

CO1 Practice the moral values that ought to 10

R/U 5,6,7,8,10
guide the Engineering profession.
Discover of the set of justified moral U/A
principles of obligation, ideals that 09
CO2 5,7,8,10
ought to be endorsed by the engineers
and apply them to concrete situations
Know the definitions of risk and R/U
CO3 05
safety also discover different factors 5,6,7,10
that affect the perception of risk
Appreciate the Ethical issues and R/U
Know the code of ethics adopted in 06
CO4 5,6,7,10
various professional body’s and
industries
CO5 Justify the need for protection of R/U
8
human rights and to know about 5,6,7,8,10
concept of women empowerment
CO6 Know the successful functioning of R/U 14
5,6,7,9,10
democracy in India
Total sessions 52

Legend: R; Remember, U: Understand A: Application

Directorate of Technical Education Karnataka State Page 1

 COURSE-PO ATTAINMENT MATRIX

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
PROFESSIONAL
ETHICS & - - - - 3 3 3 3 2 3
INDIAN
CONSTITUTION

Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.

Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

COURSE CONTENT AND BLUE PRINT OF MARKS FOR SEE

Unit Hour Questions to be Marks weightage
No Unit Name set for weightage (%)
SEE

R U A

1
HUMAN VALUES 10 15 15 - 30 21

ENGINEERING 10 15 - 25 17
2
09
ETHICS

SAFETY, 05 - 10 15 11
3
RESPONSIBILITIES 05
OF ENGINEERS

ETHICAL ISSUES IN 05 05 5 15 11
4
ENGINEERING 06
PRACTICE

8 15 5 20 13
5 HUMAN RIGHTS
INDIAN 25 15 40 27
6
14
CONSTITUTION

Total 52 35 75 35 145 100

Legend: R; Remember, U: Understand A: Application

Directorate of Technical Education Karnataka State Page 2

UNITI: HUMAN VALUES 10Hrs

Professional Ethics-Objectives of study of professional ethics-Human values- Definition of

Morals and Ethics-Difference between Morality and Ethics-Values-Definition-Types of values-
Definition of Integrity- Concept of Work Ethic- Service Learning- Definition Virtues-Definition-
Civic Virtue-Duties and Rights - Respect for Others – Attitude and values, opinions-changing
attitude-beliefs-Reliability-Living Peacefully-Means to be adopted for leaving peacefully-Caring-
Sharing-Honesty-ValuingTime-Co-operation-Commitment-Empathy-Self-Confidence-
Spirituality.

UNTII: ENGINEERING ETHICS 09Hrs

Engineering ethics-Definition-Approach-Senses of Engineering Ethics-variety of moral issues–

Inquiry-Types-Moral dilemmas-Steps to solve dilemma-Moral autonomy –Definition-consensus
& controversy –Profession-Definition–Ethical theories-Theories about right action Personality–
Self control- Self-interest –Self respect.

UNITIII: SAFETY, RESPONSIBILITIES OF ENGINEERS 05Hrs

Safety and risk-definition- - assessment of safety and risk - risk benefit analysis and reducing risk
–Personal risk-Public risk-Reducing risk-Voluntary Risk-Collegiality and loyalty–Authority-
Types- collective bargaining -occupational crime –Responsibility of engineers–Types-Social
responsibility-Professional responsibility-confidentiality-conflicts of interest-liability

UNIT IV:ETHICAL ISSUES IN ENGINEERING PRACTICE 06Hrs

Ethical issues–Industrial standards-Environmental ethics –Plastic waste disposal-E-Waste

Disposal-Semi conductor waste Disposal-Industrial waste disposal-Human centred environmental
ethics- computer ethics –Types of issues-Computer as the Instrument and Object of Unethical
Acts -Engineers as managers-Codes of ethics-Sample code of Ethics like -Institution of
Engineers(India)-Institute of Electrical & Electronics engineers- Institute of Electronics &
Telecommunication Engineers - Indian Institute of Materials Management.

UNIT V: HUMAN RIGHTS 8 Hrs

Human Rights-Definition-constitutional provisions-right to life and liberty-Human Rights of

Women-Discrimination against women- steps that are to be taken to eliminate discrimination
against women in Education, employment, health care, Economic and social life, Women in rural
areas- Status of Women in India - Constitutional Safeguards - Dowry Prohibition act 1961-
Domestic violence act 2005- Sexual harassment at work place bill 2006-Human Rights of
Children- Who is a child- list the Rights of the Child- Right to education--Protection of Children
from Sexual Offences Act(POCSO)-2012- National Human Rights Commission- Constitution-
Powers and function of the Commission-Employee rights- Provisions made-Contractual-Non
contractual employee rights-Whistle blowing-definition-Aspects-Intellectual Property Rights
(IPR)–Meaning-Need for protection- Briefly description of concept of patents, Copy right, Trade
mark.

Directorate of Technical Education Karnataka State Page 3

UNIT VI: INDIAN CONSTITUTION 14Hrs

Introduction to constitution of India-Formation and Composition of the Constituent Assembly-

Salient features of the Constitution-Preamble to the Indian Constitution Fundamental Rights-
Fundamental Duties-Directive principles of state policy.
Parliamentary system of governance- Structure of Parliament- Lokhasabha and Rajyasabha -
Functions of parliament- Legislative ,Executive, Financial Function, Powers of Loksabha and
Rajya Sabha- Procedure followed in parliament in making law-Structure of union executive-
Power and position of President, Vice President, Prime minister and council of ministers.
Structure of the judiciary: Jurisdiction and functions of Supreme Court, high court, and subordinate
courts
Federalism in the Indian constitution, Division of Powers- Union list, State list and concurrent
list, Structure of state legislation, Legislative assembly and Legislative council, Functions of state
legislature, Structure of state executive-Powers and positions of Governor, ,Speaker, Deputy
Speaker, Chief Minister and council of minister.
Local self government- meaning-Threetiersystem-Villagepanchayath-Talukpanchayath-
Zillapanchayath-Local bodies-Municipalities and Corporations, Bruhath mahanagara Palike.
Functions of Election commission, UPSC, KPSC.

MODEL QUESTION PAPER

4- Semester Diploma Examination
PROFESSIONAL ETHICS & INDIAN CONSTITUTION Time: 3
Hours] [Max Marks: 100 Note: Answer
any SIX from Part A and any SEVEN from Part B

PART-A 6x5=30 marks

1. Distinguish between ‘morality’ and ‘ethics’

2. Explain the terms, ‘Profession’, ‘Professional’, and ‘Professionalism’?
3. Name a few techniques (steps) to reduce risks?
4. List the ill effects of E waste disposal on environment?
5. Explain the role of computers as object of Unethical Acts?
6. State various provisions under ‘human rights?
7. Differentiate between ‘Patent’ and ‘Trade secret’?
8. State the function of Governor?
9. Write Note on gram panchayaths?
PART-B 7x10=70 marks

10. Illustrate the ethical aspect principle of caring or sharing, with an example?
11. Explain various actions of an engineer leading to dishonesty?
12. List the situations when moral dilemmas arise?

Directorate of Technical Education Karnataka State Page 4

 13. Distinguish between ‘Social responsibility’ and ‘Professional responsibility?
14. Explain Occupational crime?
15. Explain code of Ethics followed in Institution of Engineers?
16. Explain Sexual harassment at work place bill 2006?
17. Explain the basic structure of Parliament?
18. Explain the formation and functions of state high Court?
19. State the role of following members in Rajyasabha?:
a) Chairman
b) Leader of the house
c) Opposition leader

MODEL QUESTION BANK

4th Semester
Course title: PROFESSIONAL ETHICS & INDIAN CONSTITUTION
CO1: PRACTICE THE MORAL VALUES THAT OUGHT TO GUIDE THE ENGINEERING
PROFESSION.
Level-1: Remember

1. List the key trends in engineering ethics?

2. Distinguish between ‘morality’ and ‘ethics’?
3. List different types of values and give a few examples in each?
4. List the civic virtues one should develop?
5. List the types of virtues, with an example for each
6. List the factors for one to work peacefully?
7. List different ways the honesty reflects?
8. List the benefits of empathy?
Level-2: Understand
9. Explain the term ‘respect for others’ with suitable example?
10. Explain what should one do or not to do live peacefully?
11. Distinguish between ‘caring’ and ‘sharing’?
12. What are the impediments to proper co-operation?
13. Explain the factors that shape self-confidence in a person?
14. Explain two methods of developing self-confidence?
15. Illustrate the ethical aspect principle of caring or sharing, with an example?
16. Explain various actions of an engineer leading to dishonesty?
17. Explain Service Learning?

Directorate of Technical Education Karnataka State Page 5

 CO2: DISCOVER OF THE SET OF JUSTIFIED MORAL PRINCIPLES OF OBLIGATION, IDEALS
THAT OUGHT TO BE ENDORSED BY THE ENGINEERS AND APPLY THEM TO CONCRETE
SITUATIONS
Level-1: Remember
1. List the objectives of this course ‘professional ethics’?
2. Define Engineering Ethics?
3. State the two approaches to Engineering ethics?
4. Define the term, ‘moral dilemma’?
5. List the situations when moral dilemmas arise?
6. List the steps in confronting moral dilemma?
7. State the five characteristics of professionals?
8. State the specific virtues relating to honesty?
9. Define ‘corporate responsibility’
10. Define ‘corporate accountability?
11. List the skills required to handle moral problems/issues in engineering ethics?
Level-2: Understand
12. Why do people behave unethically?
13. Why and how do moral problems arise in a profession?
14. Explain the moral dilemma
15. Explain the difficulties in solving moral problems?
16. Explain the relation between autonomy and authority?
17. Highlight the principle of ‘pre-conventional level’ of moral development?
18. Explain the terms, ‘Profession’, ‘Professional’, and ‘Professionalism’?
19. Describe the virtues fulfilled under professional responsibility?
20. What is moral integrity? Write on its significance?
21. Distinguish between causal responsibility, moral responsibility and
Legal responsibility?
22. Where and how do moral problems arise in engineering practice?
Justify the safety and other obligations of professional engineers?

CO3: KNOW THE DEFINITIONS OF RISK AND SAFETY ALSO DISCOVER DIFFERENT
FACTORS THAT AFFECT THE PERCEPTION OF RISK
Level-1: Remember
1. Name the factors that influence the perception of risk?
2. List the factors that affect the risk acceptability?
3. Name a few techniques (steps) to reduce risks?
4. List various aspects of collegiality?
5. List factors/principles to justify ‘confidentiality’?

Level-2: Understand
6. Describe ‘institutional authority’ with an example?
7. What is meant by Professional Responsibility?
Level-3: Application
8. Explain ‘collective bargaining with example?
9. Explain briefly ‘‘institutional authority?
10. Explain Occupational crime?

Directorate of Technical Education Karnataka State Page 6

CO4: APPRECIATE THE ETHICAL ISSUES AND KNOW THE CODE OF ETHICS ADOPTED
IN VARIOUS PROFESSIONAL BODY’S AND INDUSTRIES
Level-1: Remember
1. List the ill effects of E waste disposal on environment?
2. Define ‘computer ethics’? List the issues in ‘computer ethics’?
3. Name different types of problems in ‘computer ethics’?
4. List the ethical problems by computers in workplace?

Level-2: Understand
5. Describe briefly on code of ethics?
6. What are the duties of an engineer as an experimenter, in environmental ethics?
7. How the plastic waste disposals create havocs?
8. Discuss on Industrial waste disposal creating disasters on environment?
Level-3: Application
9. Explain ‘environmental ethics’?
10. Explain human centred environmental ethics?
11. Explain the role of computers as instruments?
12. Explain the role of computers as object of Unethical Acts?
13. Explain the role of engineers as managers?
14. Explain code of Ethics followed in Institution of Engineers?
15. Explain code of Indian Institute of Materials Management?

CO 5: JUSTIFY THE NEED FOR PROTECTION OF HUMAN RIGHTS AND TO KNOW

ABOUT CONCEPT OF WOMEN EMPOWERMENT
Level-1: Remember
1. State various provisions under ‘human rights?
2. List the features of ‘international human rights?
3. State the provisions under professional rights?
4. State the features of the employee rights?
5. List the principles of conflict resolution?
6. List the various Special Programs for Women's Development from government?
Level-2: Understand
7. Describe briefly ‘trademark’?
8. Differentiate between ‘Patent’ and ‘Trade secret’?
9. Describe ‘intellectual property rights?
Level-3: Application
10. Explain briefly the ‘copyright’?
11. Explain briefly about patents?
12. Explain the concept of women empowerment?
13. Explain woman and Development?
14. Explain Dowry Prohibition act 1961?
15. Explain POCSO act 2012?
16. Explain domestic violence act 2005?
17. Explain Sexual harassment at work place bill 2006?

Directorate of Technical Education Karnataka State Page 7

CO6: KNOW THE SUCCESSFUL FUNCTIONING OF DEMOCRACY IN INDIA
Level-1: Remember
1. List the function and powers of parliament?
2. State the positions and powers of the Governor?
3. State the powers and Functions of the Chief Minister?
4. State the functions of Taluk panchayaths?
5. State the functions of Zilla panchayaths?
6. List the functions of urban local bodies?
7. State the powers of the president?
8. State the functions of the president?
9. State the powers and Functions of the prime minister?
Level-2: Understand
10. Describe briefly about Indian constitution?
11. Write about structure of Parliament?
12. What are the Procedure followed in parliament in making law?
13. Describe the role of gram panchayaths in community upliftment?
14. Describe the role of: a) Chairman b) Leader of the house c) Opposition leader in
Rajyasabha?
15. Describe importance of Judiciary?
16. Describe the Structure of state legislation
17. Describe the Jurisdiction of Supreme court,
18. Describe the Jurisdiction high court?
Level-3: Application
19. Explain theFormation & Composition of constituent assembly?
20. Explain preamble and its main objectives of Indian constitution?
21. Explain the fundamental Rights of Every citizen?
22. Explain the fundamental Duties of Every citizen?
23. Explain salient features of Indian constitution?
24. Explain the basic structure of Parliament?
25. Explain the composition of Lokasabha?
26. Explain the composition of Rajyasabha?
27. Explain the Directive principles of state policy?
28. Explain the Structure Of The Judiciary?
29. Explain the Powers of Rajya Sabha and Loksabha ?
30. Describe briefly about, Division of Powers- Union list, State list and concurrent list,
31. Explain the federalism in the Indian constitution ?
32. Explain the role of vice president?
33. Explain the role of State council of ministers?
34. Explain the functions of Zilla panchayaths?
35. Explain the formation and functions of Supreme Court?
36. Explain the formation and functions of state high Court?
37. Explain the formation and functions of subordinate courts?
38. Explain the formation of three tier system for local self government?

Directorate of Technical Education Karnataka State Page 8

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title: Data Structures lab

Course Code:
Scheme (L:T:P) : 0:2:4 Total Contact Hours: 78
15CS45P
Type of Course: Tutorial and Credit :03 Core/ Elective:
Practical’s Core
CIE- 25 Marks SEE- 50 Marks

Prerequisites

Knowledge of programming language.

Course Objectives

Design and Develop programs on derived data types and data structures such as stack, queue,
linked list, sorting and searching.

Course Outcome
On successful completion of the course, the students will be able to attain CO:

Experiment CL Linked Teaching

Course Outcome PO Hrs
linked
CO1 Demonstrate the concepts of 1 to 5 15
U 2,3,4,8,10
pointers
CO2
Design programs based on the 6 to 9
concepts of structures and files. U/A 2,3,4,8,10 12

Demonstrate the concepts of 10 to 15

CO3
Stack, Queue and Linked List
and apply various operations on U/A 2,3,4,8,10 21
them.

CO4
Demonstrate the concept of 16
binary tree traversal and its U/A 2,3,4,8,10 06
operations.
Design programs based on the 17 to 20
CO5 concept of sorting and searching 24
U/A 2,3,4,8,10
techniques.

Total sessions 78

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Directorate Of Technical Education Karnataka State CS&E 15CS45P

 Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
Data Structures lab - 3 3 3 - - - 3 - 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

List of Graded Practical Exercises

Sl. No PART – A
1 Write a C program to illustrate the use of pointers in arithmetic operations.
2 Write a C program to swap two numbers using Call by value and Call by reference
parameter passing techniques.
3 Write a C program to find the smallest element in an array of 10 elements using
pointers.
4 Write a C program to create a dynamic array of integers using pointers.
5 Write a C program to illustrate the use of function pointer.
6 Write a C program to count the number of characters in a given file.
7 Write a C program to create a file that contains at least 5 records which consists of
Book No., Book Name, Author, Publisher, and price.
8 Write a C program to display the contents of the file created in program No. 5 in
the following format
Book No. Book Name Author Publisher Price
9 Write a C program to copy one file to another file using command line arguments.
Sl. No PART – B
10 Write a C program to implement singly linked list: insert, delete, search and
display.
11 Write a C program to illustrate Stack operations using arrays.
12 Write a C program to find the GCD of two numbers using recursion
13 Write a C program to evaluate a POSTFIX expression using stack operations.
14 Write a C program to implement queue using arrays.
15 Write a C program to implement queue using linked list.
16 Write a C program to implement binary tree traversal operations.
17 Write a C program to sort an array using bubble sort
18 Write a C program to sort an array using selection sort.
19 Write a C program to search a given number using linear search.
20 Write a C program to search a given number using binary search.

Reference
1. Data Structures using C by E. Balaguruswamy - Tata McGraw-Hill Education
2. Data Structures using C by Aaron M Tenenbaum - Pearson Education India

Directorate Of Technical Education Karnataka State CS&E 15CS45P

Suggested list of student activities
Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
1. Each group should do any one of the following type activity or any other similar
activity related to the course and before conduction, get it approved from concerned course
coordinator and programme coordinator.
2. Each group should conduct different activity and no repeating should occur
1 Conduct a survey on various uses of pointers and submit a report of 2 pages.
1 Conduct a survey on the real time applications of Stacks and Queues and submit a
report of 3 to 4 pages.
2 Conduct a survey on the real time applications of Linked Lists and Trees and
submit a report of 3 to 4 pages.

3 Compare C structures and Java Classes and submit a report.

4 Quiz, Presentation and Seminars
Course Delivery
The course will be delivered through Demonstration and Practices

Course Assessment and Evaluation Scheme

When/Where
To (Frequency Max Evidence Course
Method What
whom in the Marks collected outcomes
course)
IA Students Twice tests 10 Blue books 1 to 5
(average of
two tests)
CIE Record and 10 Record 1 to 5
Direct Assessment

(Continuous
Internal Student 05
Evaluation) activity Report.

Total 25

SEE End End of the 50 Answer scripts 1 to 5

(Semester Exam course at BTE
End
Examination)
Student Feedback on Students Middle of Feedback 1,2 Delivery
course the course forms of course
Indirect Assessment

End of Course End of the Questionnaires 1 to 5

Survey course Effectiveness
of Delivery
of
instructions
&
Assessment
Methods
*CIE – Continuous Internal Evaluation *SEE – Semester End Examination

Directorate Of Technical Education Karnataka State CS&E 15CS45P

Note:
1. I.A. test shall be conducted as per SEE scheme of valuation. However obtained marks
shall be reduced to 10 marks. Average marks of two tests shall be rounded off to the next
higher digit.
2. Rubrics to be devised appropriately by the concerned faculty to assess Student activities.

Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 30
3 Application 60

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue Book(10 marks)
2. Record (10 marks)
3. Student suggested activities report for 5 marks
4. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.

Directorate Of Technical Education Karnataka State CS&E 15CS45P

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS45P

 Scheme of Valuation for End Examination

Writing one program from PART-A and one program

1 10+10=20
from PART-B

2 Executing any one program with result 20

3 Viva 10

Total 50

**Evaluation should be based on the screen output only. No hard copy required.
**Change of question is allowed only once. Marks of 05 should be deducted in the given
question.

Resource requirements for Data Structures Lab

(For an Intake of 60 Students [3 Batches])

Sl. No. Equipment Quantity

1 PC systems (latest configurations with speakers) 20
2 Laser Printers 01
3 Networking (Structured) with CAT 6e / wireless 03
24 Port switches / Wireless Router
I/O Boxes for networking(as required)
4 Broad Band Connection 01
**Open Source Software should be encouraged

Directorate Of Technical Education Karnataka State CS&E 15CS45P

 MODEL QUESTION BANK

Sl. No PART – A
1 Write a C program to illustrate the use of pointers in arithmetic operations.
2 Write a C program to swap two numbers using Call by value and Call by reference
parameter passing techniques.
3 Write a C program to find the smallest element in an array of 10 elements using
pointers.
4 Write a C program to create a dynamic array of integers using pointers.
5 Write a C program to illustrate the use of function pointer.
6 Write a C program to count the number of characters in a given file.
7 Write a C program to create a file that contains at least 5 records which consists of
Book No., Book Name, Author, Publisher, and price.
8 Write a C program to display the contents of the file created in program No. 5 in
the following format
Book No. Book Name Author Publisher Price
9 Write a C program to copy one file to another file using command line arguments.
Sl. No PART – B
10 Write a C program to implement singly linked list: insert, delete, search and
display.
11 Write a C program to illustrate Stack operations using arrays.
12 Write a C program to find the GCD of two numbers using recursion
13 Write a C program to evaluate a POSTFIX expression using stack operations.
14 Write a C program to implement queue using arrays.
15 Write a C program to implement queue using linked list.
16 Write a C program to implement binary tree traversal operations.
17 Write a C program to sort an array using bubble sort
18 Write a C program to sort an array using selection sort.
19 Write a C program to search a given number using linear search.
20 Write a C program to search a given number using binary search.

Directorate Of Technical Education Karnataka State CS&E 15CS45P

 Government of Karnataka
Department of Technical Education
Bengaluru

Course Title: OOP with Java Lab

Total Contact Hours: Course Code:
Scheme (L:T:P) : 0:2:4
78 15CS46P
Type of Course: Tutorial and Credit :03 Core/ Elective:
Practical’s Core
CIE- 25 Marks SEE- 50 Marks
Prerequisites
C Programming Knowledge.
Course Objectives

Learn to write, debug, and document well-structured Java applications.

Course Outcome
On successful completion of the course, the students will be able to attain CO:

Experiment CL Linked Teaching

Course Outcome PO Hrs
linked
CO1 Create and use classes and 1 to 7 30
U, A 2,3,4,8,10
Objects.
CO2
Demonstrate the methods of 8 to 10
String, String Buffer, Vector U, A 2,3,4,8,10 15
and Wrapper Classes.
CO3 Implement interfaces and 11 to 13 15
U, A 2,3,4,8,10
inheritance.
CO4 Demonstrate the use of 14 6
U, A 2,3,4,8,10
packages.
CO5 Implement Multithreading 15 6
U, A 2,3,4,8,10
concepts
CO6
Demonstrate programming 16
techniques with exception 2,3,4,8,10 6
U, A
handling.
Total sessions 78

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)
Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
OOP with Java Lab - 3 3 3 - - - 3 - 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

Directorate Of Technical Education Karnataka State 15CS46P CSE

LIST OF GRADED PRACTICAL EXERCISES

Sl.No Practical/Exercise
1 Write a Java Program to sort a list of names selection sort technique.
Write a Java Program to define a class, describe its constructor, overload the
2
Constructors and instantiate its object.
Write a Java Program to define a class, define instance methods for setting and
3
Retrieving values of instance variables and instantiate its object.
Write a Java Program to define a class, define instance methods and overload them
4
and use them for dynamic method invocation.
5 Write a Java Program to demonstrate use of sub class.
6 Write a Java Program to demonstrate use of nested class.
7 Write a Java Program to implement array of objects.
Write a Java program to practice
8 - using String class and its methods.
- using String Buffer class and its methods.
9 Write a Java Program to implement Vector class and its methods.
10 Write a Java Program to implement Wrapper classes and their methods.
Write a Java Program to implement inheritance and demonstrate use of method
11
overriding.
Write a Java Program to implement multilevel inheritance by applying various
12
access controls to its data members and methods.
Write a program to demonstrate
13 - use of implementing interfaces.
- use of extending interfaces.
Write a Java program to implement the concept of importing classes from user
14
defined package and creating packages.
Write a program to implement the concept of threading.
15 -by extending Thread Class
-by implementing Runnable Interface
Write a program to implement the concept of Exception Handling
16 - using predefined exception.
- by creating user defined exceptions.

Reference

1. Programming with Java, 4th edition, Balagurusamy, Mc Graw Hill, ISBN-

9780070141698
2. Computer Programming in Java, Junaid Khateeb and Dr. G.T. Thampi, Wiley
Dreamtech, ISBN: 9788177228298

Suggested list of student activities

Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 2-3
students.

Directorate Of Technical Education Karnataka State 15CS46P CSE

 1. Each group should do any one of the following type activity or any other similar
activity related to the course and before conduction, get it approved from concerned
course co-ordinator and programme co-ordinator.
2. Each group should conduct different activity and no repeating should occur.
Some of the topics for mini projects are: S Hotel Management System S E-Bill
Board, Online insurance S Online Mobile Contributor S Online Restaurant S Public
Distribution System S SECURE E-banking security S Service Call Management
S Secure location system S Standard DB EditorS Flight Reservation System S Job
Service Provider S Net Chattering SHospital Management System S E – Shopping
Mall, Personalized web search engine SE-health Care STelecom Linkage System
S Multi Message communication and file sharing system in network S ATM
Database System S Health record System using referral S Online Library
management S Typing text recognition S Online bus ticket booking S Birthday
reminder via Email STime table management system for college S Agriculture
Management System S District medical data center S etc.

Course Delivery

The course will be delivered through Demonstration and Practices

Course Assessment and Evaluation Scheme

When/Where
To (Frequency Max Evidence Course
Method What
whom in the Marks collected outcomes
course)
Two tests
(average of 10 Blue books 1 to 6
two tests)
CIE 10
Record Record
Direct Assessment

(Continuous IA
Internal Student
Evaluation) 05 Report 1 to 6
Students activity
Total 25

SEE
(Semester End End of the Answer scripts
50 1 to 6
End Exam course at BTE
Examination)
1,2,3
Student Feedback on Middle of Feedback
Delivery of
course the course forms
course
Indirect Assessment

1 to 6
Effectiveness
Students of Delivery
End of Course End of the of
Questionnaires
Survey course instructions
&
Assessment
Methods
*CIE – Continuous Internal Evaluation *SEE – Semester End Examination

Directorate Of Technical Education Karnataka State 15CS46P CSE

Note:
1. I.A. test shall be conducted as per SEE scheme of valuation. However obtained marks
shall be reduced to 10 marks. Average marks of two tests shall be rounded off to the next
higher digit.
2. Rubrics to be devised appropriately by the concerned faculty to assess Student activities.

Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 30
3 Application 60

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue Book(10 marks)
2. Record (10 marks)
3. Student suggested activities report for 5 marks
4. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.

Directorate Of Technical Education Karnataka State 15CS46P CSE

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State 15CS46P CSE

 Scheme of Valuation for End Examination

1 Writing two programs 10+10=20

2 Executing any one program 20

3 Viva Voice 10

Total 50

**Evaluation should be based on the screen output only. No hard copy required.
**Change of question is allowed only once. Marks of 05 should be deducted in the given
question.

Resource requirements for OOP with Java Lab

(For an Intake of 60 Students [3 Batches])

Sl. No. Equipment Quantity

1 PC systems (latest configurations with speakers) 20
2 Laser Printers 01
3 Networking (Structured) with CAT 6e / wireless 03
24 Port switches / Wireless Router
I/O Boxes for networking(as required)
4 Broad Band Connection 01
**Open Source Software should be encouraged

Directorate Of Technical Education Karnataka State 15CS46P CSE

 MODEL QUESTION BANK

1 Write a Java Program to sort a list of names selection sort technique.

Write a Java Program to define a class, describe its constructor, overload the
2
Constructors and instantiate its object.
Write a Java Program to define a class, define instance methods for setting and
3
Retrieving values of instance variables and instantiate its object.
Write a Java Program to define a class, define instance methods and overload them and
4
use them for dynamic method invocation.
5 Write a Java Program to demonstrate use of sub class.
6 Write a Java Program to demonstrate use of nested class.
7 Write a Java Program to implement array of objects.
Write a Java program to practice
8 - using String class and its methods.
- using String Buffer class and its methods.
9 Write a Java Program to implement Vector class and its methods.
10 Write a Java Program to implement Wrapper classes and their methods.
Write a Java Program to implement inheritance and demonstrate use of method
11
overriding.
Write a Java Program to implement multilevel inheritance by applying various access
12
controls to its data members and methods.
Write a program to demonstrate
13 - use of implementing interfaces.
- use of extending interfaces.
Write a Java program to implement the concept of importing classes from user defined
14
package and creating packages.
Write a program to implement the concept of threading.
15 -by extending Thread Class
-by implementing Runnable Interface
Write a program to implement the concept of Exception Handling
16 - using predefined exception.
- by creating user defined exceptions.

Directorate Of Technical Education Karnataka State 15CS46P CSE

 Government of Karnataka
Department of Technical Education
Bengaluru
Course Title: Linux Lab
Course Code:
Scheme (L:T:P) : 0:2:4 Total Contact Hours: 78
15CS47P
Type of Course: Tutorial,
Credit :03 Core/ Elective:
Practical’s & Student
Core
Activity
CIE- 25 Marks SEE- 50 Marks

Prerequisites

Basic Knowledge of Operating System and its usage.

Course Objectives

1. Describe the basic file system in Linux and its file attributes.
2. Appraise different filters, process handling, regular expressions and network
handling features using suitable commands.
3. Summarize different Linux commands to write Shell Programs.

On successful completion of the course, the students will be able to attain CO:
Experiment CL Linked Teaching
Course Outcome PO Hrs
linked
Demonstrate installation of 1
CO1 Linux operating system and 06
U 2,3,4,8,10
understand the importance of
Linux.
CO2 Appraise various command 2 to 4 12
U, A 2,3,4,8,10
usage of files and directories.
CO3
Show the working of vi editor 5 to 8
in all its modes using various U, A 2,3,4,8,10 12
commands.
CO4 Manage shell and processes 9 to 12 12
U, A 2,3,4,8,10
using various commands.
CO5 Write Shell scripts and C 13 to 21 30
A 2,3,4,8,10
programs using vi editor.
Demonstrate Linux 22
CO6 administration and its 06
A 2,3,4,8,10
environment

Total sessions 78

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised

taxonomy)

Directorate Of Technical Education Karnataka State CS&E 15CS47P Page 1

 Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
Linux Lab - 3 3 3 - - - 3 - 3
Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

List of Graded Practical Exercises

PART-A

1. Introduction- Linux Architecture- Shell, Kernel, System calls.

Linux installation- Steps for installing Linux Operating System
Comparison between Linux and other Operating Systems, Applications of Linux Operating
System.

2. Internal & External commands in Linux.

∑ Internal commands- echo, type, etc.
∑ External commands- ls, cp, mv, rm, cat, etc
∑ Other commands – tput clear, who, cal, date, bc, man, passwd, uname ( with
different options).

3. Working with files & directories.

∑ Know the categories of files.
∑ Directory related Commands – pwd, mkdir, rmdir, cd, ls
∑ Manipulating Absolute paths and Relative paths using cd command.
∑ File related Commands – cat, cp, mv, rm, comm, cmp, diff, tar, umask, wc

4. Basic File attributes.

∑ Listing seven attributes of a file : ls and its options
∑ File Permissions: Absolute and Relative permissions
∑ Manipulating File permissions using chmod command
∑ Manipulating File Ownership using chown command
∑ Manipulating Hardlink and Softlink using ln command

5. Learn to use vi editor.

∑ Three modes of vi editor.
∑ Input mode commands.
∑ Command mode commands.
∑ Ex mode commands.

6. Simple Filters – head, tail, cut, paste, sort, uniq, tr, pr.
7. Expressions & search patterns .(dot operator), *, ^, +, ?, grep, egrep, fgrep
8. Process Management commands.
∑ Process creation, status, Identifying process, ps -f & its options,
∑ Running process in background, Job control, and Process termination.
Directorate Of Technical Education Karnataka State CS&E 15CS47P Page 2
 ∑ Changing process priority, scheduling process (Usage of sleep and wait
commands)

9. Introduction to shell programming.

∑ Introduction, Uses of shell script, Shell special characters, comments,
command separator, escaping, quoting command substitution.
∑ Creating shell script, Shell identifiers, Shell variables, Destroying a
variable, Positional parameters & command line arguments.
∑ Evaluating expressions, Text formatting with echo & tput script termination.
10. Shell control structures
∑ if, case, for, while, relational and logical operators,
∑ Advanced filter – sed and awk.
11. Linux system administration
Managing file system, Disk management utilities, mounts,
umount, df, du, fdisk, su, useradd etc.
12. Linux Environment
Introduction, Environment variables, Command prompt system variables,
Profiles, files, terminal variable stty command and its options,
Command history, editing Environment variable.

PART – B

13. Write a shell script to display current date, time, username and directory.
14. Write script to determine whether given file exist or not, file name is supplied as
command line argument, also check for sufficient number of command line argument
15. Write shell script to show various system configuration like:
a) Currently logged user name and his long name
b) Current shell
c) Your home directory
16. Write shell script to show various system configuration like:
a) Your operating system type
b) Your current path setting
c) Your current working directory
d) Show all available shells
17. Write a Shell script to accept any two file names and check their file permissions.
18. Write a Shell script to read a file name and change the existing file permissions.
19. Write a shell script to print current month calendar and to replace the current day number
by ‘*’or ‘**’ respectively.
20. Write a C-program to fork a child process and execute the given Linux commands.
21. Write a C-program to fork a child process, print owner process ID and its parent process
ID.

Directorate Of Technical Education Karnataka State CS&E 15CS47P Page 3

 22. Write a C-program to prompt the user for the name of the environment variable, check its
validity and print an appropriate message.

References
1. “UNIX - Concepts and Applications”, Sumitabha Das 4th Edition, Tata McGraw Hill,
2006.
2. http://www.freeos.com/guides/lsst/
3. http://heather.cs.ucdavis.edu/~matloff/Linux/LinuxInstall.pdf (Chapter 1, Linux
installation).
4. http://docs.fedoraproject.org/en-US/Fedora/20/pdf/Installation_Guide/Fedora-20-
Installation_Guide-en-US.pdf.

Suggested list of student activities

Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
1. Each group should do any one of the following type activity or any other similar
activity related to the course and before conduction, get it approved from concerned course
coordinator and programme coordinator.
2. Each group should conduct different activity and no repeating should occur

Conduct a survey on the advantages of Linux Operating System and prepare a

1
report of 2 to 3 pages.
2 Prepare Report of 2 to 3 pages on Linux Administration.
Conduct a survey on other editors available in Linux Operating System with their
3
features and prepare a report of 2 to 3 pages.
Compare the file system in Linux with the file system in Windows and submit a
4
report.
Conduct a case study on handling various Networking Commands in Linux
5
Operating System and submit a report.

Course Delivery
The course will be delivered through tutorials of two hours and four hours of hands on practice
per week.

Directorate Of Technical Education Karnataka State CS&E 15CS47P Page 4

Course Assessment and Evaluation Scheme

When/Where
To Max Evidence Course
Method What (Frequency in
whom Marks collected outcomes
the course)
Two IA Tests
(Average of
10 Blue books 1 to 6
two tests will
be computed)
Record Record Book
CIE
IA Writing
Direct assessment

(Continuous
Tests (Average
Internal 10 1 to 6
marks of each
Evaluation)
Students exercise to be
computed)
Student Activities
05 1 to 6
Activities Report
TOTAL 25
SEE
(Semester End End of the Answer scripts
50 1 to 6
End Exam course at BTE
Examination)
1 to 3
Student Feedback on Middle of the Feedback
Delivery of
course course forms
course
Indirect assessment

1 to 6
Effectiveness
Students of Delivery
End of Course End of the of
Questionnaires
Survey course instructions
&
Assessment
Methods
*CIE – Continuous Internal Evaluation *SEE – Semester End Examination
Note:
1. I.A. test shall be conducted as per SEE scheme of valuation. However obtained marks
shall be reduced to 10 marks. Average marks of two tests shall be rounded off to the next
higher digit.
2. Rubrics to be devised appropriately by the concerned faculty to assess Student activities.

Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 30
3 Application 60

Directorate Of Technical Education Karnataka State CS&E 15CS47P Page 5

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue Book(10 marks)
2. Record (10 marks)
3. Student suggested activities report for 5 marks
4. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.
Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
*All student activities should be done in a group of 4-5 students with a team leader.

Directorate Of Technical Education Karnataka State CS&E 15CS47P Page 6

 Scheme of Valuation for End Examination

1 Write the syntax of commands with examples from any one 10

exercise from PART-A
2 Write any one program from PART-B 10
3 Execution of PART A commands and PART B Program with 10+10
result
4 Viva voce 10
Total 50
**Evaluation should be based on the screen output only. No hard copy required.
**Change of question is allowed only once. Marks of 05 should be deducted in the given
question.

Resource requirements for Linux Lab

(For an Intake of 60 Students [3 Batches])

Sl. No. Equipment Quantity

1 PC systems (latest configurations with speakers) 20
2 Laser Printers 01
3 Networking (Structured) with CAT 6e / wireless 03
24 Port switches / Wireless Router
I/O Boxes for networking(as required)
4 Broad Band Connection 01
**Open Source Software should be encouraged

Directorate Of Technical Education Karnataka State CS&E 15CS47P Page 7

 MODEL QUESTION BANK

PART -A

1) Write the syntax and execute the following commands.

Command Name Syntax Example
Echo
Ls
Cat
Rm
Cal

2) Write the syntax and execute the following commands.

Command Name Syntax Example
ls –l
Chmod
Chown
ln

3) Write the syntax and execute the following commands.

Command Name Syntax Example
Pwd
Mkdir
Cd
Comm.
Cmp

4) Write the syntax and execute the following commands.

Command Name Syntax Example
Head
Tail
Cut
Paste
Sort

5) Write the syntax and execute the following commands.

Command Name Syntax Example
Umount
Df
Du
Fdisk
Su

Directorate Of Technical Education Karnataka State CS&E 15CS47P Page 8

 PART – B

1. Write a shell script to display current date, time, username and directory.
2. Write script to determine whether given file exists or not, file name is supplied as
command line argument, also check for sufficient number of command line argument
3. Write shell script to show various system configuration like:
a) Currently logged user name and his long name
b) Current shell
c) Your home directory
d) Your operating system type
4. Write shell script to show various system configuration like:
a) Your current path setting
b) Your current working directory
c) Show all available shells
5. Write a Shell script to accept any two file names and check their file permissions.
6. Write a C-program to fork a child process and execute the given Linux commands.
7. Write a shell script to print current month calendar and to replace the current day
number by ‘*’or ‘**’ respectively.
8. Write a C-program to fork a child process and execute the given Linux commands.
9. Write a C-program to fork a child process, print owner process ID and its parent
process ID.
10. Write a C-program to prompt the user for the name of the environment variable,
check its validity and print an appropriate message.

Directorate Of Technical Education Karnataka State CS&E 15CS47P Page 9

 4£Éà ¸É«Ä¸ÀÖgï-PÀ£ÀßqÀ PÀ°-2 (PÀ£ÀßqÉÃvÀgÀjUÉ PÀ£ÀßqÀ ¥ÀjZÀAiÀÄ)

Course: Course Code:15KA4NT

4th Kannada Kali-2 (2016-17)
Semester No. of Credits:02 No. of teaching
hours/week:02
No. of teaching
hours/Semester:26
Mode of Assessment and Evaluation: Maximum Marks: 50
Semester End Examination (SEE only)
(SEE)only. No CIE. Minimum Passing marks:20

GzÉÝñÀ:

1. PÉüÀĪÀÅzÀÄ, UÀ滸ÀĪÀÅzÀÄ, ¤gÀUÀð¼ÀªÁV ªÀÄvÀÄÛ ¸ÀàµÀÖªÁV NzÀĪÀ ªÀÄvÀÄÛ ªÀiÁvÀ£ÁqÀĪÀ (C©üªÀåQÛ¸ÀĪÀ)

¸ÁªÀÄxÀåðªÀ£ÀÄß ¨É¼É¸ÀĪÀÅzÀÄ.
2. eÁÕ£Ádð£É, ¸Á»vÁå©ügÀÄa, aAvÀ£É ªÀÄvÀÄÛ D£ÀAzÀPÁÌV ¸ÀévÀAvÀæªÁV NzÀ®Ä, §gÉAiÀÄ®Ä ªÀÄvÀÄÛ ªÀiÁvÀ£ÁqÀ®Ä
¸ÀªÀÄxÀðgÁUÀĪÀAvÉ ªÀiÁqÀĪÀÅzÀÄ.
3. ¥ÀzÀ ¸ÀA¥ÀvÀÛ£ÀÄß ºÉaѹPÉÆAqÀÄ ¸ÀàµÀÖ GZÁÑgÀuÉAiÉÆqÀ£É °TvÀ ªÀÄvÀÄÛ ªÀiËTPÀ ZÀlĪÀnPÉUÀ¼À£ÀÄß ªÀiÁr¹,
¸ÀévÀAvÀæªÁV ¨sÁµÉAiÀÄ §¼ÀPÉ ªÀiÁqÀĪÀÅzÀÄ.
4. £ÁqÀÄ-£ÀÄr, ¸ÀA¸ÀÌøw ªÀÄvÀÄÛ ¸Á»vÀåUÀ¼À ¥ÀjZÀAiÀÄ ªÀÄvÀÄÛ DwäAiÀÄ ¨sÁªÁ©üªÀiÁ£ÀªÀ£ÀÄß ¨É¼É¸ÀĪÀÅzÀÄ.
5. QæAiÀiÁvÀäPÀ ZÀlĪÀnPÉUÀ½AzÀ ¨sÁµÁ P˱À®åzÀ ¸ÀgÀ¼À ¥ÀæAiÉÆÃUÀ ªÀiÁr¸ÀĪÀÅzÀÄ./PÀ°¸ÀĪÀÅzÀÄ.
(QæAiÀiÁvÀäPÀ ZÀlĪÀnPÉ JAzÀgÉ, ªÀtðªÀiÁ¯É ¥ÀjZÀAiÀÄ, ªÁåPÀgÀtzÀ ¸ÀgÀ¼À ¥ÀjZÀAiÀÄ, UÀÄtÂvÁPÀëgÀ,
¸ÀAAiÀÄÄPÁÛPÀëgÀUÀ¼ÀÄ, £ÁªÀÄ¥ÀzÀ, °AUÀ, ªÀZÀ£À, ¥ÀævÀåAiÀÄUÀ¼ÀÄ, ªÁPÀågÀZÀ£É (PÀvÀÈ, PÀªÀÄð, QæAiÀiÁ¥ÀzÀ) EvÁå¢).

Course outcome:
1. Developing listening and speaking skills.
2. Easy Interaction with peers.
3. Students can use the language at ease in daily life situations

¥ÀoÀåPÀæªÀÄ ªÀÄvÀÄÛ ¸ÀgÀ¼À ¨sÁµÁ P˱À®å

(PÀ£ÀßqÀ PÀ°-¥ÀoÀå¥ÀĸÀÛPÀ -²æà °AUÀzÉêÀgÀÄ ºÀ¼ÉêÀÄ£É – PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦ ¥ÀæPÁ±À£À)

¨sÁUÀ-2
¥ÁoÀUÀ¼À ¸É«Ä¸ÀÖgï
PÀæªÀiÁAPÀ ¥ÀoÀåªÀ¸ÀÄÛ«£À «ªÀgÀ - Curriculum Content ¨ÉÆÃzsÀ£À DªÀ¢ü
Lesson Total
No no.of
Classes
/Sem
Part-I
11 Plan to go for a movie. Comparative, non-past 02
tense, instrumental and ablative case
12 Conversation between Doctor & Patient. 02
Potential forms, accusative case.
13 Enquiring about friend’s family 02

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 1

 Past tense –d, and –t- and –id-, negation.
14 Conversation between friends – Past tense –k – T – D 02
and –id-v negation verbal noun
15 Routine activities of a Student. 01
16 About children’s education. 02
Continuous, Perfect tenses and negations.
17 Halebidu - Belur 02
Relative participle, negation and Participle nouns.
18 Discussing about Examination and future plan- 03
conditional and negative conditions.
19 Karnataka (Lesson for reading)(reading skill) 03
20 bEku bEDagaLu (Lesson for reading ( Reading skill) 03
Part- Kannada Scripts 03
II
ECA-word/sentence formation/letter/small essay 01
writing
MlÄÖ UÀAmÉUÀ¼ÀÄ 26

¸ÀÆZÀ£ÉUÀ¼ÀÄ:
 ªÉÄð£À ¥ÁoÀUÀ¼À ¥ÀÄ£ÀgÁªÀwðvÀ ¨sÁUÀUÀ½UÉ §zÀ¯ÁV “QæAiÀiÁvÀäPÀ ZÀlĪÀnPÉ”¬ÄAzÀ UÀ½¸ÀĪÀ CPÀëgÀ eÁÕ£À
¢AzÀ ¥ÀzÀ ¸ÀA¥ÀvÀÄÛ ºÉaѹ, ¥ÀzÀUÀ½AzÀ ¸ÀéAvÀ ªÁPÀåUÀ¼À gÀZÀ£É ªÀiÁr¸ÀĪÀÅzÀÄ. (CªÀÄä, ªÉƨÉʯï, PÀ£ÀßqÀ
¨sÁµÉ, PÀ«UÀ¼ÀÄ, £ÁlPÀ, d£À¥ÀzÀ PÀ¯É, £Ár£À ¥Àæ¹zÀÞ ªÀåQÛUÀ¼ÀÄ, ¸ÀºÉÆÃzÀgÀ, ¸ÉßûvÀ, vÀgÀPÁj, zÉÆøÉ,
wAr, ¤zÉÝ, ©¹, ZÀ½, DPÁ±À, NzÀÄ, EvÁå¢ ¤vÀå §¼ÀPÉAiÀÄ ¸ÀgÀ¼À ¥ÀzÀUÀ½AzÀ ªÁPÀågÀZÀ£É ªÀÄvÀÄÛ 25-
50 ¥ÀzÀUÀ¼À QgÀÄ ¥Àæ§AzÀ gÀÆ¥ÀzÀ ¯ÉÃR£À gÀZÀ£É).
 ¸ÀA¸ÉÜAiÀÄ ¥ÁæZÁAiÀÄðjUÉ «zÁåyðAiÀÄ ªÀÄ£À« ¥ÀvÀæ, PÀÄAzÀÄPÉÆgÀvÉUÀ¼À §UÉÎ ¸ÀA§A¢ü¹zÀªÀjUÉ ¥ÀvÀæ,
¸ÉßûvÀjUÉ ¥ÀvÀæUÀ¼ÀÄ, ¸ÀgÀ¼ÀªÁV AiÀiÁªÀÅzÉà ¸ÁªÀiÁ£Àå «µÀAiÀÄUÀ¼À §UÉÎ ¥ÀvÀæ¯ÉÃR£À. (6-10 ªÁPÀåUÀ¼ÀÄ).
DPÀgÀ UÀæAxÀUÀ¼ÀÄ:
1. PÀ£ÀßqÀ PÀ°-²æà °AUÀzÉêÀgÀÄ ºÀ¼ÉêÀÄ£É – PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦.
2. ¥ÁæxÀ«ÄPÀ ±Á¯ÉAiÀÄ PÀ£ÀßqÀ ¥ÀoÀå¥ÀĸÀÛPÀUÀ¼ÀÄ
3. ¸ÀgÀ¼À PÀ£ÀßqÀ ªÁåPÀgÀt ¥ÀĸÀÛPÀUÀ¼ÀÄ- JA.« £ÁUÀgÁdgÁªï/EvÀgÉ ¯ÉÃRPÀgÀÄ.
4. ¥ÀæAiÉÆÃUÀ ¥Àætw-¥ÀæxÀªÀÄ ¦AiÀÄĹ ¥ÀÆgÀPÀ ¥ÀoÀå.
5. ¸ÀgÀ¼À ¥ÀvÀæªÀåªÀºÁgÀzÀ ¥ÀĸÀÛPÀUÀ¼ÀÄ

r¥ÉÆèêÀiÁ 4£Éà ¸É«Ä¸ÀÖgï-PÀ£ÀßqÀ PÀ°-2 (PÀ£ÀßqÉÃvÀgÀjUÉ PÀ£ÀßqÀ ¥ÀjZÀAiÀÄ)

¸É«Ä¸ÀÖgï CAwªÀÄ °TvÀ ¥ÀjÃPÉë

¸ÀªÀÄAiÀÄ: 2 UÀAmÉUÀ¼ÀÄ UÀjµÀ× CAPÀUÀ¼ÀÄ:50
---------------------------------------------------------------------
1. Fill in the blanks using the appropriate words.

2. Rewrite as directed.
3. Combine the following sentences.
4. Translate into Kannada.
5. Answer the following questions.
6. Fill in the blanks using the correct past tense forms of the verbs giving in the bracket.

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 2

 7. Transform into negative.
8. Substitute and complete the sentence
9. Vocabulary (meanings of words) using formation of sentences (any five).
10. Questions from lessons 17 to 19. (Out of 6 questions, answer any 3 questions).

11. Scripts- consonants form- +vowel (10 types)

12. Conversation & other questions. (KK-Exercises)

ªÀiÁzÀj ¥Àæ±ÉߥÀwæPÉ:
r¥ÉÆèêÀiÁ 4£Éà ¸É«Ä¸ÀÖgï-PÀ£ÀßqÀ PÀ°-2 (PÀ£ÀßqÉÃvÀgÀjUÉ PÀ£ÀßqÀ ¥ÀjZÀAiÀÄ)

¸É«Ä¸ÀÖgï CAwªÀÄ °TvÀ ¥ÀjÃPÉë

¸ÀªÀÄAiÀÄ: 2 UÀAmÉUÀ¼ÀÄ UÀjµÀ× CAPÀUÀ¼ÀÄ:50

I. (a) Fill in the blank using the correct past tense forms of the verbs given in the
bracket. 3+2 =05
1.CªÀgÀÄ ¤£Éß Hj¤AzÀ .............. (¨Á)
2. CªÀ¼ÀÄ MAzÀÄ ºÉtÄÚ ªÀÄUÀÄ ......................... (ºÉgÀÄ)
3.£Á£ÀÄ ¤£ÀUÁV vÀÄA¨Á ºÉÆvÀÄÛ................ (PÁAiÀÄÄ)

(b) Fill in the blank using the correct verbal participle forms of the verbs given in
the bracket.
1.D ºÀÄqÀÄV ªÀÄ£É ................................ ºÉÆÃzÀ¼ÀÄ. (©qÀÄ)
2. CªÀ£ÀÄ EªÀvÀÛ Hj¤AzÀ..............£Á¼É §gÀÄvÁÛ£É. (ºÉÆgÀqÀÄ)
II. Give the negative forms of the following sentence. (Any Five) 1X5=05

C) ¤ÃªÀÅ ¥ÀĸÀÛPÀ PÉÆr.

D) ¤ÃªÀÅ ¹UÀgÉÃmï ¸ÉÃzÀ§ºÀÄzÀÄ.

E) CªÀgÀÄ £À£ÀUÉ ZÉ£ÁßV UÉÆvÀÄÛ.

F) CªÀgÀÄ PÀ£ÀßqÀ ZÉ£ÁßV PÀ°vÀgÀÄ.

G) CªÀ¼ÀÄ vÀ¯É ¨ÁaPÉÆAqÀÄ §AzÀ¼ÀÄ.

H) CªÀ¤UÉ ¥sÉÆÃ£ï §A¢zÉ.

J) gÀ« ªÀÄ£ÉAiÀÄ°è ªÀÄ®VvÁð£É.

III. Translate into KANNADA. (Any Five) 2X5=10

1) Who will come with you?

2) Today Ms. Kamala will go to her native place.
3) You must drink butter milk daily.
4) Please, don’t talk to me.
vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 3
 5) How much advance money did you pay for the hostel?
6) How many of you are learning Kannada seriously?
7) If I get good marks in diploma, I will get admission for BE program.
8) At what time today you will be available in the hostel?.

IV. Vocabulary.

(a) Write English equivalents of the Kannada words. (Any five) 1X5=05

1. DUÀ¸À 2. ±ÉÊ° 3. C£ÀĪÀiÁ£À 4.¥ÀjÃPÉë 5.eÁw 6.£ÉʸÀVðPÀ 7.ªÀÄvÀ 8. ªÁtÂdå

(b) Write Kannada equivalents of the English words. (Any five) 1X5=05

1. Wealth 2. Religion 3. Memory 4.fear 5.Environment 6. Primary 7. Mistakes 8. Tall

VI. Conversation:

F PɼÀV£À C¥ÀÆtð ¸ÀA¨sÁµÀuÉAiÀÄ£ÀÄß DªÀgÀtzÀ°è (bracket) ¤ÃrgÀĪÀ ¥ÀzÀUÀ¼À£ÀÄß CxÀðªÀiÁrPÉÆAqÀÄ ¥ÀÆwð

ªÀiÁr. -05

gÁdÄ: ¤£ÀUÉ ¤£Éß ªÉÆúÀ£ï ¹PÀÌ£Á?

gÁªÀÄÄ: ............................. negative) ¤£ÀUÉ ¹PÀÌ£Á?
gÁdÄ ..................... (Positive) ºËzÀÄ, ¤ªÀÄä£ÀÄß £ÉÆÃqÀĪÀÅzÀPÉÌ ºÉÆÃUÀÄwÛä CAvÀ ºÉýzÀ.
gÁªÀÄÄ: ................. (Enquiring about meeting him)
gÁdÄ: CªÀ£ÀÄ PÉ®¸À ©lÖ£ÀAvÉ.
gÁªÀÄÄ: ................................... (Questioning)
gÁdÄ: ....................................(Answer).

VII.Transform the following sentences as per direction. (Any Five) 1X5=05

1. ªÀÄPÀ̼ÀÄ gÀ¸ÉÛAiÀÄ°è Dl CqÁÛ (into present continuous) EzÀݪÀÅ.

2. ºÀÄqÀÄUÀgÀÄ vÀgÀUÀwAiÀÄ°è ¸ÀĪÀÄä£ É (into present continuous) £ÀUÁÛ EzÀÝgÀÄ.
3. D ºÉAUÀ¸ÀgÀÄ dUÀ¼À DqÁÛ EzÁÝgÉ. (into past continuous)
4. vÀgÀPÁj PÀrªÉÄ ¨É¯ÉUÉ ¹UÁÛ EzÉ. (into past continuous)
5. CªÀ£ÀÄ ¢£Á E°èUÉ §vÁð£É. (into habitual)
6. E°è §¸ÀÄìUÀ¼ÀÄ vÀÄA¨Á NqÁqÀÛ (into habitual) EªÉ.
7. DAzsÀæ¥ÀæzÉñÀ¢AzÀ §A¢zÀÝ «zÁåyðUÀ¼ÀÄ J°èzÁÝgÉ?(into present perfect)

VIII.Write the Kannada alphabet in the traditional order. 05

OR
ºÀ¼ÉéÃqÀÄ ¨ÉîÆj¤AzÀ JµÀÄÖ zÀÆgÀzÀ°èzÉ ªÀÄvÀÄÛ AiÀiÁªÀ f¯ÉèAiÀÄ°èzÉ? E°è£À zÉêÀ¸ÁÜ£ÀUÀ¼À ºÉ¸ÀgÀÄUÀ¼ÀÄ K£ÀÄ ªÀÄvÀÄÛ
CªÀÅUÀ¼À£ÀÄß PÀnÖ¹zÀªÀgÀÄ AiÀiÁgÀÄ?
IX. Combine the following: (Any One) 1X1=01

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 4

 (A) 1) ªÀÄ£É + EAzÀ =
2) ªÀiï + O =
(B) Combine the following sentence using verbal participle form. (Any One) 1X1=01

C) ºÀÄqÀÄUÀgÀÄ zÀÄqÀÄØ PÉÆlÖgÀÄ.

ºÀÄqÀÄUÀgÀÄ ¸ÀPÀð¸ï £ÉÆÃrzÀgÀÄ.
D) £Á£ÀÄ PÉ®¸À ªÀiÁqÁÛ EzÉÝ.
£Á£ÀÄ JA.J. N¢zÉ.
(B) Frame meaningful small sentences with using words given given below:(Any Three) -1X3=03.
C) ªÀÄgÀ D) ¥sÀ® E) HgÀÄ F) ¥ÉÃ¥Àgï G) EªÀgÀÄ H) ªÀÄ£É J) ±Á¯É

PÀ£ÀßqÀ ¥ÀoÀåPÀæªÀÄ gÀZÀ£Á ¸À«Äw

 ¸ÀA¥ÁzÀQÃAiÀÄ ¸À«Äw:

1. ²æà n J¯ï gÀ«ÃAzÀæ, G¥À£Áå¸ÀPÀgÀÄ, ¸ÀPÁðj f.Dgï.L.¹.¦ ¨ÉAUÀ¼ÀÆgÀÄ.

2. ²æà n. wªÀÄä¥Àà, G¥À£Áå¸ÀPÀgÀÄ(DAiÉÄÌ ±ÉæÃtÂ), AiÀiÁAwæPÀ «¨sÁUÀ, ¸ÀPÁðj ¥Á°mÉQßPï,
vÀĪÀÄPÀÆgÀÄ.

 ¸À®ºÁ ¸À«ÄwAiÀÄ ¨ÁºÀå ¸ÀA¥À£ÀÆä® ªÀåQÛUÀ¼ÀÄ.

1. ¥ÉÆæ. (qÁ.) r. ¥ÁAqÀÄgÀAUÀ ¨Á§Ä, PÀÄ®¸ÀaªÀgÀÄ, PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦.

2. ¥ÉÆæ. (qÁ.) C±ÉÆÃPï PÀĪÀiÁgï gÀAdgÉ, ¥ÁæzsÁå¥ÀPÀgÀÄ, ¥Àæ¸ÁgÁAUÀ «¨sÁUÀ,
PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦.
3. ¥ÉÆæ. (qÁ.) PÉ ªÉÊ £ÁgÁAiÀÄt ¸Áé«Ä, ¸ÀºÀ ¥ÁæzsÁå¥ÀPÀgÀÄ, ¸ÁßvÀPÉÆÃvÀÛgÀ «¨sÁUÀ,
¸ÀPÁðj PÀ¯Á PÁ¯ÉÃdÄ, ¨ÉAUÀ¼ÀÆgÀÄ.
4. ¥ÉÆæ. (qÁ.) eÉ ¨Á®PÀȵÀÚ, ¥ÁæzsÁå¥ÀPÀgÀÄ ºÁUÀÄ ªÀÄÄRå¸ÀÜgÀÄ, PÀ£ÀßqÀ ¨sÁµÁ CzsÀåAiÀÄ£À «¨sÁUÀ,
PÀȶ «±Àé«zÁå®AiÀÄ, (fPÉ«PÉ) ºÉ¨Áâ¼À, ¨ÉAUÀ¼ÀÆgÀÄ.

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 5

 KARNATAKA STATE BOARD OF TECHNICAL EXAMINATION, BENGALURU.
TEACHING AND EXAMINATION SCHEME FOR KANNADA COURSE IN DIPLOMA PROGRAME
SEMESTER: III COMMON TO ALL DIPLOMA PROGRAMMES C-15 Curriculum
SL.N0 COURSE Teaching scheme Examination scheme
/QP CODE Contact hours

Department
COURSE NAME TH TU PR TOTAL Credit Exam End exam Maximum Minimum

Teaching
paper Max Min CIE Marks Marks for
duration marks marks passing.
in Hrs (IA+SA ) (IA + SA)
THEORY
1 KANNADA KALI-1 KA 15KA3NT 2 - - 2 2 - - - 50 20

2 TANTRIKA KA 15KA3KT 2 - - 2 2 - - - 50 20
KANNADA -1
CIE- Continuous Internal Examination: SEE-Semester End Examination: IA-Internal Assessment Tests: SA- Student Activity.
Note: 1. Candidates studied Kannada as one subject in 10th standard shall take Tantrika Kannada 1 &2. Others may take “Kannada Kali-1&2”.
2. In 3rd Semester- Assessment is only by CIE and no SEE. Average marks of three I A tests shall be rounded off to the next higher digit. Rubrics to
be devised appropriately to assess student activity.

KARNATAKA STATE BOARD OF TECHNICAL EXAMINATION, BENGALURU.

TEACHING AND EXAMINATION SCHEME FOR KANNADA COURSE IN DIPLOMA PROGRAME
SEMESTER: IV COMMON TO ALL DIPLOMA PROGRAMMES C-15 Curriculum
SL.N0 COURSE Teaching scheme Examination scheme
/QP CODE Contact hours
Department

COURSE NAME TH TU PR TOTAL Credit Exam Sem End Exam Maximum Minimum
Teaching

paper Max Min CIE Marks Marks for

duration Exam Passing passing.
in Hrs Marks Marks (IA+SA ) (IA + SA)
THEORY
1 KANNADA KALI-2 KA 15KA4NT 2 - - 2 2 2 50 20 - -

2 TANTRIKA KA 15KA4KT 2 - - 2 2 2 50 20 - -
KANNADA -2
CIE- Continuous Internal Examination: SEE-Semester End Examination: IA-Internal Assessment Tests: SA- Student Activity.
Note: In 4th Semester- Assessment is only by SEE and no CIE. To award diploma certificate, passing in Kannada course is mandatory. However
Kannada course is not included in the eligibility criteria for promotion to the higher semester.

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ PÀ£ÁðlPÀ ¸ÀPÁðgÀ r¥ÉÆèªÀiÁ PÀ£ÀßqÀ ¥ÀoÀåPÀæªÀÄ Page 1

 r¥ÉÆèêÀiÁ-vÁAwæPÀ PÀ£ÀßqÀ-2 ( PÀ£ÀßqÀ §®èªÀjUÁV)

4£Éà ¸É«Ä¸ÀÖgï - vÁAwæPÀ PÀ£ÀßqÀ -2 ( ¸Á»vÀå ªÀÄvÀÄÛ ¨sÁµÁ P˱À®å ¥ÀæAiÉÆÃUÀ)

¥ÀoÀåPÀæªÀÄ
Course: Course Code:15KA4KT
vÁAwæPÀ PÀ£ÀßqÀ -2 (2016-17)
4th Semester No. of Credits:02 No. of teaching hours/week:02
No. of teaching
hours/Semester:26

Mode of Assessment and Maximum Marks: 50

Evaluation: (SEE only)
Semester End Examination Minimum Passing marks:20
(SEE)only. No CIE.

¥ÀoÀå ¥ÀæPÁgÀ ¥ÁoÀ ¥ÀoÀåzÀ ºÉ¸ÀgÀÄ/¯ÉÃRPÀgÀÄ/¥ÀæPÀluÉ ¸É«Ä¸ÀÖgï

¨ÉÆÃzsÀ£ÁªÀ¢ü
UÀAmÉUÀ¼ÀÄ
PÁªÀå ªÀÄAdj-(§zÀÄPÀÄ 1 (PÁªÀå UÀÄZÀÒUÀ¼ÀÄ) 02
ªÀÄvÀÄÛ ªÀiÁ£ÀªÀvÉ) (1) £À£Àß ºÀtvÉ-qÁ:f.J¸ï.J¸ï.
(2) ªÀÄAPÀÄ wªÀÄä£À PÀUÀÎ-r.«.f

¸ÀA¸ÀÌøw 2 C¯ÉPÁìAqÀgï£À UÀÄgÀÄzÀQëuÉ-ªÀiÁ¹Û ªÉAPÀmÉñÀ CAiÀÄåAUÁgï 02

¥Àj¸ÀgÀ/¸ÁºÀ¸À 3 ªÉÊ£Ár£À £ÀgÀ¨sÀPÀëPÀgÀÄ - ¥ÀÆtðZÀAzÀæ vÉÃd¹é 02

QæÃqÉ/PÀ¯É 4 f.Dgï.«±Àé£Áxï-qÁ: PÉ.¥ÀÄlÖ¸Áé«Ä 02

vÀAvÀæeÁÕ£À 5 ªÀiÁ»w vÀAvÀæeÁÕ£À-MAzÀÄ ¸ÀÆÜ® £ÉÆÃl-f.J£ï.£ÀgÀ¹ABªÀÄÆwð 02

AiÀıÉÆÃUÁxÉ/ªÀåQÛavÀæt 6 qÁ:«±ÉéñÀégÀAiÀÄå-ªÀåQÛ ªÀÄvÀÄÛ LwºÀå - J.J£ï.ªÀÄÆwðgÁªï 02
¨sÁµÁ P˱À®å- 7 °TvÀ C©üªÀåQÛ: ¥ÀvÀæUÀ¼À gÀZÀ£É-ªÁåSÉå: ¥ÀvÀæzÀ ¨sÁµÉ, ±ÉÊ°, £ÀªÀÄÆ£ÉUÀ¼ÀÄ 06
ZÀlĪÀnPÉUÀ¼ÀÄ (1) ªÉÊAiÀÄQÛPÀ ¥ÀvÀæ (¥ÀæªÁ¸À/PÉÆÃjPÉ.(ªÀÄ£À«/DwäAiÀÄjUÉ §gÉAiÀÄĪÀ ¥ÀvÀæUÀ¼ÀÄ)..)
(2) ¥ÀvÀæ ªÀåªÀºÁgÀ (ªÁtÂdå ¸ÀA¸ÉÜUÀ½UÉ §gÉAiÀÄĪÀ/¥ÀævÀÄåvÀÛgÀ ¥ÀqÉAiÀÄĪÀ,
¨ÁåAPïUÀ½UÉ/¸ÀPÁðj PÀZÉÃjUÀ½UÉ §gÉAiÀÄĪÀ ¥ÀvÀæUÀ¼ÀÄ....)-ªÀiÁzÀjUÀ¼ÀÄ
(3) C¨sÀåxÀð£À ¥ÀvÀæ (ºÀÄzÉÝUÉ Cfð) -1-2 £ÀªÀÄÆ£ÉUÀ¼ÀÄ-4-5 ¥Àæ±ÉßUÀ¼ÀÄ
(4) NzÀÄUÀgÀ «¨sÁUÀPÉÌ ¥ÀwæPÁ ¸ÀA¥ÁzÀPÀjUÉ §gÉAiÀÄĪÀ ¥ÀvÀæUÀ¼ÀÄ 1 £ÀªÀÄÆ£É-3-4
«µÀAiÀÄUÀ¼À ªÉÄÃ¯É ¥ÀvÀæ §gɸÀĪÀÅzÀÄ.
8 ¸ÀAQë¥ÀÛ ¯ÉÃR£À (¸ÁgÁA±À ¯ÉÃR£À) 02
9 ªÀiËTPÀ C©üªÀåQÛ> ZÀZÁð ¸ÀàzsÉð/PÀÆl-¨sÁµÀt-D±ÀĨsÁµÀt -PÁAiÀÄðPÀæªÀÄ 06
¤gÀÆ¥ÀuÉ ªÀiÁqÀĪÀÅzÀÄ.
MlÄÖ CªÀ¢ü 26 UÀAmÉUÀ¼ÀÄ

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 1

 r¥ÉÆèêÀiÁ 4£Éà ¸É«Ä¸ÀÖgï (PÀ£ÀßqÀ§®è «zÁåyðUÀ½UÉ)
vÁAwæPÀ PÀ£ÀßqÀ-2
¥Àj«r
¨sÁUÀ-1

PÁªÀå UÀÄZÀÒ
1. £À£Àß ºÀtvÉ-qÁ:f.J¸ï.²ªÀgÀÄzÀæ¥Àà
2. ªÀÄAPÀÄwªÀÄä£À PÀUÀÎ-r«f
UÀzÀå ¸Á»vÀå
3. C¯ÉPÁìAqÀgÀ£À UÀÄgÀÄzÀQëuÉ (¸ÀA¸ÀÌøw-PÀvÉ)-²æäªÁ¸À (ªÀiÁ¹Û)
4. ªÉÊ£Ár£À £ÀgÀ¨sÀPÀëPÀgÀÄ (¥Àj¸ÀgÀ-¸ÁºÀ¸À)-PÉ.¦.¥ÀÆ.vÉÃdì¹é
5. °lè¯ï ªÀiÁ¸ÀÖgï (QæÃqÉ/PÀ¯É)-qÁ.PÉ.¥ÀÄlÖ¸Áé«Ä
6. ªÀiÁ»w vÀAvÀæeÁÕ£À-f.J£ï.£ÀgÀ¹AºÀªÀÄÆwð
7. qÁ:«±ÉéñÀégÀAiÀÄå-ªÀåQÛ ªÀÄvÀÄÛ LwºÀå-J.J£ï.ªÀÄÆwðgÁªï

¨sÁUÀ-2 -¨sÁµÁ P˱À®å ZÀlĪÀnPÉUÀ¼ÀÄ

(1)§gÀºÀ gÀÆ¥ÀzÀ ¸ÀAªÀºÀ£À PÀ£ÀßqÀ-C©üªÀåQÛAiÀÄ ¸ÀégÀÆ¥À

O¥ÀZÁjPÀ ªÀÄvÀÄÛ C£Ë¥ÀZÁjPÀ ¥ÀvÀæUÀ¼ÀÄ
(C) ¥ÀvÀæªÀåªÀºÁgÀ-ªÁåSÉå- «ªÀgÀuÉ
(D) ¥ÀvÀæUÀ¼À ªÀiÁzÀjUÀ¼ÀÄ
1. ªÁtÂdå ¥ÀvÀæUÀ¼ÀÄ-ªÁåSÉå, PÉ®ªÀÅ «zsÀUÀUÀ¼ÀÄ
2. SÁ¸ÀV/ªÉÊAiÀÄQÛPÀ ¥ÀvÀæUÀ¼ÀÄ
3. ¥ÀwæPÉUÀ½UÉ §gÉAiÀÄĪÀ (NzÀÄUÀgÀ)¥ÀvÀæUÀ¼ÀÄ
4. C¨sÀåxÀð£À ¥ÀvÀæUÀ¼ÀÄ

(2) ¸ÁgÁA±À ¯ÉÃR£À: ªÁåSÉå, GzÉÝà ±À, «zsÁ£ÀUÀ¼ÀÄ.

3 . ªÀiËTPÀ C©üªÀåQÛ ZÀlĪÀnPÉUÀ¼ÀÄ(vÀgÀUÀw ZÀlĪÀnPÉUÀ¼ÀÄ)

1. «µÀAiÀiÁvÀäPÀ ¨sÁµÀtUÀ¼ÀÄ
2. D±ÀĨsÁµÀt (gÀZÀ£ÁvÀäPÀ «µÀAiÀÄUÀ¼ÀÄ)
3. ZÀZÉð ( «ZÁgÀ «¤ªÀÄAiÀÄ/¥ÀgÀ-«gÀÄzÀÞ ªÁzÀ ªÀÄAqÀ£É)
4. ¤gÀÆ¥ÀuÉ

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 2

 Course outcome:
1. Developing listening and speaking skills.
2. Easy Interaction with peers.
3. Students can use the language at ease in daily life situations

r¥ÉÆèêÀiÁ £Á®Ì£Éà ¸É«Ä¸ÀÖgï (PÀ£ÀßqÀ «zÁåyðUÀ½UÉ)

vÁAwæPÀ PÀ£ÀßqÀ-2
¸ÀªÀÄAiÀÄ: 2.00 UÀAmÉ CAPÀUÀ¼ÀÄ: 50

I. PɼÀV£À AiÀiÁªÀÅzÉà LzÀÄ ¥Àæ±ÉßUÀ½UÉ 1-2 ¥ÀÆtð ªÁPÀåUÀ¼À°è GvÀÛj¹. 1X5=05

(1) ªÀiÁ»w vÀAvÀæeÁÕ£ÀzÀ ªÀiÁ»wAiÀÄ£ÀÄß £ÀµÀÖUÉƽ¸ÀĪÀ C¤µÀÖ AiÀiÁªÀÅzÀÄ?
(2) ¢ªÁ£ï ¥ÀzÀ« §AzÁUÀ ¸Àgï.JA.«±ÉéñÀégÀAiÀÄå£ÀªÀgÀÄ vÀªÀÄä vÁ¬ÄUÉ ºÉýzÀ ªÀiÁvÉãÀÄ?
(3) Cj¸ÁÖl¯ï AiÀiÁgÀÄ ªÀÄvÀÄÛ CªÀgÀÄ C¯ÉPÁìAqÀgÀ¤UÉ K£ÁUÀ¨ÉÃPÀÄ?
(4) ¸ÀÄvÉÆÛÃ¯É CxÀªÀ ¥Àj¥ÀvÀæ JAzÀgÉãÀÄ?
(5) ¦ü¤Pïì JAzÀgÉãÀÄ?
(6) ‘SÉqÁØ’ JAzÀgÉãÀÄ?
(7) ¤gÀÆ¥ÀPÀgÉAzÀgÉ AiÀiÁgÀÄ?

II. PɼÀV£À AiÀiÁªÀÅzÉà ªÀÄÆgÀÄ ¥Àæ±ÉßUÀ½UÉ ¸ÀAQë¥ÀÛªÁV GvÀÛj¹. 5X3=15

(1) PÀ« “ºÀtvÉ ºÀZÀÄÑvÉÛÃ£É £Á£ÀÄ’ JAzÀÄ KPÉ ºÉüÀÄvÁÛgÉ?

(2) QèAiÀiÁAvÀ¸À£À ¸ÁªÀÅ
(3) PÁPÀ£ÀPÉÆÃmÉ PÁqÀÄ ºÉÃVzÉ?
(4) CAvÀgÀeÁ®zÀ G¥ÀAiÉÆÃUÀUÀ¼ÀÄ.
(5) C£Ë¥ÀZÁjPÀ C©üªÀåQÛ JAzÀgÉãÀÄ w½¹.
(6) ZÀZÉð – ªÁåSÉå ªÀÄvÀÄÛ G¥ÀAiÉÆÃUÀzÀ §UÉÎ §gɬÄj.

III . F PɼÀV£À AiÀiÁªÀÅzÉà ªÀÄÆgÀÄ ¥Àæ±ÉßUÀ½UÉ «ªÀgÀuÁvÀäPÀ GvÀÛgÀ §gɬÄj. 10X3=30

(C) ºÀįÁèUÀÄ ¨ÉlÖzÀr...... PÀUÀÎzÀ°è ªÀÄ£ÀĵÀå K£ÁUÀ¨ÉÃPÉAzÀÄ ªÀÄvÀÄÛ ¸ÀAVÃvÀ PÀ¯ÉAiÉÆAzÀÄ
¸Á»vÀå PÀ¯ÉAiÉÆAzÀÄ....” PÀUÀÎzÀ°è PÀ« EªÉ®è ªÀÄ£ÀĵÀå¤UÉ KPÉ ¨ÉÃPÉAzÀÄ ºÉüÀÄvÁÛgÉ?
(D) CtÚ£À£ÀÄß PÁ¥ÁqÀ®Ä AiÉÄÃUÀ ªÀiÁrzÀ ¸ÁºÀ¸ÀªÀ£ÀÄß «ªÀj¹.
(CxÀªÀ)
CwAiÀiÁzÀ £ÀUÀjÃPÀgÀtPÁÌV PÁqÀÄUÀ¼À £Á±À¢AzÀ ¥Àj¸ÀgÀzÀ ªÉÄïÁUÀĪÀ ¥ÀjuÁªÀÄUÀ¼À
§UÉÎ §gɬÄj.
(E) ¤ÃªÀÅ PÁ¯ÉÃf¤AzÀ ºÉÆÃV§AzÀ ¥ÀæªÁ¸ÀzÀ C£ÀĨsÀªÀ PÀÄjvÀÄ ¤ªÀÄä UɼÉAiÀÄjUÉ ¥ÀvÀæ §gɬÄj.
(F) PɼÀV£À «µÀAiÀĪÀ£ÀÄß MAzÀÄ ¸ÀÆPÀÛ ²Ã¶ðPÉ ¸À»vÀ 30 ¥ÀzÀUÀ¼À «ÄwAiÀÄ°è ¸ÀAPÉëÃ¥ÀUÉƽ¹.
¤Ã¯ÁA§gÀ ¢éÃ¥À. EzÉÆAzÀÄ ¸ÀÄAzÀgÀ ¢éÃ¥À. ¥ÀæªÁ¹UÀ½UÉ ¸ÀéUÀð¸ÀªÀiÁ£À ¢éÃ¥À. F ¢éÃ¥À »AzÀÆ
ªÀĺÁ¸ÁUÀgÀzÀ zÀQëtQÌgÀĪÀ DgÀÄ ¢éÃ¥À ¸ÀªÀÄƺÀzÀ°è ªÀÄzsÀåzÀ°è ºÀÄtÂÚªÉÄ ZÀAzÀæ£ÀAvÉ PÀAUÉƽ¸ÀÄwÛgÀĪÀ zÉÆqÀØ
¢éÃ¥À. F ¢éÃ¥À MAzÀÄ ¨sÁUÀzÀ°è ºÀ¹gÀÄ ZÁzÀgÀ ºÁ¹zÀAvÉ ¸ÀªÀÄvÀmÁÖzÀ ºÀÄ®ÄèUÁªÀ®Ä. E£ÉÆßAzÀÄÀ ¥ÀPÀÌ
§UɧUÉAiÀÄ ºÀtÄÚUÀ¼À ªÀÄvÀÄÛ ºÀƪÀÅUÀ¼À VqÀUÀ¼ÀÄ ªÀÄvÀÄÛ CrPÉ, ªÀiÁªÀÅ, ªÉÄt¸ÀÄ, K®QÌ, ®ªÀAUÀzÀAvÀºÀ VqÀ-
ªÀÄgÀUÀ½AzÀ PÀÆrzÉ.F ¢éÃ¥ÀzÀ ªÀÄzsÉå QjÃlzÀAvÉ £ÀªÀÄä GzÀPÀªÀÄAqÀ®zÀAwgÀĪÀ ºÀ¹j£À ¨ÉlÖ. ¤¸ÀUÀðzÀvÀÛ
ºÀƪÀÅUÀ¼À VqÀUÀ½AzÀ ¥ÀĵÉÆÖÃzÁå£ÀzÀAwzÉ. ¥ÀæPÀÈwAiÉÄà ¤«Äð¹gÀĪÀ w½¤Ãj£À ¸ÀÄAzÀgÀ PÉƼÀ F ¨ÉlÖzÀ

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 3

 DPÀµÀðuÉAiÀiÁVzÉ. »ÃUÁV F ¢éÃ¥À ¥ÀæªÁ¹UÀjUÉ C¥ÁgÀ DPÀµÀðPÀ vÁtªÁVzÉ. E°è£À d£À ¸ÀºÀ
¸Ëd£Àå²Ã®gÀÄ. ¸Àȶ×AiÀÄ ±ÀÈAUÁgÀªÀ£Éß®è M¼ÀUÉÆAqÀ F ¢éÃ¥ÀzÀ ªÀÄÄRå PÀ¸ÀÄ§Ä PÀȶ, vÉÆÃlUÁjPÉ ªÀÄvÀÄÛ
¥ÀæªÁ¸ÉÆÃzÀåªÁVgÀĪÀÅzÀjAzÀ, EzÉÆAzÀÄ ²æêÀÄAvÀ ¢éÃ¥ÀªÁVzÉ.
********

PÀ£ÀßqÀ ¥ÀoÀåPÀæªÀÄ gÀZÀ£Á ºÁUÀÄ ¥ÀoÀå¥ÀĸÀÛPÀ ¸À«Äw

 ¸ÀA¥ÁzÀQÃAiÀÄ ¸À«Äw:

1. ²æà n J¯ï gÀ«ÃAzÀæ, G¥À£Áå¸ÀPÀgÀÄ, ¸ÀPÁðj f.Dgï.L.¹.¦ ¨ÉAUÀ¼ÀÆgÀÄ.

2. ²æà n. wªÀÄä¥Àà, G¥À£Áå¸ÀPÀgÀÄ(DAiÉÄÌ ±ÉæÃtÂ), AiÀiÁAwæPÀ «¨sÁUÀ, ¸ÀPÁðj ¥Á°mÉQßPï, vÀĪÀÄPÀÆgÀÄ.

 ¸À®ºÁ ¸À«ÄwAiÀÄ ¨ÁºÀå ¸ÀA¥À£ÀÆä® ªÀåQÛUÀ¼ÀÄ.

1. ¥ÉÆæ. (qÁ.) r. ¥ÁAqÀÄgÀAUÀ ¨Á§Ä, PÀÄ®¸ÀaªÀgÀÄ, PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦.

2. ¥ÉÆ.æ (qÁ.) C±ÉÆÃPï PÀĪÀiÁgï gÀAdgÉ, ¥ÁæzsÁå¥ÀPÀgÀÄ, ¥Àæ¸ÁgÁAUÀ «¨sÁUÀ,
PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ, ºÀA¦.
3. ¥ÉÆæ. (qÁ.) PÉ ªÉÊ £ÁgÁAiÀÄt ¸Áé«Ä, ¸ÀºÀ ¥ÁæzsÁå¥ÀPÀgÀÄ, ¸ÁßvÀPÉÆÃvÀÛgÀ «¨sÁUÀ,
¸ÀPÁðj PÀ¯Á PÁ¯ÉÃdÄ, ¨ÉAUÀ¼ÀÆgÀÄ.
4. ¥ÉÆæ. (qÁ.) eÉ ¨Á®PÀȵÀÚ, ¥ÁæzsÁå¥ÀPÀgÀÄ ºÁUÀÄ ªÀÄÄRå¸ÀÜgÀÄ, PÀ£ÀßqÀ ¨sÁµÁ CzsÀåAiÀÄ£À «¨sÁUÀ,
PÀȶ «±Àé«zÁå®AiÀÄ, (fPÉ«PÉ) ºÉ¨Áâ¼À, ¨ÉAUÀ¼ÀÆgÀÄ.

vÁAwæPÀ ²PÀët ¤zÉðñÀ£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ. PÀ£ÁðlPÀ ¸ÀPÁðgÀ Page 4