GOVT SCIENCE COLLEGE HASSAN

1 Dept. of Computer Sci. And Applications ,GSC(Autonomous),Hassan-573201

GOVT SCIENCE COLLEGE HASSAN (AUTONOMUS)

REGULATIONS, SCHEME , SYLLABUS & CREDITS

Under Choice Based Credits System

For the course

I to VI Semesters

B.Sc – “Computer Science”

Revised w.e.f. Academic Year 2016-2017 and onwards

REGULATIONS & SCHEME OF STUDY FOR BSc.(COMPUTER SCIENCE)

Under Choice Based Credits System


Subject : Computer Science

B.Sc Syllabus

SEMESTER: 1

Sl.

No. Title

Code Remarks

Max.

Marks Credits

1. Programming concept using C COM101 Theory Exam 70

2. - ” - COM102 Theory IA 30

3. C Programming Lab COM103

Practical

Exam

30

4. - ” - COM104

Practical IA 20

150 4.5

SEMESTER: 2

Sl.

No. Title

Code Remarks

Max.

Marks Credits

1. Advanced C & Data Structure

programming COM201

Theory Exam 70

2. - ” - COM202 Theory IA 30

3. Data Structures Programming Lab COM203

Practical Exam

30

4. - ” - COM204

Practical IA 20

150 4.5

SEMESTER: 3

Sl.

No. Title

Code Remarks

Max.

Marks Credits

1. Object Oriented Programming with

C++

COM301 Theory Exam 70

2. - ” - COM302 Theory IA 30

3. C++ Lab COM303 Practical Exam

30

4. - ” - COM304

Practical IA 20

150

4.5


SEMESTER: 4

Sl.

No. Title

Code Remarks

Max.

Marks

Credits

1. Database management system

COM401 Theory Exam 70

2. - ” - COM402 Theory IA 30

3. DBMS Lab COM403

Practical Exam 30

4. - ” - COM404

Practical IA 20

150

4.5

SEMESTER: 5

Sl.

No. Title

Code Remarks

Max.

Marks

Credits

1. Operating System and System Software COM501 Theory Exam 70

2. - ” - COM502 Theory IA 30

3. Linux Lab . COM503

Practical Exam 30

4. - ” - COM504

Practical IA 20

5. Java Programming COM 505 Theory Exam 70

6. - ” - COM 506 Theory IA 30

7. Java programming Lab COM 507 Practical Exam 30

8. - ” - COM508 Practical IA 20

300

9

SEMESTER: 6

Sl.

No. Title

Code Remarks

Max.

Marks

Credits

1. Data Communication and

Networks COM601

Theory Exam 70

2. - ” - COM602 Theory IA 30

3. Project Work COM603

Practical exam 30

4. - ” - COM604

Practical IA 20

5. Analysis and Design of Algorithms COM 605 Theory Exam 70

6. - ” - COM 606 Theory IA 30

7. Algorithmic Lab COM 607 Practical Exam 30

8. - ” - COM608 Practical IA 20

300 9


Scheme of Marks Distribution (B.Sc)

Theory Question Paper Pattern &Marks Distribution

• SEMESTERS I, II, III, IV, V & VI

• There will be four Parts A, B, C and D.

• Part A is from Unit 1, Part B is from Unit 2 and Part C is from Unit 3.

• Part D is Conceptual question.

• Part A, B, C each is 22 Marks and Conceptual is for 04 Marks.

• Total 22 (Unit 1) + 22 (Unit 2) + 22 (Unit 3) + 04 = 70 Marks.

PART A, B ,C and D

Each Part (UNIT) Marks Distribution

• 2 mark questions – Total 4 To be answered 3 2 × 3 = 6 marks

• 6 mark questions – Total 3 To be answered 2 6 × 2 = 12 marks

• 4 mark problems – Total 3 To be answered 1 4 × 1 = 4 marks

• 2 mark questions (Conceptual) – Total 3, To be answered 2, 2 × 2 = 4 marks

A conceptual question to be asked from each unit is 1 question. Answer any two out of 3 questions.

Grand Total [A + B + C + D (Conceptual)] = 70 marks


IA Marks - Theory

A. Semesters I, II, III, IV, V & VI (i) COMPONENT 1 = 15 Marks

(ii) COMPONENT 2 = 15 Marks

COMPONENT 1 -Average of TWO tests

COMPONENT 2 -SEMINARS/PROJECTS/QUIZ/ASSIGNMENTS

IA = COMPONENT 1 + COMPONENT 2 = 30 Marks

Scheme of Marks Distribution (B.Sc)

IA Marks - Practical Semester, II, III, IV, V & VI

Practical internal test 10 marks

Evaluation of Practical Records

Observation_+ Record 10 marks

Total 20 marks

SCHEME OF EVALUATION FOR PRACTICAL EXAMINATION

There will be two questions. A candidate has to prepare procedures for both the

Questions and execute any one of examiner’s choice

Procedure Development – 10x2=20 Marks

Implementation- 6x1=6 Marks.

Viva =4 Marks

VI Semester Project work. C1-synopsis-10

C2-Report-10

C3-Viva-30


B.Sc,SEMESTER -1

Programming Concept Using C

CSA 01 Teaching Hours 15 Weeks X 3Hrs/ week =45 hrs/Semester

UNIT 1 15 HOURS

BASICPROGRAMMING CONCEPTS- Algorithm, Flowcharts, Modular Programming and structured

programming.

INTRODUCTION TO C LANGUAGE-History, Features and Applications of ‘C’. Basic structure of ‘C’

programs.

PROGRAMMING PRELIMINARIES – ‘C’ Tokens, keywords, and identifiers, constants, variables,

datatypes, declaration of variables, assigning values to variables, defining symbolic constants

UNIT 2 15HOURS

OPERATORS AND EXPRESSIONS – Various operators and expressions, Operator precedence

with example programs.

INPUT-OUTPUT STATEMENTS – various types of standard input output statements, standard

mathematical functions, with example programs.

CONTROL STRUCTURES – Decisions making- Different forms of if statements, switchstatements,

unconditional branching statements (with example programs), Loopingstatements with example

programs.

UNIT 3 15 HOURS

ARRAYS– Definitions and need of arrays, 1-D and 2-D arrays with example programs.

STRING HANDLING – Declarations, Initialization, reading and writing of strings,operations and string

functions with example programs.

FUNCTIONS – Definitions and need of functions. Library functions, user defined functions in detail,

function declaration and prototypes call by value and call by reference, functions and arrays, recursion,.

STRUCTURES AND UNIONS – Definition and use of structures. Declaring, Initializing and Accessing

Structure member, Introduction to Union.

Reference Books:

1. Programming in C – Padma Reddy

2. Let Us C – Yashwanth Kanetkar.

3. Problem Solving with C, M.T. Somashekara, PHI Learning, New Delhi, 2009

4. Programming in C – E Balaguruswamy, Tata McGraw Hill Publications.

5. Computer Concepts and C- P B Kotur.


C Programming Lab CSA 03

Practical Hours: 15 Weeks x 3Hours/Week=45 Hours/ Semester.

Part A

1. Program to pick out the biggest and smallest number among three given numbers.

2. Program to find sum of even and odd numbers separately in the given list.

3. Program to find largest and smallest of N numbers

4. Program to find the roots of the quadratic equation using nested if.

5. Given two numbers, program to perform arithmetic operations using switch statement.

6. Program to generate Fibonacci series up to N numbers using do – while loop.

7. Program to find the reverse of the given number. Also sum and count the number of digits and check

whether the given number is palindrome or not using while –do loop.

8. Program to generate prime numbers using for loop.

9. Program to check whether the given number is factorial of a number or not.

Part B

10. Program to insert a sub-string into a given string.

11. Write a C Program to accept a sentence and convert all lowercase characters to upper case and vice –

versa.

12. Program to add and subtract two M x N matrices.

13. Program to multiply two M x N matrices.

14. Program to find trace and norm of a square matrix and print its principle diagonal elements.

15. Program to exchange principle and secondary diagonal elements of a square matrix.

16. Program to find the factorial of a number using recursion.

17. Program to swap two number using functions.

18. Program to read and write information of an employee using structure.


SEMESTER- 2 ADVANCED C & DATA STRUCTURE PROGRAMMING

CSB 01

Teaching Hours 15 Weeks X 3Hrs/ week =45 hrs/Semester

UNIT 1 15 HOURS

Pointers – Introduction, declaring and initializing a pointer, accessing a variable through its pointer.

Pointer expressions, pointer increments and scale factor, pointers and arrays, pointers and functions with

example programs.

File Handling: - Introduction defining and opening a file, closing a file, input/output operations on files,

error handling during input/output operations, random access to files with examples.

Dynamic memory allocation – MALLOC, CALLOC, REALLOC, FREE with examples, Pre-processing

directives, macro with arguments

Sorting- Selection sort, Bubble Sort,Searching- Sequential and Binary searching

UNIT 2 15HOURS

Linear Data Structure and their sequential storage representation

Concept and terminology for non-primitive Data structures, Storage structures for arrays, Various

operations on Arrays-Traversal, Insertion, Deletion,.

Stacks, Definitions and Concepts, Operations on stacks, Applications of stacks- Recursion, Infix to

postfix, Evaluating postfix expressions,

Queues-Linear and circular Queue. Pointers and Linked Allocation,

Linked linear lists- Operations on Linear lists using singly linked storage structures-Insertion and

Deletion operations circularly linked linear lists-memory representation,

UNIT 3 15 HOURS

Nonlinear Data Structures

Trees - Introduction as non-linear data structure, Concepts of node, Terminal node, Depth, General Tree,

Definition for Binary Tree, Left Skewed Tree, Right Skewed Tree, memory representation using Arrays

and Linked List, Tree Traversal Algorithms- Pre-order , In-order, Post-order and Implementation of Tree

Traversal Algorithm

Graphs – Introduction, Definition, Terminology, Representation, Traversal.

Reference Books: 1. An Introduction to Data Structures with Applications 2nd edition - J.P.Trembly and Sorenson, McGraw

Hill 2013.

2. Dromey-How to solve it by computer, PHI.

3. Data Structures using C- Padma Reddy.

4. Data structures using C & C++ by Yedidyah Langsun, Moshe J Augenstein, Tenenbaum, Second

Edition, Prentice Hall of India Ltd.

5. Problem Solving with Data Structure, Schaum Outline Series.


Semester 2

Data Structures Lab

CSB 03 Practical Hours: 15 Weeks x 3Hours/Week=45 Hours/ Semester.

Part - A

1. Write an interactive program to sort an integer array in ascending order using pointer.

2. Program to read and write information of an employee using a file.

3. Write an interactive program to insert an element at the given position and delete an element at the

specified position in the given array.

4. Write an interactive program to search an element in the given linear array using linear and binary

searching technique.

5. Program to implement Tower of Hanoi problem

Part – B

6. Write an interactive program to implement the following operations on stack using arrays

a. PUSH

b. POP

7. Write an interactive program to perform insertion and deletion operations in Linear Queue using

arrays.

8. Write an interactive program to perform insertion and deletion operations in Circular Queue using

arrays.

9. Write an interactive program to insert a node in a linked list at the front, delete a node from the rear

and display.

10. Write an interactive program to implement preorder, post order and in order traversal of a binary tree

using linked list.


SEMESTER- 3

Object Oriented Programming with C++

CSC 01

Teaching Hours 15 Weeks X 3Hrs/ week =45 hrs/Semester (Theory

Unit- 1 ( 15 Hours)

1. Introduction to C++ Object Oriented Technology, Disadvantages of Conventional Programming,

Programming Paradigms, Comparison of C++ with C, Advantages and key concepts of OOP, Console

Input /Output in C++: Variables in C++, Reference Variables in C++, Function Prototyping, Function

Overloading, Default Values for Formal Arguments of Functions. Inline functions.

2. Classes and Objects: Introduction to classes and objects, Structures in C, Structures in C++,Classes in

C++, Declaring Objects, The public , private and protected keyword, Member Functions, Making an

Outside Function inline, Static Data Members and Member Functions, Array of objects. Objects as

Function Arguments ,Friend Functions, The const Member Function, Pointer to member.

3.Operator Overloading and type Conversion: Introduction, , Overloading Unary Operator, Operator

Return Type, Constraint On Increment and Decrement Operator, Overloading Binary Operator, Type

Conversion.

Unit- 2 ( 15 Hours)

4.Constructors and Destructors :Characteristics of Constructors and Destructors, Applications of

Constructors, Constructors with Arguments, Overloading Constructors, Constructors with Default

Arguments, Copy Constructors, Destructors.

5. Inheritance: Introduction, Defining deriver classes, Protected Data with Private Inheritance, Types

of Inheritance: Single Inheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical

Inheritance, Hybrid Inheritance, Virtual Base Classes, Abstract classes, Constructors in derived classes.

6.Console I/O Operations: C++ streams, C++ stream classes, Unformatted I/O operations, Formatted

I/O operations, managing output with manipulators.

Unit- 3 (15 Hours)

7. Files: Classes for file stream operations, opening and closing a file, detecting end of file, more about

open(): file modes, file pointers and their manipulations, sequential input and output operations.

8. Exception Handling: Introduction, Principles of Exception Handling, The keywords- try, throw and

catch, Exception Handling Mechanism, Multiple Catch Statements, Catching Multiple Exceptions,

Rethrowing exceptions.

9.Templates : Introduction, Need of Template, Definition of Class Template, Normal Function

Template.

Member function templates.

Text Book:

E Balagurusamy, Object Oriented Programming with C++, 5th Edition, Tata McGraw hill Publication.

Reference Books:

1. D Ravichandran, Programming with C++, Third Edition, McGraw hill 2011

2. Robert Lafore, Oriented Programming in C++, Galgotia Publications Pvt. Ltd, 2006.


C++ Lab CSC- 03

Practical Hours: 15 Weeks x 3Hours/Week=45 Hours/ Semester.

PART-A

1 . Write a c++ program to perform arithmetic operations using classes and objects.

2. Write a c++ program to illustrate the use of static member function.

3. Write a c++ program to find the mean value using friend function..

4. Write a c++ program to show the use of copy constructor.

5. Write a c++ program to implement multiple inheritances.

6..Write a c++ program to read a string with get line function.

7. Write a c++ program to display string with write() function.

8. Write a c++ program to specify field size with using width function.

PART-B

1. Write a c++ program to implement banking scheme using class and object.

2. Write a c++ program to show the use of over loaded constructor.

3. Write a c++ program to find the largest value among the set of parameters using overloaded function.

4. Write a c++ program to demonstrate single inheritance.

5. Write a c++ program to implement multilevel inheritance.

6. Write a c++ program to illustrate the implementation of virtual base class.


SEMESTER- 4

Database Management System

Teaching Hours 15 Weeks X 3Hrs/ week =45 hrs/Semester

UNIT-I 15 Hrs Introduction to Database System Concepts and Architecture.

Databases and Database Users: Introduction, an example, Characteristics of the Database Approach,

Users, Advantages of Using a DBMS Approach, when not to use a DBMS.

Database System concepts and architecture : Data Models, Schemas, and Instances, Three-schema

architecture and Data Independence, Database Languages and Interfaces, The Database System

Environment, Classification of Database Management Systems.

Data Modeling Using the Entity-Relationship Model : High-Level Conceptual Data Models for

Database Design, An example database application, Entity Types, Entity Sets, Attributes and Keys,

Relationships, Relationship Types, sets, roles, and Structural Constraints, Weak Entity Types, ER

Diagrams, Naming Conventions, and Design Issues.

UNIT-II 15 Hrs

Relational Data Model, Relational Constraints, and Relational Algebra: Relational Model Concepts,

Relational model Constraints and Relational Database Schemas, Update Operations, transactions and

Dealing with Constraint Violations

Relational Algebra and Relational Calculus: Unary relational algebra Operations : SELECT and

PROJECT, Relational Algebra operations from Set theory, Binary relational operations - JOIN and

DIVISION, Additional Relational Operations, Examples of Queries in Relational Algebra.

Functional dependencies and Normalization for Relational databases: Functional dependencies,

Normal Forms based on primary keys, General definitions of second and third normal forms, Boyce-

Codd Norma form.

UNIT-III 15 Hrs

SQL-The Relational Database Standard : Oracle and Client – Server Technology, Data manipulation

in DBMS, Data types, SQL commands: Create Table, Inserting data, SELECT, DELETE, UPDATE,

ALTER TABLE, DROP TABLE, RENAME, DESCRIBE. (Explain with syntax and examples)

Computations on table data, DUAL, SYSDATE, UNION,INTERSET MINUS CLAUSE ORACLE

functions, DATA constraints on table, USER_CONSTRAINT TABLE, defining and dropping Integrity

constraint in ALTER TABLE, Default value concepts, GROUP By, HAVING, ORDER BY, Sub queries,

Joins, Security management using SQL

Text Books:

1. Ramez Elmasri and Shamkanth B.Navate, Fundamentals of Database Systems, 5th Edition, Pearson

Education

Reference Books:

1. Abraham Silberschatz, Henry Korth and S. Sudarshan, Database Systems Concepts, 3rd edition,

McGraw Hill International Editions.

2. C J Date, Introduction to Database systems, Addison-Wesley.

3. Jeffrey D. Ullman, Principles of Database Systems, Computer Science Press, 1984.


DBMS Lab Practical Hours: 15 Weeks x 3Hours/Week=45 Hours/ Semester

PART-A

Activity 1:

Database : Student (DDL, DML statements)

Table: Student

Name Regno Class Major

Smith 17 1 CS

Brown 8 2 CS

Table: Course

CourseName CourseNumber CreditHours Department

Intro to computer science CS1310 4 CS

Data Structure CS3320 4 CS

Discrete Mathematics MATH2410 3 MATH

Database CS3380 3 CS

Table: Section

SectionIndentifier CourseNumber Year Instructor

85 MATH2410 98 King

92 CS1310 98 Andreson

102 CS3320 99 Knuth

112 MATH2410 99 Chang

119 CS1310 99 Andreson

135 CS3380 99 Stone

Table: Grade_report

Regno Section_identifier Grade

17 112 B

17 119 C

8 85 A

8 92 A

8 102 B

8 135 A

• Create Tables using create statement

• Insert rows to individual tables using insert statement

• Alter table section add new field section and update the records

• Delete brown’s grade report

• Drop the table section


Activity 2: (Select clause, Arithmetic Operators)

Database: employee

Create Following tables and insert tuples with suitable constraints

EMPLOYEE

EMPID FIRSTANAME LASTNAME Hire_Date ADDRESS CITY

1001 George Smith 11-May-06 83 first street Paris

1002 Mary Jones 25-Feb-08 842 Vine Ave Losantiville

1012 Sam Tones 12-Sep-05 33 Elm St. Paris

1015 Peter Thompson 19-Dec-06 11 Red Road Paris

1016 Sarath Sharma 22-Aug-07 440 MG

Road

New Delhi

1020 Monika Gupta 07-Jun-08 9 Bandra Mumbai

EMPSALARY

EMPID SALARY BENEFITS DESIGNATION

1001 10000 3000 Manager

1002 8000 1200 Salesman

1012 20000 5000 Director

1015 6500 1300 Clerk

1016 6000 1000 Clerk

1020 8000 1200 Salesman

Write queries for the following

• To display FIRSTNAME, LASTNAME, ADDRESS AND CITY of all employees living in

PARIS.

• To display the content of employee table in descending order of FIRSTNAME

• Select FIRSTNAME and SALARY of salesman

• To display the FIRSTNAME,LASTNAME, AND TOTAL SALARY of all employees from the

table EMPLOYEE and EMPSALARY. Where TOTAL SALARY is calculated as

SALARY+BENEFITS

• List the Names of employees, who are more than 1 year old in the organization

• Count number of distinct DESINGATION from EMPSALARY

• List the employees whose names have exactly 6 characters

• Add new column PHONE_NO to EMPLOYEE and update the records

• List employee names, who have joined before 15-Jun-08 and after 16-Jun-07

• Generate Salary slip with Name, Salary, Benefits, HRA-50%, DA-30%, PF-12%, Calculate

gross. Order the result in descending order of the gross.


Activity 3: (Logical, Relational Operators)

Database: Library

Create Following tables and insert tuples with suitable constraints

Table: Books

Book_Id Book_name Author_Name Publishers Price Type Quantity

C0001 The Klone and I Lata Kappor EPP 355 Novel 5

F0001 The Tears William Hopkins First Publ 650 Fiction 20

T0001 My First C++ Brain & Brooke ERP 350 Text 10

T0002 C++ Brainworks A.W.Rossaine TDH 350 Text 15

F0002 Thunderbolts Ana Roberts First Publ. 750 Fiction 50

Table : Issued

Book_Id Quantity_Issued

T0001 4

C0001 5

F0001 2

T0002 5

F0002 8

Write queries for the following

• To show Book name, Author name and price of books of First Publ. publisher

• Display Book id, Book name and publisher of books having quantity more than 8 and price less

than 500

• Select Book id, book name, author name of books which is published by other than ERP

publishers and price between 300 to 700

• Generate a Bill with Book_id, Book_name, Publisher, Price, Quantity, 4% of VAT “Total”

• Display book details with book id’s C0001, F0001, T0002, F0002 (Hint: use IN operator)

• Display Book list other than, type Novel and Fiction

• Display book details with author name starts with letter ‘A’

• Display book details with author name starts with letter ‘T’ and ends with ‘S’

• Select BookId, BookName, Author Name , Quantity Issued where Books.BooksId =

Issued.BookId

• List the book_name, Author_name, Price. In ascending order of Book_name and then on

descending order of price


Activity 4: (Date Functions)

Database : Lab

Create Following table and insert tuples with suitable constraints

Table : Equipment_Details

No ItemName Costperitem Quantity Dateofpurchase Warranty Operational

1 Computer 30000 9 21/5/07 2 7

2 Printer 5000 3 21/5/06 4 2

3 Scanner 8000 1 29/8/08 3 1

4 Camera 7000 2 13/6/05 1 2

5 UPS 15000 5 21/5/08 1 4

6 Hub 8000 1 31/10/08 2 1

7 Plotter 25000 2 11/1/09 2 2

(Use date functions and aggregate functions)

• To select the ItemName purchase after 31/10/07

• Extend the warrenty of each item by 6 months

• Display Itemname , Dateof purchase and number of months between purchase date and present

date

• To list the ItemName in ascending order of the date of purchase where quantity is more than 3.

• To count the number, average of costperitem of items purchased before 1/1/08

• To display the minimum warranty , maximum warrenty period

• To Display the day of the date , month , year of purchase in characters

• To round of the warranty period to month and year format.

• To display the next Sunday from the date ’07-JUN-96’

• To list the ItemNaName, which are within the warranty period till present date

PART-B

Activity 5: ( Numeric, character functions)

Use Functions for the following

• Find the mod of 165,16

• Find Square Root of 5000

• Truncate the value 128.3285 to 2 and -1 decimal places

• Round the value 92.7683 to 2 and -1 decimal places

• Convert the string ‘Department’ to uppercase and lowercase

• Display your address convert the first character of each word to uppercase and rest are in

lowercase

• Combine your first name and last name under the title Full name

• A) Take a string length maximum of 15 display your name to the left. The remaining space

should be filled with ‘*’

• Take a string length maximum of 20 display your name to the right. The remaining space should

be filled with ‘#’


• Find the length of the string ‘JSS College, Mysore’

• Display substring ‘BASE’ from ‘DATABASE’

• Display the position of the first occurrence of character ‘o’ in Position and Length

• Replace string Database with Datatype

• Display the ASCII value of ‘ ‘ (Space)

• Display the Character equivalent of 42

Activity : 6 (set operators)

Database : subject


Table - Physics

Regno Name Year Combination

AJ00325 Ashwin First PCM

AJ00225 Swaroop Second PMCs

AJ00385 Sarika Third PME

AJ00388 Hamsa First PMCs

Table – Computer Science

Regno Name Year Combination

AJ00225 Swaroop Second PMCs

AJ00296 Tajas Second BCA

AJ00112 Geetha First BCA

AJ00388 Hamsa First PMCs

1. Select all students from physics and Computer Science

2. Select student common in physics and Computer Science

3. Display all student details those are studying in second year

4. Display student those who are studying both physics and computer science in second year

5. Display the students studying only physics

6. Display the students studying only Computer Science

7. select all student having PMCs combination

8. select all student having BCA combination

9. select all student studying in Third year

10. Rename table Computer Science to CS


Activity 7: (views)

Database: Railway Reservation System


Table: Train Details

Train_no Train_name Start_place Destination

RJD16 Rajdhani Express Bangalore Mumbai

UDE04 Udhyan Express Chennai Hyderabad

KKE55 Karnataka Express Bangalore Chennai

CSE3 Shivaji Express Coimbatore Bangalore

JNS8 Janashatabdi Bangalore Salem

Table : Availability

Train_no Class Start_Place Destination No_of_seats

RJD16 Sleeper Class Banglore Mumbai 15

UDE04 First Class Chennai Hyderabad 22

KKE55 First Class AC Bangalore Chennai 15

CSE3 Second Class Coimbatore Bangalore 8

JNS8 Sleeper Class Bangalore Salem 18

1. Create view for train details as vwtd

2. Create view for availability as vwavl

3. Create view sleeper to display train no, start place, destination which have sleeper class

4. Insert new record to the view vwtd

5. Update destination=’Manglore’ where train no=’RJD16’ for the view vwtd

6. Delete a record from the view vwtd , inserted now

7. Create view details to display train no, train name, class

8. Create view totalseats to display train number, start place, No_of_seats

9. Use count function to No_of _seats , group by start place on the view totalseats

10. Update start place=’Hubli’ where train no=’JNS8’

11. Rename view sleeper to class


Activity 8 (group by, having clause)

Database: Bank system


Table: Account

Account_no Cust_Name Branch_ID

AE0012856 Reena SB002

AE1185698 Akhil SB001

AE1203996 Daniel SB004

AE1225889 Roy SB002

AE8532166 Sowparnika SB003

AE8552266 Anil SB003

AE1003996 Saathwik SB004

AE1100996 Swarna SB002

Table: Branch

Branch_ID Branch_name Branch_city

SB001 Malleshwaram Bangalore

SB002 MG Road Bangalroe

SB003 MG Road Mysore

SB004 Jainagar Mysore

Table: Depositor

Account_no Branch_Id Balance

AE1185698 SB001 102000

AE8552266 SB003 40000

AE1003996 SB004 15000

AE1100996 SB002 100000

Table:Loan

Account_no Branch_Id Balance

AE0012856 SB002 12000

AE1203996 SB004 58900

AE8532166 SB003 40000

AE1225889 SB002 150000

1. Display Total Number of accounts present in each branch


2. Display Total Loan amount in each branch

3. Display Total deposited amount in each branch by descending order

4. Display max , min loan amount present in each city.

5. Display average amount deposited in each branch , each city

6. Display maximum of loan amount in each branch where balance is more than 25000

7. Display Total Number of accounts present in each city

8. Display all customer details in ascending order of brachid

9. Update Balance to 26000 where accno=AE1003996

10. Display Customer Names with there branch Name

SEMESTER- 5

System Software and Operating System

CSE 01

Teaching Hours 15 Weeks X 3Hrs/ week =45 hrs/Semester (Theory

Unit 1 15 Hrs.

System Software – Introduction.

Assembler – Functions, Pass 1 and Pass 2 (without designing; only purposes).

Loaders – General loading scheme, Types of loading scheme, compile-and-go (without designing),

direct-linking loaders (without designing).

Compilers – Functions, Phases and compilers, lexical analysis, interpretation, syntax

analysis,Optimization, storage assignment, code generation, assembly and output, Lexical and syntax

analysis(Without designing of a parser, only concepts), .

Unit 2: 15 Hrs. Fundamentals of Operating System: An introduction, History, Types of operating system, multi-user,

single user, batch systems, multitasking, multiprogramming, real time systems.Operating System

functions / services, System Calls, System Programs.

Memory Management – Swapping, Single Contiguous Technique, Partitioned allocation, Paging,

Segmentation with paging, Demand paging.

Process Management – Process concept, Process state, Process control back.

CPU Scheduling CPU - I/O burst cycle, CPU schedulers, Scheduling queues, Scheduling criteria.

Unit3 15 Hrs. Process synchronization – Spooling, Semaphores.

Deadlocks – Characterization, Methods for handling deadlocks, Deadlock Prevention -Mutual exclusion,

hold and wait, no pre-emption, circular wait.

Introduction to Unix System-The Unix Operating System, Shell Programming- Vi editor, shell types,

shell command line processing, shell script features, executing a shell script, system and user-defined

variables, expr command, shell screen interface, read and echo statement, command substitution, escape

sequence characters, Conditional Control Structures-if statement, case statement Looping Control

Structure-while, until, for, statements. Jumping Control Structures – break, continue, exit. Shell Programs

covering the above concepts

Text Books:


1)Operating System and System Programming by Dhamdhere, Tata McGraw-Hill Publishing

2)Leyland . L. Beck

Reference:

1)Operating System by Tannenbaum.

2)Operating System by Godbole, Tata McGraw-Hill Publication.

Unix/Linux Lab CSE- 03

Practical Hours: 15 Weeks x 3Hours/Week=45 Hours/ Semester

• Write a shell script to exchange the contents of two variables.

• Write a shell script, which accepts three subject marks scored by a student and declare the result.

• Write a shell script to print integer numbers from 1 to 20.

• Write a shell script to perform arithmetic operation on two number depending on +, -, * and /.

• Write an interactive shell script to display a menu and perform the following task:

i. Renaming a file ii. Deleting a file

iii. Copying a file iv. Exit

• Write a shell script which counts the number of lines in a file.

• Write a shell script to accept three command line arguments and display each one of them.

• Write a c program to,

• Display the PID of parent and PID of child.

• Copy the contents of one file into the other using command line arguments.

• Write a c program to write a simple editor which serves the following purposes:

• Cursor movement in all directions.

• Insert a new line and a character.

• Deletion of line and a character.

• Assume a file with following information

FirstName MiddleName Age

------------- --------------- -----

Write a shell script

• To Sort the first name in alphabetical order.

• Sort the age in terms of ascending order.

• Sort the age in terms of descending order.

• Sort the middle name in alphabetical order.

• Write a Shell script to display

i. The version of the shell.

• The user information.

• Login date and time.

• List of processes running on the system.

• User home directory


JAVA PROGRMMING

UNIT 1 : 15 HOURS 1.An Overview of Java - Java Basics History of Java ,Object-Oriented Programming, Data Types. Variables and Arrays - The simple types, Floating point types, literals, Variables ,Type conversion and casting, Automatic type promotion in expressions, Arrays 2.Operators - Arithmetic operators, The bitwise operators, Relational operators, Boolean, logical operators, The assignment operators, The? operator, Operator precedence, Using parentheses 3.Control Statements - Java’s selection statements, Iteration statement, Jump statements UNIT 2 15 HOURS 4.Introducing Classes - Class fundamentals, Declaring Objects, Assigning object reference variables, Introducing methods Constructors, The this keyword, Garbage collection, The finalize() method Overloading methods, recursion, string handling. 5.Inheritance - Inheritance Basics, Using super Creating a multilevel Hierarchy Method overriding, Dynamic method dispatch, Using abstract classes, Using final with Inheritance The object class 6.Packages and Interfaces - Packages, Access protection, Importing packages, Interfaces UNIT 3 15 HOURS 7. Exception Handling -fundamentals ,Exception types, Uncaught exceptions Using try and catch, Multiple catch clauses, Nested try statements, Throw, Java’s built – in exceptions, Creating your own exception subclasses, Using exceptions 8.Introduction to Fundamental concepts Multithreaded Programming - Synchronization, The thread class and the runnable interface Thread priorities Inter thread communication Suspending, Resuming, and stopping threads 9.I/O &Applets - I/O basics, Reading console Input, Writing console output Applet fundamentals . Basic concepts of string handling - String length, Special string operations, TEXT BOOKS 1. Java Programming : Balaguruswamy 2. The Java Handbook by Patrick Naughton REFERENCE BOOK 1. Ivor Horton’s Beginning Java 2 JDK 5 Edition 2. The Complete Reference Java 2 – Third Edition 3. Programming with Java – Schaum’s Outline


Java Programming Lab CSE- 07

Practical Hours: 15 Weeks x 3Hours/Week=45 Hours/ Semester

PART-A 1. Write a Java program to sort a list of numbers. 3. Write a Java program to display all prime numbers between two limits.

4. Write a Java program to demonstrate manipulation of strings. 5. Write a Java program to find factorial of list of number reading input as command line

argument.

6. Write a Java program to demonstrate single inheritance. PART-B 1.Write a Java program to demonstrate Access Control using packages. 2. Write a Java program to display the result of a student using multiple inheritance 3. Write an applet to display the sum of two digits. 4. Write a Java applet to demonstrate Animation using threads. 5. Write a Java program using I-O streams to count the number of words in a file. 6 . Write a Java program to draw line, rectangle, circle ,oval and polygon with the help of java graphic class


SEMESTER -6 Data Communication and Computer Networks

Unit I: 15Hrs

Data Communication, Component and Basic Concepts –Introduction, Characteristics – Delivery,

Accuracy, Timeliness and Jitter Components – Message, Sender, Receiver, Transmission medium and

protocol, Guided & Unguided Media. Overview of Data & Signal Bits. Baud & Bit Rate. Modulation

(AM, PM, FM).

Topology – Mesh, Star, Tree, Bus, Ring and Hybrid Topologies. Transmission modes – Simplex, Half

Duplex, Full Duplex. Categories of networks – LAN, MAN, WAN

Unit II: 15Hrs

Digital To Analog – ASK, PSK, FSK, QPSK. Transmission methods – Synchronous & Asynchronous,

Flow Control, Error Control, Error Detection methods. Goals of Layered protocols- Introduction to OSI,

TCP/IP

HDLC- frame format, station, states, configuration, access control.

Unit III: 15Hrs

LAN Topology – Ethernet (IEEE 802.3), Token Bus (IEEE 802.4), Token Ring (IEEE 802.5) Switching

Technologies – Circuit, Message, and Packet. X.25, X.21, RS-232 C – frame format, channel, packet

frames, facilities. Bridging and Routing. Congestion Control . Text books: 1. Fourauzan B., “Data Communications and Networking”, 3rd edition, TataMcGrawHillPublications, 2004, ISBN 0 2. Tanenbaum A., “Computer Networks”, 4th Edition, PHI, ISBN 81 – 203 –2175 – 8 Reference Books: 1. Keshav S., “An Engineering Approach to Computer Networking”, PearsonEducation, ISBN 981–235- 986 2. Comer D., “Computer Networks and Internet”, 2ND Edition, PearsonEducation, ISBN 81– 7808 – 086 – 9 3. S.K.Basandra& S. Jaiswal, “Local Area Networks”, Galgotia Publications 4. William Stallings, “Data and Computer Communication”

ANALYSIS AND DESIGN OF ALGORITHMS

UNIT – 1 15 hours

Introduction: Analysis Framework, Asymptotic Notations and Basic Efficiency Classes,


Mathematical Analysis of Non-Recursive and Recursive Algorithms.

Brute Force Approaches - Selection Sort and Bubble Sort, Sequential Search and Brute

Force String Matching. Knapsack Problem, Assignment Problem.

UNIT - 2 15hours

Divide-and-Conquer approaches: Master Theorem, Binary Search, Merge Sort, Quick

Sort.

Decrease-and-Conquer approaches: Introduction, Insertion Sort, Depth First Search

and Breadth First Search

UNIT – 3 15 hours

Transform –and-Conquer approaches: Presorting, Gaussian Elimination, Heaps and

Heap sort

Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm

Backtracking: n-Queens problem

Reference Books: 1. Anany Levitin: Introduction to The Design & Analysis of Algorithms, 2nd

Edition, Pearson Education, 2007.

2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran: Fundamentals of

Computer Algorithms, 2nd Edition, Universities

Press, 2007.

3. Thomas H. Cormen, Charles E. Leiserson, And Ronal L. Rivest, Clifford Stein:

Introduction to Algorithms, 3rd Edition, PHI, 2010

Algorithmic LAB

Part-A

1. Program to search an element by sequential search method and estimate the time and

space complexity

2. Program to search an element by binary search using divide and conquer

3. Program to traverse a give graph using Warshall algorithm

4. Implement 0/1 Knapsack problem using dynamic programming.

5. Program to find the minimum cost spanning tree using Kruskal’s Algorithm.

Part-B

6. Program to find the minimum cost spanning tree using Prim’s Algorithm.

7. Implement n-Queen’s problem using Back Tracking.

8. Program to generate n random numbers and sort them using Quick Sort method

(Divide and Conquer).

9. Program to find shortest path from one vertex to every vertices using Dijkstar’s

Algorithm (Dynamic Programming).10. Program to implement Merge Sort Algorithm (Divide and

Conquer)..

GOVT SCIENCE COLLEGE HASSAN

Documents

Transcript of GOVT SCIENCE COLLEGE HASSAN