Directorate Of Technical Education Karnataka State CS&E ...

1

Directorate Of Technical Education Karnataka State CS&E 15CS31T

Government of KarnatakaDepartment of Technical Education

Bengaluru

Course Title: Programming with C

Scheme (L:T:P) : 4:0:0 Total Contact Hours: 52Course Code:

15CS31TType of Course: Lectures, Self

Study & Student ActivityCredit :04

Core/ Elective: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):

Course outcomeCL Linked PO Teaching

Hours

CO1

Illustrate syntax rules for numerical constants and variables, data types, arithmetic operators and expressions and Articulate them with different types of input/output formats using simple problems.

R, U

1,2,3,4,8,9,10

10

CO2 Discuss different branching and looping statements and experiment using simple programs.

U, A

1,2,3,4,8,9,1014

CO3 Discuss different types of functions and write simple programs.

U, A 1,2,3,4,8,9,10

06

CO4 Explain different types of arrays and write simple programs.

U, A

1,2,3,4,8,9,1008

CO5 Describe preprocessor and Discuss different types of string functions.

U, A 1,2,3,4,8,9,10

06

CO6 Describe and differentiate between structure and unions to write simple programs.

U, A

1,2,3,4,8,9,10 08

Total sessions 52

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

2


Course-PO Attainment Matrix

Course Programme Outcomes1 2 3 4 5 6 7 8 9 10

Programming with C 3 3 3 3 - - - 3 3 3Level 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

UnitNo Unit Name

Hour Questions to be set forSEE

Marks Weightage

Marks Weightage

(%)

R U A A

I Introduction to 'C' Language

10 5 12 10 27 19.24

II Decision making-Branching and Looping

14 - 15 23 38 26.9

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.

3


UNIT III: Functions 06 HrsDefinition 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 booksProgramming with ANSI-C, E. Balaguruswamy, Sixth Edition, Tata Mcgraw Hill.

References1. Programming with ANSI & Turbo C, Ashok Kamthane, Second Edition, Pearson

Education.2. Let us C, Yashavant P Kanetkar, 14th Edition, BPB publication, ISBN

97881833316303. Programming in C and Data Structure, P.B.Kotur, Sapna Book house4. http://spoken-tutorial.org/tutorial-

search/?search_foss=C+and+Cpp&search_language=English5. http://www.tutorialspoint.com/cprogramming/6. http://www.indiabix.com/online-test/c-programming-test/

Suggested student activities

4


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 whom

When/Where(Frequency in the course)

Max Marks

Evidence collected

Course outcomes

Dir

ect A

sses

smen

t

CIE IA

Stu

dent

s

Three IA tests (Average of three tests will be computed)

20 Blue books 1 to 6

Student activities

05 Report 1 to 6

Total 25

SEE End Exam

End of the course

100Answer scripts

at BTE1 to 6

Indi

rect

Ass

essm

ent

Student Feedback on course

Stu

dent

s

Middle of the course Feedback forms

1,2,3Delivery of

courseEnd of Course Survey

End of the course

Questionnaires

1 to 6Effectiveness of Delivery

of instructions

& Assessment

MethodsNote: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off

to the next higher digit.

5


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 102 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 marks3. 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 sem 10-11 Am

I/II SEM20

Year:Name of Course coordinator : Units:__ CO’s:____

Question no Question MARKS CL CO PO

1234

Note: Internal Choice may be given in each CO at the same cognitive level (CL).

MODEL QUESTION PAPER (CIE)

Test/Date and Time

Semester/year Course/Course Code Max Marks

Ex: I test/6 th weak of sem 10-11 AM

III SEM Programming with C20

Year: 2015-16 Course code:15CS31TName of Course coordinator : Units:1,2 Co: 1,2

Note: Answer all questions

Question no

Question CLCO

PO

1 What is variable? Write the rules and guidelines for naming variable? (5)

OREvaluate 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

R 1 1,2

6


2 Define algorithm? Explain its characteristics (5)OR

Write a flow chart and C program to find the sum and average of three numbers

U

A

1 1,2

3 Give the general syntax and an example of do.....while loop statement. Why it is called as "exit-controlled" loop? (5)

U 2 1,2

4 Explain printf() statement with an example. A 2 1,2

Format for Student Activity Assessment

DIMENSION Unsatisfactory1

Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data

Does not collect any information relating to the topic

Collects very limited information; some relate to the topic

Collects some basic information; refer to the topic

Collects relevant information; concerned to the topic

Collects a great deal of information; all refer to the topic

3

Fulfill team’s roles & duties

Does not perform any duties assigned to the team role

Performs very little duties

Performs nearly all duties

Performs all duties

Performs all duties of assigned team roles with presentation

4

Shares work equally

Always relies on others to do the work

Rarely does the assigned work; often needs reminding

Usually does the assigned work; rarely needs reminding

Does the assigned job without having to be reminded.

Always does the assigned work without having to be reminded and on given time frame

3

Listen to other Team

mates

Is always talking; never allows anyone else to speak

Usually does most of the talking; rarely allows others to speak

Listens, but sometimes talk too much

Listens and contributes to the relevant topic

Listens and contributes precisely to the relevant topic and exhibit leadership qualities

3

TOTAL 13/4=3.25=4*All student activities should be done in a group of 4-5 students with a team leader.

7


MODEL QUESTION PAPER Code: 15CS31TDiploma 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 functionii. 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:

8


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 BANKDiploma in Computer Science & Engineering

III SemesterCourse Title: Programming with C

CO Question CL Marks

I

What is a token? Give example for each type of token. R

05

What is a constant? Explain different types of C constants. RWhat is variable? Write the rules and guidelines for naming variable? RDefine the term Identifier. Give an example. RList the basic data types with byte specification UList the hierarchy (precedence ) rules of arithmetic operators. UEvaluate the expression 2 + 1 * 3 - 4 % 3 * 1 + 16 / 2 % 5 and smilar type expressions to be solved having arithmetic, relational and logical operators also

U

List the important features of C language. UGive a general form of ternary operator, Explain with an example. AExplain simple assignments in C. Give an example. UList input and output functions UExplain printf() statement with an example. AExplain scanf() statement with an example. ADefine algorithm? Explain its characteristics UDefine flow chart? List the symbols used in flow-chart UWrite a algorithm and C program to find the sum and average of three numbers

A

With general syntax explain formatted input-output statements. Give example for each.

U

10

Define the following with an example:i. Increment Operator. ii. Decrement Operator

U

1. Explain the basic data types of C language. UDefine the following with an example:

i. C Keyword. ii. Variable.iii. Constants. iv. Format Specifierv. Arithmetic Expression.

U

Define the following terms. Give one example each.i. Constant. ii. Keyword.iii. Relational Expression. iv. Assignment statement.

U

9


v. Conditional operator. Write a flow chart and C program to swap the values of two variables without using third variable.

A

Explain the basic structure of C program. UWrite an algorithm and C program to find the largest of three numbers using conditional operators.

A

Write an algorithm and flow chart to compute sum of n numbers AWrite an algorithm and C program to find area and circumference of a circle (circum=2πr and Area= πr2

A

II

Explain different logical operators with examples. U

05

Explain different relational operators with examples. UWrite the general syntax of if & if-else statement. UCompare while and do....while statement. UCompare if and if-else statement. UIllustrate and explain nested if –else statement. Ustate and explain if –else ladder statement. UWrite a program to find the largest of three numbers. AWith general syntax, explain the significance of break and continue statement in loops..

U

Define the following i. break.

ii. goto.and labeliii. continue.

U

List and explain any two unconditional statements/jumping statements. UExplain Relational and Logical operators. UWith general syntax, explain the need of break statement in Switch. UGive the general syntax and an example of do.....while loop statement. Why it is called as "exit-controlled" loop?

U

Differentiate between break and continue statements. UWrite a C program to check whether the given number is odd or even. AExplain the logical operators with example. UExplain relational operators with example. UExplain for statement with an example. UExplain If......else statements with an example. A

10

Explain nested for loop with the general syntax. UWrite a program to find roots of quadratic equation using switch statement.

A

Explain the switch statement with syntax, with an example. AExplain entry controlled and exit controlled loop with an example. AWrite a program to find the numbers and sum of all numbers greater than 150 and less than 250 which are divisible by 8.

A

Write a program to find the largest of 3 numbers using if....else statement.

A

Write a program to find smallest of three numbers using nested if.....else statement.

A

Write a program to check whether the given number is prime or not. A

10


Write a program to generate Fibonacci series. AWrite a program to find the sum of n natural numbers. AWrite a program to find the reverse of a given numbers. AWrite a program to count even and odd from n natural numbers. A

III

Define function. List different types of functions. U

05

What are the advantages of functions? UList the difference between actual parameters and formal Parameters. UExplain scope and lifetime of a variable in a function. UWhat do you mean by user defined function? Explain. UWrite a short note on C library functions. UWrite a user defined function great() that computes greatest of two numbers and return the largest number to function main().

A

Write the block structure of a function. UDefine the following

1. Formal parameter2. Actual parameter3. Return type4. Function call

U

What is a function prototype give an example. UWrite a program to find the factorial of a given number using function. A

10

Write a program to find the GCD of a given number using function. AExplain Call by Value with an example. UExplain the following with a example:

i. Passing argument to a functionii. Returning value from a function

A

IV

What is an array? Explain how to declare and initialize a single dimension array?

U

05

With an example, explain declaration & initialization of two dimensional array.

U

Compare one dimensional array with two dimensional array. UExplain multidimensional array with an example. AWrite an algorithm to search a given key in the array of elements. ADiscuss one dimensional array with example. UExplain different operations on arrays. UWrite a program in C to store 25 elements (integers) in two-dimensional array called "temp" in 5-rows and 5-columns. The program should also display these numbers in a matrix format.

A

Write a program to transpose the given matrix. AList the advantages and disadvantages of an array. UWrite a C program to find the sum of principle diagonal elements of a matrix.

A

Write a program to search an element in an array. AWrite a program to find the sum and number of positive numbers and negative numbers in an array

A

Write a program to sort 'N' elements of an array using simple sort. ADefine the following:

a. Array b. Searching c. SortingU

11


Write a program to find the sum of two matrices. A 10Write a C function to compute trace and norm of a matrix. AWrite C function to compute largest of N numbers. A

V

Define string. How to Declare & Initialize string variables with an example.

U

05

Write a program to concatenate two strings using in-built string function.

A

Explain how to read the string from the terminal and write a string to the terminal with an example.

U

Explain with an example the Null-terminated strings as "Array of Characters".

U

Write a C program to check whether the given string is a palindrome or not.

A

List string handling functions. UWrite a program to compare any two strings using string functions AList the advantages of preprocessor directives. A

Explain briefly how to use #define directive. AWrite a short note on File inclusion. UExplain with Example the #include preprocessor directive. AHow do you define symbolic constants? Illustrate with an example AExplain the following function with an example:

i. getchar() ii. strrev()iii. strcmp() iv. strcat()v. strcpy()

U 10

Define a macro. Explain macro substitution with an example. U

Define string. Give an example. Explain the various string handling functions with an example.

U

Write a C program to verify that the given string is palindrome or not using iterative method.

A

Write a program to find the area of a circle using macros. AWrite a note on the following:

a. Pre-processor directiveb. Macro substitution

U

VI

Define a structure. Explain with an example, the general syntax of a structure.

U 5

What are structure variables? Explain how to declare and initialize a structure variable.

U

Define a union. Explain with an example, the general syntax of a union. UList the difference between Union and Structure. UCompare Arrays versus Structures. U

Define array of structure. Give an example. UExplain array variable as a structure member with an example. UExplain array of structure with an example. U 10Explain the need of structure within a structure (nested structure) with an example

U

12


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

A

1



Bengaluru

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


Course outcomeCL Linked

POTeaching

Hours

CO1 Describe operating system operations and operating system structures. U 1,2,9,10 08

CO2 Understand process management and apply process scheduling algorithms

U, A

2,3,9,10 12

CO3 Recognize Synchronization and discover themethods for handling deadlocks.

U, A

2,3,9,10 08

CO4Explain the memory management techniques.

U, A

2,3,9,10 08

CO5 Discover the concepts related to virtual memory management

U, A

2,3,9,10 08

CO6Identify file systems concepts. U,

A2,3,9,10 08

Total sessions 52


Course Title: Operating System



Study & Student Activity.Credit :04

Core/ Elective:Core


2




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



UnitNo Unit Name


Marks Weightage

Marks Weightage

(%)

R U A A

I Introduction to operating systems

8 - 22 - 22 15.38

II Process management 12 - 22 10 32 23.10

III Synchronization & Deadlocks

08 - 12 10 22 15.38

IV Memory management 08 - 14 10 24 15.38

V Virtual memory management

08 - 13 10 23 15.38

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

3


UNIT IV: Memory Management Strategies 08 Hrs

Background, Swapping, Contiguous memory allocation, Paging, Structure of page table, SegmentationUNIT 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

References1. Operating Systems, I. Chandra Mohan, PHI, 2013, ISBN – 97881203472672. http://www.tutorialspoint.com/operating_system/3. http://courses.cs.vt.edu/~csonline/OS/Lessons/index.html4. http://www.nptel.ac.in

Suggested list of student activities


1 How to install and Uninstall an Operating System on a New Computer

2 How to Remove a Second Operating System from a PC3 A Survey of recent Operating System4 Case study on real time deadlock situation5 A case study on real time process synchronization6 Comparison of OS working in single core and multi core environment7 Comparison of 32 bits and 64 bits OS8 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

http://courses.cs.vt.edu/~csonline/OS/Lessons/index.html

http://yourbusiness.azcentral.com/uninstall-operating-system-new-computer-19235.html

http://yourbusiness.azcentral.com/remove-second-operating-system-pc-23702.html

4


∑ 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



Method What To whom


Max Marks

Evidence collected

Course outcomes

Dir

ect A

sses

smen

t

CIE IA

Stu

dent

s


20 Blue books

1,2,3,4

Student activities

05 Report1,2,3,4

Total 25

SEE

End Exam

End of the course

100Answer scripts

at BTE1,2,3,4

Indi

rect

Ass

essm

ent


Stu

dent

s

Middle of the course Feedback forms

1 & 2 Delivery of course

End of Course Survey

End of the course

Questionnaires

1,2,3,4Effectiveness of

Delivery of instructions & Assessment





3 Application 30



Assessment Methods.

5




I/II SEM20



1234

Note: Internal choice may be given in each CO at the same cognitive level (CL).


Test/Date and Time


Ex: I test/6 th week of sem 10-11 AM

IV SEM Operating System20

Year: 2015-16 Course code:15CS43T

Name of Course coordinator : Units:1,2 Co: 1,2


Question no

Question CLCO

PO

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 time given in milliseconds

Process Burst time PriorityP1 9 3P2 11 1P3 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)

A 2 1,2

4 What is a process? Draw and explain the state transition diagram of a process.

U 2 1,2

6




Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data






3





Performs all duties


4

Shares work equally






3


mates






3


7


MODEL QUESTION PAPER Code: 15CS43TDiploma in Computer science & Engineering

IV- Semester Course Title: Operating System


PART-A


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


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

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.

Process Burst Time PriorityP1 10 3P2 13 1P3 3 3P4 8 4

8


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

9



IV SemesterCourse Title: Operating System


I

Write a note on protection and security. U

05

Write a note on client/server computing. UDiscuss time sharing system. UExplain distributed system. UExplain the peer-to-peer computing. UExplain OS in user’s view and system’s view. UList the advantages and disadvantages of multiprogramming system U

What is an operating system? Explain the computer system architecture. U

10

What are the different operating system operations? UCompare process management and memory management. UExplain the special-purpose systems. UExplain clustered system. UDifferent activities in connection with process management, memory management and storage management.

U

II

What is a process? Draw and explain the state transition diagram of a process.

U

05Explain the contents of PCB with neat diagram. UCompare long-term, short-term and medium-term scheduler. UExplain the different scheduling criteria. U

Explain the different operations on processes. U

10

What is inter-process communication (IPC). Explain the two models of IPC with neat diagram.

U

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

Process Burst time priorityP1 10 3P2 13 1P3 3 3

The processes are assumed to have arrived in the order P1, P2, P3 all attime 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

A

III

Write a note on semaphores. U05Explain the 3 requirements for the solution to critical-section problem. A

Write a note on critical-section problem and the solution to solve it. A

10


What is deadlock? What are the necessary conditions for deadlock? UHow deadlock can be prevented? Explain. UHow deadlock can be avoided using resource allocation graph? Explain. AExplain how to recover from deadlock. UHow deadlock can be detected? Explain. U

10Explain the banker’s algorithm. UExplain resource-allocation graph with deadlock and without deadlock with examples.

A

IV

Write a note on shared pages. U

05

Explain First-fit, Best-fit and Worst-fit strategies for memory allocation. UWhat is fragmentation? Differentiate between internal and external fragmentation.

U

Explain basic concept of memory allocation using paging UExplain how memory is protected in paging with a neat diagram. UDifferentiate between logical and physical address space UExplain address binding with a neat diagram. UExplain swapping technique with a neat diagram. UExplain the contiguous memory allocation. U

10Explain hardware implementation of page table with a neat diagram AList and explain different structure of the page table with a neat diagram. AWhat is segmentation? Draw and explain its hardware support. A

V

Explain the virtual memory concept with a neat diagram U

05

Explain virtual address space with a neat diagram. UExplain demand paging with a neat diagram. UExplain the steps for handling page fault with a neat diagram. UWrite a note on Copy-on-write. UExplain the need for page replacement. UHow frames are allocated? Explain. UExplain the steps involved in the basic page replacement with diagram. UConsider 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. Similar Problems

A

10

VI

Briefly explain the operations that can be performed on files. U

05What are the different operations performed on a directory. UWrite a note on remote file systems. UDiscuss briefly client-server model of file sharing. UDefine file and explain the different file attributes. U

10

List out common file types with their extension and functions. UDifferentiate between sequential access and direct access methods. UExplain Single-level directory and Two-level directory with a neat diagram.

A

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

A

1



Bengaluru

Course Title: Database Management Systems



Study & Student ActivityCredit :04

Core/ Elective:Core


PrerequisitesKnowledge 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



Hours

CO1 Identify the characteristics of database and describe the architecture and languages of Database system.

R, U

1,2,5,6,7,8,9,10 08

CO2 Identify the elements used in Entity-Relationship diagram and sketch a simple diagram.

U, A

1,2,3,4,5,6,7,8,9,10 08

CO3 Summarize relational model concept and illustrate the relational constraints.

U, A 1,2,3,4,5,6,7,8,9,10 08

CO4 Describe Structured Query Language (SQL) and apply to query a database.

A 1,2,3,4,5,6,7,8,9,10 10

CO5 Recognize and interpret normalization for relational databases.

U, A

1,2,3,4,5,6,7,8,9,10 08

CO6 Visualize the features of NOSql and identify the database applications.

A 1,2,3,4,5,6,7,8,9,10 10

Total sessions 52


2




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



UnitNo Unit Name

Hour Questions to be set for

SEE

Marks Weightage

Marks Weightage

(%)R U A A

I Identify the characteristics of database and describe the architecture and languages of Database system.

08

10 12 - 22 15.38

II Identify the elements used in Entity-Relationship diagram and sketch a simple diagram.

086 10 6 22 15.38

III Summarize relational model concept and illustrate the relational constraints.

085 10 7 22 15.38

IV Describe Structured Query Language (SQL) and apply to query a database.

10- 5 25 30 19.24

V Recognize and interpret normalization for relational databases.

08- 24 - 24 15.38

VI Visualize the features of NOSql and identify the database applications.

10- 15 10 25 19.24

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 DBMSDatabase 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

3


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 books1. Fundamentals of Database Systems, Sixth edition, 2014, Ramez Elmasri, Shamkan B.

Navathe, Pearson Education, ISBN- 97881317924762. http://www.w3resource.com/mongodb/nosql.php --for NoSQL - UNIT VI

References1. Fundamentals of Database Management Systems, Mark L. Gillenson, 2009, Wiley

India2. Database Management Systems – Raghu Ramakrishnan and Johannes Gehrke – 3rd

Edition, McGraw-Hill, 20033. DBMS a practical approach , by E R Rajiv Chopra, S Chand publications.4. http://elearning.vtu.ac.in/10CS54.html5. http://www.tutorialspoint.com/dbms/6. http://www.indiabix.com/technical/dbms-basics/7. http://beginner-sql-tutorial.com/sql.htm


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.

4


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-ordinator2. 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


Method What To whom


Max Marks

Evidence collected

Course outcomes

Dir

ect A

sses

smen

t

CIE IA

Stu

dent

s


20 Blue books

1 to 6

Student activities

05 Report1 to 6

Total 25

SEE End Exam

End of the course

100Answer scripts

at BTE1 to 6

Indi

rect

A

sses

smen

t


Stu

dent

s

Middle of the course

Feedback forms1,2,3 Delivery of


End of the course

Questionnaires

1 to 6Effectiveness of

Delivery of instructions &

Assessment MethodsNote: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off




3 Application 35

5




Assessment Methods.



I/II SEM20



1234



Test/Date and Time


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

6


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



Question no

Question CLCO

PO

1 Define the following. (5) 1. Data Model 2. Database Schema/Intension 3. Database State/Extension 4. Data Sublanguage 5. DML.

R 1 1,2

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)OR

Develop an E-R diagram for a company database.

A 2 1,2



Developing2

Satisfactory3

Good4

Exemplary5

Score

7


Collection of data






3





Performs all duties


4

Shares work equally






3


mates






3



III- Semester Course Title: Data Base Management Systems


8


PART-A


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


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.


III SemesterCourse Title: Data Base Management Systems


9


I

What is database? List the important characteristics of database approach.

R

05

What do you mean by data model? List and explain the different types of data model.

R

What is Data Independence? Differentiate between logical & physical Data Independence.

U

Define the following.1. Data Model 2. Database Schema/Intension 3. Database State/Extension 4. Data Sublanguage 5. DML.

R

Explain the functions of database administrators and database designers.

U

Briefly explain the different types of End Users. UDefine data independence and explain different types of it. U

List the various DBMS languages and explain each. RList the various DBMS interfaces and explain each. RExplain the functions of different Database utilities. UExplain the important characteristics of database approach. U

10

Explain the actors on the scene and workers behind the scene. UDiscuss the advantages of DBMS Approach. UExplain the two-tier client/server architecture for DBMS with neat diagram.

U

Explain the DBMS components modules with neat diagram. UWrite a note on classification of DBMS. U

II

What is E-R diagram? List out the notations used for E-R diagram. R

5Explain the different cardinality ratios for binary relationship types. UDifferentiate between a) an attribute and value setb) stored and derived attributes.

U

Explain the structural constraints of relationship type. UExplain with suitable examples 1:1 and M:N relationship types. AWith a neat diagram explain the different phases of database design. U

10

What is a Weak entity type, explain with an example how the entities are identified in a Weak entity.

U

Define the following term with examples:-a) Entity b) Entity set c) Multi-valued attribute

d) Composite attribute e)Derived attribute

R

Identify the entities, relationships and develop an E-R diagram for a company database.

A

Identify the entities, relationships and develop an E-R diagram for a Hospital database.

A

III

Compare entity integrity and referential integrity constraints. U

5Classify the constraints on databases and give examples for each of them.

U

Explain the characteristics of Relations. UExplain with examples Entity Integrity Constraints and referential Integrity Constraint

A

Differentiate i) Key and super Key ii) degree and cardinality UDefine the following term with examples:- R

10


a) Domain b) Attribute c) Tuple d) Relation schema (R)e) Relation (r) 10

Explain the insert, delete and update operation with examples. AExplain with example the different constraints that are violated during UPDATE and DELETE operations

U

IV

Write a note on different data types supported by SQL. R

5

Write the general syntax of specifying Check constraint and default constraint while creating a table.

R

Differentiate Having and Where clause with example. AWrite a note on aggregate functions in SQL. UDiscuss the strategies for View Implementation. UWith examples write a note on CREATE and DROP command. ADefine view. How to create it? Give example. U,AExplain UPDATE and ALTER command with example. U,AWrite a note on basic queries in SQL. UExplain the different schema change statements in SQL with example.

A

List and explain the different data types used in SQL. U

10

Explain different constraints available in SQL with example. UList and explain the different aggregate functions available in SQL

with example. A

Explain the following with examples: a) Insert b) Delete c) Distinct d) Order by e) Where

A

Explain the following Operators with examples: a) ANY b) ALL c) IN d) LIKE e) BETWEEN

A

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’.

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

A

V

Explain the generation of spurious tuples and how to overcome the same.

U

5

Differentiate between i) prime attribute and non prime attribute ii) Full functional dependencies and partial dependencies with examples.

U

Explain the functional dependencies with examples. UExplain second normal form with an example. UExplain third normal form with an example. U

11


Explain the Boyce-Codd normal form with example. UExplain the different UPDATE anomalies of tables. U

10Discuss the informal design guidelines for relational schema. UWhat is normalization? Explain the different types of normal forms with examples.

U

VI

Explain the following terms: transaction, concurrency control. U

5

Explain the desirable properties of a transaction. UWrite a note on System Log. UWrite a note on commit point of a transaction. UDiscuss the advantages of NoSql versus RDBMS. UExplain CAP theorem. UExplain the advantages of distributed computing. UWhat is scaling. Explain the types of scaling. UDifferentiate between ACID and BASE. UBring out the advantages and disadvantages of Nosql. UDraw a state diagram and discuss the typical states during transaction execution.

A

10Discuss the different types of failures that occur during transaction execution.

A

Explain the need for concurrency control. AExplain the categories of NoSql. UExplain Column store and Row store with suitable examples. A

1



Bengaluru

Course Title: Computer Network




Core/ Elective:Core


PrerequisitesBasic Knowledge of Computers and Communication

Course Objectives:

1. Discuss basic concepts, the need, and the various components in Networking2. 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



POTeaching

Hours

CO1 Define various data communication components in networking.

R, U

1,2,10 06

CO2 Describe networking with reference to different types of models and topologies.

R, U

1,2,10 06

CO3 Summarize the concepts related to error detection, correction and error control techniques.

R, U

2,3,4,5,10 08

CO4 Recognize the importance of LAN components, protocols that enable multiple computers to communicate with one another.

U, A

2,3,4,8,10 14

CO5 Identify the features of the different IP address classes.

R, A

2,3,4,10 06

CO6 Explain different connectivity and devices related to WAN.

U, A

2,3,4,5,8,10 12

Total sessions 52


2




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



UnitNo Unit Name

Hour Questions to be set for

SEE

Marks Weightage

Marks Weightage

(%)

R U A A

I Introduction to Data Communication 06

05 11 - 16 11.53

II Introduction to Networking and Topologies

06- 08 08 16 11.53

III Error Detection and Error Correction 08

- 13 10 23 15.38

IV LAN Components and Protocols

14- 15 25 40 27

V Network Addressing 06 - 16 - 16 11.53VI 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 HrsIntroduction, 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

3


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 Books1. 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.

References1. http://www.tutorialspoint.com/data_communication_computer_network/index.htm2. http://www.e-tutes.com/lesson1/networking_fundamentals_lesson1_1.htm3. http://www.techiwarehouse.com/engine/d9e99072/Basic-Networking-Tutorial4. http://www.nptel.com5. http://www.w3schools.com/


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-ordinator2. 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

4


2 Prepare a presentation on Sending Email via Telnet

3 Prepare a report on File sharing between computers using LAN connectivity4 Prepare a report on Setting up a Wireless LAN5 Prepare a report on Securing a Wireless LAN6 Prepare a presentation on use of ping program to test your own computer

Course Delivery



Method What To whom


Max Marks

Evidence collected

Course outcomes

Dir

ect A

sses

smen

t

CIE IA

Stu

dent

s



Student activities05

ActivityReports

1 to 6

Total 25

SEE End Exam

End of the course

100Answer scripts

at BTE1 to 6

Indi

rect

Ass

essm

ent


Stu

dent

s


Feedback forms

1,2,3 Delivery of course


End of the course

Questionnaires

1 to 6Effectiveness of Delivery of instructions & Assessment





3 Application 35



Assessment Methods.

5




I/II SEM20



1234



Test/Date and Time



III SEM Computer Networks20




Question no

Question CLCO

PO

1 Define the following terms – (5)a. Data communication.b. Phase.c. Wavelength.d. Bandwidth.e. Throughput.

R 1 1,2

2 Discuss different forms of data representation (5)OR

Explain briefly the components of Data communication, with a diagram

U 1 1,2

3 Explain the need for networking. (5) A 2 1,2

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

6




Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data






3





Performs all duties


4

Shares work equally






3


mates






3


7



III- Semester

Course Title: COMPUTER NETWORK


PART-A


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


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.

8



III Semester

Course Title: Computer Network


I

Define the following terms –a. Data communication.b. Phase.c. Wavelength.d. Bandwidth.e. Throughput.

R

05

Define the following terms –f. Periodic signal.g. Non-periodic signal.h. Latency.i. Jitter.j. Bit rate.

R

Illustrate different types of data flow. RExplain briefly the components of Data communication, with a diagram. RDiscuss different forms of data representation. UMention and explain the fundamental characteristics of data communication system.

U

Explain the different categories of networks. UExplain briefly the components of Data communication, with a diagram. U

10

Mention and explain the fundamental characteristics of data communication system.

U

Explain the different categories of networks. U

II

Explain the need for networking. A

5

Explain the function of physical and data link layers of OSI model. UExplain the function of presentation and application layers of OSI model.

U

Explain the function of Transport layer and Session layers of OSI model.

U

Explain TCP/IP reference model. UList different network topologies. Explain with a diagram Ring Topology.

A

Classify types of hardware and software network components. A

10Explain OSI reference model with neat diagram. UCompare OSI and TCP/IP Reference Models. UCompare Bus and Star Topologies with diagram. ACompare Mesh and Hybrid Topologies with diagram. AExplain the terms –

a. Error detection.b. Error correction.c. Redundancy.d. Forward error correction.e. Re-transmission.

U

5Illustrate with examples different types of errors. UIllustrate block coding with example. A

9


III

Mention some standard CRC Polynomials. UDiscuss the advantages of Cyclic Codes. AExplain briefly CSMA protocol. UWrite a note on CSMA/CD. AExplain with a diagram and an example, the process of error detectionusing block coding method.

A

10

With a diagram and an example, explain the structure of encoder and decoder in error correction.

A

Illustrate with a block diagram process of error detection in block coding.

A

Explain the design of CRC encoder and decoder, with an example. AWith an example, explain CRC division with polynomials. ADiscuss Controlled Access methods. U

IV

Describe the important factors to be considered when transmitting signal between two computers.

U

5

Explain coaxial cable with a diagram. AWrite a note on optical fibre cable. AExplain multimode transmission of optical fibre. UExplain single mode transmission of optical fibre. UDescribe the role of switches. AExplain the role of NIC. AList the benefits of WLAN verses Conventional LAN. AList and explain the uses of WLAN. AList the disadvantages of ARCNet. AExplain ARCNet data frame format. UExplain broadcasting in an Ethernet network. AExplain the features of Fast Ethernet. AExplain TCP/IP middle layer protocol. ADescribe SMTP protocol. AWrite a note on IMAP. AExplain different types of twisted pair cable with advantages and disadvantages.

A

10

List and explain coaxial, twisted pair and optical fibre connectors. AExplain with a diagram Repeaters and Hubs. ADescribe Wireless LAN with a diagram. AIllustrate with a neat diagram media access in Ethernet. ADescribe the Token Ring Data frame format. UIllustrate with a diagram media access in Token Ring. AExplain FDDI Lower layer protocol. AExplain HTTP and FTP Higher layer protocols. ACompare SMTP verses POP. A

V

Explain the components of an IP address. U5Explain the limitation of IP address classes. U

Discuss different sub netting considerations. UExplain the limitations of sub netting. UExplain the features of IP address of classes. U

10Explain the process of dividing a network into subnets. UExplain communication across subnets with examples. UDifferentiate between LAN and WAN technologies. UExplain the features of POTS. U

10


VI

Explain the advantages and disadvantages of Leased lines. A

5

Explain the working of ISDN. UDescribe the components of VSAT network. AIdentify and explain the different factors to be considered to access charges in WAN connectivity.

U

List the features of microwave connectivity. UDescribe the content of Routing table. UDifferentiate between Node–based Routing and Router–based Routing. AExplain briefly Routing Protocols. UDiscuss frame relay protocol. AIllustrate the working of VPN with a neat diagram. A

10

Describe VSAT network architecture and Access technologies. ACompare the features of Radio and Infrared waves. UCompare PPTP and IPSec. UExplain briefly transparent bridge. UExplain briefly Source Route Bridge. UDescribe different type of Gateways. ADiscuss PPP and X.25 Protocol. UExplain ATM reference model with a diagram. AIllustrate the working of DNS with a diagram. AIllustrate the working of WINS with a diagram. AIllustrate the working of DHCP with a diagram. A

Directorate Of Technical Education Karnataka State IS&E 15IS31P


Bengaluru

Course Title: Programming with C lab

Scheme (L:T:P) : 0:2:4 Total Contact Hours: 78Course Code:15IS31P

Type of Course: Tutorial and Practicals

Credit :03 Core/ Elective:Core


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:

Course OutcomeExperiment

linkedCL Linked

POTeaching

Hrs

CO1Demonstrate branching statements

1 to 3A 1 to 10 12

CO2Demonstrate looping statements

4 to 7 A1 to 10 18

CO3Experiment on functions

8 & 9 A 1 to 10 12

CO4Construct programs on arrays

10 to 12A

1 to 10 18

CO5Solve programs on structures

13 & 14 1 to 10 12

CO6 Write program on Preprocessor directive #define

15A

1 to 10 06

Total sessions 78





Programming with C lab 3 3 3 3 3 3 3 3 3 3Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low 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 function10 WAP to search for a given number in an array11 WAP to find the transpose of a given matrix12 WAP to addition two matrices13 WAP to create a structure with employee details and display the same14 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 activitiesNote: 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


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


Method WhatTo

whom

When/Where(Frequency

in the course)

Max Marks

Evidence collected

Course outcomes

Dir

ect A

sses

smen

t CIE(Continuous

Internal Evaluation)

IA Students Two tests (average of two tests)

10 Blue books 1,2,3,4,5

Record 10 Record

Report.

1,2,3,4,5

Student activity.

05

Total 25

SEE (Semester

End Examination)

End Exam

End of the course

50 Answer scripts at BTE

1,2,3,4,5

Indi

rect

Ass

essm

ent


Students Middle of the course

Feedback forms

1,2,3 Delivery of


End of the course

Questionnaires 1,2,3, 4 & 5 Effectiveness of Delivery

of instructions

& Assessment

Methods*CIE – Continuous Internal Evaluation *SEE – Semester End ExaminationNote:

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.



3 Application 70



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

Assessment Methods.



Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data






3





Performs all duties


4

Shares work equally






3


mates






3



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 Quantity1 PC systems (latest configurations with speakers) 202 Laser Printers 013 Networking (Structured) with CAT 6e / wireless

24 Port switches / Wireless RouterI/O Boxes for networking(as required)

03

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 function10 WAP to search for a given number in an array11 WAP to find the transpose of a given matrix12 WAP to addition two matrices13 WAP to create a structure with employee details and display the same14 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.



Bengaluru

Course Title: DBMS and GUI lab


Type of Course: Tutorial and Practical’s



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



linkedCL Linked

POTeaching

Hrs

CO1Explain the underlying concepts of database technologies. Design and implement a database schema for a given problem-domain.

1,2,3

U, A 1 to 10 03

CO2Apply Normalization to a database.

1,2,3 U, A1 to 10 03

CO3

Illustrate and query a database using SQL DML/DDL commands To motivate the students to relate all these to one or more commercial product environments as they relate to the developer tasks

1 to 17

A

1 to 10

48

CO4 Design, create, build, and debug Gambas /Visual Basic Database applications.

18A

1 to 1024

Total sessions 78





DBMS and GUI lab 3 3 3 3 3 3 3 3 3 3Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.



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_AUTHORSBOOK_ID AUTHOR_NAME

PUBLISHERNAME ADDRESS PHONE

BOOK_COPIESBOOK_ID BRANCH_ID NO_COPIES

BOOK_LOANSBOOK_ID BRANCH_ID CARD_NO DATE_HIRED DUE_DATE

LIBRARY_BRANCHBRANCH_ID BRANCH_NAME ADDRESS

BORROWERCARD_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


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

EMPLOYEEFname Minit Lname Ssn Bdate Address Sex Salary Super_ssn Dno

DEPARTMENTDname Dnumber Mgr_ssn Mgr_start_date

DEPT_LOCATIONSDnumber Dlocation

PROJECTPname Pnumber Plocation Dnum

WORKS_ONEssn Pno Hours

DEPENDENTEssn Dependent_name Sex Bdate Relationship

4 Illustrate the use of constraintsNOT NULLPRIMARY KEYUNIQUECHECKDEFAULTREFERENCES

5 DATA MANIPULATION : INSERTING VALUES INTO A TABLE 6 Illustrate the use of SELECT statement7 Conditional retrieval - WHERE clause8 Query sorted - ORDER BY clause9 Grouping the result of query - GROUP BY clause and HAVING clause10 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 manipulating16 Use COMMIT and ROLL BACK commands17 Use SAVEPOINT commands18. GUI


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 & Associates3. http://www.tutorialspoint.com/dbms/sql_overview.htm4. http://www.sql-tutorial.net/5. http://www.visualbasicbooks.com/vb6introtutorial.html6. http://gambas.sourceforge.net/7. http://gambasdoc.org/help

Suggested list of student activitiesNote: 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.



∑ 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 DeliveryThe course will be delivered through Demonstration and Practices



Method WhatTo

whom


in the course)

Max Marks

Evidence collected

Course outcomes

CIE(Continuous



10 Blue books 1,2,3,4

Record 10 Record

Student activity

05 Report 1,2,3,4

Total 25

SEE (Semester

End Examination)

End Exam

End of the course


1,2,3,4



Feedback forms

1,2,3(half session)

Delivery of course


End of the course

Questionnaires 1,2,3, 4 Effectiveness of Delivery

of instructions

& Assessment






3 Application 70


1. Blue books (10 marks)2. Record (10 marks)


3. Student suggested activities report for 5 marks4. Student feedback on course regarding Effectiveness of Delivery of instructions &

Assessment Methods.Format for Student Activity Assessment

DIMENSION

Unsatisfactory1

Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data






3





Performs all duties


4

Shares work equally






3


mates






3

TOTAL 13/4=3.2=4

*All student activities should be done in a group of 4-5 students with a team leader.



1 Creating and inserting records for minimum two tables. Use minimum 2 constraints

10

2 Executing minimum 3 queries 15

3 Build a GUI program for the table created with data grid view and options such as Add, Delete, Modify etc.

15

4 Viva-Voce 10

Total 50


Resource requirements for DBMS & GUI Lab(For an Intake of 60 Students [3 Batches])



03



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 ssn

Dno

ii) Dependent TableEssn 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) BOOKBook_id Title Publisher_name

ii) BOOK_AUTHORBook_id Author_name Gender

iii) PUBLISHERName 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).


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 ssn

Dno

ii) Project tableP_name Pno P_location

iii) Works_OnEssn Pno Hours


∑ 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_BorrowedBook_id Card_No Date_out Due_Date

iii) Book_BorrowerCard_No Name Address Phone


∑ 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


ii) Account

Account_no. Transaction_type Amount Balanceiv) Loan

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.


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_objectId_no Artist_ Name Year_ Created Title Art_ type Description

Art type can either Painting or Statue

ii) PAINTINGPaint_ type Base_ Material Style Price

Paint type can be oil or water colour or organic colourBase material can be paper, canvas or woodStyle can be Modern or Abstractiv) Statue

Material_type Height Weight Style PriceMaterial tyoe can be stone, wood, glassStyle 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”.


Account_no Name Address Phone

Loan _no Account_no Amount Loan_type Interest_rate

Directorate Of Technical Education Karnataka State 15IS33P ISE


BengaluruCourse Title: Linux Lab


Type of Course: Tutorial,Practical’s & Student

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.



linkedCL Linked

POTeaching

Hrs

CO1Demonstrate installation of Linux operating system and understand the importance of Linux.

1

U 2,3,4,8,10 06

CO2 Appraise various command usage of files and directories.

2 to 4 U, A 2,3,4,8,10 12

CO3 Show the working of vi editor in all its modes using various commands.

5 to 8U, A 2,3,4,8,10 12

CO4 Manage shell and processes using various commands.

9 to 12U, A 2,3,4,8,10 12

CO5 Write Shell scripts and C programs using vi editor.

13 to 21A 2,3,4,8,10 30

CO6Demonstrate Linux administration and its environment

22

A 2,3,4,8,10 06

Total sessions 78





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



PART-A

1. Introduction- Linux Architecture- Shell, Kernel, System calls.Linux installation- Steps for installing Linux Operating SystemComparison 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, fgrep8. Process Management commands.

∑ Process creation, status, Identifying process, ps -f & its options, ∑ Running process in background, Job control, and Process termination.


∑ 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 administrationManaging 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


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.


22. Write a C-program to prompt the user for the name of the environment variable, check its

validity and print an appropriate message.

References1. “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.



1Conduct a survey on the advantages of Linux Operating System and prepare a report of 2 to 3 pages.

2 Prepare Report of 2 to 3 pages on Linux Administration.

3Conduct a survey on other editors available in Linux Operating System with their features and prepare a report of 2 to 3 pages.

4Compare the file system in Linux with the file system in Windows and submit a report.

5Conduct a case study on handling various Networking Commands in Linux Operating System and submit a report.

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



Method WhatTo

whom

When/Where(Frequency in

the course)

Max Marks

Evidence collected

Course outcomes

CIE(Continuous


IA Tests

Students

Two IA Tests(Average of two tests will be computed)


Record Writing(Average marks of each exercise to be computed)

10

Record Book

1 to 6

Student Activities

05Activities

Report1 to 6

TOTAL 25SEE (Semester End Examination)

End Exam

End of the course

50Answer scripts

at BTE1 to 6


Students


Feedback forms

1 to 3 Delivery of

course


End of the course

Questionnaires

1 to 6 Effectiveness of Delivery

of instructions

& Assessment






3 Application 60



1. Blue Book(10 marks)2. Record (10 marks) 3. Student suggested activities report for 5 marks4. Student feedback on course regarding Effectiveness of Delivery of instructions &

Assessment Methods.Format for Student Activity Assessment


Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data






3





Performs all duties


4

Shares work equally






3


mates






3




1 Write the syntax of commands with examples from any one exercise from PART-A

10

2 Write any one program from PART-B 10

3 Execution of PART A commands and PART B Program with result

10+10

4 Viva voce 10

Total 50


Resource requirements for Linux Lab(For an Intake of 60 Students [3 Batches])



03



MODEL QUESTION BANK

PART -A

1) Write the syntax and execute the following commands.Command Name Syntax ExampleEchoLsCatRmCal

2) Write the syntax and execute the following commands.Command Name Syntax Examplels –lChmodChownln

3) Write the syntax and execute the following commands.Command Name Syntax ExamplePwdMkdirCdComm.Cmp

4) Write the syntax and execute the following commands.Command Name Syntax ExampleHeadTailCutPasteSort

5) Write the syntax and execute the following commands.Command Name Syntax ExampleUmountDfDuFdiskSu


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


a) Currently logged user name and his long name

b) Current shell

c) Your home directory

d) Your operating system type


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.


7. Write a shell script to print current month calendar and to replace the current day

number by ‘*’or ‘**’ respectively.


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.

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

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

3rd Semester

Course: Kannada Kali-1

Course Code:15KA3NT (2016-17)

No. of Credits:02 No. of teaching hours/week:02 No. of teaching hours/Semester:26

Mode of Assessment and Evaluation: Continuous Internal Evaluation (CIE)only. I.A Tests:30 Marks (3 Tests) Student activities: 20 Marks

Maximum Marks: 50 (CIE only) Minimum Passing marks:20 (IA Tests + Student activities)

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À¼À PÀæªÀiÁAPÀ Lesson

No

¥ÀoÀåªÀ¸ÀÄÛ«£À «ªÀgÀ - Curriculum Content

¸ÉªÉÄ¸ÀÖgï ¨ÉÆÃzsÀ£À DªÀ¢ü Total no.of Classes /Sem

PÀ£ÀßqÀ ¨sÁµÉAiÀÄ ¥ÀjZÀAiÀÄ/ªÀtðªÀiÁ¯É/’PÀ£ÀßqÀ PÀ°’AiÀÄÄªÀ «zsÁ£À PÀÄjvÀ ªÀiÁ»w 02 1 Introducing each other Personal Pronouns,

Possessive forms and Interrogative words 1. £ÁªÀÅ ªÀÄvÀÄÛ sÁµÉ 2. CPÀëgÀUÀ½AzÀ ¥ÀzÀUÀ¼ÀÄ

03

2 Introducing each other Personal Pronouns, Possessive forms – Yes/No Type Interrogative

02

3 About Ramayana. Possessive forms of nouns, dubitive question, Relative nouns. ¥ÀzÀUÀ½AzÀ ªÁPÀåUÀ¼ÀÄ

02

4 Enquiring about college. Qualitative and quantitative adjectives.

02

5 Enquiring about room. Predicative forms, 02


locative case. 6 Vegetable Market. Dative case, basic numerals. 02 7 About Medical college. Ordinal numerals, plural

markers. 02

8 In a cloth shop. Color adjectives, defective verbs

02

9 Plan to go for picnic - imperative, permissive and hortative

02

10 Enquiring about one’s family, Verb iru, and corresponding negation PÀ£ÀßqÀ avÀæ¥ÀlUÀ¼À°è£À CPÀëgÀUÀ¼À£ÀÄß UÀÄgÀÄw¹ N¢ ¢£À¥ÀwæPÉ NzÀÄªÀ ºÀªÁå¸À--¸ÀAªÀºÀ£À ªÀiÁzsÀåªÀÄzÀ §UÉÎ ¥ÀjZÀAiÀÄ

02

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Á¥À£À (I A Tests)

ªÀÄÆgÀÄ DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ¥ÀjÃPÉëUÀ¼ÀÄ (¸ÀgÁ¸Àj CAPÀUÀ¼À£ÀÄß ¥ÀjUÀtÂ¸ÀÄªÀÅzÀÄ)

30

02 PÀ£ÀßqÀ sÁµÁ PË±À¯Áå©üªÀÈ¢Ý ZÀlÄªÀnPÉUÀ¼ÀÄ (Student Activities)

ªÀÄÆgÀÄ ZÀlÄªÀnPÉUÀ¼ÀÄ (¸ÀgÁ¸Àj CAPÀUÀ¼À£ÀÄß ¥ÀjUÀtÂ¸ÀÄªÀÅzÀÄ)

20

MlÄÖ CAPÀUÀ¼ÀÄ 50 20


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. 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ÀÄ PÀ£ÁðlPÀ ¸ÀPÁðgÀ r¥ÉÆèªÀiÁ PÀ£ÀßqÀ ¥ÀoÀåPÀæªÀÄ Page 1

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 NAME

Teac

hing

De

part

men

t

COURSE /QP CODE

Teaching scheme Examination scheme Contact hours

TH TU PR TOTAL Credit Exam paper duration in Hrs

End exam Maximum CIE Marks (IA+SA )

Minimum Marks for passing. (IA + SA)

Max marks

Min marks

THEORY 1 KANNADA KALI-1

KA 15KA3NT 2 - - 2 2 - - - 50 20

2 TANTRIKA KANNADA -1

KA 15KA3KT 2 - - 2 2 - - - 50 20

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.


SEMESTER: IV COMMON TO ALL DIPLOMA PROGRAMMES C-15 Curriculum SL.N0

COURSE NAME

Teac

hing

De

part

men

t

COURSE /QP CODE



Sem End Exam Maximum CIE Marks (IA+SA )


Max Exam Marks

Min Passing Marks


KA 15KA4NT 2 - - 2 2 2 50 20 - -


KA 15KA4KT 2 - - 2 2 2 50 20 - -


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.


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ÀæªÀÄ 3rd Semester

Course: vÁAwæPÀ PÀ£ÀßqÀ -1

Course Code:15KA3KT (2016-17)


Mode of Assessment and Evaluation: Continuous Internal Evaluation (CIE)only. I.A Tests:30 Marks (3 Tests) Student activities: 20 Marks

Maximum Marks: 50 (CIE only) Minimum Passing marks:20 (IA Tests + Student activities)

¥À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À

ªÀåQÛ avÀæ) 02

vÀAvÀæeÁÕ£À 6 ªÀÄAUÀ¼À£À CAUÀ¼ÀzÀ°è – eÉ.¨Á®PÀÈµÀÚ 02

sÁµÁ PË±À®å ZÀlÄªÀnPÉUÀ¼ÀÄ

7 *ªÀiËTPÀ C©üªÀåQÛ: ¸ÀºÀd sÁµÁ §¼ÀPÉ: .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À±Àð£À)

06

°TvÀ ZÀlÄªÀnPÉUÀ¼ÀÄ 8 «¸ÀÛgÀuÉ: £ÀÄrUÀlÄÖUÀ¼ÀÄ-¥ÀzÀUÀ¼À£ÀÄß §¼À¹PÉÆAqÀÄ ¸ÀtÚ ªÁ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Áå¢)

06

DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ¥ÀjÃPÉëUÀ¼ÀÄ 02 MlÄÖ UÀAmÉUÀ¼ÀÄ 26


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À¼ÀÄ


¥À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Á¥À£À (I A Tests)

ªÀÄÆgÀÄ DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À ¥ÀjÃPÉëUÀ¼ÀÄ (¸ÀgÁ¸Àj CAPÀUÀ¼À£ÀÄß ¥ÀjUÀtÂ¸ÀÄªÀÅzÀÄ)

30

02 PÀ£ÀßqÀ sÁµÁ PË±À¯Áå©üªÀÈ¢Ý ZÀlÄªÀnPÉUÀ¼ÀÄ (Student Activities)

ªÀÄÆgÀÄ ZÀlÄªÀnPÉUÀ¼ÀÄ (vÁAwæPÀ ¥Àæ§AzsÀ/C±ÀÄ sÁµÀt/ZÀZÉð/vÁAwæPÀ PÉëÃvÀæUÀ¼À°è£À C«µÁÌgÀUÀ¼À §UÉÎ «±ÉèÃµÀuÉ EvÁå¢.) (¸ÀgÁ¸Àj CAPÀUÀ¼À£ÀÄß ¥ÀjUÀtÂ¸ÀÄªÀÅzÀÄ)

20

MlÄÖ CAPÀUÀ¼ÀÄ 50 20


¸ÀÆ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









1



Bengaluru

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 OutcomeOn successful completion of the course, the students will be able to attain below Course Outcome (CO):


POTeaching

Hours

CO1 Illustrate the concepts of pointers and dynamic memory allocation with programs. U,A

1 to 4 and 7 to 10

08

CO2Discuss different types of file operations and command line arguments to develop simple program. of lists and apply various operations on them.

U,A1 to 4 and

7 to 10

06

CO3 Describe data structures and different types of linked list U,A

1 to 4 and 7 to 10

10

CO4 Construct stacks and queues using the concept of Arrays and Linked lists. U,A

1 to 4 and 7 to 10

10

CO5 Illustrate the use of Binary Trees and its operations. U,A

1 to 4 and 7 to 10

08

CO6 Explain sorting and searching techniques with associated programs. U,A

1 to 4 and 7 to 10

10

Total sessions 52




Data Structures using C 3 3 3 3 - - 3 3 3 3

Course Title: Data Structures using C




Core/ Elective:Core


2


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.


UnitNo Unit Name


Marks Weightage

Marks Weightage

(%)R U A A

I Pointers and Dynamic Memory allocation

08 - 07 15 22 15.39

II Files 06 - 07 10 17 11.53

III Introduction to data structures & Linked lists

10 05 07 16 28 19.23

IV Stack & Queues 10 - 08 20 28 19.23

V Trees 08 - 07 15 22 15.39VI Sorting, Searching and

Application of Data Structures

10 - 08 20 28 19.23

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.

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

3


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 books1. Programming with ANSI-C, E. Balaguruswamy, Sixth Edition, Tata Mcgraw Hill for

Unit I and II2. Data Structures using C, E. Balagurusamy, Tata Mcgraw Hill for Unit III,IV,V,VI

References1. Programming with ANSI & Turbo C, Ashok Kamthane, Second Edition, Pearson

Education.2. Let us C, Yashavant P Kanetkar, 14th Edition, BPB publication, ISBN

97881833316303. 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 house5. http://spoken-tutorial.org/tutorial-

search/?search_foss=C+and+Cpp&search_language=English6. http://www.tutorialspoint.com/cprogramming/7. http://www.indiabix.com/online-test/c-programming-test/



https://sapnaonline.com/shop/Author/yashavant-p-kanetkar

http://www.tutorialspoint.com/cprogramming/

http://www.indiabix.com/online-test/c-programming-test/

4


1 Implementation of Double linked list and circular linked list

2 Implementation of Circular Queue

3 Implementation of function pointers4 Design and implement the Applications of Stack5 Quiz

Course Delivery



Method What To whom


Max Marks

Evidence collected

Course outcomes

CIE IA Three IA tests(Average of three tests will be computed)

20 Blue books

1 to 6

Student activities

05 Report1 to 6

Total 25SEE

End Exam

End of the course

100Answer scripts

at BTE1 to 6


Feedback forms1, 2, 3 Delivery

of courseEnd of Course Survey

End of the course

Questionnaires

1 to 6 Effectiveness of

Delivery of instructions & Assessment





3 Application 40


1. Blue books (20 marks)2. Student suggested activities report for 5 marks

http://yourbusiness.azcentral.com/remove-second-operating-system-pc-23702.html

5


3. Student feedback on course regarding Effectiveness of Delivery of instructions & Assessment Methods.



I/II SEM20



1234


MODEL QUESTION PAPER (CIE)Test/Date and

TimeSemester/year Course/Course Code Max Marks


IV SEM Data Structures Using C20




Question no

Question CLCO

PO

1 How is a pointer to an array different from an array of pointers? Explain with an example (5)

U 1 1,2

2 Write C program to swap two numbers using pointers. (5)OR

Give the difference between call-by-value and call-by-reference methods.

A 1 1,2

3 Explain different file accessing modes. OR

With an example, explain how to handle errors during I/O operations

U 2 1,2

4 Write a program to copy contents of one file to another. A 2 1,2

. Format for Student Activity Assessment

6



Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data






3





Performs all duties


4

Shares work equally






3


mates






3



IV- Semester

7


Course Title: Data Structures Using C


PART-A


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


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.


IV Semester

8


Course Title: Data Structures Using C


I

Define Pointer. Write its advantages and disadvantages. A

05

Explain the declaration and initialization of pointer variable with an example.

U

Discuss the use of address operator and indirection operator with pointers.

U

Explain the array of pointers with an example. UGive the difference between call-by-value and call-by-reference methods.

U

Differentiate between pointers as function arguments and pointers to function.

A

How is a pointer to an array different from an array of pointers? Explain with an example

U

Explain pointers and array using example. UExplain how an array can be passed to a function? AExplain in brief the different parameter passing mechanisms. AExplain pointer to structure with example. AWrite C program to swap two numbers using pointers. ADefine Dynamic Programming in C and its advantages. AGive the difference between malloc() and calloc() functions. UExplain free(). What are its advantages? UExplain character pointer as an argument to a function with an example. U

10

Discuss pointer as a function argument. With an example explain call-by-reference method.

A

With an illustration program explain pointers to structures. AWith an illustration program explain pointers to arrays. AWrite a program to illustrate pointer arithmetic’s. AWrite C program to compare 2 strings to check whether they are equal or not using pointer.

A

What are the advantages of pointer? Write a program using pointers to compute the sum of all elements stored in an array.

A

Explain Dynamic Memory allocation in C using memory map. AList and explain Dynamic Memory allocation functions in C. AWrit a program to illustrate memory allocation using malloc() function. AWrit a program to illustrate memory allocation using calloc() function. AWrit a program to illustrate reallocation of memory using realloc() function.

A

How are static and dynamic memory allocations different? Write a program to sort 10 numbers using malloc().

A

What is a file? Explain how to open and close a file. U

05Distinguish between the following functions:

i. getc and getcharii. printf and fprintf

R

With an example, explain how to handle errors during I/O operations. UExplain fseek() and ftell() functions. U

9


II

Differentiate between following functions:i. feof and ferrorii. printf and fprintfiii. getc and getw

U

10Write a program to copy contents of one file to another. AUse command line arguments to specify the file names. UList and explain Input /Output functions of file. UExplain different file accessing modes. U

III

Define Data structures. Mention different types of data structures. R

05

What are primitive data types? Explain UDistinguish between linear and non-linear data structures. RExplain data structure operations. UDefine Linked List. Mention the different types of Linked list. RExplain the representation of a Linked List in memory with a help of an illustration.

U

Explain the operations that are performed on Singly Linked List. UWrite the advantages and disadvantages of a Linked List. UCompare Singly Linked List with Circular Linked List. UCompare Singly Linked List with Doubly Linked List. U

Write the c functions to perform insert at end and display operations onSingly Linked List.

A

10

Write the c functions to perform insert at front and delete operations onSingly Linked List.

A

Write the c functions to perform insert at a given position operations on Singly Linked List.

A

Define Circular Linked List. Give its C representation. ADefine Doubly Linked List. Give its C representation. A

IV

Define stack. Explain how to represent a stack in C. U

05Explain push and pop operations of stack. ADefine queue. Explain the sequential representation of queue UWrite a note on queue. UDefine Priority queue. Differentiate ascending ord descending priority queue

A

Write C program to implement push and pop operation of stack. A

10

Define queue. List and explain types of queues. UWrite a program to implement queue in C. AWrite an algorithm to perform Queue insertion and deletion. ADefine Circular queue. Write the C implementation Circular Queue. ADefine Priority queue. Write the C implementation Priority Queue. ADefine Double Ended queue. Write the C implementation Double Ended Queue double.

A

Define Binary tree. Explain the method of representing binary trees. UExplain with an example how to perform deletion Aoperation on a binary tree. Define the following a) root node b) leaf node c) level of tree d) child R

10


V

node e)parent node. 05Define the following a)internal node b) sibling c) degree of the tree d)

depth of a tree e)path R

Construct a binary tree for the following data,16, 3, 8, 11, 1, 6, 9, 14, 2, 10, 17, 7 13

A

Explain Strictly Binary tree and Complete Binary Tree, with an example.

A

Explain Perfect Binary tree and Balanced Binary Tree, with an example. AWhat is binary tree traversing? Explain type of traversal with example. A

10Develop a recursive algorithm to traverse a binary tree in the following order i.e Inorder, Preorder and Post order.

A

Construct a binary tree for the following values and traverse the tree in preorder, inorder and postorder:

46, 76, 36, 26, 16, 56, 96

A

Define tree traversal. List and explain types of tree traversal. A

VI

Explain with an example the working of the merge sort. A

05

Explain the concept of straight selection sort. UWrite a note on simple insertion sort. UExplain Quick sort with example. AExplain Bubble sort with an example. AExplain the concept of Linear Search. UExplain the concept of Binary Search. UWrite a recursive C program to find the GCD of two numbers. AWrite a recursive C program to find the Factorial of a number. AWhat is recursion? Explain the properties of recursive definition UList the application of Queues. AList the application of Linked List. AList the application of Trees. ADevelop a C program to implement bubble sort method. A

10

Write a program to implement Insertion sort.A

Write a program to implement Selection sort. AWrite a c program to implement Linear Search. AWrite a c program to implement Binary Search. AList the application of stack. Write an algorithm to convert infix to postfix expression.

A

Give the postfix and prefix forms for the following expression. (a / b) * c – (d + g) $ f

U

Give the postfix and prefix forms for the following expression. a $ b * c – d + e / f / (g + h)

U

Evaluate the given postfix expression with the stack content,3+4*2/(9-5) ^ 4

U

1



Bengaluru

Course Title: OOP With Java




Core/ Elective:Core


PrerequisitesKnowledge 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



POTeaching

Hours

CO1 Discuss the OOP’s concept and Apply the concepts to design, implement, compile, test and execute simple Java programs.

U, A

2,3,4,8,108

CO2Explain the concepts related to classes and Use built-in methods of String and String Buffer classes.

U, A

2,3,4,8,1014

CO3 Define Inheritance and Discover Interface with programs

U, A

2,3,4,8,106

CO4 Illustrate Packages and articulate with simple programs

U, A

2,3,4,8,108

CO5 Illustrate multithreading concepts by experimenting with programs

U, A

2,3,4,8,10 8

CO6 Interpret different types of Exceptions by solving programs.

U, A

2,3,4,8,108

Total sessions 52


2




OOP With Java - 3 3 3 - - - 3 - 3Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.



UnitNo Unit Name


Marks Weightage

Marks Weightage

(%)

R U A A

I Introduction of Java 8 5 10 7 22 15.38

II Classes, Objects and Methods; Strings and String Buffer Classes

14 - 18 10 38 27.00

III Interface: Multiple Inheritance

6 - 6 10 16 11.53

IV Packages: Putting Classes Together

8 - 13 10 23 15.38

V Multithreaded Programming

8 - 13 10 23 15.38

VI Managing Errors and Exceptions

8 - 13 10 23 15.38

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 JavaProgram, 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.

3


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 10HrsIntroduction, Defining Interfaces, Extending Interfaces, Implementing Interfaces, AccessingInterface 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 booksProgramming with Java, 6th edition, Balagurusamy, Mc Graw Hill, ISBN 13- 9789351343202ISB 10- 9351343200

References1. Complete Reference Java J2se, Herbert Schildt, Tata McGraw Hill, ISBN

97800705987822. Java 6 Programming – Black Book Wiley India Pvt ltd3. Programming in JAVA2 – Dr. K. Somasundaram Jaico Publish4. Programming in JAVA – S.S. Khandare – S. Chand Publish

E-learning resources

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


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

4


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 Coordinator2. 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



Method What To whom


Max Marks

Evidence collected

Course outcomes

CIE IA Three IA tests (Average of three tests will be computed)



ActivityReports

1 to 6

Total 25

SEE End Exam

End of the course

100Answer scripts

at BTE1 to 6



Feedback forms

1 to 3 Delivery of course


End of the course

Questionnaires

1 to 6Effectiveness of Delivery of instructions & Assessment





3 Application 60


http://www.1000projects.com/hotel-management-system/java-mini-projects/

http://www.1000projects.com/e-bill-board/java-mini-projects/

http://www.1000projects.com/insurance-on-internet/java-mini-projects/

http://www.1000projects.com/online-mobile-contributor/java-mini-projects/


http://www.1000projects.com/online-restaurant/java-mini-projects/

http://www.1000projects.com/public-distribution-system/java-mini-projects/

http://www.1000projects.com/secure-e-banking-security/tech/


http://www.1000projects.com/district-medical-data-center/java-mini-projects/

5



Assessment Methods.



I/II SEM20



1234



Test/Date and Time



IV SEM OOP With Java20




Question no

Question CLCO

PO

1 Define the following OOPS concepts (5)a. Inheritance b. Polymorphism

U 1 1,2

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

6




Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data

Does not collect anyinformation relating to the topic





3





Performs all duties


4

Shares work equally






3


mates




Listens and contributes to the relevanttopic


3


7



IV- Semester

Course Title: OOP With Java Programming


PART-A


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


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 runnableInterface..

10. Write a program for throwing your own exception.

8


MODEL QUESTION BANK

Diploma in Computer Science & EngineeringIV Semester

Course Title: OOP with Java


I

Give the definition of object oriented programming and how it is different from procedure-oriented programming

U

05

Explain the organization of data and methods in an object oriented programming.

U

List the unique advantages of an object oriented programming UGive the definition of object and classes. Explain representation of an object with an example.

U

Define the following(i) Data abstraction (ii) Data encapsulation

U

Define the following OOPS conceptsb. Inheritancec. Polymorphism

U

Distinguish between objects and classes UDistinguish between Data abstraction & Data encapsulation UDistinguish between Inheritance &Polymorphism U

Distinguish between Dynamic binding & message passing. UExplain Dynamic binding & message passing UList any five advantages of OOP AList any five areas of application of OOPS technology AJava is platform independent language. Justify UDiscuss how Java is more secured than other language UList any features of Java. A

List any five major differences between C and Java. U

List any five major differences between C++ and Java UDiscuss the contributions of Java to the world wide web. AIllustrate Java communication with a web page AExplain the process of building and running Java application programs

A

Explain Java run time environment UWrite a simple Java program and explain AWrite a simple Java program to illustrate the use of mathematical functions

A

List the different sections of Java program structure U

I

List the advantages of OOPS. UDiscuss OOPs areas of application. ADefine the following.

a. Data abstraction.b. Data encapsulation.c. Inheritance.

R

Define the following. R

9


a. Polymorphism.b. Dynamic binding.c. Message Communication. 10

List and explain Java features. ADiscuss how Java differs from C & C++. UExplain the contributions of Java to the world wide web. With afigure illustrate how Java communicates with a web page.

U

Write a Java program to illustrate an application with two classes

A

Explain Java program structure with a diagram UExplain the features of Java. AList and explain Java statements. UDescribe in detail the steps involved in implementing a standalone program

U

Explain Java virtual machine. UDiscuss command line arguments in Java with an example program

U

With general syntax explain formatted input-output statements. Give example for each.

U

II

Define constructors. List its special properties U

05

Define object. Explain object creation from a class UDefine multilevel inheritance with an example UDefine hierarchical inheritance with an example UDescribe the syntax of single inheritance in Java UCompare and contrast overloading and overriding methods UDefine subclass constructor and the use of keyword super UDefine final classes and finalize methods UDefine abstract methods and classes UWrite the visibility control of Java classes. UCompare arrays and vectors UExplain any five string methods. UExplain any five string buffer methods UExplain the use of wrapper class in Java UDifferentiate between interfaces and classes UExplain class definition with fields and methods declaration U

10

Discuss object creation in Java. UWith an example explain accessing of class members AWrite a program to illustrate constructor ADiscuss the process of method overloading UDefine static member. Write a program to illustrate static members.

A

Write a program to illustrate method overloading AWrite a program to sort N elements of an array. AWrite a program to illustrate vectors. AWrite a program to illustrate wrapper classes A

III

Differentiate between interfaces and classes U

05Write the general syntax of creating an interface and explain UExplain the various forms of interface implementation UExplain how to access interface variables with an exampleWrite the similarities between class and interfaces U

10


Explain how to extend interfaces with an example A10With an example explain how to support multiple inheritance A

Write a program to implement interfaces. A

IV

Define a package. List Java API packages U

05

How to create and implement a package UExplain the naming convention of a package with an example UExplain how to access packages with an example AExplain how to add a class to a package with an example ADiscuss the various levels of access protection available for packages

U

Explain how to hide classes in a package UExplain static import and how is it useful UExplain Java API packages. U

10

Write a program to add a class to a package. AWrite a Package program to demonstrate basic arithmetic operators

A

Write a program to use inbuilt packages to calculate square root of a number

A

V

Define thread. R

05

Differentiate between multithreading and multitasking UExplain how to create thread by extending Thread class with an example

U

Explain how to stop and block a thread UDescribe complete life cycle of a thread UExplain yield(),sleep() and stop() methods of a thread UWrite a note on thread exceptions UHow do we set priorities for threads? UHow to create a runable thread? UDefine synchronization? When do we use it UDifferentiate between suspending and stopping a thread UExplain the different methods of creating threads U

10

Write a program to create a threads using a thread class AExplain thread creation by implementing runnable interface with an example

A

Write a note on inter- thread communication UWrite a program to create threads by extending thread class AWrite a program to create threads by implementing runnable interface

A

Write a program to set priorities for threads AWrite a program to implement yield(),sleep() and stop() methods of a thread

A

Explain the life cycle of thread. U

VI

Define exception and explain its purpose U

05

Explain types of errors with suitable examples UList the compile time errors UList the run time errors UIllustrate compile time errors with an example AIllustrate run time errors with an example AExplain the syntax of exception handling UWrite a program to illustrate nested try statements A

11


Explain nested try statements with an example AExplain multiple catch blocks with an example AHow many catch blocks can be used with one try block.,explain UCreate a try block that is likely to generate three types of exception and then incorporate necessary catch block to catch and handle them appropriately

A

Explain the finally block. When and how it is used with a suitable example

U

Explain how exception handling mechanism can be used for debugging a program

A

Define an exception called “No MatchException”that is thrown when a string is not equal to “ Ïndia”.Write a program that uses this exception

A

Explain how to throw our own exceptions UWrite a program to implement “ Throwing our own exceptions” AWrite a program to illustrate multiple catch blocks A

10Write a program to use multiple catch block statement. AWrite a program to illustrate nested try statement. AWrite a program for throwing your own exception A

1

Directorate Of Technical Education Karnataka State IS&E 15IS41T


Board of Technical Examinations, Bangalore

Course Title: Analysis and Design of Algorithm


15IS41TType of Course: Lectures, Self


Core/ Elective:Core


PrerequisitesBasic Knowledge of basic Mathematics ,English comprehension and C Programming.

Course Objectives:

1. Analyze the asymptotic performance of algorithms & Write rigorous correctness proofs for algorithms

2. illustrate with different algorithm design techniques (brute-force, decrease and conquer, divide and conquer)

3. Work with different algorithm design techniques (Greedy, dynamic programming) 4. Acquire basic knowledge of computational complexity.(Branch and bound and Back

tracking)

Course Outcome



Hours

CO1 Apply the concepts of designing and analysis of an algorithm. U,A 2,3,4,8,10 12

CO2 Analyze worst-case running times of algorithms using asymptotic analysis.

U,A 2,3,4,8,10 08

CO3 Comprehend to evaluate the algorithm performance.

U,A2,3,4,8,10 06

CO4 Illustrates the different methods of analyzing algorithms.

U,A 2,3,4,8,10 10

CO5 Explain the major graph algorithms and the various algorithm design and their analyses.

U,A 2,3,4,8,10 10

CO6 Explain what competitive analysis is and to which situations it applies. Perform competitive analysis.

U,A2,3,4,8,10 06

Total sessions 52


2




Data Structures using C - 3 3 3 - - - 3 - 3Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.



UnitNo Unit Name


Marks Weightage

Marks Weightage

(%)R U A A

I Introduction. 12 05 08 20 33 23.01

II Graphs Optimization Problems

08 - 07 15 22 15.39

III Brute Force method 06 - 07 10 17 11.53

IV Divide and Conquer, Decrease and Conquer

10 05 07 16 28 19.23

V Dynamic Programming, Greedy Technique

10 05 07 16 28 19.23

VI Backtracking , Branch and Bound

06 - 07 10 17 11.53

Total 52 15 43 87 145 100

UNIT I: Introduction 12 Hrs

1.Introduction 1.1.1 Algorithm Definitions 1.1.2 Fundamentals of algorithm problem solving 1.1.3 The efficiency of algorithms1.1.4 Best, Average and worst case analysis1.2. Methodologies for Analyzing algorithm1.2.1 Pseudo code1.2.2 Counting the primitive operations1.2.3 Algorithm Complexities

1.2.3.1 Space Complexity1.2.3.1.1 Analysis of space complexity1.2.3.1.2 How to calculate Space complexity?

1.2.3.2 Time Complexity 1.3. Asymptotic Notations

1.3.1 The Big-oh Notation1.3.2 The Big-omega Notation

3


1.3.3 The big-theta notation1.3.4 Ordering functions by their Growth rates

UNIT II: Graphs Optimization Problems 08 Hrs

2. Graphs Optimization Problems 2.1Graphs

2.1.1 Definitions and Representations2.1.2 Different types of graph2.1.3 Searching Methods: DFS and BFS2.1.4 Introduction to Trees2.1.5 Applications

2.2Optimization Problems 2.2.1 Feasible Solutions2.2.2 Optimal Solutions2.2.3 Important problem types: Sorting, Searching, string processing, graph problems,

combinatorial problems, Geometric problems, Numeric problems.

UNIT III: Brute Force method 06 Hrs3. Brute Force method

3.1 Selection Sort3.2 Bubble Sort3.3 Sequential Search3.4 Exhaustive Search

3.4.1 Travelling Salesman problem3.4.2 0/1 Knapsack Problem

UNIT IV: Divide and Conquer, Decrease and Conquer 10Hrs

4. Divide and Conquer, Decrease and Conquer 4.1. Divide and Conquer

4.1.1 Merge Sort4.1.2 Quick Sort4.1.3 Strassen’s Matrix Multiplication

4.2.Decrease and Conquer 4.2.1 Insertion Sort

4.2.1.1 Analysis of Insertion sort4.2.1.2 Implementation

4.2.2 Topological SortingUNIT V: Dynamic Programming, Greedy Technique 10 Hrs

5. Dynamic Programming, Greedy Technique 5. 1 Dynamic Programming

5.1.1 Warshall’s algorithm5.1.2 Floyd’s Algorithm5.1.3 0/1 Knapsack problem

5.2 Greedy Technique 5.2.1 Prim’s Algorithm5.2.2 Kruskal’s Algorithm5.3.3 Dijikstra’s Algorithm

UNIT VI: Backtracking , Branch and Bound 06 Hrs

4


6. Backtracking, Branch and Bound 6.1 Backtracking 06

6.1.1 The method6.1.2 Explicit and Implicit constraints6.1.3 Solution Space6.1.4 n-queens problem6.1.5 Travelling Salesman problem

6.2 Branch and Bound 6.2.1 Traveling Salesman problem

®Text Books1. Algorithms Design by Michael T.Good Rich and Roberto Tamassia, WILEY INDIA

EDITION 20092. Introduction to the design & Analysis of Algorithms by Anany

Levitin3. Analysis And Design of Algorithms by Nandagopalan, Sapna Publications

References1. Fundamentals of computer Algorithms by Ellis Horowitz Sartaj Sahani Sanguthevar

Rajasekaran.2. Design and Analysis of Algorithm by prabhakar gupta,vineet agarwal, monish varshney.3. Design Methods and Analysis of Algorithms by S.K.Basu by PHI .

4. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html5. http://www.slideshare.net/VinayChinnappaReddy/ada-complete-notes


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 1-2students. 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-ordinator2. Each group should conduct different activity and no repeating should occur.

1 Implement 4-Queens problem using Back Tracking.

2 Implement 4-Queens problem using Branching and Bounding.

3 Implement Travelling Salesman problem using Back Tracking.4 Implement Travelling Salesman problem using Greedy Technique5 Comparative study of all Asymptotic Notations6 Seminars7 Quiz etc.

Course Delivery

∑ The course will be delivered through lectures and Power point presentations/ Video∑ Course co-ordinator can prepare or download presentations of different topic’s.

http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html

http://www.slideshare.net/VinayChinnappaReddy/ada-complete-notes

5



What To whom


Max Marks

Evidence collected

Course outcomes

Direct Assessment

CIE IA Three IA tests (Average of three tests will be computed)

20 Blue books 1,2,3,4,5,6


ActivityReports

1,2,3,4,5,6

SEE End Exam

End of the course 100

Answer scripts at BTE

1,2,3,4,5,6

Indirect Assessment



Feedback forms

1,2& 3 Delivery of course


End of the course

Questionnaires

1,2,3,4,5 & 6Effectiveness of Delivery of instructions & Assessment


to the next higher digit. Questions for CIE and SEE will be designed to evaluate the various educational components (Bloom’s taxonomy) such as:


3 Application 60


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

Assessment Methods.



I/II SEM20



1234


6



Test/Date and Time



IV SEM Analysis and Design of Algorithms20

Year: 2015-16 Course code:15IS41T



Question no

Question CLCO

PO

1 Explain best, worst and average case analysis. U 1 1,2

2 f(n)= 100n+5,analyse for best case. A 1 1,2

3 Explain adjacency matrix representation of a graph with example U 2 1,2

4 Explain DFS and traverse the given graph using DFS. A 2 1,2

7




Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data






3





Performs all duties


4

Shares work equally






3


mates






3


8


MODEL QUESTION PAPER Code: 15IS41TDiploma in Information Science & Engineering

IV- Semester

Course Title: ANALYSIS AND DESIGN OF ALGORITHM

Time: 3 Hours Max Marks: 100PART-A

Answer any SIX questions each carries 5 marks. 5X6=30 Marks

1) Write an algorithm to find sum and average of three numbers.

2) What is time complexity? Explain with suitable example.

3) Explain node, vertex, edge in a graph with an example.

4) Explain Travelling salesman problem with suitable example using Brute force technique.

5) Explain and write an algorithm using decrease and conquer technique.

6) Sort the following numbers using Insertion sort.6 5 4 3 2

7) Write the Prim’s algorithm.8) Write the applications of Dynamic programming.9) Explain explicit and implicit constraints with example.

PART-BAnswer any SEVEN full questions each carries 10marks. 10X7=70 Marks

1) Explain the following with suitable examplesa)Big-oh notationb)Big-omega notation

2) f(n)= 100n+5,analyse for best, worst and average cases.3) Explain the following,

a)sorting b)searching c)graph problems4) Write an algorithm of DFS and explain.5) Write and explain Bubble sort algorithm with suitable example.6) Write the formulas and apply Strassen’s matrix multiplication for the following,

7) Obtain Topological ordering for the following graph.

1

2

4

3

5

6

7

9


8) Solve the following instance for 0/1 knapsack problem using Dynamic programming.

n = 4, p = [4, 2, 1, 8] w = [3, 1, 7, 9] M=10

9) Find the single source shortest path for the following graph

10) Explain n-queens problem and write the solution space tree for 4 queens

10


MODEL QUESTION BANKDiploma in Information Science & Engineering

IV Semester

Course Title: ANALYSIS AND DESIGN OF ALGORITHM


I

Define algorithm. Explain with an example. U

05

List the various steps involved in designing an algorithm. UWrite an algorithm to find sum and average of three numbers. AWrite an algorithm to find largest of three numbers. AWrite the advantages and disadvantages of an algorithm. UWrite a note on efficiency of algorithms. UExplain best, worst and average case analysis. UWhat is a pseudo code? Explain with an example. UExplain counting primitive operations with suitable example. AWhat is space complexity? Explain with suitable example. AWhat is time complexity? Explain with suitable example. AExplain big-oh notation with an example. UExplain big-omega notation with an example. UExplain big-theta notation with an example. Uf(n)=100n+5,analyse for worst case. Af(n)= 100n+5,analyse for best case. Af(n)= 100n+5,analyse for average case. AWrite a note on ordering functions by their growth rates. UF(n)= 100n+5,analyse for best, worst and average cases. A

10

Define algorithm. Explain the fundamental steps in solving any algorithm. UExplain best, worst and average case analysis with an example. A

Explain the followinga)algorithm with an exampleb)best, worst and average case of linear search

U

Explain the following with suitable examplesa)Big-oh notation b)Big-omega notation

A

Define graph. Explain its applications. AExplain node, vertex, edge in a graph with an example. UExplain adjacency matrix representation of a graph with example . UExplain adjacency lists representation of a graph with example. U

11


II

Explain DFS and traverse the given graph using DFS. A

05

Explain BFS and traverse the above graph using BFS. UExplain the pseudocode of BFS. UExplain the pseudocode of DFS . UExplain different types of trees with example. AExplain feasible and optimal solutions with example. AExplain the following.

a)sorting b)searching c)graph problemsU 10

Explain the following with example.a)DFS b)BFS

U

Define graph. Explain different types of graph representations with example. A

Write an algorithm of DFS and explain. UWrite an algorithm of BFS and explain. U

III Sort the following numbers using Selection sort.5 7 2 9 1

A

05

Sort the following numbers using Bubble sort.20 30 40 10 5

A

Write the algorithm for selection sort. UWrite the algorithm for Bubble sort. UExplain Sequential search algorithm with suitable example. AExplain Travelling salesman problem with suitable example using Brute force technique.

A

Explain 0/1 Knapsack problem with suitable example using Brute force technique

A

Write and explain Selection sort algorithm with suitable example. A

10

Write and explain Bubble sort algorithm with suitable example. AExplain the following with suitable examples using Brute force technique

a) Travelling salesman problemb) 0/1 Knapsack problem

A

Write the algorithm for Merge sort. UWrite the algorithm for Quick sort. UWrite the algorithm for Insertion sort. USort the following numbers using Merge sort.

8 4 1 3 2A

Sort the following numbers using Quick sort. A

12


IV

7 4 2 9 1

05Sort the following numbers using Insertion sort.6 5 4 3 2

A

Write the applications of divide and conquer technique. AWrite the applications of decrease and conquer technique. AWrite the applications of divide and conquer technique. AWrite the applications of decrease and conquer technique. AExplain divide and conquer technique. UExplain decrease and conquer technique. UWrite the formulas and apply Strassen’s matrix multiplication for the following, A

10

2. Explain Strassen’s matrix multiplication with suitable example. AObtain Topological ordering for The following

graph.

A

Write and explain Quick sort with suitable example using divide and conquer technique.

A

Write and explain Insertion sort with suitable example using decrease and conquer technique.

A

Explain Merge sort with suitable example using divide and conquer technique. A

V

Write a note on Dynamic programming. U

05

Write the Warshall’s algorithm. U

Write the Floyd’s algorithm. UWrite the Prim’s algorithm. UWrite the kruskal’s algorithm. U

Write the Dijkstra’s algorithm. U

Write the applications of Dynamic programming. A

Write the applications of Greedy technique. A

1

2

4

3

5

6

7

13


Obtain the minimum cost spanning tree for the graph in fig(a) using kruskal’s algorithm

A

Obtain the transitive closure for the following graph A 10

Obtain All pairs Shortest path for the following graph A

14


Obtain the minimum cost spanning tree for the following graph using Prim’s

algorithm

A

Find the single source shortest path for the following graph A 10

Solve the following instance for 0/1 knapsack problem using Dynamic programming n = 4, p = [4, 2, 1, 8] w = [3, 1, 7, 9] M=10

A

Solve the following instance for 0/1 knapsack problem using Dynamic programming

n = 3, p = [25,24,15] w = [18,15,10] M=20

VI

Explain the method of backtracking. U

05

Explain the method of Branch and bound. UExplain explicit and implicit constraints with example. UWrite the applications of Backtracking. AWrite the applications of Branch and bound. A

Explain travelling salesman problem using Backtracking. A 10Explain travelling salesman problem using Branch and bound A

Directorate of Technical Education Karnataka State Page 1

Government of Karnataka Department of Technical Education


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 guide the Engineering profession. R/U 5,6,7,8,10 10

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

U/A

5,7,8,10 09

CO3 Know the definitions of risk and safety also discover different factors that affect the perception of risk

R/U 5,6,7,10 05

CO4

Appreciate the Ethical issues and Know the code of ethics adopted in various professional body’s and industries

R/U

5,6,7,10 06

CO5 Justify the need for protection of human rights and to know about concept of women empowerment

R/U 5,6,7,8,10 8

CO6 Know the successful functioning of democracy in India

R/U 5,6,7,9,10 14

Total sessions 52

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

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 Study& Quiz Credit :04 Core/ Elective:

Core CIE- 25 Marks SEE- 100 Marks


COURSE-PO ATTAINMENT MATRIX

Course Programme Outcomes 1 2 3 4 5 6 7 8 9 10

PROFESSIONAL ETHICS &

INDIAN CONSTITUTION

- - - - 3 3 3 3 2 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 No

Unit Name

Hour Questions to be set for SEE

Marks weightage

weightage (%)

R U A

1 HUMAN VALUES 10 15 15 - 30 21

2 ENGINEERING ETHICS 09 10 15 - 25 17

3

SAFETY, RESPONSIBILITIES OF ENGINEERS

05 05 - 10 15 11

4

ETHICAL ISSUES IN ENGINEERING PRACTICE

06 05 05 5 15 11

5 HUMAN RIGHTS 8 15 5 20 13

6 INDIAN CONSTITUTION 14 25 15 40 27

Total 52 35 75 35 145 100

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


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.


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?


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?


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?


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?


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?



Bengaluru

Course Title: Data Structures lab





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



linkedCL Linked

POTeaching

Hrs

CO1 Demonstrate the concepts of pointers

1 to 5U 2,3,4,8,10 15

CO2 Design programs based on the concepts of structures and files.

6 to 9U/A 2,3,4,8,10 12

CO3

Demonstrate the concepts of Stack, Queue and Linked List and apply various operations on them.

10 to 15

U/A 2,3,4,8,10 21

CO4 Demonstrate the concept of binary tree traversal and its operations.

16U/A 2,3,4,8,10 06

CO5Design programs based on the concept of sorting and searching techniques.

17 to 20

U/A 2,3,4,8,10 24

Total sessions 78





Data Structures lab - 3 3 3 - - - 3 - 3Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.



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 recursion13 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 sort18 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.

Reference1. Data Structures using C by E. Balaguruswamy - Tata McGraw-Hill Education2. Data Structures using C by Aaron M Tenenbaum - Pearson Education India




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 DeliveryThe course will be delivered through Demonstration and Practices


Method WhatTo

whom


in the course)

Max Marks

Evidence collected

Course outcomes

CIE(Continuous




Record and 10 Record 1 to 5

Student activity

05Report.

Total 25

SEE (Semester

End Examination)

End Exam

End of the course


1 to 5



Feedback forms

1,2 Delivery of course


End of the course

Questionnaires 1 to 5 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.




3 Application 60



Assessment Methods.




Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data






3





Performs all duties

Performs all duties ofassigned team roles with presentation

4

Shares work equally






3


mates






3




1Writing one program from PART-A and one program from PART-B

10+10=20


3 Viva 10

Total 50


Resource requirements for Data Structures Lab(For an Intake of 60 Students [3 Batches])



03



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 recursion13 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 sort18 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.



Bengaluru

Course Title: OOP with Java Lab

Scheme (L:T:P) : 0:2:4Total Contact Hours:

78Course Code:15IS43P




PrerequisitesC Programming Knowledge.

Course Objectives

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

Course Outcome



linkedCL Linked

POTeaching

Hrs

CO1 Create and use classes and Objects.

1 to 7U, A 2,3,4,8,10 30

CO2 Demonstrate the methods of String, String Buffer, Vector and Wrapper Classes.

8 to 10U, A 2,3,4,8,10 15

CO3 Implement interfaces and inheritance.

11 to 13U, A 2,3,4,8,10 15

CO4 Demonstrate the use of packages.

14U, A 2,3,4,8,10 6

CO5 Implement Multithreading concepts

15U, A 2,3,4,8,10 6

CO6 Demonstrate programming techniques with exception handling.

16U, A 2,3,4,8,10 6

Total sessions 78

Legends: R = Remember U= Understand; A= Apply and above levels (Bloom’s revised taxonomy) Course-PO Attainment Matrix


OOP with Java Lab - 3 3 3 - - - 3 - 3Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.



LIST OF GRADED PRACTICAL EXERCISES


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

2Write a Java Program to define a class, describe its constructor, overload the Constructors and instantiate its object.

3Write a Java Program to define a class, define instance methods for setting and Retrieving values of instance variables and instantiate its object.

4Write a Java Program to define a class, define instance methods and overload them 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.

8Write a Java program to practice

- 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.

11Write a Java Program to implement inheritance and demonstrate use of method overriding.

12Write a Java Program to implement multilevel inheritance by applying various access controls to its data members and methods.

13Write a program to demonstrate

- use of implementing interfaces.- use of extending interfaces.

14Write a Java program to implement the concept of importing classes from user defined package and creating packages.

15Write a program to implement the concept of threading.

-by extending Thread Class-by implementing Runnable Interface

16Write a program to implement the concept of Exception Handling

- 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


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-3students.



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 ManagementS 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 SystemS 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


Method WhatTo

whom


in the course)

Max Marks

Evidence collected

Course outcomes

CIE(Continuous


IA

Students

Two tests (average of two tests)


Record 10

Record

1 to 6Student activity

05 Report

Total 25

SEE (Semester

End Examination)

End Exam

End of the course

50Answer scripts

at BTE1 to 6


Students


Feedback forms

1,2,3Delivery of

course


End of the course

Questionnaires

1 to 6 Effectiveness of Delivery

of instructions

& Assessment

Methods*CIE – Continuous Internal Evaluation *SEE – Semester End Examination

http://www.1000projects.com/hotel-management-system/java-mini-projects/



http://www.1000projects.com/insurance-on-internet/java-mini-projects/


http://www.1000projects.com/online-restaurant/java-mini-projects/




http://www.1000projects.com/service-call-management/tech/

http://www.1000projects.com/secure-location-system/java-mini-projects/

http://www.1000projects.com/generic-database-editor/java-mini-projects/

http://www.1000projects.com/crm-for-airline-industry/java-mini-projects/

http://www.1000projects.com/job-exchange/java-mini-projects/

http://www.1000projects.com/job-exchange/java-mini-projects/

http://www.1000projects.com/net-cackle/java-mini-projects/

http://www.1000projects.com/hospital-management-system/java-mini-projects/

http://www.1000projects.com/e-shopping-mall/java-mini-projects/

http://www.1000projects.com/e-shopping-mall/java-mini-projects/

http://www.1000projects.com/personalized-web-search-engine/java-mini-projects/

http://www.1000projects.com/e-health-care/java-mini-projects/

http://www.1000projects.com/telecom-connect-system/java-mini-projects/

http://www.1000projects.com/multi-message-communication-and-file-sharing-system-in-network/java-mini-projects/

http://www.1000projects.com/atm-database-system/java-mini-projects/

http://www.1000projects.com/atm-database-system/java-mini-projects/

http://www.1000projects.com/health-record-system-using-referral/java-mini-projects/

http://www.1000projects.com/typing-text-recognition/java-mini-projects/

http://www.1000projects.com/online-bus-ticket-booking/java-mini-projects/

http://www.1000projects.com/birthday-reminder-via-email/java-mini-projects/

http://www.1000projects.com/birthday-reminder-via-email/java-mini-projects/

http://www.1000projects.com/agriculture-management-system/java-mini-projects/

http://www.1000projects.com/agriculture-management-system/java-mini-projects/

http://www.1000projects.com/district-medical-data-center/java-mini-projects/


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.




3 Application 60



Assessment Methods.




Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data






3





Performs all duties


4

Shares work equally






3


mates






3





2 Executing any one program 20

3 Viva Voice 10

Total 50


Resource requirements for OOP with Java Lab(For an Intake of 60 Students [3 Batches])



03



MODEL QUESTION BANK

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

2Write a Java Program to define a class, describe its constructor, overload the Constructors and instantiate its object.

3Write a Java Program to define a class, define instance methods for setting and Retrieving values of instance variables and instantiate its object.

4Write a Java Program to define a class, define instance methods and overload them 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.

8Write a Java program to practice

- 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.

11Write a Java Program to implement inheritance and demonstrate use of method overriding.

12Write a Java Program to implement multilevel inheritance by applying various access controls to its data members and methods.

13Write a program to demonstrate

- use of implementing interfaces.- use of extending interfaces.

14Write a Java program to implement the concept of importing classes from user defined package and creating packages.

15Write a program to implement the concept of threading.

-by extending Thread Class-by implementing Runnable Interface

16Write a program to implement the concept of Exception Handling

- using predefined exception.- by creating user defined exceptions.




Prerequisites:

Knowledge of Computer Operation.

Course Objectives:

1. To analyze the running time of asymptotic algorithm.2. To develop algorithms for sorting, searching, insertion and matching.3. To identify and apply the concept of computational intractability.

Course Outcome



linkedCL Linked

POTeaching

Hrs

CO1Implement the various techniques and analyse the space and time complexity

1,4,5,6U, A 2,3,4,8,10 21

CO2 Illustrate the performance of graphs, dynamic programming

2,3,10U, A 2,3,4,8,10 18

CO3 Identify the problem and find the optimal solution using various algorithms

7,8,9U, A 2,3,4,8,10 21

CO4To understand techniques for designing algorithms, including the techniques of divide-and-conquer, and greedy.

11,12,

U, A 2,3,4,8,10 18

Total sessions 78


Course Title: Analysis and Design of Algorithm Lab








Analysis and Design of Algorithm 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


1 Sort a given set of elements using Selection sort. Hence find the time and space complexities required to search an element.

2 Implement DFS to check whether the Roads are connected to different places or not (use Fig (a) and Fig (c)).

3 Implement BFS to check whether the Roads are connected to different places or not (use Fig (a) and fig (c)).

4 Arrange ten students marks of ADA using Merge sort of Divide and conquer Technique.

5 Arrange age of n students by Implementing Quick sort using Divide and conquer Technique.

6 Arrange n students name using Insertion sort.7 For the following Graph in Fig (b) obtain the topological order in getting dressed by

a professor

8km

Fig (a)

JAYANAGAR

4km

2km

13km

6km

K.R.PURAM

V.V.PURAM

JPNAGAR

BTM

13km

BELT SHOE

PANT SOCKS


Fig (b)

8 Compute the transitive closure (whether the path exists between each cities or not) for the given directed graph in Fig (c) using Warshall’s algorithm.

Fig: (c)

9 Find out the shortest path from each area to all the remaining areas in Fig (c) using all pairs shortest path algorithm of Floyd’s.

10 A ship can carry up to 50 ton of load. If we have the following items to load with the respective profits, find out the maximum profit we can get using 0/1 knapsack problem solving algorithm of dynamic programming.

Fig (d)

50 ton

COTTONWOOL

SILK FUR

Weight= 10 ton 20 ton 20ton

30 ton

SHIP

JAYANAGAR

4k

2k

13k

6k

JPNAGAR

V.V.PURAM

8k

BTM


11 Find minimum cost spanning tree of a given undirected graph in Fig (e) using Prim’s algorithm.

Fig (e)

12 Find minimum cost spanning tree of a given undirected graph in Fig (e) using Kruskal’s algorithm.

Note: 1. Implement the entire program using C.

Reference

1) Introduction to the design & Analysis of Algorithms by Anany Levitin.2) Fundamentals of computer Algorithms by Ellis Horowitz Sartaj Sahani Sanguthevar

Rajasekaran.3) Analysis and Design of algorithms by A.M. Padma reddy.4) http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html5) http://www.slideshare.net/VinayChinnappaReddy/ada-complete-notes6) http://www.just.edu.jo/~basel/algorithms/Algo%20Slides/algo_ch22_graph_part3.pdf7) http://www.dfs.de/dfs_karriereportal/en/Career/Pupils/Life%20on%20the%20DFS%20Cas/8) http://www.guru99.com/how-to-crack-password-of-an-application.html9) http://resources.infosecinstitute.com/10-popular-password-cracking-tools/

3

21

5

3

2

4

1


Suggested list of student activitiesNote: 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.


1 GPS Navigation systems

2 Computer Networks

3 Web Crawlers

4 Facebook

5 Getting Dressed

6 Life on the DFS campus

7 Crack Password an application of brute force method

8 Parallelism

9 Memory access

10 Round off control

11 Recursion

12 Explicit stack

13 Stack size

14 Virtual Machines Migration based on Greedy Algorithm in Cloud Computing

15 Back tracking linux

16 Back tracking for Flow-shop

17 Digital Forensic analysis using backtrack

Course Delivery

The course will be delivered through Demonstration and Practices.



Method WhatTo

whom


in the course)

Max Marks

Evidence collected

Course outcomes

CIE(Continuous



10 Blue books 1,2,3,4,5

Record and Student activity.

10+05 Record and Report.

1,2,3,4,5

Total 25

SEE (Semester

End Examination)

End Exam

End of the course


1,2,3,4,5



Feedback forms

1,2,3 Delivery of


End of the course

Questionnaires 1,2,3, 4 & 5 Effectiveness of Delivery

of instructions

& Assessment






3 Application 60



Assessment Methods.




Developing2

Satisfactory3

Good4

Exemplary5

Score

Collection of data






3





Performs all duties


4

Shares workequally






3


mates






3






3 Viva Voice 10

Total 50

**Evaluation should be based on the screen output only. No hard copy required.


Model Question Bank


1 Sort a given set of elements using Selection sort. Hence find the time and space complexities required to search an element.

2 Implement DFS to check whether the Roads are connected to different cities or not (use Fig (a) and Fig (c)).

3 Implement BFS to check whether the Roads are connected to different cities or not (use Fig (a) and fig (c)).

4 Arrange ten students marks of ADA using Merge sort of Divide and conquer Technique.

5 Arrange age of n students by Implementing Quick sort using Divide and conquer Technique.

6 Arrange n students name using Insertion sort.

7 For the following Graph in Fig (b) obtain the topological order in getting dressed by a professor

Fig (b)

8 Compute the transitive closure (whether the path exists between each cities or not) for the given directed graph in Fig (c) using Warshall’s algorithm.

8km

Fig (a)

JAYANAGAR

4km

2km

13km

6km

K.R.PURAM

V.V.PURAM

JPNAGAR

BTM

13km

BELT SHOE

PANT SOCKS


Fig: (c)

9 Find out the shortest path from each area to all the remaining areas in Fig (c) using all pairs shortest path algorithm of Floyd’s.

10 A ship can carry up to 50 ton of load. If we have the following items to load with the respective profits, find out the maximum profit we can get using 0/1 knapsack problem solving algorithm of dynamic programming.

Fig (d)

11 Find minimum cost spanning tree of a given undirected graph in Fig (e) using Prim’s algorithm.

50 ton

COTTONWOOL

SILKFUR

Weight= 10 ton 20 ton 20 ton30 ton

SHIP

JAYANAGAR

4km

2km

13km

6km

JPNAGAR

V.V.PURAM

8km

BTM


Fig (e)

12 Find minimum cost spanning tree of a given undirected graph in Fig (e) using Kruskal’s algorithm.

3

21

5

3

2

4

1


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

4th Semester

Course: Kannada Kali-2

Course Code:15KA4NT (2016-17)


Mode of Assessment and Evaluation: Semester End Examination (SEE)only. No CIE.

Maximum Marks: 50 (SEE only) 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À¼À PÀæªÀiÁAPÀ Lesson

No

¥ÀoÀåªÀ ÀÄÛ«£À «ªÀgÀ - Curriculum Content

¸É«Ä¸ÀÖgï ¨ÉÆÃzsÀ£À DªÀ¢ü Total no.of Classes /Sem

Part-I 11 Plan to go for a movie. Comparative, non-past

tense, instrumental and ablative case 02

12 Conversation between Doctor & Patient. Potential forms, accusative case.

02

13 Enquiring about friend’s family 02


Past tense –d, and –t- and –id-, negation. 14 Conversation between friends – Past tense –k – T – D

and –id-v negation verbal noun 02

15 Routine activities of a Student. 01 16 About children’s education.

Continuous, Perfect tenses and negations. 02

17 Halebidu - Belur Relative participle, negation and Participle nouns.

02

18 Discussing about Examination and future plan- conditional and negative conditions.

03

19 Karnataka (Lesson for reading)(reading skill) 03 20 bEku bEDagaLu (Lesson for reading ( Reading skill) 03

Part-II

Kannada Scripts 03

ECA-word/sentence formation/letter/small essay writing

01

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À¼ÀÄ


¸É«Ä¸ÀÖ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.


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É:


¸É«Ä¸ÀÖ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.


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


(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


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ÀÄ.


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ÀÄ PÀ£ÁðlPÀ ¸ÀPÁðgÀ r¥ÉÆèªÀiÁ PÀ£ÀßqÀ ¥ÀoÀåPÀæªÀÄ Page 1


SEMESTER: III COMMON TO ALL DIPLOMA PROGRAMMES C-15 Curriculum SL.N0

COURSE NAME

Teac

hing

De

part

men

t

COURSE /QP CODE



End exam Maximum CIE Marks (IA+SA )


Max marks

Min marks


KA 15KA3NT 2 - - 2 2 - - - 50 20


KA 15KA3KT 2 - - 2 2 - - - 50 20


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.


SEMESTER: IV COMMON TO ALL DIPLOMA PROGRAMMES C-15 Curriculum SL.N0

COURSE NAME

Teac

hing

De

part

men

t

COURSE /QP CODE



Sem End Exam Maximum CIE Marks (IA+SA )


Max Exam Marks

Min Passing Marks


KA 15KA4NT 2 - - 2 2 2 50 20 - -


KA 15KA4KT 2 - - 2 2 2 50 20 - -


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.


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ÀæªÀÄ

4th Semester

Course: vÁAwæPÀ PÀ£ÀßqÀ -2

Course Code:15KA4KT (2016-17)


Mode of Assessment and Evaluation: Semester End Examination (SEE)only. No CIE.

Maximum Marks: 50 (SEE only) Minimum Passing marks:20

¥ÀoÀå ¥ÀæPÁgÀ ¥ÁoÀ ¥ÀoÀåzÀ ºÉ¸ÀgÀÄ/¯ÉÃRPÀgÀÄ/¥ÀæPÀluÉ ¸É«Ä¸ÀÖgï ¨ÉÆÃzsÀ£ÁªÀ¢ü UÀAmÉUÀ¼ÀÄ

PÁªÀå ªÀÄAdj-(§zÀÄPÀÄ ªÀÄvÀÄÛ ªÀiÁ£ÀªÀvÉ)

1 (PÁªÀå UÀÄZÀÒUÀ¼ÀÄ) (1) £À£Àß ºÀtvÉ-qÁ:f.J¸ï.J¸ï. (2) ªÀÄAPÀÄ wªÀÄä£À PÀUÀÎ-r.«.f

02

¸À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Ë±À®å-

ZÀlÄªÀnPÉUÀ¼ÀÄ 7 °TvÀ C©üªÀåQÛ: ¥ÀvÀæUÀ¼À gÀZÀ£É-ªÁåSÉå: ¥ÀvÀæzÀ ¨sÁµÉ, ±ÉÊ°, £ÀªÀÄÆ£É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ÀÄ.

06

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ÀæªÀÄ

¤gÀÆ¥ÀuÉ ªÀiÁqÀÄªÀÅzÀÄ. 06

MlÄÖ CªÀ¢ü 26 UÀAmÉUÀ¼ÀÄ


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É



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À


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






