V.S.R &N.V.R COLLEGE (AUTONOMOUS), TENALI.

I B.Sc (M.P.Cs, M.S.Cs) – I Semester

Problem Solving using C

Course Objectives
1. To explore basic knowledge on computers
2. Learn how to solve common types of computing problems.
3. Learn to map problems to programming features of C.
4. Learn to write good portable C programs.
Course Outcomes
Upon successful completion of the course, a student will be able to:
1. Understand the working of a digital computer and Fundamental constructs of Programming
2. Analyze and develop a solution to a given problem with suitable control structures
3. Apply the derived data types in program solutions
4. Use the ‘C’ language constructs in the right way
5. Apply the Dynamic Memory Management for effective memory utilization

UNIT-I
Introduction to computer and programming: Introduction, Basic block diagram and functions of
various components of computer, Concepts of Hardware and software, Types of software, Compiler
and interpreter, Concepts of Machine level, Assembly level and high-levelprogramming, Flowcharts
and Algorithms
Fundamentals of C: History of C, Features of C, C Tokens-variables and keywords and identifiers,
constants and Data types, Rules for constructing variable names, Operators, Structure of C program,
Input /output statements in C-Formatted and Unformatted I/O
UNIT-II
Control statements: Decision making statements: if, if else, else if ladder, switch statements. Loop
control statements: while loop, for loop and do-while loop. Jump Control statements: break,continue
and goto.
UNIT-III
Derived data types in C: Arrays: One Dimensional arrays - Declaration, Initialization and Memory
representation; Two Dimensional arrays -Declaration, Initialization and Memory representation.
Strings: Declaring & Initializing string variables; String handling functions, Character handling
functions
UNIT-IV
Functions: Function Prototype, definition and calling. Return statement. Nesting of functions.
Categories of functions. Recursion, Parameter Passing by address & by value. Local and Global
variables. Storage classes: automatic, external, static and register.
Pointers: Pointer data type, Pointer declaration, initialization, accessing values using pointers.
Pointer arithmetic. Pointers and arrays, pointers and functions.

UNIT-V
Dynamic Memory Management: Introduction, Functions-malloc, calloc, realloc, free Structures:
 Basics of structure, structure members, accessing structure members, nested structures, array of
structures, structure and functions, structures and pointers. Unions - Union definition; difference
between Structures and Unions.
Text Books:
1. E. Balagurusamy, “Programming in ANSI C”, Tata McGraw Hill, 6 th Edn, ISBN-13: 978- 1- 25-
90046-2
2. Herbert Schildt, ―Complete Reference with C, Tata McGraw Hill, 4th Edn., ISBN- 13:
9780070411838, 2000
3. Computer fundamentals and programming in C, REEMA THAREJA, OXFORD
UNIVERSITY PRESS
Reference Books
1. E Balagurusamy, COMPUTING FUNDAMENTALS & C PROGRAMMING – Tata
McGraw-Hill, Second Reprint 2008, ISBN 978-0-07-066909-3.
2. Ashok N Kamthane, Programming with ANSI and Turbo C, Pearson Edition Publ, 2002.
3. Henry Mullish&Huubert L.Cooper: The Spirit of C An Introduction to
modern Programming, Jaico Pub. House,1996.
4. Y kanithkar, let us C BPB, 13 th edition-2013, ISBN:978-8183331630,656 pages.

SUGGESTED CO-CURRICULAR ACTIVITIES & EVALUATION METHODS:

Unit 1: Activity: Quiz on computer hardware and software concepts

Evaluation Method: Objective-based quiz assessing knowledge and understanding

Unit 2: Activity: Problem-solving using Decision-Making Statements

Evaluation Method: Correctness of decision-making logic

Unit 3: Activity: Array and String Program Debugging

Evaluation Method: Identification and correction of errors in code

Unit 4: Activity: Pair Programming Exercise on Functions

Evaluation Method: Collaboration and Code Quality

Unit 5: Activity: Structured Programming Assignment

Evaluation Method: Appropriate use of structures and nested structures

 Problem Solving using C

List of Experiments

1. A. Write a program to calculate simple & compound interest

B. Write a C program to interchange two numbers.
2. Find the biggest of three numbers using C.
3. Write a c program to find the sum of individual digits of a positive integer.
4. A Fibonacci sequence is defined as follows: the first and second terms in the sequenceare
0 and 1. Subsequent terms are found by adding the preceding two terms in the
sequence.
5. Write a c program to check whether a number is Armstrong or not.
6. Write a c program to generate all the prime numbers between 1 and n, where n is avalue
supplied by the user.
7. Write a c program that implements searching of given item in given list
8. Write a c program that uses functions to perform the following: Addition of twomatrices.
Multiplication of two matrices.
9. Write a program for concatenation of two strings.
10. Write a program for length of a string with and without String Handling functions
11. Write a program to demonstrate Call by Value and Call by Reference mechanism
12. Write a Program to find GCD of Two numbers using Recursion
13. Write a c program to perform various operations using pointers.
14. Write a c program to read data of 10 employees with a structure of 1.employee id2.aadar
no, 3.title, 4.joined date, 5.salary, 6.date of birth, 7.gender, 8.department.
15. Write a Program to demonstrate dynamic arrays using Dynamic Memory
Management functions
 V.S.R &N.V.R COLLEGE (AUTONOMOUS), TENALI.
I B.Sc (M.P.Cs, M.S.Cs) – II Semester

Data Structures using C

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

Upon successful completion of the course, a student will be able to:

1. Understand various Data Structures for data storage and processing.
2. Realize Linked List Data Structure for various operations
3. Analyze step by step and develop algorithms to solve real world problems by implementing
Stacks, Queues data structures.
4. Understand and implement various searching & sorting techniques.
5. Understand the Non-Linear Data Structures such as Binary Trees and Graphs

UNIT-I
Basic Concepts: Pointers and dynamic memory allocation, Algorithm-Definition and characteristics,
Algorithm Analysis-Space Complexity, Time Complexity, Asymptotic Notation Introduction to
Data structures: Definition, Types of Data structure, Abstract Data Types (ADT), Difference
between Abstract Data Types, Data Types, and Data Structures.
Arrays-Concept of Arrays, Single dimensional array, Two dimensional array, Operations on arrays
with Algorithms (searching, traversing, inserting, deleting)

UNIT-II
Linked List: Concept of Linked Lists, Representation of linked lists in Memory, Comparison
between Linked List and Array, Types of Linked Lists - Singly Linked list, Doubly Linked list,
Circularly Singly Linked list, Circularly Doubly Linked list;
Implementation of Linked List ADT: Creating a List, Traversing a linked list, Searching linkedlist,
Insertion and deletion into linked list (At first Node, Specified Position, Last node), Application of
linked lists

UNIT-III
Stacks: Introduction to stack ADT, Representation of stacks with array and Linked List,
Implementation of stacks, Application of stacks - Polish Notations - Converting Infix to Post Fix
Notation - Evaluation of Post Fix Notation - Tower of Hanoi, Recursion: Concept and Comparison
between recursion and Iteration
 Queues: Introduction to Queue ADT, Representation of Queues with array and Linked List,
Implementation of Queues, Application of Queues Types of Queues- Circular Queues, De-queues,
Priority Queue
UNIT-IV
Searching: Linear or Sequential Search, Binary Search and Indexed Sequential Search
Sorting: Selection Sort, Bubble Sort, Insertion Sort, Quick Sort and Merge Sort

UNIT-V
Binary Trees: Concept of 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, Applications of Binary Tree.
Graphs: Introduction to Graphs, Terms Associated with Graphs, Sequential Representation of
Graphs, Linked Representation of Graphs, Traversal of Graphs (DFS, BFS), Application of
Graphs.

Text Books:

1. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt Ltd
Delhi India.
2. A.K. Sharma ,Data Structure Using C, Pearson Education India.
3. “Data Structures Using C” Balagurusamy E. TMH

Reference Books

1. “Data Structures through C”, Yashavant Kanetkar, BPB Publications

2. Rajesh K. Shukla, “Data Structure Using C and C++” Wiley Dreamtech Publication.
3. Lipschutz, “Data Structures” Schaum’s Outline Series, Tata Mcgraw-hill Education (India)Pvt.
Ltd .
4. Michael T. Goodrich, Roberto Tamassia, David M. Mount “Data Structures
and Algorithms in C++”, Wiley India.

SUGGESTED CO-CURRICULAR ACTIVITIES & EVALUATION METHODS:

Unit 1: Activity: Algorithm analysis exercises

Evaluation Method: Programming Assignment and Correctness

Unit 2: Activity: Presentations on real-life applications of linked lists

Evaluation Method: Presentation skills or reports

Unit 3: Activity: Role-playing activities for stack operations

Evaluation Method: Problem-solving skills, communication and collaboration abilities.

Unit 4: Activity: Sorting algorithm analysis and comparison activities

Evaluation Method: Performance analysis and presentation.

Unit 5: Activity: Case Study on Applications of Graphs

Evaluation Method: Critical thinking, problem-solving, and presentation skills

 V.S.R&N.V.RCOLLEGE (AUTONOMOUS), TENALI.
V.S. I B.Sc (M.P.Cs, M.S.Cs) – II Semester

Data Structures using C

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 beginning of an array
b. Insert an element at given index of array
c. Update an element using a values and index
d. Delete an existing element

2. Write Program to implement Single Linked List with insertion, deletion and traversal
operations
3. Write Program to implement Circular doubly Linked List with insertion, deletion and
traversal operations
4. Write Programs to implement the Stack operations using an array
5. Write a program using stacks to convert a given infix expression to postfix
6. Write Programs to implement the Stack operations using Liked List.
7. Write Programs to implement the Queue operations using an array.
8. Write Programs to implement the Queue operations using Liked List.
9. Write a program for Binary Search Tree Traversals
10. Write a program to search an item in a given list using the following Searching Algorithms
a. Linear Search
b. Binary Search.
11. Write a program for implementation of the following Sorting Algorithms
a. Bubble Sort
b. Insertion Sort
c. Quick Sort
 V.S.R &N.V.R COLLEGE (AUTONOMOUS), TENALI.
II B.Sc (M.P.Cs, M.S.Cs) – III Semester

Database Management Systems

To familiarize with concepts of database design

Learning Outcomes: On successful completion of the course, students will be able to

1. Differentiate between database systems and file based systems

2. Design a database using ER model
3. Use relational model in database design
4. Use SQL commands for creating and manipulating data stored in databases.
5. Write PL/SQL programs to work with databases.
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,
Classification of Database Management Systems, advantages of database approach, Various Data
Models, Components of Database Management System, three schema architecture of data base, costs
and risks of database approach.

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

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 upto 3rd normal form.

UNIT - IV
Structured Query Language: Introduction, Commands in SQL, Data Types in SQL, Data
Definition Language, Selection Operation, Projection Operation, Aggregate functions, Data
Manipulation Language, Table Modification Commands, Join Operation, Set Operations, View, Sub
Query.
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.
Text Books:

1. Operating System Principles by Abraham Silberschatz, Peter Baer Galvin and GregGagne (7th
Edition) Wiley India Edition.

Reference Books

1. Database Management Systems by Raghu Ramakrishnan, McGrawhill

2. Principles of Database Systems by J. D. Ullman
3. Fundamentals of Database Systems by R. Elmasri and S. Navathe
4. SQL: The Ultimate Beginners Guide by Steve Tale.

SUGGESTED CO-CURRICULAR ACTIVITIES & EVALUATION METHODS:

Unit 1: Activity: Seminar Presentation on Database Management Systems

Evaluation Method: Depth of research, clarity of explanations, ability to addressquestions

and engage the audience.
Unit 2: Activity: Case Study on EER model

Evaluation Method: Identification of inheritance relationships, effective use of

generalization and specialization, and adherence to constraints.
Unit 3: Activity: Exercise on Normalization: Assign students a set of unnormalized tables andhave
them normalize the tables to third normal form
Evaluation Method: Normalized table designs, identification of functional dependencies,adherence to
normalization rules, and elimination of anomalies.

Unit 4: Activity: Competition on SQL Query Writing

Evaluation Method: Query correctness, efficiency, proper use of SQL commands, abilityto
handle complex scenarios, and creativity in query formulation.
Unit 5: Activity: Peer Review of PL/SQL code

Evaluation Method: Peer evaluation of code quality, adherence to coding standards, proper
use of language elements, and logic.
 Database Management Systems
List of Experiments:

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 nameis
'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 'Product X' 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
employeefirst name.
20. Select the names of employees whose salary does not match with salary of any
employeein 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.
 V.S.R &N.V.R COLLEGE (AUTONOMOUS), TENALI.
II B.Sc (M.P.Cs, M.S.Cs) – IV Semester

Object Oriented Programming using Java

Course Objectives

To introduce the fundamental concepts of Object-Oriented programming and to design &implement

object-oriented programming concepts in Java.
Course Outcomes

Upon successful completion of the course, a student will be able to:

1. Understand the basic concepts of Object-Oriented Programming and Java Program
Constructs
2. Implement classes and objects and analyze Inheritance and Dynamic Method Dispatch
3. Demonstrate various classes in different packages and can design own packages
4. Manage Exceptions and Apply Threads
5. Create GUI screens along with event handling
UNIT-I
OOPs Concepts and Java Programming: Introduction to Object-Oriented concepts, proceduraland
object-oriented programming paradigm

Java programming: An Overview of Java, Java Environment, Data types, Variables, constants,
scope and life time of variables, operators, type conversion and casting, Accepting Input from the
Keyboard, Reading Input with Java.util.Scanner Class, Displaying Output with System.out.printf(),
Displaying Formatted Output with String.format(), Control Statements
UNIT-II
Arrays, Command Line Arguments, Strings-String Class Methods
Classes & Objects: Creating Classes, declaring objects, Methods, parameter passing, static fieldsand
methods, Constructors, and ‘this’ keyword, overloading methods and access
Inheritance: Inheritance hierarchies, super and subclasses, member access rules, ‘super’ keyword,
preventing inheritance: final classes and methods, the object class and its methods; Polymorphism:
Dynamic binding, method overriding, abstract classes and methods;

UNIT-III
Interface: Interfaces VS Abstract classes, defining an interface, implement interfaces, accessing
implementations through interface references, extending interface;
Packages: Defining, creating and accessing a package, understanding CLASSPATH, importing
packages.
Exception Handling: Benefits of exception handling, the classification of exceptions, exception
 hierarchy, checked exceptions and unchecked exceptions, usage of try, catch, throw, throws and
finally, rethrowing exceptions, exception specification, built in exceptions, creating own exceptionsub
classes.
UNIT-IV
Multithreading: Differences between multiple processes and multiple threads, thread states, thread
life cycle, creating threads, interrupting threads, thread priorities, synchronizing threads, inter thread
communication.
Stream based I/O (java.io) – The Stream classes-Byte streams and Character streams, Reading
console Input and Writing Console Output, File class, Reading and writing Files, The Console class,
Serialization
UNIT-V
GUI Programming with Swing- Introduction, MVC architecture, components, containers.
Understanding Layout Managers - Flow Layout, Border Layout, Grid Layout, Card Layout, GridBag
Layout.
Event Handling- The Delegation event model- Events, Event sources, Event Listeners, Event
classes, Handling mouse and keyboard events, Adapter classes, Inner classes, Anonymous Inner
classes.

Text Books:

1. Java The complete reference, 9th edition, Herbert Schildt, McGraw Hill.
2. Understanding Object-Oriented Programming with Java, updated edition, T.
Budd, Pearson Education.
Reference Books
1. Cay S. Horstmann, “Core Java Fundamentals”, Volume 1, 11 th Edition, Prentice Hall,
2018.
2. Paul Deitel, Harvey Deitel, “Java SE 8 for programmers”, 3rd Edition, Pearson, 2015.
3. S. Malhotra, S. Chudhary, Programming in Java, 2nd edition, Oxford Univ. Press.

SUGGESTED CO-CURRICULAR ACTIVITIES & EVALUATION METHODS:

Unit 1: Activity: Quiz on Object-Oriented Programming Concepts and Java Constructs

Evaluation Method: Quiz Performance and Knowledge Retention

Unit 2: Activity: Object-Oriented Programming Assignment: Class Implementation

Evaluation Method: Assignment Completion and Correctness.

Unit 3: Activity: Hands-on Lab Activity: Creating and Using Custom Java Packages

Evaluation Method: Lab Performance and Correctness of Code Implementation

Unit 4: Activity: Case Study Discussion on where multi-threading is crucial

Evaluation Method: Critical thinking, problem-solving, and presentation skills.

Unit 5: Activity: GUI design contest using Java Swings

Evaluation Method: GUI design, Visual appearance and user friendliness, usability, and
adherence to event handling principles.
 Object Oriented Programming using Java Lab

List of Experiments

1. Write a Java program to print Fibonacci series using for loop.

2. Write a Java program to calculate multiplication of 2 matrices.
3. Create a class Rectangle. The class has attributes length and width. It should have methods that
calculate the perimeter and area of the rectangle. It should have read Attributes method to read
length and width from user.
4. Write a Java program that implements method overloading.
5. Write a Java program for sorting a given list of names in ascending order.
6. Write a Java program that displays the number of characters, lines and words in a text file.
7. Write a Java program to implement various types of inheritance
i. Single ii. Multi-Level iii. Hierarchical iv. Hybrid
8. Write a java program to implement runtime polymorphism.
9. Write a Java program which accepts withdraw amount from the user and throws an exception “In
Sufficient Funds” when withdraw amount more than available amount.
10. Write a Java program to create three threads and that displays “good morning”, for every one
second, “hello” for every 2 seconds and “welcome” for every 3 seconds by using extending
Thread class.
11. Write a Java program that creates three threads. First thread displays “OOPS”, the second thread
displays “Through” and the third thread Displays “JAVA” by using Runnable interface.
12. Implement a Java program for handling mouse events when the mouse entered, exited, clicked,
pressed, released, dragged and moved in the client area.
13. Implement a Java program for handling key events when the key board is pressed, released, typed.
14. Write a Java swing program that reads two numbers from two separate text fields and display
sum of two numbers in third text field when button “add” is pressed.
15. Write a Java program to design student registration form using Swing Controls. The form which
having the following fields and button SAVE

.
 V.S.R &N.V.R COLLEGE (AUTONOMOUS), TENALI.
II B.Sc (M.P.Cs, M.S.Cs) – III Semester

Operating Systems

To gain knowledge about various functions of an operating system like memory management,
process management, device management, etc.
Course Outcomes:

Upon successful completion of the course, a student will be able to:

1. Demonstrate knowledge and comprehension of operating system functions.

2. Analyze different process scheduling algorithms and apply them to manage processes and
threads effectively
3. Create strategies to prevent, detect, and recover from deadlocks, and design solutions for
inter-process communication and synchronization problems.
4. Compare and contrast different memory allocation strategies and evaluate their
effectiveness
5. Evaluate disk scheduling algorithms while implementing OS security measures

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; Process Synchronization, Classical Process Synchronization Problems:
Producer-Consumer, Reader-Writer.

UNIT IV
Memory Management: ; 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, Disk Scheduling algorithms.

Text Books:
1. Operating System Principles by Abraham Silberschatz, Peter Baer Galvin and GregGagne
(7th Edition) Wiley India Edition.

Reference Books
1. Operating Systems: Internals and Design Principles by Stallings (Pearson)
2. Operating Systems by J. Archer Harris (Author), Jyoti Singh (Author) (TMH)

SUGGESTED CO-CURRICULAR ACTIVITIES & EVALUATION METHODS:

Unit 1: Activity: Case Study on a specific Operating System: highlighting its functions and key
features.
Evaluation Method: Case study presentation, depth of understanding of operating system
functions, and ability to articulate key concepts.
Unit 2: Activity: Comparison Poster on Scheduling Algorithms

Evaluation Method: Assessment of posters based on content accuracy, clarity of

information, visual presentation, and ability to convey key insights.
Unit 3: Activity: Assignment on Dead Lock prevention techniques

Evaluation Method: Understanding, Completion and report.

Unit 4: Activity: Debate on various Memory allocation schemes

Evaluation Method: Debate arguments, ability to counter opposing viewpoints, logical

reasoning, and presentation skills.
Unit 5: Activity: Comparative study of various disk scheduling algorithms using real world
datasets
Evaluation Method: Analysis methodology, accuracy of results, and presentation of
findings and conclusions.
 Operating Systems
List of
Experiments:

1. Illustrate the LINUX commands

a) pwd
b) mkdir
c) rmdir
d) grep
e) chmod
f) ls
g) rm
h) cp
2. Write a program to calculate average waiting time and turn around time of each process
using the following CPU Scheduling algorithm for the given process schedules.
a) FCFS
b) SJF
c) Priority
d) Round Robin
3. Simulate MVT and MFT memory management techniques
4. Write a program for Bankers Algorithm for Dead Lock Avoidance
5. Implement Bankers Algorithm Dead Lock Prevention.
6. Write a program to simulate Producer-Consumer problem.
7. Simulate all Page replacement algorithms.
e) FIFO
f) LRU
g) LFU
h) Optimal
8. Simulate Paging Techniques of memory management
9. Simulate the following disk scheduling algorithms
a) FCFS
b) SSTF
c) SCAN
d) CSCAN
 V.S.R &N.V.R COLLEGE (AUTONOMOUS), TENALI.
II B.Sc (M.P.Cs, M.S.Cs) – V Semester

Web Interface Designing Technologies

Learning Objectives:

To enable students to understand web architecture, develop aesthetic websites, create static and
dynamic web pages, implement user interactivity, and gain proficiency in installing and utilizing
WordPress and plugins

Learning Outcomes: On successful completion of the course, students will be able to

1. Understand and appreciate the web architecture and services along with its basic
building blocks
2. Gain knowledge about various components of a website related to aesthetics
3. Demonstrate skills regarding creation of a static website and addition of dynamic behaviorto
a website
4. Get experience on making user-interactive web pages.
5. Learn how to install word press and gain the knowledge of installing various plugins to usein
their websites.
UNIT - I
HTML: Introduction to web designing, difference between web applications and desktop
applications, introduction to HTML, HTML structure, elements, attributes, headings, paragraphs,
images, tables, lists, blocks, symbols, embedding multi-media components in HTML, HTML forms
UNIT – II
CSS: CSS home, introduction, syntax, CSS combinators, colors, background, borders, margins,
padding, height/width, text, fonts, tables, lists, position, overflow, float, pseudo class, pseudo
elements, opacity, tool tips, image gallery, CSS forms, CSS counters.
UNIT – III
Java Script: What is DHTML, JavaScript, basics, variables, operators, statements, string
manipulations, mathematical functions, arrays, functions. objects, regular expressions, exception
handling.
UNIT-IV
Client-Side Scripting: Accessing HTML form elements using Java Script object model, basic data
validations, data format validations, generating responsive messages, opening windows using java
script, different kinds of dialog boxes, accessing status bar using java script, embedding basic
animative features using different keyboard and mouse events.
UNIT – V
Word press: Introduction to word press, features, and advantages, installing and configuring word
press and understanding its admin panel (demonstration only), working with posts, managing pages,
working with media - Adding, editing, deleting media elements, working with widgets, using menus,
working with themes, defining users, roles and profiles, adding external links, extending word press
with plug-ins.
Text Book(s)
1. Chris Bates, Web Programming Building Internet Applications, Second Edition, Wiley (2007)
2. Paul S.WangSanda S. Katila, an Introduction to Web Design plus Programming, Thomson
(2007).
Reference Books
1. Head First HTML and CSS, Elisabeth Robson, Eric Freeman, O’Reilly Media Inc.
2. An Introduction to HTML and JavaScript: for Scientists and Engineers, David R. Brooks.
Springer, 2007
3. Schaum's Easy Outline HTML, David Mercer, Mcgraw Hill Professional.
4. Word press for Beginners, Dr.Andy Williams.
5. Professional word press, Brad Williams, David damstra, Hanstern.
SUGGESTED CO-CURRICULAR ACTIVITIES & EVALUATION METHODS:
Unit 1: Activity: Infographic explaining the necessity to have a web site for each of the agenciessuch
as hotels, hospitals, supermarkets, and educational institutions.
Evaluation Method: Assess the accuracy, visual design, clarity, creativity, use of visual
elements, presentation of the infographic explaining the necessity of a
website for different agencies.
Unit 2: Activity: Seminar though PPT on various Look and Feel components that websites relatedto
different agencies
Evaluation Method: Content knowledge, organization, clarity, presentation skills,
visualaids, audience engagement
Unit 3: Activity: Code snippets Challenge.
Evaluation Method: Accuracy, functionality, efficiency, code readability, and problem-
solving approach of the JavaScript code snippets
Unit 4: Activity: Group discussion on different kinds of web forms that take and validate userinput
using java script validations
Evaluation Method: Active participation, knowledge sharing, critical thinking, and
demonstration of different web forms and JavaScript validations
Unit 5: Activity: Creation of Personal website using wordpress

Evaluation Method: Design aesthetics, functionality, user interactivity, contentorganization,

and utilization of plugins.
 Web Interface Designing Technologies
List of Experiments:

1. Create an HTML document with the following formatting options:

(a) Bold, (b) Italics, (c) Underline, (d) Headings (Using H1 to H6 heading styles), (e) Font
(Type, Size and Color), (f) Background (Colored background/Image in background), (g)
Paragraph, (h) Line Break, (i) Horizontal Rule, (j) Pre tag

2. Create an HTML document which consists of:

(a) Ordered List (b) Unordered List (c) Nested List (d) Image

3. Create a Table with four rows and five columns. Place an image in one column.
4. Using “table” tag, align the images as follows:

5. Create a menu form using html.

6. Style the menu buttons using CSS.
7. Create a form using HTML which has the following types of controls:
(a) Text Box (b) Option/radio buttons (c) Check boxes (d) Reset and Submit buttons

8. Embed a calendar object in your web page.

9. Create a form that accepts the information from the subscriber of a mailing system.
Word press:

10. Installation and configuration of word press

11. Access admin panel and manage posts
12. Access admin panel and manage pages
13. Add widgets and menus
14. Create users and assign roles
15. Create a site and add a theme to it
 V.S.R &N.V.R COLLEGE (AUTONOMOUS), TENALI.
II B.Sc (M.P.Cs, M.S.Cs) – V Semester

Web Applications Development using PHP & MYSQL

Learning Objectives:

To enable students to understand open-source tools to create dynamic web pages, implement user
interactivity, and gain proficiency in developing web sites

Learning Outcomes: On successful completion of the course, students will be able to

1. Write simple programs in PHP.

2. Understand how to use regular expressions, handle exceptions, and validate data
using PHP.
3. Apply In-Built functions and Create User defined functions in PHP programming.
4. Write PHP scripts to handle HTML forms.
5. Know how to use PHP with a MySQL database and can write database driven web pages.

UNIT-I
The building blocks of PHP: Variables, Data Types, Operators and Expressions, Constants. Flow
Control Functions in PHP: Switching Flow, Loops, Code Blocks and Browser Output.Working with
Functions: Creating functions, Calling functions, Returning the values from User- Defined Functions,
Variable Scope, Saving state between Function calls with the static statement,arguments of
functions

UNIT-II
Working with Arrays: Creating Arrays, Some Array-Related Functions.

Working with Objects: Creating Objects, Accessing Object Instances, Working with Strings, Dates
and Time: Formatting strings with PHP, Manipulating Strings with PHP, Using Date and Time
Functions in PHP.

UNIT-III
Working with Forms: Creating Forms, Accessing Form Input with User defined Arrays, Combining
HTML and PHP code on a single Page, Using Hidden Fields to save state, Redirectingthe user, Sending
Mail on Form Submission, and Working with File Uploads, Managing files onserver, Exception
handling.

UNIT-IV
Working with Cookies and User Sessions: Introducing Cookies, setting a Cookie with PHP,
Session Function Overview, starting a Session, working with session variables, passing session IDs in
the Query String, Destroying Sessions and Unsetting Variables, Using Sessions in an Environment
 with Registered Users.
UNIT-V
Interacting with MySQL using PHP: MySQL Versus MySQLi Functions, connecting to MySQL
with PHP, Working with MySQL Data. Planning and Creating Database Tables, Creating Menu,
Creating Record Addition Mechanism, Viewing Records, Creating the Record Deletion Mechanism.
Text Book(s)
1. Julie C. Meloni, SAMS Teach yourself PHP MySQL and Apache, Pearson Education (2007).
2. Steven Holzner , PHP: The Complete Reference, McGraw-Hill
Reference Books
1. Robin Nixon, Learning PHP, MySQL, JavaScript, CSS & HTML5, Third Edition O'reilly, 2014
2. Xue Bai Michael Ekedahl, The web warrior guide to Web Programming, Thomson (2006).
SUGGESTED CO-CURRICULAR ACTIVITIES & EVALUATION METHODS:
Unit 1: Activity: Infographic explanation of client-server architecture and different server-side
scripting languages.
Evaluation Method: Assess the accuracy, visual design, clarity, creativity, use of visual
elements, presentation of the infographic explaining the benefits of
server-side scripting languages.
Unit 2: Activity: Presentation on various open-source frameworks available in LAMP model

Evaluation Method: Content knowledge, organization, clarity, presentation skills,

visual aids, audience engagement
Unit 3: Activity: Code snippets Challenge.

Evaluation Method: Accuracy, functionality, efficiency, code readability, and problem-

solving approach of the PHP code snippets
Unit 4: Activity: Group discussion on Session Management in PHP
Evaluation Method: Active participation, knowledge sharing, critical thinking, and
demonstration of Session Management
Unit 5: Activity: Hands-on Lab Session on MYSQL Queries

Evaluation Method: Lab Performance and Correctness of solution Implementation

 Course 13: Web Applications Development using PHP & MYSQL

List of Experiments:

1. Write a PHP program to Display “Hello”

2. Write a PHP Program to display the today’s date.
3. Write a PHP program to display Fibonacci series.
4. Write a PHP Program to read the employee details.
5. Write a PHP program to prepare the student marks list.
6. Create student registration form using text box, check box, radio button, select, submit
button.And display user inserted value in new PHP page.
7. Create Website Registration Form using text box, check box, radio button, select, submitbutton.
And display user inserted value in new PHP page.
8. Write PHP script to demonstrate passing variables with cookies.
9. Write a PHP script to connect MySQL server from your website.
10. Write a program to keep track of how many times a visitor has loaded the page.
11. Write a PHP application to perform CRUD (Create, Read, Update and Delete) operations on a
database table.
12. Create a web site using any open-source framework built on PHP and MySQL – It is a team
activity wherein students are divided into multiple groups and each group comes up with
theirown website with basic features.