B.Sc. CS Syllabus 2021

B.
Sc (Computer Science) Syllabus

Rayalaseema University, Kurnool with effect from 2020-2021
RAYALASEEMA UNIVERSITY::KURNOOL
Common Framework of CBCS for Colleges in Andhra Pradesh
(A.P. State of Council of Higher Education)
REVISED SYLLABUS OF B.Sc. (COMPUTER SCIENCE/ INFORMATION

TECHNOLOGY) UNDER CBCS FRAMEWORK WITH EFFECT FROM 2020-2021
PROGRAMME: THREE-YEAR B.Sc.

(B.Sc. Computer Science/ Information Technology (IT))
(With Learning Outcomes, Unit-wise Syllabus, References, Co-curricular Activities &

Model Q.P.)
For Fifteen Courses of 1, 2, 3 & 4 Semesters)
(To be Implemented from 2020-21 Academic Year)
B.Sc (Computer Science) Syllabus
Structure of Computer Science /Information Technology (IT)
Programme: B.Sc. with Computer Science as one of the

Core Subjects. Discipline: Computer Science
Hrs. per
Credits
Week
Total
ES
IA
Year Semester Paper Code Subject
I C1 Problem Solving in C 4 3 25 75 100

First I C1-P Problem Solving in C Lab 2 2 50 50
Year II C2 Data Structures using C 4 3 25 75 100
Data Structures using C
II C2-P 2 2 50 50
Lab
Database Management
III C3 4 3 25 75 100
System
Database Management
III C3-P 2 2 50 50
System Lab
Object Oriented
Second IV C4 4 3 25 75 100
Programming using Java
Year Object Oriented
IV C4-P Programming using Java 2 2 50 50
Lab
IV C5 Operating Systems 4 3 25 75 100
Operating Systems Lab
IV C5-P 2 2 50 50
using C/Java
PROBLEM SOLVING IN C
Semester Course Code Course Title Hours Credits

I C1 PROBLEM SOLVING IN C 60 3
Objectives:
This course aims to provide exposure to problem-solving through programming. It introduces
the concepts of the C Programming language.
Course Learning Outcomes:

Upon successful completion of the course, a student will be able to:
1. Understand the evolution and functionality of a Digital Computer.
2. Apply logical skills to analyse a given problem
3. Develop an algorithm for solving a given problem.
4. Understand ‘C’ language constructs like Iterative statements, Array processing, Pointers,
etc.
5. Apply ‘C’ language constructs to the algorithms to write a ‘C’ language program.
UNIT I
General Fundamentals: Introduction to computers: Block diagram of a computer,
characteristics and limitations of computers, applications of computers, types of computers,
computer generations.
Introduction to Algorithms and Programming Languages: Algorithm – Key features of
Algorithms, Flow Charts, Programming Languages – Generations of Programming
Languages – Structured Programming Language- Design and Implementation of Correct,
Efficient and Maintainable Programs.
UNIT II
Introduction to C: Introduction – Structure of C Program – Writing the first C Program –
File used in C Program – Compiling and Executing C Programs – Using Comments –
Keywords – Identifiers – Basic Data Types in C – Variables – Constants – I/O Statements in
C- Operators in C- Programming Examples.
Decision Control and Looping Statements: Introduction to Decision Control Statements–
Conditional Branching Statements – Iterative Statements – Nested Loops – Break and
Continue Statement – goto Statement
UNIT III
Arrays: Introduction – Declaration of Arrays – Accessing elements of the Array – Storing
Values in Array– Operations on Arrays – one dimensional, two dimensional and multi-
dimensional arrays, character handling and strings.
UNIT IV
Functions: Introduction – using functions – Function declaration/ prototype – Function
definition – function call – return statement – Passing parameters – Scope of variables –
Storage Classes – Recursive functions.
Structure, Union, and Enumerated Data Types: Introduction – Nested Structures – Arrays
of Structures – Structures and Functions– Union – Arrays of Unions Variables – Unions
inside Structures – Enumerated Data Types.
UNIT V
Pointers: Understanding Computer Memory – Introduction to Pointers – declaring Pointer
Variables – Pointer Expressions and Pointer Arithmetic – Null Pointers - Passing Arguments
to Functions using Pointer – Pointer and Arrays – Memory Allocation in C Programs –
Memory Usage – Dynamic Memory Allocation – Drawbacks of Pointers
Files: Introduction to Files – Using Files in C – Reading Data from Files – Writing Data to
Files – Detecting the End-of-file.
BOOKS
1. E Balagurusamy – Programming in ANSIC – Tata McGraw-Hill publications.
2. Brain W Kernighan and Dennis M Ritchie - The ‘C’ Programming language” - Pearson
3. Ashok N Kamthane: Programming with ANSI and Turbo C, Pearson Edition Publications.
4. Yashavant Kanetkar - Let Us ‘C’ – BPB Publications.
RECOMMENDED CO-CURRICULAR ACTIVITIES:

(Co-curricular activities shall not promote copying from textbook or from others work and shall
encourage self/independent and group learning)
A. Measurable
1. Assignments (in writing and doing forms on the aspects of syllabus content and outside the
syllabus content. Shall be individual and challenging)
2. Student seminars (on topics of the syllabus and related aspects (individual activity))
3. Quiz (on topics where the content can be compiled by smaller aspects and data (Individuals or
groups as teams))
4. Study projects (by very small groups of students on selected local real-time problems
pertaining to syllabus or related areas. The individual participation and contribution of students
shall be ensured (team activity
B. General
1. Group Discussion
2. Try to solve MCQ’s available online.
3. Others
RECOMMENDED CONTINUOUS ASSESSMENT METHODS:
Some of the following suggested assessment methodologies could be adopted;
1. The oral and written examinations (Scheduled and surprise tests),
2. Closed-book and open-book tests,
3. Problem-solving exercises,
4. Practical assignments and laboratory reports,
5. Observation of practical skills,
6. Individual and group project reports like “Creating Text Editor in C”.
7. Efficient delivery using seminar presentations,
8. Viva voce interviews.
9. Computerized adaptive testing, literature surveys and evaluations,
10. Peers and self-assessment, outputs form individual and collaborative work

I C1-P PROBLEM SOLVING IN C LAB 30 2
Problem Solving in C LAB
1. Write a program to check whether the given number is Armstrong or not.

2. Write a program to find the sum of individual digits of a positive integer.
3. Write a program to generate the first n terms of the Fibonacci sequence.
4. Write a program to find both the largest and smallest number in a list of integer values
5. Write a program to demonstrate refection of parameters in swapping of two integer values
using Call by Value & Call by Address
6. Write a program that uses functions to add two matrices.
7. Write a program to calculate factorial of given integer value using recursive functions
8. Write a program for multiplication of two N X N matrices.
9. Write a program to perform various string operations.
10. Write a program to search an element in a given list of values.
11. Write a program to sort a given list of integers in ascending order.
12. Write a program to calculate the salaries of all employees using Employee (ID, Name,
Designation, Basic Pay, DA, HRA, Gross Salary, Deduction, Net Salary) structure.
a. DA is 30 % of Basic Pay
b. HRA is 15% of Basic Pay
c. Deduction is 10% of (Basic Pay + DA)
d. Gross Salary = Basic Pay + DA+ HRA
e. Net Salary = Gross Salary - Deduction
13. Write a program to illustrate pointer arithmetic.
14. Write a program to read the data character by character from a file.
15. Write a program to create Book (ISBN, Title, Author, Price, Pages, Publisher )structure and
store book details in a file and perform the following operations
a. Add book details
b. Search a book details for a given ISBN and display book details, if available
c. Update a book details using ISBN
d. Delete book details for a given ISBN and display list of remaining Books
DATA STRUCTURES USING C

II C2 DATA STRUCTURES USING C 60 3
Course Objectives
To introduce the fundamental concept of data structures and to emphasize the importance of
various data structures in developing and implementing efficient algorithms.

1. Understand available Data Structures for data storage and processing.
2. Comprehend Data Structure and their real-time applications - Stack, Queue, Linked List, Trees
and Graph
3. Choose a suitable Data Structures for an application
4. Develop ability to implement different Sorting and Search methods
5. Have knowledge on Data Structures basic operations like insert, delete, search, update and
traversal
6. Design and develop programs using various data structures
7. Implement the applications of algorithms for sorting, pattern matching etc
UNIT – I:
Introduction to Data Structures: Introduction to the Theory of Data Structures, Data
Representation, Abstract Data Types, Data Types, Primitive Data Types, Data Structure and
Structured Type, Atomic Type, Difference between Abstract Data Types, Data Types, and Data
Structures.
Principles of Programming and Analysis of Algorithms: Algorithms, Complexity, Big ‘O’
Notation, Algorithm Analysis, Structured Approach to Programming, Recursion.
UNIT – II:
Arrays: Introduction to Linear and Non- Linear Data Structures, One- Dimensional Arrays,
Array Operations, Two- Dimensional arrays, Multidimensional Arrays, Pointers and Arrays, an
Overview of Pointers.
Linked Lists: Introduction to Lists and Linked Lists, Dynamic Memory Allocation, Basic Linked
List Operations, Doubly Linked List, Circular Linked List, Atomic Linked List, Linked List in
Arrays, Linked List versus Arrays
UNIT – III:
Stacks: Introduction to Stacks, Stack as an Abstract Data Type, Representation of Stacks through
Arrays, Representation of Stacks through Linked Lists, Applications of Stacks, Stacks and
Recursion
Queues: Introduction, Queue as an Abstract data Type, Representation of Queues through
Arrays, Representation of Queues through Linked Lists, Circular Queues, Double Ended Queues-
Dequeues, Priority Queues, Application of Queues
UNIT – IV:
Binary Trees: Introduction to Non- Linear Data Structures, Introduction Binary Trees, Types of
Trees, Basic Definition of Binary Trees, Properties of Binary Trees, Representation of Binary
Trees, Operations on a Binary Search Tree, Binary Tree Traversal, Counting Number of Binary
Trees, Applications of Binary Tree
UNIT – V:
Searching and sorting: Sorting – An Introduction, Bubble Sort, Selection Sort, Insertion Sort,
Merge Sort, Quick Sort. Searching – An Introduction, Linear or Sequential Search, Binary
Search.
Graphs: Introduction to Graphs, Terms Associated with Graphs, Sequential Representation of
Graphs, Linked Representation of Graphs, Traversal of Graphs, Spanning Trees, Shortest Path,
Application of Graphs.
BOOKS:
1. “Data Structures using C”, ISRD group Second Edition, TMH
2. “Data Structures through C”, Yashavant Kanetkar, BPB Publications
3. “Data Structures Using C” Balagurusamy E. TMH

A. Measurable
groups as teams))
shall be ensured (team activity))
B. General
1. Group Discussion
2. Others
3. Programming exercises,
6. Individual and group project reports.
DATA STRUCTURES USING C LAB

II C2-P DATA STRUCTURES USING C LAB 30 2
1. Write a program to read ‘N’ numbers of elements into an array and also perform the following
operation on an array
a. Add an element at the begging of an array
b. Insert an element at given index of array
c. Update a element using a values and index
d. Delete an existing element
2. Write a program using stacks to convert a given

a. infix expression to prefix
b. infix expression to postfix
3. Write Programs to implement the Stack operations using an array

4. Write Programs to implement the Stack operations using Linked List.
5. Write Programs to implement the Queue operations using an array.
6. Write Programs to implement the Queue operations using Linked List.
7. Write a program for arithmetic expression evaluation.
8. Write a program for Binary Search Tree Traversals
9. Write a program to search an item in a given list using Linear Search Algorithm.
10. Write a program to search an item in a given list using Binary Search Algorithm
11. Write a program for implementation of Bubble Sort Algorithm
12. Write a program for implementation of Quick Sort Algorithm
13. Write a program for implementation of Insertion Sort Algorithm
14. Write a program to implement Depth First Search graph traversals algorithm
15. Write a program to implement Breadth First Search graph traversals algorithm
DATABASE MANAGEMENT SYSTEMS

III C3 DATABASE MANAGEMENT 60 3
SYSTEMS
Course Objective:
The objective of the course is to introduce the design and development of databases with special
emphasis on relational databases.

On completing the subject, students will be able to:
1. Gain knowledge of Database and DBMS.
2. Understand the fundamental concepts of DBMS with special emphasis on relational data
model.
3. Demonstrate an understanding of normalization theory and apply such knowledge to the
normalization of a database
4. Model database using ER Diagrams and design database schemas based on the model.
5. Create a small database using SQL.
6. Store, Retrieve data in database.
UNIT I
Overview of Database Management System: Introduction to data, information, database,
database management systems, file-based system, Drawbacks of file-Based System, database
approach, Objectives of DBMS, Classification of Database Management Systems, advantages of
database approach, limitations of database approach, Various Data Models, Components of
Database Management System, three schema architecture of database.
UNIT II
Entity-Relationship Model: Introduction, the building blocks of an entity relationship diagram,
classification of entity sets, attribute classification, relationship degree, relationship classification,
reducing ER diagram to tables, enhanced entity-relationship model (EER model), generalization
and specialization, IS A relationship and attribute inheritance, multiple inheritance, constraints on
specialization and generalization, advantages of ER modelling.
UNIT III
Relational Model: Introduction, CODD Rules, relational data model, concept of key, relational
integrity, relational algebra, relational algebra operations, advantages of relational algebra,
limitations of relational algebra, relational calculus, tuple relational calculus, domain relational
Calculus (DRC). Functional dependencies and normal forms up to 3rd normal form.
UNIT IV
Structured Query Language: Introduction, History of SQL Standard, Commands in SQL, Data
Types in SQL, Data Definition Language, Selection Operation, Projection Operation, Data
Manipulation Language, Table Modification Commands, Aggregate functions, Join Operation,
Set Operations, View, and Nested Queries.
UNIT V
PL/SQL: Introduction, Shortcomings of SQL, Structure of PL/SQL, PL/SQL Language
Elements, Data Types, Operators Precedence, Control Structure, Steps to Create a PL/SQL,
Program, Iterative Control, Procedure, Function, Database Triggers, Types of Triggers, Cursors,
Packages.
BOOKS:
1. Database System Concepts by Abraham Silberschatz, Henry Korth, and S. Sudarshan,
McGrawhill
2. Database Management Systems by Raghu Ramakrishnan, McGrawhill
3. Principles of Database Systems by J. D. Ullman
4. Fundamentals of Database Systems by R. Elmasri and S. Navathe
5. SQL: The Ultimate Beginners Guide by Steve Tale.

(Co-curricular activities shall not promote copying from text book or from others work and shall
A. Measurable
groups as teams))
B. General
1. Group Discussion
3. Others

5. Individual and group project reports like Create your college database for placement purpose.

III C3-P DATABASE MANAGEMENT SYSTEMS 30 2
LAB
1. Draw ER diagram for hospital administration

2. Creation of college database and establish relationships between tables
3. Relational database schema of a company is given in the following figure.
Relational Database Schema - COMPANY
Questions to be performed on above schema

1. Create above tables with relevant Primary Key, Foreign Key and other constraints
2. Populate the tables with data
3. Display all the details of all employees working in the company.
4. Display ssn, lname, fname, address of employees who work in department no 7.
5. Retrieve the Birthdate and Address of the employee whose name is 'Franklin T. Wong'
6. Retrieve the name and salary of every employee
7. Retrieve all distinct salary values
8. Retrieve all employee names whose address is in ‘Bellaire’
9. Retrieve all employees who were born during the 1950s
10. Retrieve all employees in department 5 whose salary is between 50,000 and 60,000(inclusive)
11. Retrieve the names of all employees who do not have supervisors
12. Retrieve SSN and department name for all employees
13. Retrieve the name and address of all employees who work for the 'Research' department
14. For every project located in 'Stafford', list the project number, the controlling department
number, and the department manager's last name, address, and birth date.
15. For each employee, retrieve the employee's name, and the name of his or her immediate
supervisor.
16. Retrieve all combinations of Employee Name and Department Name
17. Make a list of all project numbers for projects that involve an employee whose last name is
'Narayan’ either as a worker or as a manager of the department that controls the project.
18. Increase the salary of all employees working on the 'ProductX' project by 15%. Retrieve
employee name and increased salary of these employees.
19. Retrieve a list of employees and the project name each works in, ordered by the employee's
department, and within each department ordered alphabetically by employee first name.
20. Select the names of employees whose salary does not match with salary of any employee in
department 10.
21. Retrieve the employee numbers of all employees who work on project located in Bellaire,
Houston, or Stafford.
22. Find the sum of the salaries of all employees, the maximum salary, the minimum salary, and
the average salary. Display with proper headings.
23. Find the sum of the salaries and number of employees of all employees of the ‘Marketing’
department, as well as the maximum salary, the minimum salary, and the average salary in this
department.
24. Select the names of employees whose salary is greater than the average salary of all
employees in department 10.
25. Delete all dependents of employee whose ssn is ‘123456789’.
26. Perform a query using alter command to drop/add field and a constraint in Employee table.
27. Write a PL/SQL function to find the id, name of the employee with highest salary?
28.Write a PL/SQL procedure to find the details of the employees those who are having
salary greater than average salary of employees working in ‘marketing’ department?
29. Create a row level Trigger on employee table?
OBJECT ORIENTATED PROGRAMMING THROUGH JAVA

IV C4 OBJECT ORIENTATED 60 3
PROGRAMMING THROUGH JAVA
Objectives:
To introduce the fundamental concepts of Object-Oriented programming and to design &
implement object oriented programming concepts in Java.
Course Learning Outcomes: At the end of this course student will:
1. Understand the benefits of a well-structured program
2. Understand different computer programming paradigms
3. Understand underlying principles of Object-Oriented Programming in Java
4. Develop problem-solving and programming skills using OOP concepts
5. Develop the ability to solve real-world problems through software development in high-level
programming language like Java
UNIT – I
Introduction to Java: Features of Java, The Java virtual Machine, Parts of Java
Naming Conventions and Data Types: Naming Conventions in Java, Data Types in Java,
Literals
Operators in Java: Operators, Priority of Operators
Control Statements in Java: if... else Statement, do... while Statement, while Loop, for Loop,
switch Statement, break Statement, continue Statement, return Statement
Input and Output: Accepting Input from the Keyboard, Reading Input with Java.util.Scanner
Class, Displaying Output with System.out.printf(), Displaying Formatted Output with
String.format()
Arrays: Types of Arrays, Three Dimensional Arrays (3D array), arrayname.length, Command
Line Arguments
UNIT – II
Strings: Creating Strings, String Class Methods, String Comparison, Immutability of Strings
Introduction to OOPs: Problems in Procedure Oriented Approach, Features of Object-Oriented
Programming System (OOPS)
Classes and Objects: Object Creation, Initializing the Instance Variables, Access Specifiers,
Constructors
Methods in Java: Method Header or Method Prototype, Method Body, Understanding Methods,
Static Methods, Static Block, The keyword ‘this’, Instance Methods, Passing Primitive Data
Types to Methods, Passing Objects to Methods, Passing Arrays to Methods, Recursion, Factory
Methods
Inheritance: Inheritance, The keyword ‘super’, The Protected Specifier, Types of Inheritance
UNIT – III
Polymorphism: Polymorphism with Variables, Polymorphism using Methods, Polymorphism
with Static Methods, Polymorphism with Private Methods, Polymorphism with Final Methods,
final Class
Type Casting: Types of Data Types, Casting Primitive Data Types, Casting Referenced Data
Types, The Object Class
Abstract Classes: Abstract Method and Abstract Class
Interfaces: Interface, Multiple Inheritance using Interfaces
Packages: Package, Different Types of Packages, The JAR Files, Interfaces in a Package,
Creating Sub Package in a Package, Access Specifiers in Java, Creating API Document
.
UNIT – IV
Exception Handling: Errors in Java Program, Exceptions, throws Clause, throw Clause, Types
of Exceptions, Re – throwing an Exception
Threads: Single Tasking, Multi-Tasking, Uses of Threads, Creating a Thread and Running it,
Terminating the Thread, Single Tasking Using a Thread, Multi-Tasking Using Threads, Multiple
Threads Acting on Single Object, Thread Class Methods, Deadlock of Threads, Thread
Communication, Thread Priorities, thread Group, Daemon Threads, Applications of Threads,
Thread Life Cycle
UNIT – V
Streams: Stream, File Class, Creating a File using FileOutputStream, Reading Data from a File
uing FileInputStream, Creating a File using FileWriter, Reading a File using FileReader,
Counting Number of Characters in a File, File Copy.
Applets: Creating an Applet, Uses of Applets, <APPLET> tag, A Simple Applet, An Applet with
Swing Components, Animation in Applets, A Simple Game with an Applet, Applet Parameters
BOOKS:
1. Core Java: An Integrated Approach, Authored by Dr. R. Nageswara Rao &Kogent Learning
Solutions Inc.
2. E.Balaguruswamy, Programming with JAVA, A primer, 3e, TATA McGraw- Hill Company.
3. John R. Hubbard, Programming with Java, Second Edition, Schaum’s outline Series, TMH.
4. Deitel&Deitel. Java TM: How to Program, PHI (2007)

A. Measurable
groups as teams))
B. General
1. Group Discussion
3. Others


IV C4-P OBJECT ORIENTATED 30 2
PROGRAMMING THROUGH JAVA
LAB
OBJECT ORIENTATED PROGRAMMING THROUGH JAVA LAB
1. Write a program to read Student Name, Reg.No, Marks[5] and calculate Total, Percentage,
Result. Display all the details of students
2. Write a program to perform the following String Operations
a. Read a string
b. Find out whether there is a given substring or not
c. Compare existing string by another string and display status
d. Replace existing string character with another character
e. Count number of works in a string
3. Java program to implements Addition and Multiplication of two N X N matrices.
4. Java program to demonstrate the use of Constructor.
5. Calculate area of the following shapes using method overloading.
a. Triangle
b. Rectangle
c. Circle
d. Square
6. Implement inheritance between Person (Aadhar, Surname, Name, DOB, and Age) and
Student (Admission Number, College, Course, Year)classes where ReadData(), DisplayData()
are overriding methods.
7. Java program for implementing Interfaces
8. Java program on Multiple Inheritance.
9. Java program for to display Serial Number from 1 to N by creating two Threads
10. Java program to demonstrate the following exception handlings
a. Divided by Zero
b. Array Index Out of Bound
c. File Not Found
d. Arithmetic Exception
e. User Defined Exception
11. Create an Applet to display different shapes such as Circle, Oval, Rectangle, Square and
Triangle.
12. Write a program to create Book (ISBN,Title, Author, Price, Pages, Publisher)structure and
store book details in a file and perform the following operations
a. Add book details
b. Search a book details for a given ISBN and display book details, if available
c. Update a book details using ISBN
d. Delete book details for a given ISBN and display list of remaining Books
OPERATING SYSTEMS
IV C5 OPERATING SYSTEMS 60 2
Objectives:
This course aims to introduce the structure and organization of a file system. It emphasizes
various functions of an operating system like memory management, process management, device
management, etc.

1. Know Computer system resources and the role of operating system in resource management
with algorithms
2. Understand Operating System Architectural design and its services.
3. Gain knowledge of various types of operating systems including Unix and Android.
4. Understand various process management concepts including scheduling, synchronization, and
deadlocks.
5. Have a basic knowledge about multithreading.
6. Comprehend different approaches for memory management.
7. Understand and identify potential threats to operating systems and the security features design
to guard against them.
8. Specify objectives of modern operating systems and describe how operating systems have
evolved over time.
9. Describe the functions of a contemporary operating system
UNIT- I
What is Operating System? History and Evolution of OS, Basic OS functions, Resource
Abstraction, Types of Operating Systems– Multiprogramming Systems, Batch Systems, Time
Sharing Systems; Operating Systems for Personal Computers, Workstations and Hand-held
Devices, Process Control & Real time Systems.
UNIT- II
Processor and User Modes, Kernels, System Calls and System Programs, System View of the
Process and Resources, Process Abstraction, Process Hierarchy, Threads, Threading Issues,
Thread Libraries; Process Scheduling, Non-Preemptive and Preemptive Scheduling Algorithms.
UNIT III
Process Management: Deadlock, Deadlock Characterization, Necessary and Sufficient
Conditions for Deadlock, Deadlock Handling Approaches: Deadlock Prevention, Deadlock
Avoidance and Deadlock Detection and Recovery.
Concurrent and Dependent Processes, Critical Section, Semaphores, Methods for Inter-process
Communication
UNIT IV
Memory Management: Physical and Virtual Address Space; Memory Allocation Strategies–
Fixed and -Variable Partitions, Paging, Segmentation, Virtual Memory.
UNIT V
File and I/O Management, OS security: Directory Structure, File Operations, File Allocation
Methods, Device Management, Pipes, Buffer, Shared Memory, Security Policy Mechanism,
Protection, Authentication and Internal Access Authorization
Introduction to Android Operating System, Android Development Framework, Android
Application Architecture, Android Process Management and File System.
REFERENCE BOOKS:
1. Operating System Principles by Abraham Silberschatz, Peter Baer Galvin and Greg Gagne
(7thEdition) Wiley India Edition.
2. Operating Systems: Internals and Design Principles by Stallings (Pearson)
3. Operating Systems by J. Archer Harris (Author), Jyoti Singh (Author) (TMH)
4. Online Resources for UNIT V
A. Measurable
groups as teams))
B. General
1. Group Discussion
3. Others
8. Viva-Voce interviews.
OPERATING SYSTEMS LAB

IV C-5 OPERATING SYSTEMS LAB 30 2
USING C/Java
1. Write a program to implement Round Robin CPU Scheduling algorithm

2. Simulate SJF CPU Scheduling algorithm
3. Write a program the FCFS CPU Scheduling algorithm
4. Write a program to Priority CPU Scheduling algorithm
5. Simulate Sequential file allocation strategies
6. Simulate Indexed file allocation strategies
7. Simulate Linked file allocation strategies
8. Simulate MVT and MFT memory management techniques
9. Simulate Single level directory File organization techniques
10. Simulate Two level File organization techniques
11. Simulate Hierarchical File organization techniques
12. Write a program for Bankers Algorithm for Dead Lock Avoidance
13. Simulate FIFO Page replacement algorithms.
14. Simulate LRU Page replacement algorithms.
15. Simulate LFU Page replacement algorithms.
ALL SEMESTERS
MODEL QUESTION PAPER MAXIMUM

MARKS=70
ANSWER ANY FIVE OF THE FOLLOWING

5*4=20
1.UNIT-1
2.UNIT-2
3.UNIT-3
4.UNIT-4
5.UNIT-5
6.UNIT-1 or 2 or 3 or 4 or 5
7. UNIT-1 or 2 or 3 or 4 or 5
8. UNIT-1 or 2 or 3 or 4 or 5
ANSWER THE FOLLOWING QUESTIONS

5*10=50
9.UNIT-1
Or
10.UNIT-1
11.UNIT-2
Or
12.UNIT-2
13.UNIT-3
Or
14. UNIT-3
15.UNIT-4
Or
16.UNIT-4
17.UNIT-5
Or
18.UNIT-5

B.Sc. CS Syllabus 2021

Uploaded by

Copyright:

Available Formats

B.Sc. CS Syllabus 2021

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

B.Sc. CS Syllabus 2021

Uploaded by

Copyright:

Available Formats

B.

Sc (Computer Science) Syllabus

REVISED SYLLABUS OF B.Sc. (COMPUTER SCIENCE/ INFORMATION

PROGRAMME: THREE-YEAR B.Sc.

(With Learning Outcomes, Unit-wise Syllabus, References, Co-curricular Activities &

Structure of Computer Science /Information Technology (IT)

Programme: B.Sc. with Computer Science as one of the

I C1 Problem Solving in C 4 3 25 75 100

Semester Course Code Course Title Hours Credits

Course Learning Outcomes:

RECOMMENDED CO-CURRICULAR ACTIVITIES:

Semester Course Code Course Title Hours Credits

Problem Solving in C LAB

1. Write a program to check whether the given number is Armstrong or not.

13. Write a program to illustrate pointer arithmetic.

DATA STRUCTURES USING C

Semester Course Code Course Title Hours Credits

Course Learning Outcomes:

RECOMMENDED CO-CURRICULAR ACTIVITIES:

DATA STRUCTURES USING C LAB

2. Write a program using stacks to convert a given

3. Write Programs to implement the Stack operations using an array

5. Write Programs to implement the Queue operations using an array.

6. Write Programs to implement the Queue operations using Linked List.

7. Write a program for arithmetic expression evaluation.

8. Write a program for Binary Search Tree Traversals

DATABASE MANAGEMENT SYSTEMS

Course Learning Outcomes:

RECOMMENDED CO-CURRICULAR ACTIVITIES:

RECOMMENDED CONTINUOUS ASSESSMENT METHODS:

Semester Course Code Course Title Hours Credits

1. Draw ER diagram for hospital administration

Relational Database Schema - COMPANY

Questions to be performed on above schema

OBJECT ORIENTATED PROGRAMMING THROUGH JAVA

4. Deitel&Deitel. Java TM: How to Program, PHI (2007)

RECOMMENDED CO-CURRICULAR ACTIVITIES:

RECOMMENDED CONTINUOUS ASSESSMENT METHODS:

Some of the following suggested assessment methodologies could be adopted;

Semester Course Code Course Title Hours Credits

OBJECT ORIENTATED PROGRAMMING THROUGH JAVA LAB

Course Learning Outcomes:

OPERATING SYSTEMS LAB

1. Write a program to implement Round Robin CPU Scheduling algorithm

MODEL QUESTION PAPER MAXIMUM

ANSWER ANY FIVE OF THE FOLLOWING

ANSWER THE FOLLOWING QUESTIONS

You might also like