B.Sc. (Computer Science) PDF

VIKRAMA SIMHAPURI UNIVERSITY NELLORE
B.SC., COMPUTER SCIENCE
UG (CBCS) SEMESTER PATTERN SYLLABUS

I TO VI SEMESTER
Andhra Pradesh State Council of Higher Education
B.Sc. Computer Science/Information Technology (IT) Syllabus Under CBCS
w.e.f.2015-2016 (Modified in April 2016)
Structure of Computer Science/Information Technology (IT) Syllabus
Structure of Computer Science/Information Technology (IT) Syllabus I YEAR 1
SEMESTER
Computer Fundamentals & Photoshop

Course Outcome
To explore basic knowledge on computers and Photoshop’s beauty from the practical to the painterly
artistic and to understand how Photoshop will help you create your own successful images
UNIT-I:
Introduction to computers, characteristics and limitations of computer, Block diagram of computer, types
of computers, uses of computers, computer generations. Number systems :binary, hexa and octal
numbering system
UNIT-II:
Input and output devices: Keyboard and mouse, inputting data in other ways, Types of Software: system
software, Application software, commercial, open source, domain and free ware software, Memories:
primary, secondary and cache memory.
Unit –III
Introduction to Adobe photoshop, Getting started with photoshop, creating and saving a document in
photoshop, page layout and back ground, photoshop program window-title bar,menu bar,option bar,image
window,image title bar,status bar,ruler,paletts,tool box,screen modes,saving files,reverting files,closing
files.
Unit –IV
Images: working with images, image size and resolution ,image editing,colour modes and adjustments ,
Zooming & Panning an Image,, , Rulers, Guides & Grids- Cropping & Straightening an Image,image
backgrounds ,making selections.
Working with tool box: working with pen tool, save and load selection-working with erasers-working
with text and brushes-Colour manipulations: colour modes- Levels – Curves - Seeing Colour accurately -
Patch tool – Cropping-Reading your palettes - Dust and scratches- Advanced Retouching- smoothing skin
Unit-V
Layers: Working with layers- layer styles- opacity-adjustment layers
Filters: The filter menu, Working with filters- Editing your photo shoot, presentation –how to create
adds ,artstic filter,blur filter,brush store filter,distort filters,noice filters,pixelate filters,light
effects,difference clouds,sharpen filters,printing.
Reference Books:
1. Fundamentals of Computers by Reema Thareja from Oxford University Press
2. Adobe Photoshop Class Room in a Book by Adobe Creative Team.
3. Photoshop: Beginner's Guide for Photoshop - Digital Photography, Photo Editing, Color Grading &
Graphic...19 February 2016 by David Maxwell
Student Activity:
1. Design a poster for technical paper presentation.
2. Create a digital scrap book.
VIKRAMA SIMHAPURI UNIVERSITY :: NELLORE
CBCS – BSc(COMPUTER SCIENCE) - I YEAR - SEMESTER-I

COMPUTER FUNDAMENTALS & PHOTOSHOP
MODEL QUESTION PAPER
Time: 3 Hours Max. Marks : 75
Section-A
Answer any FIVE of the following Questions: (5 x 5= 25 Marks)
1. Write various limitations of computers.

2. Briefly explain binary number system
3. Explain keyboard and mouse
4. Write about commercial software
5. How do you set page layout in Photoshop?
6. Write and explain how to create a document in Photoshop
7. How rulers and guides are useful in Photoshop window?
8. Explain how will you zoom an image in Photoshop.
9. Define Layer
10. Define Filter
Section - B
Answer any FIVE of the following Questions (5 ´ 10 =50 Marks)
11. Draw block diagram of a computer and explain

12. Explain various types of computers.
13. What is primary memory? Explain its types
14. Define software. Explain different types of software
15. Explain various components of Photoshop program window
16. Write about reverting files
17. Explain how you change image size and resolution in Photoshop
18. Write about various colour modes.
19. Explain in detail about layers.
20. Explain the working of filers in Photoshop
Instruction to Paper Setter:
Two questions must be given from each unit in Section-A and Section-B
Photo Shop Lab
1. Create your Visiting card

2. Create Cover page for any text book
3. Create a Paper add for advertising of any commercial agency
4. Design a Passport photo
5. Create a Pamphlet for any program to be conducted by an organixation
6. Create Broacher for you college
7. Create Titles for any forthcoming film
8. Custom shapes creation
9. Create a Web template for your college
10. Convert color photo to black and white photo
11. Enhance and reduce the given Image size
12. Background changes
13. Design Box package cover
14. Design Texture and patterns
15. Filter effects & Eraser effects
Structure of Computer Science/Information Technology (IT) Syllabus I YEAR II
SEMESTER
Paper-II : PROGRAMMING IN C
Course Objectives
1. Learn how to solve common types of computing problems.
2. Learn data types and control structures of C
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. Appreciate and understand the working of a digital computer
2. Analyze a given problem and develop an algorithm to solve the problem
3. Improve upon a solution to a problem
4. Use the 'C' language constructs in the right way
5. Design, develop and test programs written in 'C'
UNIT I
Introduction to Algorithms and Programming Languages: Algorithm – Key features of Algorithms –
examples of Algorithms – Flow Charts – Programming Languages – Generation of Programming
Languages – Structured Programming Language.
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 –
Type Conversion and Type Casting
UNIT II
Decision Control and Looping Statements: Introduction to Decision Control Statements – Conditional
Branching Statements – Iterative Statements – Nested Loops – Break and Continue Statement – Goto
Statement
Functions: Introduction – using functions – Function declaration/ prototype – Function definition –
function call – return statement – Passing parameters – Scope of variables – Storage Classes – Recursive
functions.
UNIT III
Arrays: Introduction – Declaration of Arrays – Accessing elements of the Array – Storing Values in Array
– Calculating the length of the Array – Operations on Array – one dimensional array for inter-function
communication – Two dimensional Arrays –Operations on Two Dimensional Arrays -
Strings: Introduction – String Operations –String and Character functions
UNIT IV
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 – Passing Array to Function – Array 0f Function Pointer – Pointers to Pointers
– Memory Allocation in C Programs – Memory Usage – Dynamic Memory Allocation – Drawbacks of
Pointers
Structure, Union, and Enumerated Data Types: Introduction – Nested Structures – Arrays of Structures
– Self referential Structures – Union – Enumerated Data Types
UNIT V
Files: Introduction to Files – Using Files in C – Reading Data from Files – Writing Data from Files –
Detecting the End-of-file – Error Handling during File Operations.
TEXT BOOKS
1. Introduction to C programming by REEMA THAREJA from OXFORD UNIVERSITY PRESS

2. E Balagurusamy: ―COMPUTING FUNDAMENTALS & C PROGRAMMING – Tata McGraw-Hill,
Second Reprint 2008, ISBN 978-0-07-066909-3.
REFERENCE BOOKS
1. Ashok N Kamthane: Programming with ANSI and Turbo C, Pearson Edition Publ, 2002.
2. Henry Mullish & Huubert L.Cooper: The Spirit of C An Introduction to modern Programming, Jaico
Pub. House,1996.
Student Activity:
1. Write a program for preparing the attendance particulars of students of your college at
the end of semester according to following guidelines
a. Above 75 % promoted
b. Above 65% condoned
c. Below 65% detained
2. Write a program for creating timetable or your class taking work load of faculty into
consideration.
CBCS - BSc(Computer Science) - I YEAR - SEMESTER-II (w.e.f. 2016-’17)
PROGRAMMING IN C
Section-A
1. What is constant? Explain various constants used in C language

2. Define flowchart. Write various symbols used in flow chart.
3. Explain about switch statement with an example
4. Write a C program to find sum of first ‘n’ natural numbers
5. Differentiate one-dimensional and two-dimensional arrays
6. Write about various character functions
7. Define pointer. Explain declaration of a pointer variable in C
8. Write differences between structure and union
9. Explain the use of files in C language
10. Explain how to detect end of file thru a program
Section - B
Answer any FIVE of the following Questions (5  10 =50 Marks)
11. Explain about structure of a C program with an example

12. Write about basic data types used in C language
13. Explain various decision control statements used in C language
14. What is function? Explain how a function is declared in C
15. What is an array? Explain how one-dimensional arrays are used in a C program
16. Define string. Explain various string operations
17. Explain dynamic memory allocation in C
18. What is a structure? Explain with an example
19. Explain how to read data from files in a C program
20. Write about error handling in file operations

PROGRAMMING IN C LAB
1. Find out the given number is perfect number or not using c program.
2. Write a C program to check whether the given number is Armstrong or not.
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 sequence are 0 and 1.
Subsequent terms are found by adding the preceding two terms in the sequence. Write a C program to
print the Fibonacci series
5. Write a C program to generate the first n terms of the Fibonacci sequence.
6. Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied
by the user.
7. Write a C program to find both the largest and smallest number in a list of integers.
8. Write a C program that uses functions to perform the following:
a. Addition of Two Matrices
b. Multiplication of Two Matrices
9. Write a program to perform various string operations
10. Write C program that implements searching of given item in a given list
11. Write a C program to sort a given list of integers in ascending order
Structure of Computer Science/Information Technology (IT) Syllabus II YEAR
III SEMESTER
Paper-III : OBJECT ORIENTED PROGRAMMING USING JAVA
Course Objectives
As the business environment becomes more sophisticated, the software development (software engineering
is about managing complexity) is becoming increasingly complex. As of the best programming paradigm
which helps to eliminate complexity of large projects, Object Oriented Programming (OOP) has become
the predominant technique for writing software in the past decade. Many other important software
development techniques are based upon the fundamental ideas captured by object-oriented programming.
Course Outcomes
At the end of this course student will:

1. Understand the concept and underlying principles of Object-Oriented Programming
2. Understand how object-oriented concepts are incorporated into the Java programming language
3. Develop problem-solving and programming skills using OOP concept
4. Understand the benefits of a well structured program
5. Develop the ability to solve real-world problems through software development in high-level
programming language like Java
6. Develop efficient Java applets and applications using OOP concept
7. Become familiar with the fundamentals and acquire programming skills in the Java language.
UNIT-1
FUNDAMENTALS OF OBJECT – ORIENTED PROGRAMMING : Introduction, Object Oriented

paradigm, Basic Concepts of OOP, Benefits of OOP, Applications of OOP , Java features: OVERVIEW OF
JAVA LANGUAGE: Introduction, Simple Java program structure, Java tokens, Java Statements,
Implementing a Java Program, Java Virtual Machine, Command line arguments. CONSTANTS,
VARIABLES & DATA TYPES: Introduction, Constants, Variables, Data Types, Declaration of Variables,
Giving Value to Variables, Scope of variables, Symbolic Constants, Type casting, Getting Value of
Variables, Standard Default values; OPERATORS & EXPRESSIONS.
UNIT-II
DECISION MAKING & BRANCHING: Introduction, Decision making with if statement, Simple if
statement, if. Else statement, Nesting of if. else statements, the else if ladder, the switch statement, the
conditional operator. LOOPING: Introduction, The While statement, the do-while statement, the for
statement, Jumps in loops.
CLASSES, OBJECTS & METHODS: Introduction, Defining a class, Adding variables, Adding methods,
Creating objects, Accessing class members, Constructors, Method overloading, Static members, Nesting of
methods;
UNIT-III
INHERITANCE: Extending a class, Overloading methods, Final variables and methods, Final classes,
Abstract methods and classes;
ARRAYS, STRINGS AND VECTORS: Arrays, One-dimensional arrays, Creating an array, Two –
dimensional arrays, Strings, Vectors, Wrapper classes;
INTERFACES: MULTIPLE INHERITANCE: Introduction, Defining interfaces, Extending interfaces,
Implementing interfaces, Assessing interface variables;
UNIT-IV
MULTITHREADED PROGRAMMING: Introduction, Creating Threads, Extending the Threads,
Stopping and Blocking a Thread, Lifecycle of a Thread, Using Thread Methods, Thread Exceptions,
Thread Priority, Synchronization, Implementing the ‘Runnable’ Interface. MANAGING ERRORS AND
EXCEPTIONS: Types of errors : Compile-time errors, Run-time errors, Exceptions, Exception handling,
Multiple Catch Statements, Using finally statement,
UNIT-V
APPLET PROGRAMMING: local and remote applets, Applets and Applications, Building Applet code,
Applet Life cycle: Initialization state, Running state, Idle or stopped state, Dead state, Display state.
PACKAGES: Introduction, Java API Packages, Using System Packages, Naming conventions, Creating
Packages, Accessing a Package, using a Package.
Reference Books:
1. E.Balaguruswamy, Programming with JAVA, A primer, 3e, TATA McGraw-Hill Company.
2. John R. Hubbard, Programming with Java, Second Edition, Schaum’s outline Series,
TATA McGraw-Hill Company.
3. Deitel &Deitel. Java TM: How to Program, PHI (2007)
4. Java Programming: From Problem Analysis to Program Design- D.S Mallik
5. Object Oriented Programming Through Java by P. Radha Krishna, Universities Press (2008)
Student Activity:
1. Create a front end using JAVA for the student database created
2. Learn the difference between ODBC and JDBC
CBCS – BSc(COMPUTER SCIENCE) - II YEAR - SEMESTER-III

OBJECT ORIENTED PROGRAMMING USING JAVA
Section-A
1. Explain about command line arguments.

2. Discuss about JVM.
3. Write about conditional operator
4. Define a class. How to define a class in Java.
5. Explain abstract methods.
6. What is an array? Discuss creating a one dimensional array in Java.
7. Write short notes on Thread
8. Discuss how to implement the Runnable Interface.
9. Differentiate local and remote applets.
10. Write about different Java API packages.
Section - B
11. Explain basic concepts of OOP.

12. Write about the structure of Java Program with an example.
13. Write in detail about looping structures in Java
14. Explain about constructors in Java.
15. Explain about Inheritance with an example.
16. Write about Interfaces used in Java
17. How to handle exceptions in Java with an example.
18. What is Thread? Explain thread life cycle.
19. Explain how to create user defined package.
20. Explain Applet life cycle in detail.
Structure of Computer Science/Information Technology (IT) Syllabus OBJECT
ORIENTED PROGRAMMING USING JAVA LAB
1. Write a program to perform various String Operations

2. Write a program on class and object in java
3. Write a program to illustrate Function Overloading & Function Overriding methods in Java
4. Write a program to illustrate the implementation of abstract class
5. Write a program to implement Exception handling
6. Write a program to create packages in Java
7. Write a program on interface in java
8. Write a program to Create Multiple Threads in Java
9. Write a program to Write Applets to draw the various polygons
10. Write a program which illustrates the implementation of multiple Inheritance using interfaces in
Java
11. Write a program to assign priorities to threads in java
Structure of Computer Science/Information Technology (IT) Syllabus II YEAR IV
SEMESTER
Paper-IV: DATA STRUCTURES

Course Objectives
To introduce the fundamental concept of data structures and to emphasize the importance of data structures
in developing and implementing efficient algorithms..
Course Outcomes
After completing this course satisfactorily, a student will be able to:

1. Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are represented
in memory and used by algorithms
2. Describe common applications for arrays, records, linked structures, stacks, queues, trees, and
graphs.
3. Write programs that use arrays, records, linked structures, stacks, queues, trees, and graphs
4. Demonstrate different methods for traversing trees
5. Compare alternative implementations of data structures with respect to performance
6. Compare and contrast the benefits of dynamic and static data structures
implementations
7. Describe the concept of recursion, give examples of its use, describe how it can be implemented
using a stack .
8. Discuss the computational efficiency of the principal algorithms for sorting, searching,
and hashing.
UNIT I
Concept of Abstract Data Types (ADTs)- Data Types, Data Structures, Storage Structures, and File
Structures, Primitive and Non-primitive Data Structures, Linear and Non-linear Data Structures.
Linear Lists – ADT, Array and Linked representations, Pointers.
Arrays – ADT, Mappings, Representations, Sparse Matrices Linked Lists: Single Linked List, Double
Linked List, Circular Linked List , applications
UNIT II
Stacks: Definition, ADT, Array and Linked representations, Implementations and Applications
Queues: Definition, ADT, Array and Linked representations, Circular Queues, Dequeues, Priority Queues,
Implementations and Applications.
UNIT III
Trees: Binary Tree, Definition, Properties, ADT, Array and Linked representations, Implementations and
Applications. Binary Search Trees (BST) – Definition, ADT, Operations and Implementations,
UNIT IV
Graphs – Graph and its Representation, Graph Traversals, Connected Components, Basic
Searching Techniques, Minimal Spanning Trees
UNIT- V
Sorting and Searching: Selection, Insertion, Bubble, Merge, Quick, sort, Sequential and
Binary Searching.
REFERENCE BOOKS
1. D S Malik, Data Structures Using C++, Thomson, India Edition 2006.
2. Sahni S, Data Structures, Algorithms and Applications in C++, McGraw-Hill,
2002.
3. SamantaD, Classic Data Structures, Prentice-Hall of India, 2001.
4. Heilman G I,. Data Structures and Algorithms with Object-Oriented
Programming, Tata McGraw-l lill. 2002. (Chapters I and 14).
5. Tremblay P, and Sorenson P G, Introduction to Data Structures with Applications,
Tata McGraw-Hill,
Student activity:
1. Create a visible stack using C-graphics
2. Create a visible Queue using C-graphics
CBCS - BSc(Computer Science) - II YEAR - SEMESTER-IV (w.e.f. 2016-’17)
DATA STRUCTURES
SECTION-A
1. Explain about ADT.

2. Write about storage structures
3. What are the applications of stack? Explain
4. Write the differences between stack and queue
5. Write about fully and complete binary Tree
6. Write about tree terminologies
7. What is Graph? Write the representation of adjacency matrix
8. Write short notes on BFS.
9. What is sorting? Write an algorithm for Bubble sort
10. What is searching? Explain about sequential search.
SECTION - B
11. Write the classification of Data structures with diagram?

12. Explain about primitive data structures.
13. What are the operations performed on stacks with neat diagram?
14. Write the algorithm for Queue insert and Queue Delete
15. What is Binary tree? Write the Tree traversal techniques in Binary tree.
16. What is Binary search tree Give an example?
17. Write about Minimum Spanning tree?
18. Explain BFS and DFS
19. What is insertion sort? Explain the procedure with an Example?
20. Explain about Binary search.
DATA STRUCTURES USING JAVA LAB
1. Write a Program to implement the Linked List operations

2. Write a Program to implement the Stack operations using an array.
3. Write Programs to implement the Queue operations using an array.
4. Write Programs to implement the Stack operations using a singly linked list.
5. Write Programs to implement the Queue operations using a singly linked list.
6. Write a program for arithmetic expression evaluation
7. Write a program to implement Double Ended Queue using a doubly linked list.
8. Write a program to search an item in a given list using Linear Search and Binary
Search
9. Write a program for Quick Sort
10. Write a program for Merge Sort
11. Write a program on Binary Search Tree operations(insertion, deletion and traversals)
12. Write a program for Graph traversals.

w.e.f.2017-2018
III YEAR V SEMESTER
Paper-V: Data Base Management System
Course Objective:
Design & develop database for large volumes & varieties of data with optimized data
processing techniques.
Course Outcomes
On completing the subject, students will be able to:

1. Design and model of data in database.
2. Store, Retrieve data in database.
Unit-I: Overview of Database Management System: Introduction, Data and Information,

Database, Database Management System, Objectives of DBMS, Evolution of Database
Management Systems, Classification of Database Management System.
Unit-II: File-Based System, Drawbacks of File-Based System, Advantages of DBMS,

Services of DBMS, Components of Database System, CODD’S Rules
The Relational Database Model: Integrity Rules, Relational Set Operators, Relationships
within the Relational Database,
Unit-III: Entity–Relationship Model: Introduction, The components of an Entity–

Relationship model, entities, attributes, relationships, Classification of Entity Sets, Attribute
Classification, Relationship Degree, Relationship Classification. Normalization, Normal
forms (1NF,2NF,3NF,BCNF)
Unit-IV: Structured Query Language: Introduction, Commands in SQL, SQL literals, Data
types in SQL, SQL operators, Data Definition Language (DDL) commands, Data
Manipulation Language commands, Table Modification, Table Truncation, Queries, Sub
queries, Aggregate Functions, Set Operators
Unit-V: PL/SQL: Introduction, Structure of PL/SQL program, PL/SQL Data Types, PL/SQL
operators, Steps to Create a PL/SQL Program, Control Structures: conditional control
statements, Iterative Control statements, Cursors, Steps to create a Cursor
w.e.f.2017-2018
TEXT BOOKS:
1. Peter Rob, Carlos Coronel, Database Systems Design, Implementation and Management,
Seventh Edition, Thomson (2007)
2. SQL, PL/SQL the Programming Language of Oracle, Ivan Bayross, BPB publications
Reference Books
1. Paneerselvam: Database Management Systems, PHI.

2. “Database System Concepts” by Abraham Silberschatz, Henry Korth, and S.
Sudarshan, McGrawhill, 2010, 9780073523323
3. “Database Management Systems” by Raghu Ramakrishnan, McGrawhill, 2002,
4. Fundamentals of Relational Database Management Systems by S. Sumathi, S.

Esakkirajan, Springer Publications
5. “Fundamentals of Database Systems” by R. Elmasri and S. Navathe
Student Activity:
1. Create your college database for placement purpose.
Create faculty database of your college with their academic performance
scores
CBCS – BSc(COMPUTER SCIENCE) - III YEAR - SEMESTER-V

DATABASE MANAGEMENT SYSTEM
Section-A
1. Describe the following

a) Data b) information c) DBMS
2. Write the objectives of DBMS
3. Explain the Services of DBMS
4. What are the Components of DBMS? Explain
5. What is an entity and explain their types.
6. Explain the relationship degree with an example
7. Define literal. Write about various literals used in SQL
8. Explain aggregate functions
9. Briefly explain the block structure of PL/SQL suitable example
10. Write steps to create a PL/SQL program
Section-B
11. Explain evolution of database management system

12. Classification of data base management system
13. Explain advantages of DBMS
14. Write a short note on ER model
15. What is normalization? Explain normal forms with an example
16. Explain relationship within the relational database
17. Explain about data manipulation command s
18. Explain about relational set operators with examples
19. Write about iterative control structures
20. Explain cursors and their types
III YEAR V SEMESTER
DATABASE MANAGEMENT SYSTEMS LAB
1. Draw ER diagrams for train services in a railway station

2. Draw ER diagram for hospital administration
3. Creation of college database and establish relationships between tables
4. Creation of reports based on queries
5. Creation of a table with constraints
6. Write a program to find factorial of a number
7. Write a program to find sum of digits of an integer
8. Write a program to demonstrate a function
9. Write a program to demonstrate cursors
10. Write a program to demonstrate Aggregate functions
w.e.f.2017-2018
III YEAR V SEMESTER

Paper VI : Software Engineering
Course Objectives
The Objective of the course is to assist the student in understanding the basic theory of
software engineering, and to apply these basic theoretical principles to a group software
development project.
Course outcomes
1. Ability to gather and specify requirements of the software projects.
2. Ability to analyze software requirements with existing tools
3. Able to differentiate different testing methodologies
4. Able to understand and apply the basic project management practices in real life projects
5. Ability to work in a team as well as independently on software projects
UNIT I
INTRODUCTION: The Evolving Role of Software – Software and its characteristics –

Software Myths – Software Engineering – Components of Software Engineering – Software
Engineering – A Layered Technology. Reactive Vs Proactive Risk Strategies – types of
Software Risks – Risk Management process
UNIT II
SOFTWARE PROCESS MODELS: Prescriptive Models – The waterfall Model –
Incremental Process Models: The Incremental Model, The RAD Model, Evolutionary Process
Model: Prototyping Model, The spiral Model
UNIT III
REQUIREMENTS ENGINEERING: Requirements Engineering Tasks, Initiating the
Requirement Engineering Process.
BUILDING THE ANALYSIS MODEL: Requirements Analysis, Analysis Modeling
Approaches, Data Modeling Concepts, Flow – oriented Modeling: Creating a Data Flow
Model.
UNIT IV
SOFTWARE DESIGN: Design Process & Design Quality – Design concepts –
Architectural styles & Patterns. Quality Management: Quality Concepts – Software Quality
Assurance
UNIT V
SOFTWARE QUALITY AND TESTING : Functional Testing – System Testing – User
satisfaction Testing – Test Cases – Test plans.
SOFTWARE PROJECT MANAGEMENT (SPM): Introduction – SPM basics – Project
Management –Project Integration Management – Project Life Cycle.
w.e.f.2017-2018
TEXT BOOKS:
1. Roger Pressman S., “Software Engineering: A Practitioner's Approach”, McGraw Hill,
2010.
REFERENCE BOOKS:
1. Software Engineering Principles and Practice by Deepak Jain Oxford University Press
2. Sommerville, “Software Engineering”, Eighth Edition, Pearson Education, 2007
3. Pfleeger, “Software Engineering: Theory & Practice”, 3rd Edition, Pearson Education,
2009
4. Carlo Ghazi, Mehdi Jazayari, Dino Mandrioli, “Fundamentals of Software Engineering”,
Pearson Education, 2003
Student Activity:
1. Visit any financial organization nearby and prepare
requirement analysis report
2. Visit any industrial organization and prepare risk chart.
CBCS – BSc(COMPUTER SCIENCE) - III YEAR - SEMESTER-V

SOFTWARE ENGINEERING
Section-A
1. Define software and explain its characteristics.

2. List and Explain software myths.
3. Write advantages & disadvantages of waterfall model.
4. Define Incremental model.
5. Write about initiating requirements engineering process.
6. Draw level 0 and level 1 DFD for ATM system.
7. Write quality concepts.
8. Define design process.
9. Discuss about Software Project Management basics.
10. Define test plans.
Section-B
11. Explain components of software engineering.

12. What is a risk? Explain its types in detail.
13. Explain about RAD model.
14. What is spiral model? Explain in detail.
15. Discuss about requirements engineering tasks.
16. Explain Analysis models.
17. Define and explain Software Quality Assurance.
18. Write about Design concepts in software design.
19. What is software testing? Explain Functional testing.
20. Explain software Project life cycle.
w.e.f.2017-2018
III YEAR V SEMESTER

Software Engineering Lab
1. Studying various phases of Water-Fall Model.

2. Prepare SRS for Banking or On line book store domain problem
3. Calculate effort using FP oriented estimation model
4. Analyze the Risk related to the project and prepare RMMM plan.
5. Develop Time-line chart and project table using PERT or CPM project scheduling
methods.
6. Draw E-R diagram, DFD, CFD and STD for the project.
7. Design of the test cases.
8. Prepare FTR. Version control and change control for software configuration item
w.e.f.2017-2018
III YEAR VI SEMESTER
Paper-VII: Elective-I(A)
Operating Systems
Course Objectives
1. To understand the services provided by and the design of an operating system.

2. To understand the structure and organization of the file system.
3. To understand what a process is and how processes are synchronized and scheduled.
4. To understand different approaches to memory management.
5. Students should be able to use system calls for managing processes, memory and the
file system.
Course Outcomes
1. Analyze the concepts of processes in operating system and illustration of the scheduling
of processor for a given problem instance.
2. Identify the dead lock situation and provide appropriate solution so that protection
and security of the operating system is also maintained.
3. Analyze memory management techniques, concepts of virtual memory and disk
scheduling.
4. Understand the implementation of file systems and directories along with the interfacing of
IO devices with the operating system.
UNIT - I
Operating System Introduction: Operating Systems Objectives and functions, Computer
System Architecture, OS Structure, Evolution of Operating Systems (Simple Batch, Multi
programmed, Distributed Systems, Real-Time Systems), Operating System services.
UNIT - II
Process and CPU Scheduling - Process concepts - The Process, Process State, Process
Control Block, Threads, Process Scheduling - Schedulers, Preemptive and non-preemptive
Scheduling algorithms (FCFS, SJF, RR)
UNIT - III
Memory Management and Virtual Memory - Logical & physical Address Space, Swapping,
Contiguous Allocation, Paging, Structure of Page Table. Segmentation, Segmentation with
paging
w.e.f.2017-2018
UNIT - IV
File System Interface - The Concept of a File, Access methods, Directory Structure, File
Sharing, Protection, File System Structure
Mass Storage Structure - Overview of Mass Storage Structure, Disk Structure, Disk
Attachment
UNIT - V
Deadlocks - System Model, Deadlock Characterization, Methods for Handling Deadlocks,
Deadlock Prevention, Deadlock Avoidance, Deadlock Detection and Recovery from
Deadlock.
.
TEXT BOOK
1. Operating System Principles, Abraham Silberchatz, Peter B. Galvin, Greg Gagne
8th Edition, Wiley Student Edition.
2. Operating systems - Internals and Design Principles, W. Stallings, 6th
Edition, Pearson.
REFERENCES BOOKS:
1. Principles of Operating Systems by Naresh Chauhan, OXFORD University Press

2. Modern Operating Systems, Andrew S Tanenbaum 3rd Edition PHI.
3. Operating Systems A concept - based Approach, 2nd Edition, D. M.
Dhamdhere, TMH.
4. Principles of Operating Systems, B. L. Stuart, Cengage learning, India Edition.
5. Operating Systems, A. S. Godbole, 2nd Edition, TMH
Student Activity:
1. Load any new operating system into your computer.
2. Partition the memory in your system
3. Create a file in a directory structure
CBCS – BSc(Computer Science) - III YEAR - SEMESTER-V

Paper-VII : Elective-I(A)
OPERTING SYSTEMS
SECTION-A
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
SECTION - B
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
w.e.f.2017-2018

Paper-VII: Elective-I(A)
Operating Systems Lab
1. Given the list of processes, their CPU burst times and arrival times, display/print the
Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print
the average waiting time and average turnaround time.
2. Developing applications using Inter Process Communication (using shared memory)
3. Implement any two memory management schemes
4. Implement file allocation techniques (Linked)
5. Implement Deadlock prevention algorithm.
6. Given the list of processes, their CPU burst times and arrival times, display/print the
Gantt chart for Round robin. Compute and print the average waiting time and average
turnaround time.
7. Implement file allocation techniques (Indexed)
8. Implement file allocation techniques (Contiguous)
9. Developing applications using Inter Process Communication (pipes)
10. Developing applications using Inter Process Communication (message queues)
11. Implement Deadlock detection algorithm.
12. Implement Deadlock avoidance algorithm.
w.e.f.2017-2018

Paper-VII: Elective-I(B)
DISTRIBUTED SYSTEMS
Course Objectives
 To expose the fundamentals of distributed computer systems, assuming the
availability of facilities for data transmission.
 To discuss multiple levels of distributed algorithms, distributed file systems,
distributed databases, security and protection.
Course Outcomes
 Create models for distributed systems.
 Apply different techniques learned in the distributed system.
UNIT I
Introduction to Distributed Computing Systems, System Models, and Issues in Designing a
Distributed Operating System, Examples of distributed systems.
UNIT II
Features of Message Passing System, Synchronization and Buffering, Introduction to RPC
and its models, Transparency of RPC, Implementation Mechanism, Stub Generation and
RPC Messages, Server Management, Call Semantics, Communication Protocols and Client
Server Binding.
UNIT III
Introduction, Design and implementation of DSM system, Granularity and Consistency
Model, Advantages of DSM, Clock Synchronization, Event Ordering, Mutual exclusion,
Deadlock, Election Algorithms.
UNIT IV
Task Assignment Approach, Load Balancing Approach, Load Sharing Approach, Process
Migration and Threads.
UNIT V
File Models, File Accessing Models, File Sharing Semantics, File Caching Schemes, File
Replication, Atomic Transactions, Cryptography, Authentication, Access control and Digital
Signatures.
Text Book
1.Pradeep. K. Sinha: “ Distributed Operating Systems: Concepts and Design ” , PHI, 2007.
Reference Books
1 .George Coulouris, Jean Dollimore, Tim Kindberg: “ Distributed Systems” , Concept and
rd
Design, 3 Edition, Pearson Education, 2005.
Student Activity
1. Implementation of Distributed Mutual Exclusion Algorithm.
2. Create a Distributed Simulation Environment.
CBCS – BSc(Computer Science) - III YEAR - SEMESTER-VI

Paper-VII : Elective-I(B)
DISTRIBUTED SYSTEMS
SECTION-A
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
SECTION - B
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.

w.e.f.2017-2018

Paper-VII: Elective-I(B)
DISTRIBUTED SYSTEMS LAB
1. Java program using RPC

2. Java program using Client/Server implementation
3. Java program to implement deadlock avoidance
4. Implementation of mutual exclusion
5. Java program to demonstrate clock synchronization
6. Java program to implementation of election algorithm
7. Java program to implement threads
8. File replication methods
9. Java program for access a sequential file
10. Implementation cryptography techniques

w.e.f.2017-2018

Paper-VII : Elective-I(C)
WEB TECHNOLOGIES
Course Objective
 To provide knowledge on web architecture, web services, client side and server side
scripting technologies to focus on the development of web-based information systems and
web services.
 To provide skills to design interactive and dynamic web sites.
Course Outcome
1. To understand the web architecture and web services.

2. To practice latest web technologies and tools by conducting experiments.
3. To design interactive web pages using HTML and Style sheets.
4. To study the framework and building blocks of .NET Integrated Development
Environment.
5. To provide solutions by identifying and formulating IT related problems.
UNIT -1
Introduction to Internet : Definition of Internet – History of Internet – Advantages &
disadvantages of Internet – Tools of internet - How internet works. Introduction to WWW:
Definition of WWW –WWW tools - Web Terminology –web browser – web server
UNIT-2
E-Mail : Definition of e-mail – advantages & disadvantages of e-mail – how to work with e-
mail accounts – e-mail inner working : Store and forward method & Central mail spool
method– message components – message composition – features of e-mail. Protocols:
TCP/IP - HTTP
UNIT -3
Introduction to HTML: Basic HTML – HTML document structure – HTML tags – Basefont
tag – title tag – body tag – Text formatting tags – Character tags - Character entities
HTML Lists : Ordered List , Unordered List & Definition List – Using colors – Using Images
w.e.f.2017-2018
UNIT – 4
Horizontal Rule Tag - HTML Tables – Nested Tables - Hyperlinks: Textual, Graphical Links
to sections – Multimedia Objects – Frames – Nested Frames – Forms – Form Controls :
textbox, password, checkbox, radio button, select, text area - Processing of forms
UNIT – 5
Advanced HTML : Cascading Style Sheets: Introduction – Using Styles: As an attribute, tag
& external file – Defining Your own styles – Properties and values : properties related to
Fonts , Backgrounds & colors, text , boxes & borders
Text Book
1. Inline/Online: Fundamentals of the Internet and the World Wide Web, Raymond
Greenlaw Ellen Hepp, McGraw – Hill
2. Harvey M. Deitel and Paul J. Deitel, “Internet & World Wide Web How to
Program”, 4/e, Pearson Education.
References:
1. Chris Bates, Web Programming Building Internet Applications, Second Edition,

Wiley.
2. Uttam Kumar Roy, Web Technologies from Oxford University Press
3. Paul S.Wang Sanda S. Katila, An Introduction to Web Design Plus
Programming,Thomson.
4. Robert W.Sebesta, Programming the World Wide Web, Third Edition, Pearson
Education.
5. Joel Sklar, Principles of Web Design, Thomson.
6. Raj Kamal, Internet and Web Technologies, Tata McGraw Hill.
7. Gopalan & Akilandeswari, Web Technology: A Developer‟s Perspective, PHI.
Student Activities:
1. Prepare a web site for your college

2. Prepare your personal website
WEB TECHNOLOGIES
Section-A
1. What is Internet? Write about advantages of Internet

2. Explain briefly about web server
3. What is protocol? Explain TCP/IP
4. Explain about message composition in Internet
5. What is HTML? Explain HTML document structure
6. Write about Basefont tag
7. Briefly explain about hyperlinks
8. Explain about frames
9. What is a property? Explain various properties
10. Explain about attribute.
Section - B
11. Write about Tools of WWW

12. Explain about how Internet works
13. Write about e-mail advantages.
14. Explain various message components in creating an e-mail
15. Write in detail about HTML tags.
16. Explain about HTML lists.
17. Explain about tables in HTML
18. Write about form controls used in designing a web page.
19. Explain CSS with an example
20. Illustrate how to create a web page with your own styles.

w.e.f.2017-2018

Web Technologies Lab
1. Create a simple HTML page which demonstrates all types of lists.

2. Create a letter head of your college using following styles
i. image as background
ii. use header tags to format college name and address
3. Create a web page, which contains hyper links like fruits, flowers, animals. When
you click on hyper links, it must take you to related web page; these web pages must
contain with related images.
4. Create a hyperlink to move around within a single page rather than to load another
page.
5. Create a leave letter using different text formatting tags.
6. Create a table format given bellow using row span and colspan.
MARKS
RNO NAME
M1 M2 M3 M4 M5
Insert 5 records.
7. Create a table with different formats as given bellow.
i. Give different background and font colors to table header, footer and body.
ii. Use table caption tag.
8. Divide a web page vertically and horizontally with scroll bars, name them as shown
bellow decorate it with some items.
F2
F1
F3
9. Create a student Bio-Data, using forms.

10. Create a web page using following style sheets
i. Inline style sheets.
ii. Embedded style sheets.
iii. External style sheets
w.e.f.2017-2018

(Cluster A) Paper-VIII : Elective–II-1
VISUAL BASIC PROGRAMMING
Course Objective
 To provide knowledge on GUI programming concepts

 To provide skills to understand how controls are used in programming
Course Outcome
1. To understand the Graphical user interface design

2. To understand input and output operations using forms
3. To study the menu design
4. To study the coding system of various controls
UNIT – I
Object Oriented Programming : Introduction to OOPS – Basic Concepts – Objects and
Classes – Concepts of Inheritance. Encapsulation and Polymorphism.
Fundamentals Of Visual Basic : Introduction – Features of VB – VB Editions – Controls –
Properties – Events – Methods.
UNIT – II
Application Window
Project Explorer – The Properties Window – Tool Box: Text Box Control – Command
Button – Check Box – The line and shape controls – Menu Bar – Tool bars – Tool box –
Project explorer window – Properties window – Object browser – Form Designer – Code
editor window – Form layout window
UNIT-III:
Forms and controls:
Setting form properties – Working with Properties Window – Name – Caption – Picture –
The Controls box – Min button and Max button – Movable – Border style – Font – properties
Form methods: Move, Graphic methods, Show method
Form Events - Working with a control – Opening the code window.
UNIT – IV
Variables in VB: Declaring variables – Data types – Constants – Conversion – Arrays
Writing Code in VB: The code window – Subroutine – control Structures in VB – Performing
Loops in VB.
UNIT V
Arrays: Definition, one dimensional and two dimensional arrays, declaring array, storing
values in an array
Menus: Menu convention – creating menus in VB
Multiple Documents Interfaces: Features of MDI Form – Property – Creating MDI forms
TEXT BOOKS:
1. PROGRAMING WITH VISUAL BASIC – MOHAMMED AZAM – Vikas publishing
house Pvt.Ltd. – New Delhi.
2. OBJECT ORIENTED PROGRAMING – E. BALAGURUSWAMY – Tata McGraw – Hill
Publishing Company Limited – New Delhi.
REFERENCE BOOKS:
1. ‘VISUAL BASIC 6.0 PROGRAMMING ” – Content Development Group – Tata McGraw –
Hill Publishing Company Limited – 2002 – New Delhi
2. ‘INTRODUCTION TO OOP AND VB’ – V.K.JAIN – Vikas Publishing House – New Delhi
3. ‘VISUAL BASIC 6’ – PAUL SHERIEF –PRENTICE HALL OF INDIA Pvt. Ltd – New
Delhi.
4. ‘TEACH YOURSELF VISUAL BASIC 6’ –SCOTT WARNER - Tata McGraw – Hill
Publishing Company Limited – New Delhi.
5. “USING VISUAL BAISC 6” – Brain Siler and Jeff Spotts – Prentice Hall Of India Limited –
New Delhi – Eleventh Edition (2002).

VISUAL BASIC PROGRAMMING
Section-A
1. Write about classes and objects.

2. Briefly explain Visual Basic editions.
3. Define project explorer window
4. Explain Form Designer
5. Write about forms and controls.
6. What is a method? Explain any three form methods
7. What is a variable? Explain how to declare variables in VB
8. Explain constants in Visual Basic
9. Define an array. Write about declaring an array
10. What is menu? Explain
Section - B
11. Write about basic concepts of OOPS

12. Write in detail about features of VB
13. What is tool box? Explain various tools in tool box
14. Write about text box control in VB
15. Explain how you will work with properties window.
16. Write about various form events used in Visual Basic.
17. Explain various data types used in Visual Basic
18. Write about looping statements in VB
19. Briefly explain menu creation in Visual Basic
20. Explain in detail about creating a MDI form.
w.e.f.2017-2018

VISUAL BASIC PROGRAMMING LAB
1. Design a form to demonstrate text boxes

2. Design a form to demonstrate check boxes
3. Design a form to demonstrate command buttons
4. Design a form and write code to demonstrate graphic methods of a form
5. Write Visual Basic code to find largest of four numbers
6. Write Visual Basic code to print mathematical table of a number
7. Write Visual Basic code to illustrate select..case statement
8. Write Visual Basic code to find whether a number is prime or not
9. Design a form for simple calculator
10. Design a form to demonstrate various events of a form
11. Menu creation
12. MDI form creation
w.e.f.2017-2018

PHP (PERSONAL HOME PAGE)

Course Objective
 To provide knowledge on web architecture, web services, client side and server side
scripting technologies to focus on the development of web-based information systems and
web services.
 To provide skills to design interactive and dynamic web sites.
Course Outcome
1. To understand the web architecture and web services.

2. To practice latest web technologies and tools by conducting experiments.
3. To design interactive web pages using PHP
UNIT - I
The Building Blocks of PHP
What is PHP? - Variables - Data Types - Operators and Expressions - Constants
Flow Control Functions in PHP
Switching Flow - Loops - Code Blocks and Browser Output
UNIT - II
Working with Functions
What Is a Function - Calling Functions - Defining a Function - Returning Values from User-
Defined Functions - Variable Scope - Saving State Between Function Calls with the static
Statement - Arguments - Testing for the Existence of a Function
UNIT - III
Working with Arrays
What Are Arrays - Creating Arrays – Array Related Constructs and Functions
Working with Objects

Creating an Object - Object Inheritance
UNIT - IV
Working with Strings, Dates, and Time
Formatting Strings - Investigating Strings - Manipulating Strings
Using Date and Time Functions - Date, and Time Functions - Other String,
w.e.f.2017-2018
UNIT - V
Working with Forms
Creating a Simple Input Form - Accessing Form Input with User-Defined Arrays -
Combining HTML and PHP Code on a Single Page - Using Hidden Fields to Save State -
Redirecting the User - Sending Mail on Form Submission - Working with File Uploads
Text books:
1. Sams Teach Yourself PHP, MySQL, and Apache All in One, Fifth Edition - Meloni,
Julie C. 2012 by Pearson Education
Reference Book
1. Visual QuickStart Guide - PHP for the Web, Fourth Edition - Larry Ullman
2. PHP Bible, Tim Converse Joyce Park, 2nd Edition, Wiley
3. Beginning PHP4, Wankyu Choi, Allan Kent, Chris Lea, Ganesh Prasad, Chris Ullman
Wrox publications
PHP (PERSONAL HOME PAGE)
Section-A
1. Write about variables used in PHP

2. Illustrate constants in PHP
3. Explain defining a function.
4. Write about returning values from a function
5. What are arrays? Explain
6. Explain how to create an object in PHP
7. Define String. Write about formatting strings
8. Write any five date functions with examples
9. What is a form? Explain form input
10. Explain how to send a mail on form submission.
Section - B
11. Explain various data types used in PHP

12. Write about various loop statements.
13. What is a function? Explain with an example
14. Write about scope of variables
15. Explain how you will create arrays in PHP
16. Write about working with object in PHP
17. Explain how to manipulate strings with an example
18. Write about time functions with an example
19. Briefly explain how to combine HTML and PHP code on a single page
20. Explain various form elements in PHP
w.e.f.2017-2018

PHP (PERSONAL HOME PAGE) LAB
1. PHP program to demonstrate arithmetic operators

2. PHP program to demonstrate various constants
3. PHP program to find biggest of 5 numbers
4. PHP program to print sum of natural numbers
5. PHP program to find factorial of a number using function
6. PHP program to sort a list of values using an array
7. PHP program to implement any two array related constructs
8. PHP program to create an object
9. PHP program to implement single inheritance
10. PHP program to manipulate strings
11. PHP program to implement date functions
12. PHP program to create a simple form
w.e.f.2017-2018

(Cluster B) Paper-VIII : Elective–II-1
FOUNDATIONS OF DATA SCIENCE
Course Objectives
Modern scientific, engineering, and business applications are increasingly dependent on data,
existing traditional data analysis technologies were not designed for the complexity of the
modern world. Data Science has emerged as a new, exciting, and fast-paced discipline that
explores novel statistical, algorithmic, and implementation challenges that emerge in
processing, storing, and extracting knowledge from Big Data.
Course Outcomes
4. Able to apply fundamental algorithmic ideas to process data.
5. Learn to apply hypotheses and data into actionable predictions.
6. Document and transfer the results and effectively communicate the findings
using visualization techniques.
UNIT I
INTRODUCTION TO DATA SCIENCE :Data science process – roles, stages in data

science project – working with data from files – working with relational databases –
exploring data – managing data – cleaning and sampling for modeling and validation –
introduction to NoSQL.
UNIT II
MODELING METHODS :Choosing and evaluating models – mapping problems to

machine learning, evaluating clustering models, validating models – cluster analysis – K-
means algorithm, Naïve Bayes – Memorization Methods – Linear and logistic regression –
unsupervised methods.
UNIT III
INTRODUCTION TO R Language: Reading and getting data into R – ordered and

unordered factors – arrays and matrices – lists and data frames – reading data from files –
probability distributions – statistical models in R - manipulating objects – data distribution.
w.e.f.2017-2018
UNIT IV
MAP REDUCE: Introduction – distributed file system – algorithms using map reduce,
Matrix-Vector Multiplication by Map Reduce – Hadoop - Understanding the Map Reduce
architecture - Writing Hadoop Map Reduce Programs - Loading data into HDFS - Executing
the Map phase - Shuffling and sorting - Reducing phase execution.
UNIT V
DELIVERING RESULTS :Documentation and deployment – producing effective

presentations– Introduction to graphical analysis – plot() function – displaying multivariate
data – matrix plots – multiple plots in one window - exporting graph - using graphics
parameters.
Reference Books
1.Nina Zumel, John Mount, “Practical Data Science with R”, Manning Publications, 2014.
2.Jure Leskovec, Anand Rajaraman, Jeffrey D.Ullman, “Mining of Massive Datasets”,
Cambridge University Press, 2014.
3.Mark Gardener, “Beginning R - The Statistical Programming Language”, John Wiley &
Sons, Inc., 2012.
4.W. N. Venables, D. M. Smith and the R Core Team, “An Introduction to R”, 2013. 5.Tony
Ojeda, Sean Patrick Murphy, Benjamin Bengfort, Abhijit Dasgupta, “Practical Data
Science Cookbook”, Packt Publishing Ltd., 2014.
6.Nathan Yau, “Visualize This: The FlowingData Guide to Design, Visualization, and
Statistics”, Wiley, 2011.
7.Boris lublinsky, Kevin t. Smith, Alexey Yakubovich, “Professional Hadoop Solutions”,
Wiley, ISBN: 9788126551071, 2015.
Student Activity:
1. Collect data from any real time system and create clusters using any clustering
algorithm
2. Read the student exam data in R perform statistical analysis on data and print
results.
FOUNDATIONS OF DATA SCIENCE

SECTION-A
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
SECTION - B
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
w.e.f.2017-2018

FOUNDATIONS OF DATA SCIENCE LAB
1) Installing R and R studio

2) Basic Operations in R
a. Arithmetic Operations
b. Logical Operators - <=, >, >=, = , !=, &&,
3) Basic data manipulation using R
4) Operation on vectors and matrices.
5) Basic Plotting
6) Frequency plots
7) Box plots
8) Bar charts & Pie charts
9) While, for break, next, repeat.
10) Basic functions- Print(), exp( ), Log( ), sqrt( ), abs( ), sin( ), Cos( ), tan( ), factorial( ), rand ().
w.e.f.2017-2018

BIG DATA TECHNOLOGY
Course Objective
The Objective of this course is to provide practical foundation level training that enables
immediate and effective participation in big data projects. The course provides grounding in
basic and advanced methods to big data technology and tools, including MapReduce and
Hadoop and its ecosystem.
Course Outcome
1. Learn tips and tricks for Big Data use cases and solutions.
2. Learn to build and maintain reliable, scalable, distributed systems with Apache Hadoop.
3. Able to apply Hadoop ecosystem components.
UNIT I
INTRODUCTION TO BIG DATA:Introduction – distributed file system – Big Data and its
importance, Four V‟s in bigdata, Drivers for Big data, Big data analytics, Big data
applications. Algorithms using map reduce, Matrix-Vector Multiplication by Map Reduce.
UNIT II
INTRODUCTION HADOOP : Big Data – Apache Hadoop & Hadoop EcoSystem –

Moving Data in and out of Hadoop – Understanding inputs and outputs of MapReduce - Data
Serialization.
UNIT- III
HADOOP ARCHITECTURE: Hadoop Architecture, Hadoop Storage: HDFS, Common

Hadoop Shell commands , Anatomy of File Write and Read., NameNode, Secondary
NameNode, and DataNode, Hadoop MapReduce paradigm, Map and Reduce tasks, Job,
Tasktrackers - Cluster Setup – SSH & Hadoop Configuration – HDFS Administering –
Monitoring & Maintenance.
w.e.f.2017-2018
UNIT-IV
HADOOP ECOSYSTEM AND YARN :Hadoop ecosystem components - Schedulers - Fair

and Capacity, Hadoop 2.0 New Features- NameNode High Availability, HDFS Federation,
MRv2, YARN, Running MRv1 in YARN.
UNIT-V
HIVE AND HIVEQL, HBASE:-Hive Architecture and Installation, Comparison with

Traditional Database, HiveQL - Querying Data - Sorting And Aggregating, Map Reduce
Scripts, Joins & Subqueries, HBase concepts- Advanced Usage, Schema Design
Reference Books
1. Boris lublinsky, Kevin t. Smith, Alexey Yakubovich, “Professional Hadoop

Solutions”, Wiley, ISBN: 9788126551071, 2015.
2. Chris Eaton, Dirk deroos et al. , “Understanding Big data ”, McGraw Hill, 2012.
3. Tom White, “HADOOP: The definitive Guide” , O Reilly 2012.
4. Vignesh Prajapati, “Big Data Analytics with R and Haoop”, Packet Publishing
2013.
5. Tom Plunkett, Brian Macdonald et al, “Oracle Big Data Handbook”, Oracle Press,
2014.
6. Jy Liebowitz, “Big Data and Business analytics”,CRC press, 2013.
Student Activity:
1. Collect real time data and justify how it has become Big Data
2. Reduce the dimensionality of a big data using your own map reducer
BIG DATA TECHNOLOGY

SECTION-A
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
SECTION - B
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
w.e.f.2017-2018

BIG DATA TECHNOLOGY LAB
1) Implement the following Data Structures in Java

a. Linked Lists
b. Stacks
c. Queues
2) Implement the following Data Structures in Java
a. Set
b. Map
3) Perform setting up and Installing Hadoop in its three operating modes:
a. Standalone, Pseudo distributed, Fully distributed
4) Use the web based tools to monitor your Hadoop setup.
5) Implement the following file management tasks in Hadoop.
a. Adding files
b. Adding directories
c. Retrieving files
d. Deleting files
w.e.f.2017-2018

(Cluster C) Paper-VIII : Elective –II-1
COMPUTER NETWORKS
Course Objectives
1. To provide an introduction to the fundamental concepts on data communication and the

design of computer networks.
2. To get familiarized with the basic protocols of computer networks.
Course Outcomes
After this course, the student will be able to
1. Identify the different components in a Communication System and their respective roles.
2. Describe the technical issues related to the local Area Networks
3. Identify the common technologies available in establishing LAN infrastructure.
UNIT I :
INTRODUCTION: Definition, Advantages of Networks, Network topologies, Types of
Networks, Network models – Internet model, OSI model.
THE PHYSICAL LAYER: Digital Transmission – Coding, Sampling, Analog

Transmission - Modulation of digital and analog signals, Guided media
UNIT II :
DATA LINK LAYER: Error detection and correction, Data link Protocols - Stop and wait,
Go-back-n, Selective repeat.
Wired LANS – Traditional Ethernet, Fast Ethernet, Gigabit Ethernet, Wireless LAN‟s
UNIT III:
NETWORK LAYER: Inter-networks, Addressing, Network layer Protocols – ARP, IPv4,
IPv6
UNIT IV:
TRANSPORT LAYER: Process- to- Process delivery, Congestion and Control, Quality of
service (QOS) and techniques to improve QOS.
SECURITY: Introduction, Symmetric- key cryptography, Public key cryptography.
w.e.f.2017-2018
UNIT V:
THE APPLICATION LAYER: Domain Name System-domain name space, distribution of
name space, DNS in Internet, Electronic mail, SMTP, File Transfer, FTP, HTTP, World Wide
Web.
Text Book
1. Andrew S. Tanenbaum, “Computer Networks”, Fifth Edition, Pearson Education.
Reference Books:
1. Bhushan Trivedi, Computer Networks , Oxford University Press

2. James F.Kurose, Keith W.Ross, “Computer Networking”, Third Edition, Pearson
Education
3. Behrouz A Forouzan, “Data Communications and Networking”, Fourth Edition, TMH
(2007).
4. Kurose & Ross, “COMPUTER NETWORKS” – A Top-down approach featuring the
Internet”, Pearson Education – Alberto Leon – Garciak.
Student Activity:
1. Study the functioning of network devices available in your
organization .
2. Prepare a pictorial chart of LAN connections in your
organization
(Cluster C) Paper-VIII : Elective–II-1
COMPUTER NETWORKS
SECTION-A
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
SECTION - B
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
w.e.f.2017-2018

COMPUTER NETWORKS LAB
1. Connecting computers in LAN

2. Creating and modifying IP addresses to the systems
3. Java program to implement stop and wait protocols
4. Java program to implement goback-N protocol
5. Java program to implement select-repeat ARQ protocols
6. Java program to implement encryption using RSA algorithm
7. Java program to implement decryption using RSA algorithm
8. Java program to implement encryption using Ceasers Cipher
9. Java program to implement decryption using Ceasers Cipher
10. Java program to implement encryption using transposition cipher
w.e.f.2017-2018

CLOUD COMPUTING
Course Objectives:
The student will learn about the cloud environment, building software systems and
components that scale to millions of users in modern internet, cloud concepts capabilities
across the various cloud service models including Iaas, Paas, Saas, and developing cloud
based software applications on top of cloud platforms.
Course Outcomes
1. Compare the strengths and limitations of cloud computing
2. Identify the architecture, infrastructure and delivery models of cloud computing
3. Apply suitable virtualization concept.
4. Choose the appropriate cloud player , Programming Models and approach.
5. Address the core issues of cloud computing such as security, privacy
and interoperability
6. Design Cloud Services and Set a private cloud
Unit 1
Cloud Computing Overview – Origins of Cloud computing – Cloud components - Essential

characteristics – On-demand self-service, Broad network access, Location independent
resource pooling, Rapid elasticity, Measured service
Unit II
Cloud scenarios – Benefits: scalability, simplicity , vendors ,security. Limitations – Sensitive

information - Application development – Security concerns - privacy concern with a third
party - security level of third party - security benefits Regularity issues: Government policies
Unit III
Cloud architecture: Cloud delivery model – SPI framework , SPI evolution , SPI vs.
traditional IT Model
Software as a Service (SaaS): SaaS service providers – Google App Engine, Salesforce.com
and google platfrom – Benefits – Operational benefits - Economic benefits – Evaluating SaaS
Platform as a Service ( PaaS ): PaaS service providers – Right Scale – Salesforce.com –
Rackspace – Force.com – Services and Benefits
w.e.f.2017-2018
Unit IV
Infrastructure as a Service ( IaaS): IaaS service providers – Amazon EC2 , GoGrid – Microsoft soft
implementation and support – Amazon EC service level agreement – Recent developments – Benefits
Unit V
Virtualization: Virtualization and cloud computing - Need of virtualization – cost , administration , fast
deployment , reduce infrastructure cost - limitations
Types of hardware virtualization: Full virtualization - partial virtualization - para virtualization
Reference Books
1. Cloud computing a practical approach - Anthony T.Velte , Toby J. Velte Robert Elsenpeter
TATA McGraw- Hill , New Delhi - 2010
2. Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate
Online - Michael Miller - Que 2008
3. Cloud Computing, Theory and Practice, Dan C Marinescu, MK Elsevier.
4. Cloud Computing, A Hands on approach, Arshadeep Bahga, Vijay Madisetti, University
Press
5. Mastering Cloud Computing, Foundations and Application Programming, Raj Kumar Buyya,
Christenvecctiola, S Tammarai selvi, TMH
Student Activity:
1. Prepare the list of companies providing cloud services category wise.
2. Create a private cloud using local server
(Cluster C) Paper-VIII : Elective–II-2
CLOUD COMPUTING
SECTION-A
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
SECTION - B
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
w.e.f.2017-2018

CLOUD COMPUTING LAB
1) Use Eucalyptus or Open Nebula or equivalent to set up the cloud and demonstrate.
i. Find procedure to run the virtual machine of different configuration. Check how many
virtual machines can be utilized at particular time.
ii. Find procedure to attach virtual block to the virtual machine and check whether it holds the
data even after the release of the virtual machine.
iii. Install a C compiler in the virtual machine and execute a sample program.
iv. Show the virtual machine migration based on the certain condition from one node to the
other.
v. Find procedure to install storage controller and interact with it.
2) Creating a Warehouse Application in Sales Force.com.
3) Creating an Application in Sales Force.com using Apex programming Language.
4) Implementation of SOAP web services in C#/ JAVA Applications.
5) Implementation of Para- Virtualization using VM ware's workstation/ Oracle's Virtual Box and
Guest O.S.
6) Case study: PAAS ( Face book, Google App Engine)
7) Case Study: Amazon web services.

B.Sc. (Computer Science) PDF

Uploaded by

Copyright:

Available Formats

B.Sc. (Computer Science) PDF

Uploaded by

Document Information

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. (Computer Science) PDF

Uploaded by

Copyright:

Available Formats

VIKRAMA SIMHAPURI UNIVERSITY NELLORE

B.SC., COMPUTER SCIENCE

UG (CBCS) SEMESTER PATTERN SYLLABUS

Computer Fundamentals & Photoshop

CBCS – BSc(COMPUTER SCIENCE) - I YEAR - SEMESTER-I

1. Write various limitations of computers.

Answer any FIVE of the following Questions (5 ´ 10 =50 Marks)

11. Draw block diagram of a computer and explain

Instruction to Paper Setter:

1. Create your Visiting card

1. Introduction to C programming by REEMA THAREJA from OXFORD UNIVERSITY PRESS

1. What is constant? Explain various constants used in C language

Answer any FIVE of the following Questions (5  10 =50 Marks)

11. Explain about structure of a C program with an example

Instruction to Paper Setter:

Paper-III : OBJECT ORIENTED PROGRAMMING USING JAVA

At the end of this course student will:

FUNDAMENTALS OF OBJECT – ORIENTED PROGRAMMING : Introduction, Object Oriented

CBCS – BSc(COMPUTER SCIENCE) - II YEAR - SEMESTER-III

1. Explain about command line arguments.

11. Explain basic concepts of OOP.

1. Write a program to perform various String Operations

Paper-IV: DATA STRUCTURES

After completing this course satisfactorily, a student will be able to:

Time: 3 Hours Max. Marks : 75

1. Explain about ADT.

Answer any FIVE of the following Questions (5 ´ 10 =50 Marks)

11. Write the classification of Data structures with diagram?

Instruction to Paper Setter:

DATA STRUCTURES USING JAVA LAB

1. Write a Program to implement the Linked List operations

B.Sc. Computer Science/Information Technology (IT) Syllabus Under CBCS

On completing the subject, students will be able to:

Unit-I: Overview of Database Management System: Introduction, Data and Information,

Unit-II: File-Based System, Drawbacks of File-Based System, Advantages of DBMS,

Unit-III: Entity–Relationship Model: Introduction, The components of an Entity–

1. Paneerselvam: Database Management Systems, PHI.

4. Fundamentals of Relational Database Management Systems by S. Sumathi, S.

CBCS – BSc(COMPUTER SCIENCE) - III YEAR - SEMESTER-V

1. Describe the following

11. Explain evolution of database management system

Instruction to Paper Setter:

III YEAR V SEMESTER

DATABASE MANAGEMENT SYSTEMS LAB

1. Draw ER diagrams for train services in a railway station

III YEAR V SEMESTER

INTRODUCTION: The Evolving Role of Software – Software and its characteristics –

CBCS – BSc(COMPUTER SCIENCE) - III YEAR - SEMESTER-V

1. Define software and explain its characteristics.

11. Explain components of software engineering.

Instruction to Paper Setter:

III YEAR V SEMESTER

1. Studying various phases of Water-Fall Model.

III YEAR VI SEMESTER

1. To understand the services provided by and the design of an operating system.

1. Principles of Operating Systems by Naresh Chauhan, OXFORD University Press

CBCS – BSc(Computer Science) - III YEAR - SEMESTER-V

Answer any FIVE of the following Questions (5  10 =50 Marks)

III YEAR VI SEMESTER