Davanagere University Board of Studies in Computer ......Page 2 of 20 B.Sc Syllabus-2015 Board of...

of 20 B.Sc Syllabus-2015

Board of Studies in Computer Science, Davanagere University 08-01-2015

Davanagere University

Board of Studies in Computer Science

BSc Syllabus pattern for Computer Science

Semester

Paper Code

Paper Teaching Hours Marks

Theory Practical IA Exam Total

1 12SA74

Introduction to Computer Science and Logic Design

4 - 20 80 100

Basic Skills Lab - 3 - 50 50

2 12SB74

C Programming 4 - 20 80 100

C Programming Lab - 3 - 50 50

3 12SC74

Data Structures using C 4 - 20 80 100

Data Structures using C Lab - 3 - 50 50

4 12SD74

Object Oriented Programming Using C++ 4 - 20 80 100

Object Oriented Programming Using C++ Lab

- 3 - 50 50

5

12SE74/5

Database Management Systems 3 - 20 80 100

Database Management Systems Lab - 3 - 50 50

12SE74/6

Operating Systems 3 - 20 80 100

Operating Systems Lab - 3 - 50 50

6

12SF74/7

Java Programming 3 - 20 80 100

Java Programming Lab - 3 - 50 50

12SE74/8

Software Engineering and Computer Networks

3 - 20 80 100

Project Work - 3 - 50 50



BSc 1st Semester Introduction to Computer Science and Logic Design

Subject Code : 12SA74 Total Teaching Hours : 52 IA Marks : 20 Teaching Hours/Week : 04 Exam Marks : 80 Examination Hours : 03

1. Introduction to Computer Science and Architecture: Introduction, characteristics of computers, Generation of computers, Classifications of computers, the computer system, Applications of computers. Architecture: Introduction, CPU, memory, communication between various units of a computer system, the instruction format, instruction set, multiprocessor systems. 10 Hrs.

2. Memory: Primary memory: Introduction, memory hierarchy, Ram, types of RAM, ROM, and Types of ROM. Secondary memory: Introduction, classification of secondary storage Devices, magnetic tape, magnetic Disk, optical Disk, magneto-optical disk. 8 Hrs.

3. Introduction to Computer Programming Using HTML: Introduction to HTML, Providing Structured Format, Creating Your First HTML Page, Adding Title, Adding Different Headings, Adding Paragraphs and Emphasis, Forcing Line Breaks, Using Non-Break Spaces, Performing Text, Adding Special Characters, Creating Lists, Adding Links to other Pages, Adding links to Areas in the same page, Working with Images, Flowing Text around Images, Using Tables. 10 Hrs

4. Number Systems: Weighted and non weighted:- classification of weighted numbers Decimal,Binary,Octal and Hexadecimal Numbers, Base Conversation, addition and subtraction of binary numbers, 1’s and 2’s Compliments, Binary to Gray and Gray to Binary conversation,ASCIIcode. 8 Hrs

5. Boolean Algebra and Logic Gates: Boolean Laws,Boolean Theorems and Properties, DemorgansTheoreams,Basic Logicgates and Universal Gates(NAND,NOR and solving equations based on boolean algebra). 08 Hrs

6. Combinational Circuits: Adders:-Half and full adders using logic gates, Decoders, BCD to decimal,Encoder: Decimal to BCD, ,Multiplexer, Demultiplexer (Defination, List the Applications), flip-flops(SR,JK,D&T),registers(brief study of SIPO,SISO,PISO&PIPO). 8 Hrs.

Text Books: 1. Introduction to Computer Science, ITL Education solution Limited Published by Pearson

Education. 2. Active Server Pages and ASP.NET by Kris Jamsa Thomson Publication 3. “Digital Logic and Computer Design” by M.Morris Mano, Pearson Education, 2006.

Reference Books: 1. Digital Computers Fundamentals: Bartee T C.

2. Computer fundamentals: B Ram.



BSc 1st Semester Basic Skills Lab Subject Code : 12SA74 Total Teaching Hours : 39 IA Marks : - Teaching Hours/Week : 03 Exam Marks : 50 Examination Hours : 03

1. MS DOS: a. Internal Commands. b. External Commands: - More, Move, attrib, edit, Tree, Sort, deltree.

2. Introduction to MS-Word:

a. Creating Biodata, b. Designing Marks Card. c. Designing Time table. d. Job Application.

3. Introduction to MS-Excel:

a. Creating Employee Payroll. b. Students Marks List. c. Drawing Bar Charts. d. Drawing Pie Chart.

4. Introduction HTML programming: a. Linking Pages. b. Putting Images in HTML. c. Using Tables.

Text Book:

1. Working with MS-OFFICE 2000, content Development Group, chennai, Tata Mc Graw – hill. 2. TR Jagadeesh MA Jayaram, DS rajendra prasad, “A computer Laboratory Referral for diploma

and Engineering Students. Examination:

2 Questions may be chosen one from each of any two groups among Word, Excel, or HTML.

Student has to answer and execute both questions.

Marks Distribution:

Exam Marks

Practical Proper 20+20 =40

Viva 05

Report 05

Total 50



BSc 2nd Semester C Programming Subject Code : 12SB74 Total Teaching Hours : 52 IA Marks : 20 Teaching Hours/Week : 04 Exam Marks : 80 Examination Hours : 03

1. Computer Software: Introduction, Software – Definition, Relationship between Hardware &

Software, Software Categories- System Software, Application Software, Software

Terminology. Classification of programming languages, Assemble, Complier, Interpreter,

linker, loader, operating System.(only Definitions), Algorithms and flow charts. 10 Hrs

2. C Programming: Introduction, features basic program structure, character set, tokens,

keywords and identifier. Constants, variables, data types, variables declaration, symbolic

constant definition. Operators: Arithmetic, relational, logical, assignment, increment,

decrement, conditional, bitwise and special operators, Arithmetic expressions, evaluation of

expressing precedence of operators and associativity. Type conversions. Mathematical

functions, managing I/O operators – reading and writing a character, formatted I/O.

10 Hrs.

3. Decision making, Branching and Looping: Introduction, Sequential and Branching

Statements, Simple IF , IF-ELSE , Nested-IF, ELSE-IF ladder , switch statements, the ?:

operator, goto statements, while, do-while and for statements, break and continue

statements. 8 Hrs.

4. Arrays and Strings: Introduction, one and two dimensional arrays, array declaration and

initialization. String:- declaration and initialization of string variable, reading and writing

strings, string handling functions. 8 Hrs.

5. Function: Introduction, Need, Definition, Syntax of function Declaration, Return Values and

Their Type, Function Calls, Nesting of functions, function with arrays. 6 Hrs.

6. Pointers: understanding pointers, accessing the address of a variable, declaring and

initializing pointers, accessing a variable through its pointers. 4 Hrs.

7. Structures: Definition, Declaration, Syntax, Accessing members of a Structure, Initialization,

Structures within Structures, Structures and Functions, Definition of union and its general

form. 6 Hrs.

Text Books: (1) Programming in ANSIC – E.Balaguruswamy. (2) Computer Concepts and C programming Techniques: A. M Padma Reddy.

Reference Books:

(1) Let us C – Yashwantkanetkar. (2) Computer Concepts and C programming: P B Kottur



BSc 2nd Semester C Programming Lab Subject Code : 12SB74 Total Teaching Hours : 39 IA Marks : - Teaching Hours/Week : 03 Exam Marks : 50 Examination Hours : 03

1. WAP to find biggest of 3 numbers.

2. To simulate calculator array SWITCH statements.

3. WAP to find sum of first N numbers.

4. To generate prime numbers between two integers M and N.

5. To find the sum of odd positioned digits in the given integer.

6. WAP to generate fibanocci numbers between two integers P and Q.

7. WAP to cheek whether given number is palindrome or not.

8. To find the biggest and second biggest among N numbers (without using array).

9. To count the numbers of words, vowels, spaces and lines in the given text.

10. WAP to sort the given array in ascending order using linear sort

11. WAP to search an element using binary search.

12. To delete the repeated elements in an array.

13. WAP to add two matrices using Functions.

14. WAP to multiply two matrices using Functions.

15. To find the sum of each row and column in a matrix.

16. To find the norm of trace of a matrix.

17. To transpose the given matrix and check whether the transpose in same as the original matrix.

18. To read an array and count the number of even nos and odd nos in an array of size N.

19. To read an array and to find the biggest element in an array and with its position.

20. To sort the diagonal element of a square matrix.

Examination:

One Question has to be given from the above list (Carries 25 Marks).

One more question has to be given by the examiner by his choice and that question need not be in the list (Carries 15 Marks).


Marks Distribution:

Criteria Marks

Question from The List Examiner’s Question

Practical Proper

Writing Program 15 10

Execution 10 5

Total 40

Viva 05

Report 05

Total 50



BSc 3rd Semester Data Structures using C Subject Code : 12SC74 Total Teaching Hours : 52 IA Marks : 20 Teaching Hours/Week : 04 Exam Marks : 80 Examination Hours : 03

1. Structures, Pointers, and Unions: introduction, Arrays of structures, nesting of structures. Introduction to special features of C, Register variable, bitwise operator, bit fields, enumerations, command line arguments, macros, preprocessors statement, Dynamic memory allocation. 8 Hrs.

2. Stacks: Introduction, definition of a stack with various operations, stack implementation using arrays, applications of stack, conversions of expressions: conversion from infix to postfix, Infix to prefix, evaluation of postfix expression, stacks using structures. 8 Hrs

3. Recursion: Introduction, what is recursion, factorial of a number, Fibonacci series, GCD of two numbers, Tower of Honai, binary search, binomial coefficient, efficiency of recursion, comparison between iterative and recursive functions, properties of recursive functions. 4 Hrs

4. Queues: Introduction, different types of queues, implementation of ordinary queue, circular queue. 8 Hrs

5. Linked Lists: Introduction, Definition and linked representation, stack and Queues using Linked list, Other list structure: circular and doubly list (concepts only). 8 Hrs

6. Trees: Introduction, Definitions, Storage representation of a binary tree, Various operations on a binary tree using linked representation, tree traversals, Binary search tree (Insertion, Searching and other operations) 8 Hrs

7. Searching: Introduction, Linear Search, Binary search, searching an ordered table, indexed sequential search, and Interpolation search. Sorting: Introduction, Bubble sort, Merge sort, quick sort, Selection sort, Heap sort, Insertion sorts, Shell sort, Radix sort 08 Hrs.

Text Books:

1. Systematic approach to Data structures using C – A.M. Padma Reddy, Revised edition 2007 2. Programming in ANSI C - E. Balagursamy

Reference Books:

1. Datastructures and applications - Trembly and Sorenson 2. Data Structures using C, Aaron M. Fenenbaum, Yedidyah Langsam and Moshe J. Augestein,

Pearson education/PHI, 2006



BSc 3rd Semester Data Structures using C Lab Subject Code : 12SC74 Total Teaching Hours : 39 IA Marks : - Teaching Hours/Week : 03 Exam Marks : 50 Examination Hours : 03

1. Program to Read and Display Employees Information using array of Structure. 2. Program to implement a structure within a structure. 3. WAP to implement stack operations using structure. 4. WAP to implement queue operation using structure. 5. WAP to convert valid infix expression to valid postfix expression. 6. WAP to convert valid infix expression to valid prefix expression. 7. WAP to evaluate a postfix expression. 8. WAP to search an element in a given list of integers using binary search using recursion. 9. To find sum of elements of the given array using recursion.

10. WAP to sort elements in an array using Bubble sort. 11. WAP to sort elements in an array using Selection sort. 12. WAP to search an element in an array using Interpolation search. 13. WAP to implement a linked list to insert an element at begin and end of the list, delete

an element at begin and end of the list and display the list. 14. WAP to implement a stack operations (push, pop, display) using linked list. 15. WAP to implement a queue operations (Qinsert, Qdelete, Qdisplay) using linked list. 16. WAP to create a tree, traverse a tree in preorder, postorder, and inorder and search a

node in a tree using binary search tree. 17. WAP to sort elements in an array using Quick sort. 18. WAP to sort elements in an array using Heap sort. 19. WAP to sort elements in an array using Merge sort. 20. WAP to sort elements in an array using Radix sort.

Examination:




Marks Distribution:

Criteria Marks


Practical Proper


Execution 10 5

Total 40

Viva 05

Report 05

Total 50



BSc 4th Semester Object Oriented Programming Using C++

Subject Code : 12SD74 Total Teaching Hours : 52 IA Marks : 20 Teaching Hours/Week : 04 Exam Marks : 80 Examination Hours : 03

1. Introduction to OPP: Programming paradigms: -Procedure oriented programming (POP), Object oriented programming (OOP), Basic concepts of OOP and Features: - Objects, Classes, Abstraction and Encapsulation, Inheritance, Polymorphism, Dynamic Binding, Message Passing / Communication. Benefits of OOP, object oriented languages, Applications of OOP. 8 Hrs

2. C++ Programming: Introduction, C++ Features, C with classes, applications of C++, Data Types, Literals, constants, variable, pointer types, type definition, string types, constant qualifier, reference types, enumeration types, array types, input output operators, structure of C++ program, key words, symbolic constants, type compatibility, declaration of variable, reference variables, operators in C++, control structures. 8 Hrs

3. Functions: Overview of functions, return types, function prototyping, call by reference, call by value, return by Reference, inline functions, default arguments, constant arguments, function overloading, friend function and virtual function. 6 Hrs

4. Classes and Objects: Introduction, Limitations of C Structures, Specifying a Class, creating object, Defining a Member Function, Making an Outside Function Inline, Nesting of Member Functions, private member functions, Arrays within a Class, Memory Allocation for Objects, Static Data Members, Static Member Functions, Array of Objects, Objects as Function Arguments, Friendly Functions, Returning Objects, Constant Member Functions, Pointers to Members, Local Classes. 8 Hrs

5. Constructors and Destructors: Introduction, Constructors, Parameterized Constructors, Multiple Constructors in a Class, Constructors with Default Arguments, Dynamic Initialization of Objects, Copy Constructors, Dynamic Constructors, Constructing 2-D Arrays, Constant Objects, and Destructors. 6 Hrs

6. Operator Overloading and Type Conversion: Introduction, Definition, rules, unary operators overloading, and Binary operator overloading Using Member Function and friend functions. Mention operators, which are not possible to over load, Manipulation of Strings using Operators, type conversion. 8 Hrs

7. Inheritance and Templates: Introduction, definition, types of inheritance, virtual base class, abstract class. Defining derived class constructors, member classes: - nesting of classes. Templates: Introduction, class templates, class templates with multiple parameters, function templates, function templates with parameters. 8 Hrs.

Text Books:

1. Object oriented Programming with C++ -- E Balagurusamy 2. Object oriented Programming with C++, “P.B. Kotur” 3. Object oriented Programming with C++, “Rabort Laffer”



BSc 4th Semester Object Oriented Programming Using C++ Lab

Subject Code : 12SD74 Total Teaching Hours : 39 IA Marks : - Teaching Hours/Week : 03 Exam Marks : 50 Examination Hours : 03

1. Given that an Employee class contains the following members: Data members: Employee_number, Employee_name, basic, DA, IT, Net_salary. Member functions: to read the data, to calculate net_salary and to print data members. Write ctt program to read the data of N employees and compute Net_salary of each employee. (Dearness allowance (DA)=52% of basic and income tax (IT) =30% of gross salary, Net_salary = basic+DA-IT).

2. Define a STUDENT Class with USN, name, and marks in 3 tests of a subject. Declare an array of 10 STUDENT objects. Using appropriate functions. Find the average of two better marks for each student. Print USN, name and the average marks for all the students.

3. Write a c++ program to create a class called COMPLEX and implement the following overloading functions ADD that return a Complex number.

1. ADD (a, S2): where ‘a’ is an integer (real part) and s2 is a complex number. 2. ADD (S1, S2): where S1 and S2 are Complex numbers.

4. Define a class P to calculate remainder and class Q to calculate Quotient inherit the class P and Q to reverse the given integer and check for palindrome.

5. WAP to search an element in an array using template function for searching an integer, character and double.

6. WAP to create a template function for Quick sort and demonstrate sorting of integer and double.

7. WAP to create a class called STRING and implement the following operations. Display the results after every operation by overloading the operator <<. 1. STRING S1=”VTU”. 2. STRING S2=”BELGAUM”. 3. STRING S3= S1+S2 ;( use copy constructor).

8. WAP to create a class called OCTAL, which has the characteristics of an OCTAL number. Implement the following operations by writing an appropriate constructor and an over loaded operator +.

1. OCTAL h=x; where x is an integer 2. int y= h+k; where h is OCTAL object and k is an integer.

Display the OCTAL result by over loading the operator << and also display the values of h and y. 9. WAP to create a base class called STUDENT with data members USN, name and age. Using

inheritance, create classes UGSTUDENT and PGSTUDENT having fields as semester, fees and stipend. Enter the data for at least 5 students. Find the semester wise average age for all UG and PG students separately.

10. Write a Program to create a class called STACK using array of integers. Implement the following operations by overloading the operators + (plus) and – (minus).

A. s1 = s1 + element; where s1 is an object of the class STACK. Element is an integer to be pushed on to top of the Stack.

B. s1=s1--; where s1 is an object of the class STACK and -- operator pops the element. Handle STACK EMPTY and STACK FULL conditions. Also display the contents of the stack after

each operation by overloading the operator <<.

11. Write function using polymorphism: a. Reverse an integer. b. Reverse a floating-point numbers. c. Reverse a String.



12. WAP to read a String by overloading unary +. This function has to read String character at a time and after reading each character. Array index should be incremented by 1. Using this function implement String copy. Strings compare and String concatenation by overloading assignment (=), equality (==) and addition (+) operator respectively.

13. WAP to concatenate two Strings by overloading + operator then sort the concatenate String in alphabetical order by over loading < or > operator (use String and its length as operands).

14. Let ADD be a class with member function addmat(). MUL be a class with member function mulmat(). Let readmat() and printmat() be two friend functions to both the classes using the above concept. WAP to find the sum and product of two matrices function. Take different matrices for addition and multiplication.

15. Define a class to represent a bank account, which includes the following Data members: name of depositor, account number, balance account, type of account. Member function: initialize values, to deposit an amount, to withdraw an amount after checking the balance to display name, balance accno, type.

16. Write a class to represent a generic Vector (a series of values). Include member functions to perform the following tasks.

A. To create a Vector. B. To modify the value of given element. C. To modify by a scalar value. D. To display the vector in the form (10 20 30….).

Define a friend to add two Vectors. Test the program for at least two types of values

stored in the Vector.

17. WAP to implement the linked implementations of Queue using class templates for the operations Qinsert, Qdelete, Qdisplay and it also check for Qempty and Qfull.

18. A Bookshop maintenance the inventory of books that are begin at the shop. The list includes details such as author, title, prize, publisher and stock position. Whenever a customer’s wants a book the sale person inputs the title and author and the system searches the list and display whether it is available or not. If is it not, an appropriate message is displayed if it is then the system displace the book.

19. WAP to create a class called LIST (linked list) with member functions insert an element at the front of the list as well as to delete an element from the front of the list. Demonstrate all functions after creating a list object.

20. Write a C++ Program to create a base class called EXPRESSION. Using appropriate member functions convert a given valid infix expression into postfix form. Display the infix and postfix expressions.

Examination:



Student has to answer and execute both questions. Marks Distribution:

Criteria Marks


Practical Proper


Execution 10 5

Total 40

Viva 05

Report 05

Total 50



BSc 5th Semester DataBase Management Systems Subject Code : 12SE74/5 Total Teaching Hours : 52 IA Marks : 20 Teaching Hours/Week : 03 Exam Marks : 80 Examination Hours : 03

1. Introduction: application, database system vs. file system, view of data models-E-R data model, Relational, database languages, database users and administrators, transaction management, Database system structure, application architecture. 8 Hrs.

2. E_R Model: Basic-concepts, constraints, keys, Design Issues, E-R diagram, weak entity sets, Extended E-R features, Design of an ER database schema, Reduction of an E-R schema to tables, UML. 8 Hrs

3. Relational Model: Structure of Relational Databases, Relational Algebra, Extended Relational Algebra Operations, Modification of the database, Views. 8 Hrs

4. SQL: Background, Basic structure, set operation, aggregate functions, NULL values, sub queries, views, Modification of the Database, joined Relations, DDL. 12 Hrs

5. Normalization: Introduction, 1NF, 2NF and FDs, 3NF and BCNF, 4NF and MVDs, 5NF and PJNF, Closure of a set of FDs, MVDs, Loss less join 8 Hrs

6. Transaction Management: Introduction, Transaction concepts and properties, States, concurrent execution, Scheduling of Transactions, Operations Conflicts, Testing for serializability. 8 Hrs.

Text book:

1. “Database System Concepts” by Silberchatz-Korth-sudarshan , Mcgraw Hill-IV Edition

2. “Database Management Systems”, A Practical Approach (DBMS) by Rajiv Chopra.

References:

1. Navathe and Elmarri “fundamentals of database Systems”-Addison Wesley-200.

2. C.j. Data “introduction to Database systems” Addison-wesley.

3. Ullman “Principals of Data base systems” computer science press”.

4. Bipin C Desai “Introduction to Data base system” Galotia.



BSc 5th Semester DataBase Management Systems Lab

Subject Code : 12SE74/5 Total Teaching Hours : 39 IA Marks : - Teaching Hours/Week : 03 Exam Marks : 50 Examination Hours : 03

Consider the following database : 1. employee(emp_id, first_name, last_name varchar2(15), job_id, doj, salary, dept_id,

manager_id) 2. departments (dept_id,dept_name,manager_id) 3. customer (cust_id, first_name,last_name,address,city, phone, email) 4. salgrade (grade, highsal, lowsal)

Insert values into tables depending on the requirements for the queries.

1. Working with Table and data using another table. a. Create empsal table using first_name,last_name,salary of employee table. b. Copy data from employee to empsal table whose salary is more than 50000. c. delete all rows from empsal table. d. Copy firstname,lastname,salary of all rows from employee to empsal. e. delete rows from empsal whose salary is less than 70000;

2. Modifying table structure and updating data.

a. Create empsalary table using employee table. b. Add a new column grade to empsalary table. c. set grades for employees based on salary(d-salary<25000,c if salary between 50000and

25000, b-if salary between 100000 and 50000, a if salary morethan 1lakh). d. Drop the grade column;

3. Keys: a. Explicitly Adding Primary key: b. Adding a foreign key Explicitly using cascade option. c. Check the difference by deleting one row from departments: d. Dropping foreign key e. adding a foreign key explicitly using set null option. f. Dropping Primary key:

4. Using Where Clause(Comparison, between and set comparision). Create Employee table with (emp_id, first_name, last_name, job_id, doj, salary, dept_id, manager_id) and execute the following queries. a. Display employee ID, name, salary whose salary is more than 50000. b. Display employee ID, name, designation whose designation is ‘Asst Proff’. c. Display employee ID, Name, date of joining who has joined to duty between ’01-jan-

1991’ and ‘31-dec-2000’. d. Display employee ID, Name, whose employee id is not matching to any of (101, 106,

108, 111). 5. Using Where Clause(Matching Characters and NULL values).

Create Employee table with (emp_id, first_name, last_name, job_id, doj, salary, dept_id, manager_id) and execute the following queries. a. Display employee ID, Name whose name contains character ‘h’ in the 2nd position. b. Display employee information whose name contains character ‘n’ in any position. c. Containing ‘ha’ combination any where in first_name: d. Display employee information who does not have last name. e. Display employee information whose last name is not null.



6. Where Clause (Using Logical operators to join more than one conditions). a. Display employee information who is a proffessor and whose manager id is not in

(101,102) b. Display employee information who is working in department 3 and his salary is more

than 50000. c. Display employee information who is a proffessor or Principal d. Display employee information whose job_id is principal or Proffessor and department id

not equal to 4; 7. Formatting the output Result by putting Column aliases, using expressions and ordering

the Data. a. Display employeeID,First_name,designation,salary by putting appropriate Column

Aliases. b. Display first_name and Last_name concatenated using a space in between. c. Display each employees name and Annual salary. d. Display employee id,name and his salary in descending order of salary, if salary is same

for more than one they have to be sorted according to alphabetical order of name in ascending.

8. Using SubQueries in where Clause. a. (Set Membership) Display employee ID,name,dept_id who is manager in department

table. b. (Set comparison)

Display employee information who is getting more salary than any one of the employee in department no 5. Display employee information who is getting more salary than all of the employees in department no 5.

c. (Test for Empty Relations)Display employee information whose department is in department table.

9. Sub Queries in From Clause. a. Display maximum of total salary of any department. b. Display dept_id, sum of salary in each dept whose total salary is more than 100000. c. Display Total salary of each department whose department is not null. d. Display department name along with no of employees in the department.

10. Aggregate Functions: a. Display minimum, maximum, average, sum, of salary of all employees. b. Display minimum, maximum, average, sum, of salary given to employees and no. of

employees in each department: c. Display minimum, maximum, average, sum, of salary given to employees and no. of

employees under each manager: d. Display Dept_id,total salary for that department whose total salary is more than

1,50,000; 11. Using single row Functions:

a. Display First_name, remove ‘a’ from ends of first_name, and show length of first_name. b. Display first_name, and salary of employee rounded to thousandth place. c. Display employee name in small letters, Capital letters, and Initial letters capitals. d. Implement Substr(),Instr(),lpad(), and rpad() functions on first_name of employee table.

12. Joning More than one table. a. (Equi-Join)Display employee ID,first_name,job_id,dept_id from employee table along

with dept_name from department table. b. (Self–join)Display employee name along with his manager name in the same

department



c. (non-equi join)Display Employee name and his grade according to the grades fixed in the salgrades table.

d. Display employee name,salary and his department whose salary is more than 50000. 13. SQL Joins.

a. Display employee ID, Name, Dept_id and Dept name who have matching department in the corresponding department table.

b. Display employee ID, Name, Dept_id and Dept name who have matching department in the corresponding department table, along with the employee information who do not have departments assigned.

c. Display employee ID, Name, Dept_id and Dept name who have matching department in the corresponding department table, along with the Department Names which do not have any employees in it.

d. Display employee ID, Name, Dept_id and Dept name who have matching department in the corresponding department table, along with the employee information who do not have departments assigned and Department Names which do not have any employees in it.

14. Set Operators. a. Display Employee Names who are also Customers. b. Display Employee names along with customers eliminating repeated names: c. Display Employee names along with customers Allowing repeated names: d. Display Employee names who are not customers. e. Display Customers who are not employees.

15. Creating and working with views. a. Create a view to Display Emp_id,first_name,salary from employee. b. Insert a row to employee table using the view created. c. Create a view to display emp_id,first_name concatenated with last_name as Name,

job_id and his department name. d. Create a view to display department name along with maximum salary in the

department. Examination:

Any one set of questions may be given to student for examination.

Required tables has to be created by the student during examination

Table creation 10 marks.

Inserting values (at least 5) as required for the queries 10marks.

4 queries 20 marks.

Marks Distribution:

Exam Marks

Practical Proper 40

Viva 05

Report 05

Total 50



BSc 5th Semester Operating Systems Subject Code : 12SE74/6 Total Teaching Hours : 52 IA Marks : 20 Teaching Hours/Week : 03 Exam Marks : 80 Examination Hours : 03

1. Operating System: Introduction, early system performance, Multiprogramming:- time sharing, real time system, functions of operating systems, spooling. 8 Hrs

2. Process Management: Overview, Process Scheduling, Operations on Processes, IPC, Examples of IPC Systems, Communication in C/S Systems, Multithreaded Proamming, Overview, Multithreading Models, Thread Libraries, Threading Issues, OS Examples, Process Scheduling, Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Multiple-Processor Scheduling, Thread Scheduling, OS Examples, Algorithm Evaluation 10 Hrs

3. CPU Scheduling: Scheduling concepts, algorithms, performance criteria, FCFS, shortest job first, priority scheduling, round robin algorithm. 8 Hrs

4. Deadlock: Deadlock problems, deadlock characteristics, deadlock prevention and avoidance, Deadlock detection and recovery from deadlock. 8 Hrs

5. Memory Management: Single contiguous allocation, partitioned allocation, paging and segmentation. Virtual memory management (concept, advantages and disadvantages): Demand Paging, Copy-on-write, Page replacement, Allocation of Frames, Thrashing. 10 Hrs

6. File System: File Concepts, Access Methods, Directory Structure, File System Mounting, File Sharing, and Protection. 8 Hrs.

Reference Books:

1. Operating systems – Silbershatz and Galvin. 2. System programming and operating systems – Dhamadare



BSc 5th Semester Operating Systems Lab Subject Code : 12SE74/6 Total Teaching Hours : 39 IA Marks : - Teaching Hours/Week : 03 Exam Marks : 50 Examination Hours : 03

1. program to implement FCFS CPU scheduling Algorithm 2. program to implement SJF CPU scheduling Algorithm 3. program to implement Priority CPU scheduling Algorithm 4. program to implement RR CPU scheduling Algorithm 5. program to demonstrate FCFS Page replacement Algorithm 6. Program to demonstrate LRU Page replacement Algorithm 7. program to simulate a lexical analyzer 8. Program to check valid identifier 9. program to implement FCFS disk scheduling 10. program to implement Shortest Seek Time First disk scheduling

Examination:




Marks Distribution:

Criteria Marks


Practical Proper


Execution 10 5

Total 40

Viva 05

Report 05

Total 50



BSc 6th Semester Java Programming Subject Code : 12SF74/7 Total Teaching Hours : 52 IA Marks : 20 Teaching Hours/Week : 04 Exam Marks : 80 Examination Hours : 03

1. Java Evolution: Java Features, java and Internet, java and World Wide Web, web browsers,

overview of java language, Constants, Variables and data types, Operators and Expressions, Decision making and Branching, Decision making and looping. 12 Hrs

2. Classes, Objects and methods: Defining a class, Adding Variables, Adding Methods, creating objects, Accessing Class members, Constructors, Method Overloading, Inheritance: Extending a Class, Overriding Methods, Final Variables and methods, Final Classes, Abstract classes and methods, Visibility control, Arrays, Strings, and Vectors, Interfaces: Multiple inheritance 16Hrs.

3. Packages: putting classes together: Java API Packages, Creating Packages, Accessing a package, Using a package, Hiding classes Multi threaded programming: Creating Threads, Extending a Thread Class, Stopping and blocking a thread, Life cycle of a thread, Using thread methods, Thread Exceptions, Thread priority, Synchronization 8 Hrs

4. Managing Errors and Exceptions: Types of Errors, Syntax of Exception handing code, Multiple catch statement, Throwing our Exceptions 4 Hrs

5. Applet Programming: Local and Remote Applets, Building applet code, Applet life cycle, Creating an Executable Applet, Applet Tag Adding Applet to HTML File, Running the Applet, Graphics Programming: The Graphics class, Lines and Rectangles, Circles and Ellipses, Drawing Arcs 8 Hrs

6. Java database connectivity: Event handling, java Networking, A tour of swing, Introduction to java servlets, the collection frame work, java. util package 4 Hrs

Text Book:

1) Programming with java, by E. Balagurusamy, Tata M.C.Graw-Hill publishing company limited. 2) The complete reference java by Herbert Schildt , Tata M.C.Graw-Hill publishing company

limited.



BSc 6th Semester Java Programming Lab Subject Code : 12SF74/7 Total Teaching Hours : 39 IA Marks : - Teaching Hours/Week : 03 Exam Marks : 50 Examination Hours : 03

1. Java program to accept names as commandline arguments and convert them to capitals.

2. Java program to implement basic arithmatic binary operations.

3. Java program to enter names and sort in alphabetical order.

4. Java program to implement vector operations add,insert and displaying items. 5. Java program to implement method overloading and nesting of methods.

6. Java program to create class employee and super class college input and display employee

information using inheritance.

7. Java program to demonstrate interfaces.

8. Java program to implement matrix addition.

9. Java program to accept numbers as command line arguments and handle exception if data is non-numeric.

10. Java program to implement threads use yield(), stop() and sleep() methods 11. Applet program for addition of two numbers 12. Applet program for drawing rectangle, line, rounded rectangle and put appropriate labels. 13. Applet program for drawing oval, circle, arc and put appropriate labels. 14. Program to draw bar chart using applets. 15. Applet program to implement checkboxes and display the status of all checkboxes. 16. Applet program to accept student information and display.

Examination:



Student has to answer and execute both questions. Marks Distribution:

Criteria Marks


Practical Proper


Execution 10 5

Total 40

Viva 05

Report 05

Total 50



BSc 6th Semester Software Engineering and Computer Networks

Subject Code : 12SF74/8 Total Teaching Hours : 52 IA Marks : 20 Teaching Hours/Week : 04 Exam Marks : 80 Examination Hours : 03

1. Introduction to software engineering: Software, Software engineering, phases in software development, role of management and metrics terminologies and role of management in software design. 8 Hrs

2. Software Life cycle models: Build and Fix model, waterfall model, prototyping model, iterative Evolutionary development model, spiral model and RAD Model. 8 Hrs

3. Software Requirement specification: SRS, need for SRS, problem analysis- Analysis issues, structured analysis, Requirement specification – characteristics and components, validation. Design: Design objectives, design principles, module level concepts, structured design methodology, introduction to detailed design. 12 Hrs.

4. Coding and testing: programming practice – top-down and bottom-up, structured programming, programming style. Testing fundamentals, brief introduction to functional testing and structural testing. 12 Hrs

5. Computer networks: Introduction, goals of computer networks, Network hardware: Types: -Broadcast, point to point network, LAN, WAN, MAN, wirless network, Internet. 6 Hrs

6. Network Software: Design issues, connection oriented and connectionless services. Reference Model: OSI-ISO, TCP/IP, and nowell network: ARPANET. 6 Hrs

Text Books:

1. Software Engineering: KK Agarwal & Yogesh Singh. Reference Books:

1. An integrated approach to software Engineering – pankaj jalote. 2. Software engineering – a practitioners approach – Roger Pressman. 3. Computer networks- Andre s Tamenbaum.



BSc 6th Semester Project Work Subject Code : 12SF74/8 Total Teaching Hours : 39 IA Marks : - Teaching Hours/Week : 03 Exam Marks : 50 Examination Hours : 03

A Team of 1 to 4 students must develop the project. However, during the examination, each student

must demonstrate the project individually.

The Team may implement a project of their choice

The team must submit a Project Report that must include the following:

1. Introduction

2. Requirements

3. Software Development Process Model Adopted

4. Analysis and Design Models

5. Implementation

6. Testing and conclusion.

Examination:

Student has to write description about his project based on the questions given by the examiner.

Each individual of team member has to demonstrate the project. Marks Distribution:

Exam Marks

Demonstration 20

Viva 20

Report 10

Total 50

Davanagere University Board of Studies in Computer ......Page 2 of 20 B.Sc Syllabus-2015 Board of...

Documents

Transcript of Davanagere University Board of Studies in Computer ......Page 2 of 20 B.Sc Syllabus-2015 Board of...