department of computer science (ug)

37 AC Meeting Agenda Page 276

DEPARTMENT OF COMPUTER SCIENCE (UG)

BOS meeting was held in department of Computer Science on 17/03/2018 at 10.30 AM.

The Following members attended the meeting.

1. Sri K.Sridhar--------------Chairman

2. Dr. R.Vijay Kumari------University Nominee

3. Dr. K.Ramchand---------Special Invite

4. Mr. K. Sai Rajasekhar---Alumni

5. Dr.M. Suneetha----------Subject Expert

6. Smt.M. Bhadraja

7. Sri R.Gopi

8. Sri A.N.V.K.Gopichand

9. Sri S.Rajesh

10. Sri D.Vijaya Kumar

11. Smt. YJN Lakshmi

12. Sri K. Sudhir

13. Smt.V. Jhansi Lakshmi

14. Smt.T. Malleswari

15. Smt.Ch. Archana

1. It is resolved to introduce the following courses for B.C.A programme in V semester for students

admitted from 2016 – 2017 academic year ( Annexure – I) .

Programme: B. C. A Semester : V

Sl.

No Course Title

Core /

Elective Creidts

1. Network Security Core 4

2. Software Engineering Core 4

3. OOAD Core 4

4. Data Mining and Warehousing

Elective – 1

3 5. Computer Networks

6. Cyber Forensics

7. Data Mining Lab

2 8. Computer Networks Lab

9. Cyber Forensics Lab

10. Android Basics

Elective - 2

3 11. Principles of Animation

12. SoftwareTesting Methodologies

13. Android Basics Lab

2 14. Computer Animation Lab

15. Testing Tools Lab

Resolutions:

37 AC Meeting Agenda 77

2. It is resolved introduce the following courses for B.C.A programme in VI semester for students

admitted from 2016 – 2017 academic year ( Annexure – II).

Programme: B. C. A Semester: VI

Sl. No Course Title Core /

Elective Credits

1. E - Commerce Core 4

2. Open Source Software Core 4

3. Cloud Computing Core 4

4. Hadoop & R – Language

Elective – 1 4

5. Network Programming

6. Cyber Laws

7. Advanced Android

Elective – 2 4 8. Design of Video Games

9. Advanced Software Testing

10. Main Project 2

3. It is resolved to introduce the following courses for B.Sc (H) Computer Science programme in

V semester for students admitted from 2016–17 Academic Year (Annexure – III).

Programme: B.Sc (H) Computer

Science Semester: V

Sl. No. Course Title Core / Elective Credits

1. Web Designing Core 4

2. Operating Systems Core 4

3. Software

Engineering Core 4

4. Web Designing Lab Core 2

5. Operating Systems

Lab Core 2

6. Project Work -

4. It is resolved to introduce the following courses for B.Sc (H) Computer Science programme in

VI semester for students admitted from 2016–17 Academic Year (Annexure – IV:

Page 60).

Programme: B.Sc (H) Computer

Science Semester: VI

Sl. No. Course Title Core / Elective Credits

1. Software Testing Core 4

2. Information

Security Core 4

3. Cyber Crimes &

Crimes Security

Elective

4

4. Cloud Computing

5. Artificial

Intelligence

6. Software Testing

Lab Core 2

7. Mobile Application

Development Lab Core 2

8. Project Work 4


5. It is resolved to modify the curriculum for B. C. A programme w.e.f 2018 – 2019 admitted batch.

Security Analyst course is introduced into the curriculum as Job ready program in collaboration

with SSC NASSCOM (Annexure – V ).

6. It is resolved to introduce Information Security Management (Security Analyst – 1) in lieu of

Scribus as ICT - 1 for B. C. A in III Semester for the batch of students admitted from academic

year 2018 – 2019.

7. It is resolved to introduce Information Security Assessment and Audit (Security Analyst – 2)

in lieu of Bluegriffon as ICT - 2 for B. C. A IV Semester for the batch of students admitted from

academic year 2018 – 2019.

8. It is resolved to introduce Information Security Incident Response and Management

(Security Analyst – 3) in lieu of Network Security for B. C. A V Semester for the batch of

students admitted from academic year 2018 – 2019.

9. It is resolved to swap Python and UNIX courses(Theory and Practical) for B.C.A II, IV

Semesters respectively for the batch of students admitted from academic year 2018 – 2019.

The swapping of courses is recommended to offer Python course for B.C.A, B.Sc (Computer

Science), B.Sc(H) Computer Science programmes in IV semester.

10. It is resolved to modify the structure for B. Sc (H) Computer Science programme for students

admitted from 2018 – 19 Academic year.(Annexure – VI) with following modicications:

a. Python and Python Lab to be moved from II semester to IV semester in lieu of

Computer Networks and Computer Networks Lab.

b. Computer Networks and Computer Networks Lab to be moved from IV semester to V

semester in lieu of Web Designing and Web Designing Lab.

c. Web Designing and Web Designing Lab to be moved from V semester to II Semester in

lieu of Python and Python Lab.

The swapping of courses is unavoidable to offer Python course for B.C.A, B.Sc (Computer

Science), B.Sc(H) Computer Science programmes in IV semester.

11. It is resolved to introduce Python and Python Lab in lieu of Digital Imaging and Digital

Imaging Lab for B.Sc(MSCA, MECS, MPCS) programmes in IV semester for students admitted

from academic year 2018 – 2019.

12. It is resolved to introduce Python and Python Lab in lieu of DBMS and DBMS Lab for

B.Sc(MSCS) programme in IV semester for students admitted from academic year 2017 – 2018.

13. It is resolved to adopt under mentioned curriculum structure for B.sc (CAME) (Annexure – VII).

The table with I to IV semesters course titles is furnished. The syllabus of courses in V and VI

semesters shall be proposed in next BOS meeting.

14. It is recommended to provide 3hrs lab session for all I year Computer Science students to provide

better hands – on practice and logic development.


Annexure: I

PARVATHANENI BRAHMAYYA SIDDHARTHA COLLEGE OF ARTS & SCIENCE

VIJAYAWADA - 520 010

An autonomous college in the jurisdiction of Krishna University, A.P., India

COMPUTER SCIENCE 2018 - 2019 B. C. A

Semester : V Credits: 4

NETWORK SECURITY Total : 75 Hrs

Course Objectives:

To introduce the concept of

1. Security Attacks, Services & Mechanisms.

2. Studying of various security algorithms available for security and protection.

3. Cryptography and various encryption methods and digital signature.

4. Network security e-mails.

5. Firewalls, Viruses and Intrusion Detection.

Course Outcomes:

By the end of the course, students will be able to

1) Understand OSI security architecture and data Encryption standards.(PO1, PO7)

2) Understand Public Key Cryptography and RSA algorithm. (PO1, PO7)

3) Understand authentication requirements and hash functions. (PO1, PO7)

4) have knowledge about various Authentications and applications. (PO1, PO7)

5) To apply different security mechanisms and counter measures. (PO1, PO7)

UNIT – I Introduction to Network Security 15 hours

OSI Security Architecture, Security Attacks, Security Services, Security Mechanisms, Classical

Encryption techniques (Symmetric Cipher Model, Substitution Techniques, - Caesar Cipher, Hill Cipher

Only, Steganography), Block Cipher Principles(Excluding Feistel Cipher Structure) - Data Encryption

Standard - Block Cipher Design Principles.

UNIT – II Public Key Cryptography and RSA Algorithm 15 hours:

Principles of public – key cryptosystems( public key cryptosystems, conventional vs public key

encryption, public key cryptanalysis). RSA Algorithm (Description of RSA Algorithm Only). Diffie-

Hellman key Exchange , Elliptic Curve Arithmetic, Elliptic Curve Cryptography,

UNIT – III Cryptographic Data Integrity Algorithms 15 hours

Applications of Cryptographic Hash Functions, Two Simple Hash Functions, Requirements and Security

of Hash Functions, Secure Hash Algorithm(SHA).

MESSAGE AUTHENTICATION AND DIGITAL SIGNATURES :Message Authentication

requirements, message Authentication functions – Requirements of Message Authentication Codes

Digital Signatures, Digital Signature Standard.

UNIT – IV NETWORK AND INTERNET SECURITY 15 hours:

Web Security Considerations, SSL Architecture, SSH Protocol Stack. Electronic Mail Security – Pretty

Good Privacy(Notation, Operational Description only), MIME(Overview, Content Types Only), S/MIME

Certificate Processing. IP Security Overview, IP Security Policy.

UNIT – V SYSTEM LEVEL SECURITY 10 hours:

Intrusion detection, password management , Viruses – types and counter measures, Firewall

Characteristics and types of Firewalls.

Text book:

William Stallings, "Cryptography And Network Security - Principles and Practices", Prentice

Hall of India, Fifth Edition, 2012.


REFERENCES: 1. Atul Kahate, "Cryptography and Network Security", Tata McGraw-Hill, 2003.

2. Bruce Schneier, "Applied Cryptography", John Wiley & Sons Inc, 2001.

3. Charles B. Pfleeger, Shari Lawrence Pfleeger, "Security in Computing", Third Edition,

Pearson Education, 2003.


PARVATHANENI BRAHMAYYA SIDDHARTHA COLLEGE OF ARTS&SCIENCE VIJAYAWADA-520 010



Semester: V Credits: 4

SOFTWARE ENGINEERING Total : 75 Hrs

Course Objectives:

The Objective of the course is

1. To assist the student in understanding the basic theory of software engineering

2. To apply these basic theoretical principles to a group software development project.

3. To apply different existing tools on the basis of software requirements.

4. To apply different class diagrams, chart diagrams.

5. To apply different testing methodologies.

Course Outcomes:

By the end of course, student will have

1. Ability to gather and specify requirements of the software projects. (PO1, PO7)

2. Ability to use perfect models according to the requirements of the software projects. (PO1, PO7)

3. Ability to analyse software requirements with existing tools. (PO1, PO7)

4. Able to use different class diagrams, user interface designs, chart diagrams. (PO1, PO7)

5. Able to differentiate different testing methodologies. (PO1, PO7)

UNIT–I: 15 Hours

Introduction: The Software Engineering – Evolution and impact, Software Development

Projects,Software Process and Project Metrics,Emergence of Software Engineering, Computer Systems

Engineering.

Software Life cycle models: Need for life Cycle model, classical waterfall model, Iterative waterfall

model, V-model, Prototyping model, Evolutionary model, Spiral model, Comparison of different life cycle

models.

UNIT–II: 15 Hours

Software Project Management: Responsibilities of a Software Project Manager, Project planning,

Metrics for Project size estimation and scheduling,

Requirement Analysis: Requirements gathering and analysis, Software Requirements Specification ___

contents of the SRS document, Functional requirements, Traceability, Characteristics of good SRS

DOCUMENT, Organization of the SRS document.

UNIT-III: 15 Hours

Software Design: Desirable characteristics of a good software design, Cohesion and coupling, Layer

Arrangement of Modules, Function-oriented design and Object-oriented design.

Function-oriented software Design: Overview of SA/SD methodology, structured analysis, Data Flow

Diagrams, Structured Design and Detailed Design.

UNIT-IV: 15 Hours Unified Modeling Language: Overview of Object-oriented concepts, Unified Modeling Language, UML

diagrams, use case model class diagrams, Interaction diagrams, Activity diagrams, state chart diagrams

User Interface Design: Characteristics of good user interface design, Basic concepts, Types of user

interfaces, component-based GUI development, A user interface Design Methodology


UNIT-V: 15 Hours,

Coding and Testing: Coding standards & guidelines, code review, testing, unit testing, Black-box

testing, White-box testing, Debugging, Integration testing, System testing.

Software Reliability and Quality Management: Software Reliability, Statistical Testing, Software

Quality.

Text Book: Fundamentals of Software Engineering -By RAJABMALL –PHI Third Edition

REFERENCE BOOKS:

1. Roger Pressman S., “Software Engineering: A Practitioner's Approach”, 7th Edition, McGraw Hill,

2010.

2. Sommerville, “Software Engineering”, Eighth Edition, Pearson Education, 2007.







OOAD Total : 75 Hrs

Course Objectives:

1. To learn about the basics of UML.

2.To learn about different types of class diagrams, Relationships.

3.To learn about use case diagrams, interaction diagrams.

4. To learn about Deployment diagram and activity diagrams.

5. To learn about Design Patterns.

Course Outcomes:

1. Able to know the basics of UML.(PO1)

2. Able to use different types of class diagrams, Relationships.(PO1, PO7)

3. Able to use case diagrams, interaction diagrams.(PO1, PO7)

4. Able to use Deployment diagram and activity diagrams.(PO1, PO7)

5. Able to use Design Patterns.(PO1, PO7)

UNIT–I: Introduction to OOAD AND UML 15 Hours

Introduction to OOAD, what is OOAD, what is uml, The importance of Modeling, Principles of

Modeling, Object Oriented Modeling, Overview of the UML, Conceptual model of the UML,

Architecture and software development life cycle.

UNIT–II: Basic Structural Modeling 15 Hours

Classes, Relationships, Common Mechanisms, Diagrams and Class Diagrams.

UNIT - III: Basic Behavioral Modeling 15 Hours

Interactions, Use Cases, Use Case Diagrams, Interaction Diagrams and Activity Diagrams

UNIT - IV: Architectural Modeling 15 Hours

Components, Deployment, Collaborations, Component Diagrams, Deployment Diagrams

UNIT-V: Design Patterns 15 Hours

What is a Design pattern, Describing Design patterns, the Catalog of Design patterns,

Organizing the catalog, How to select a Design pattern, How to Use a Design pattern,

Adapter, singleton, factory and observer patterns.

Text Book:

1. The Unified Modeling Language User Guide by Grady Booch, James Rambaugh,

Ivar Jacobson, Pearson Education.

Chapters: 1,2,4,5,6,7,8,15,16,17,18,19,25,26,27,29,30

2. Design Patterns-Elements of Reusable Object Oriented Software by Erich Gamma, Richard Helm,

Ralph Johnson, John Vlissides, AWL

Chapters: 1,3,4,5







DATA MINING & WARE HOUSING (ELECTIVE – I) Total : 75 Hrs

ELECTIVE 1: Data mining & Ware Housing

Course Objectives

1. To understand what is data mining and ETL tools.

2. To understand structure and architecture of data warehouse.

3. The Objective of this course is to understand data mining principles and techniques

4. To understand the different types of classification techniques

5. To understand and implement different cluster analysis.

Course Outcomes

1. Examine the types of the data to be mined and present a general classification of tasks and primitives to

integrate a data mining system.(PO1)

2. Apply preprocessing statistical methods for any given raw data(PO1)

3. Discover interesting patterns from large amounts of data to analyze and extract patterns to solve

problems , make predictions of outcomes(PO1)

4. Comprehend the roles that data mining plays in various fields and manipulate different data mining

techniques(PO2)

5. Select and apply proper data mining algorithms to build analytical applications. (PO2)

Unit I 12H

1.1What Motivated Data Mining? Why Is It Important?

1.2So, What Is Data Mining?

1.3Data Mining—On What Kind of Data?

1.3.1 Relational Databases

1.3.2 Data Warehouses

1.3.3 Transactional Databases

1.3.4 Advanced Data and Information Systems and Advanced Applications

1.4Data Mining Functionalities—What Kinds of Patterns Can Be Mined?

1.4.1 Concept/Class Description: Characterization and Discrimination

1.4.2 Mining Frequent Patterns, Associations, and Correlations 23

1.4.3 Classification and Prediction

1.4.4 Cluster Analysis

1.4.5 Outlier Analysis

1.4.6 Evolution Analysis

1.5Data Preprocessing

1.5.1Why Preprocess the Data?

1.5.2Descriptive Data Summarization

1.5.2.1 Measuring the Central Tendency

1.5.2.2 Measuring the Dispersion of Data

1.5.2.3 Graphic Displays of Basic Descriptive Data Summaries

1.6Data Cleaning

1.6.1 Missing Values

1.6.2 Noisy Data

1.6.3 Data Cleaning as a Process

1.7Data Integration and Transformation

1.7.1 Data Integration


1.7.2 Data Transformation

1.8Data Reduction

1.8.1 Data Cube Aggregation

1.8.2 Attribute Subset Selection

1.8.3 Dimensionality Reduction

1.8.4Numerosity Reduction

1.9Data Discretization and Concept Hierarchy Generation

1.9.1 Discretization and Concept Hierarchy Generation for Numerical Data

1.9.2 Concept Hierarchy Generation for Categorical Data

Unit II 12H

2Data Warehouse and OLAP Technology: An Overview

2.1What Is a Data Warehouse?

2.1.1 Differences between Operational Database Systems and Data Warehouses

2.1.2 But, Why Have a Separate Data Warehouse?

2.2A Multidimensional Data Model

2.2.1 From Tables and Spreadsheets to Data Cubes

2.2.2 Stars, Snowflakes, and Fact Constellations:Schemas for Multidimensional Databases

2.2.3 Examples for Defining Star, Snowflake,and Fact Constellation Schemas

2.2.4 Measures: Their Categorization and Computation

2.2.5 Concept Hierarchies

2.2.6 OLAP Operations in the Multidimensional Data Model

2.2.7 A Starnet Query Model for Querying Multidimensional Databases

2.3Data Warehouse Architecture

2.3.1 Steps for the Design and Construction of Data Warehouses

2.3.2 A Three-Tier Data Warehouse Architecture

2.3.3 Data Warehouse Back-End Tools and Utilities

2.3.4 Metadata Repository

2.3.5 Types of OLAP Servers: ROLAP versus MOLAP versus HOLAP

2.4Data Warehouse Implementation

2.4.1 Efficient Computation of Data Cubes

2.4.2 Indexing OLAP Data

2.4.3 Efficient Processing of OLAP Querie

Unit III 12H

3Mining Frequent Patterns, Associations, and Correlations

3.1Basic Concepts and a Road Map

3.1.1 Market Basket Analysis: A Motivating Example

3.1.2 Frequent Itemsets, Closed Itemsets, and Association Rules

3.1.3 Frequent Pattern Mining: A Road Map

3.2Efficient and Scalable Frequent Itemset Mining Methods

3.2.1 The Apriori Algorithm: Finding Frequent Itemsets UsingCandidate Generation

3.2.2 Generating Association Rules from Frequent Itemsets

3.2.3 Improving the Efficiency of Apriori

3.2.4 Mining Frequent Itemsets without Candidate Generation

Unit IV 12H

4Classification and Prediction

4.1What Is Classification? What Is Prediction?

4.2Issues Regarding Classification and Prediction

4.2.1 Preparing the Data for Classification and Prediction

4.2.2 Comparing Classification and Prediction Methods

4.3Classification by Decision Tree Induction

4.3.1 Decision Tree Induction

4.3.2 Attribute Selection Measures


4.3.3 Tree Pruning

4.3.4 Scalability and Decision Tree Induction

4.4Bayesian Classification

4.4.2 Naïve Bayesian Classification

4.4.3 Bayesian Belief Networks

4.4.4 Training Bayesian Belief Networks

4.5Rule-Based Classification

4.5.1 Using IF-THEN Rules for Classification

4.5.2 Rule Extraction from a Decision Tree

4.5.3 Rule Induction Using a Sequential Covering Algorithm

Unit V 12H

5Cluster Analysis

5.1What Is Cluster Analysis?

5.2Types of Data in Cluster Analysis

5.2.1 Interval-Scaled Variables

5.2.2 Binary Variables

5.2.3 Categorical, Ordinal, and Ratio-Scaled Variables

5.2.4 Variables of Mixed Types

5.2.5 Vector Objects

5.3A Categorization of Major Clustering Methods

5.4Partitioning Methods

5.4.1 Classical Partitioning Methods:k-Means and k-Medoids

5.4.2 Partitioning Methods in Large Databases: From k-Medoids to CLARANS

5.5Hierarchical Methods

5.5.1 Agglomerative and Divisive Hierarchical Clustering

5.5.2 BIRCH: Balanced Iterative Reducing and ClusteringUsing Hierarchies ing

5.6Density-Based Methods

5.6.1 DBSCAN: A Density-Based Clustering Method Based onConnected Regions with Sufficiently High

Density

5.6.2 OPTICS: Ordering Points to Identify the Clustering Structure

5.6.3 DENCLUE: Clustering Based on Density Distribution Functions

5.7Model-Based Clustering Methods

5.7.1 Expectation-Maximization

5.7.2 Conceptual Clustering

5.7.3 Neural Network Approach

5.8Clustering High-Dimensional Data

5.81Outlier Analysis

5.8.1 Statistical Distribution-Based Outlier Detection

5.8.2 Distance-Based Outlier Detection

5.8.3 Density-Based Local Outlier Detection

5.8.4 Deviation-Based Outlier Detection

References:

1.Data Mining:Concepts and Techniques Second Edition Jiawei Han University of Illinois at Urbana-

ChampaignMicheline Kamber

2.Data Mining by Vikram Pudi, P.Radha Krishna, Oxford Universith Press

3.Data Warehousing by Reema Thareja , Oxford University Press

4.J. Han , M. Kamber and J. Pei , Data Mining: Concepts and Techniques , 3rd.edMorgan Kaufmann,

2011

5.Introduction to data mining –G.K.Gupta, PHI

6..Data mining, Data warehouse & Olap-Berson, Tata McGraw Hill

Student Activity:

1.Predict the course taken by a student based on his activities and way of learning

2. Learn visual patterns of any real time data







DATA MINING & WARE HOUSING LAB(ELECTIVE – I)

Course Objectives:

1)The main objective of this lab is to impart the knowledge on how to implement classical models and

algorithms in data warehousing and data mining

2) To characterize the kinds of patterns that can be discovered by association rule mining, classification

and clustering.

3)At the end to compare and contrast different conceptions of data mining.

4)To understand different models of OLAP and data pre-processing

5)To understand different classification techniques and association rule mining

Course Outcomes:

1)To evaluate the different models of OLAP and data preprocessing. (PO1)

2)To enlist various algorithms used in information analysis of Data Mining Techniques. (PO1)

3) To demonstrate the knowledge retrieved through solving problems(PO1)

4) To evaluate the different classification techniques(PO1)

5) To evaluate the different association tecniques(PO1)

Lab List:

1. Demonstration of preprocessing on dataset student.arff

2. Demonstration of preprocessing on dataset labor.arff

3. Demonstration of Association rule process on dataset contactlenses.arff using apriori algorithm

4. Demonstration of Association rule process on dataset test.arff using apriori algorithm

5. Demonstration of classification rule process on dataset student.arff using j48 algorithm

6. Demonstration of classification rule process on dataset employee.arff using j48 algorithm

7. Demonstration of classification rule process on dataset employee.arff using id3 algorithm

8. Demonstration of classification rule process on dataset employee.arff using naïve bayes algorithm

9. Demonstration of clustering rule process on dataset iris.arff using simple k-means

10. Demonstration of clustering rule process on dataset student.arff using simple k-means.







Computer Networks 60 Hrs

COURSE OBJECTIVES

1. To provide an introduction on the Design of computer networks and to have a good

understanding of the OSI Reference Model and in particular have a good knowledge of Layers

2. To get familiarized with the basic protocols used in data link layer

3. To get familiarized with the routing algorithms used in network layer

4. To get familiarized with the basic protocols used in transport layer

5. To get familiarized with various application layer protocols such as HTTP, DNS, and SMTP

COURSE OUTCOMES 1. Independently understand basic computer network technology (PO1)

2. Able to build the skills on various types of data link layer protocols(PO1, PO7)

3. Able to build the skills of routing mechanisms.(PO1, PO7)

4. Have a working knowledge of datagram and internet socket programming(PO1, PO7)

5. Analyse the features and operations of various application layer protocols such as HTTP, DNS,

and SMTP (PO1)

UNIT-I Network architecture - layers – Physical links – Channel access on links - Issues in the data link layer -

Framing – Error correction and detection – Flow Control-Error control

UNIT-II

Medium access – CSMA – Ethernet – Token ring – FDDI - Wireless LAN – Bridges and Switches

UNIT III Circuit switching vs. packet switching / Packet switched networks – ARP – RARP –ICMP- IGMP –

Routing algorithms – distance vector routing – link state routing – Subnetting – Multicasting –

Congestion avoidance in network layer

UNIT IV UDP – TCP – Adaptive Flow Control – Adaptive Retransmission - Congestion control –

Congestion avoidance

UNIT V

DNS-Email architecture and services-User agent sending and receiving Email-WWW Architectural

Overview-Client side Server side URL-Cookies-Cryptography

Text books :

1. Computer Networks-Andrew.S.Tanenbaum ,Pearson Edu Asia Fourth edision.

2. Introduction to Data Communications and Networking-Behrouz Forouzan,Tata McGraw Hill Edition

Prescribed Text book :

Computer Networks-Andrew.S.Tanenbaum ,Pearson Edu Asia Fourth edition.

Reference Text book:

Introduction to Data Communications and Networking-Behrouz Forouzan,Tata McGraw Hill

Edition







COMPUTER NETWORKS LAB(ELECTIVE – I)

Course Objectives:

1. Understanding the basic protocols used in data link layer

2. Understanding the basic routing algorithms used in network layer

3. Understanding the basic protocols used in transport layer)

4. Understanding the fundamentals of socket programming Understanding the basic protocols used

in Application layer

Course Outcomes: 1. Have a working knowledge on basic protocols used in data link layer (PO1,PO7)

2. Have a working knowledge on routing algorithms used in network layer (PO1,PO7)

3. Have a working knowledge on basic protocols used in transport layer (PO1,PO7

4. Have a working knowledge of datagram and internet socket programming(PO1)

5. Analyse the features of application layer protocols such as Http, DNS, and SMTP. (PO1)

LAB LIST

1. Implementation of Stop and Wait Protocol

2. Implementation of Sliding Window Protocol

3. Study of Socket Programming and Client – Server model

4. Write a code simulating ARP /RARP protocols.

5. Write a code simulating PING and TRACEROUTE commands

6. create a socket for HTTP for web page upload and download.

7. Write a program to implement RPC (Remote Procedure Call).

8. Implementation of Subnetting.

9. Applications using TCP and UDP Sockets like DNS, SNMP and File Transfer

10. Applications using TCP Sockets like

A) Echo client and echo server

B) Chat

C) File Transfer





COMPUTER SCIENCE 2018 -

2019 B. C. A

SEMESTER – V Credits: 3

Cyber Forensics(ELECTIVE – I)

Total Hrs.: 60

Course Objectives:

1. To enable students gain basic knowledge in Digital Forensics as profession and Investigations

along with physical requirements for investigators office and laboratory.

2. To enable students acquiring data, processing crime and incident scenes.

3. To enable students to learn using forensics tools in various types of systems.

4. To educate students in current digital forensics tools, recovering graphic files, collecting and

analysing data.

5. To provide basic knowledge in e-mail, mobile forensics and report writing.

Course Outcomes:

1. Students will gain knowledge in history of digital forensics and using of electronic evidence

developed. (PO2)

2. Students will know how to acquire data from suspects drive, and understand the nature of

typical digital forensic case.(PO1)

3. Students will know how to use digital forensics tools in Microsoft, Linux, Mac and CLI

systems.(PO1)

4. Students will have basic idea on current digital forensics software and hardware tools,

recovering and examining data.(PO7)

5. Students learn to implement mobile device forensics, e-mail investigations and report

writing.(PO1)

UNIT – I Introduction to Digital Forensics and Investigations 14 Hrs

1.1 Understanding the Digital Forensics Profession and Investigations 1.1.1 An Overview of Digital Forensics

1.1.2 Digital Forensics and Other Related Disciplines

1.1.3 A Brief History of Digital Forensics

1.1.4 Understanding Case Law

1.1.5 Developing Digital Forensics Resources

1.2 Preparing for Digital Investigations 1.2.1 Understanding Law Enforcement Agency

1.2.2 Following Legal Process

1.2.3 Understanding Private-Sector Investigations

1.3 Conducting an Investigation

1.3.1 Gathering the Evidence

1.3.2 Understanding Bit-stream Copies

1.3.3 Acquiring an Image of Evidence Media

1.3.4 Using ProDiscover Basic to Acquire a USB Drive

1.3.5 Analysing Your Digital Evidence

1.3.6 Completing the Case

1.3.7 Critiquing the Case


1.4 Understanding Forensics Lab Accreditation

1.4.1 Identifying Duties of the Lab Manager and Staff

1.4.2 Lab Budget Planning

1.4.3 Acquiring Certification and Training

1.4.4 Identifying Lab Security Needs

1.4.5 Conducting High-Risk Investigations

1.4.6 Using Evidence Containers

1.4.7 Auditing a Digital Forensics Lab

1.4.8 Selecting a Basic Forensic Workstation

1.4.9 Using a Disaster Recovery Plan

UNIT – II Data Acquisition, Processing crime and incident scenes 12 Hrs

2.1 Data Acquisition

2.1.1 Understanding Storage Formats for Digital Evidence

2.1.2 Determining the Best Acquisition Method

2.1.3 Contingency Planning for Image Acquisitions

2.1.4 Using Acquisition Tools.

2.1.5 Validating Data Acquisitions

2.1.6 Performing RAID Data Acquisitions

2.1.7 Using Remote Network Acquisition

2.2 Processing crime and incident scenes

2.2.1 Identifying Digital Evidence

2.2.2 Collecting Evidence in Private Sector Incident Scenes

2.2.3 Processing Law Enforcement Crime Scenes

2.2.4 Preparing for Search

2.2.5 Securing a Computer Incident or Crime Scene

2.2.6 Seizing Digital Evidence at Scene

2.2.7 Storing Digital Evidence and obtaining Digital Hash.

2.2.8 Reviewing a Case

UNIT – III Working with Systems 12 Hrs

3.1 Working with Windows Systems

3.1.1 Understanding File System

3.1.2 Microsoft File Structures

3.1.3 Examining NTFS Disks

3.1.4 Understanding Virtual Machines

3.2 Working with Linux and Mac OS

3.2.1 Examining Linux File Structures

3.2.2 Understanding Macintosh File Structures

3.2.3 Using Linux Forensics Tools

UNIT – IV Digital Forensics Tools, Analysis and Validation 12 Hrs

4.1 Current Digital Forensics Tools

4.1.1 Evaluating Digital Forensics Tool Needs

4.1.2 Digital Forensics Software Tools

4.1.3 Digital Forensics Hardware Tools

4.1.4 Validating and Testing Forensics Software

4.2 Recovering Graphics Tools


4.2.1 Recognising a Graphics File

4.2.2 Locating and Recovering Graphics Files

4.2.3 Identifying Unknown File Formats

4.3 Collecting and Analysing Data

4.3.1 Determining What Data to Collect and Analyse

4.3.2 Validating Forensic Data

4.3.3 Addressing Data Hiding Techniques

UNIT – V Implementing Forensics and Report Writing 10 Hrs

5.1 E – Mail and Social Media Investigations

5.1.1 Role of E – Mail in Investigation

5.1.2 Roles of Client and Servers in E – Mail

5.1.3 Investigating E – Mail Crimes and Violations

5.1.4 Using Specialized E – Mail Forensics Tools

5.1.5 Applying Digital forensics to Social Media

5.2 Mobile Device Forensics

5.2.1 Understanding Mobile Device Forensics

5.2.2 Understanding Acquisition Procedure for Mobile Devices

5.3 Report Writing

5.3.1 Understanding Importance of Reports

5.3.2 Guidelines for Report Writing

5.3.3 Generating Report Findings with Forensics Software Tools

Text Book:

Guide to Computer Forensics and Investigations, Processing Digital Evidence – Bill Nelson, Amelia

Philips, Chris Steuart. 5th

Edition, CENGAGE LEARNING.

Reference Books:

1. Scene of the Cybercrime, by Debra Littlejohn Shinder.

2. John R. Vacca, Computer Forensics: Computer Crime Scene Investigation, 2nd Edition, Charles

River Media, 2005

3. Christof Paar, Jan Pelzl, Understanding Cryptography: A Textbook for Students and Practitioners, 2 nd

Edition, Springer’s, 2010

4. Ali Jahangiri, Live Hacking: The Ultimate Guide to Hacking Techniques & Countermeasures for

Ethical Hackers & IT Security Experts, Ali Jahangiri, 2009

5.. Computer Forensics: Investigating Network Intrusions and Cyber Crime (Ec-Council Press Series:

Computer Forensics), 2010







CYBER FORENSICS LAB (ELECTIVE – I)

Course Objectives:

1. To introduce sleuth kit and autopsy

2. To introduce analysing disk volumes and partitions.

3. To introduce analysing file systems and data.

4. To introduce analysing file name category.

5. To implement searching tools.

Course Outcomes:

1. Student will be able to use sleuth kit and autopsy.(PO1, PO7)

2. Student will be able to analyse disk volumes and disk partitions. (PO1, PO7)

3. Student will be able to analyse file systems and data that describe files. (PO1, PO7)

4. Student will be able to analyse file name category (PO1, PO7)

5. Student will be able to use various searching tools (PO1, PO7)

The Sleuth Kit and Autopsy

The Sleuth Kit (TSK) and the Autopsy Forensic Browser are open source Unix-based tools .TSK is a

collection of over 20 command line tools that can analyze disk and file system images for evidence. To

make the analysis easier, the Autopsy Forensic Browser can be used. Autopsy is a front end to the TSK

tools and provides a point-and-click type of interface.

1. Use of disk tools to analyze the tool displays the total number of sectors and the user-accessible

sectors

2. Use of volume system tools to analyze the disk volume and partitions , whether they are allocated

properly or not

3. File system tools to analyze the file system , its type and its description

4. Content category tool to analyze the data in the directory

5. Meta data category tool to analyze the data that describes a file

6. File name category tool to analyze The file name category of data includes the data that

associates a name with a metadata entry.

7. Multiple category tool to analyze that combine the data from the various categories to produce the

data sorted in a different order

8. Experiment to use the searching tools







ANDROID BASICS (ELECTIVE – II)

Objectives:

1. To know the Basic of Android and to install and configure Android Studio and SDK tools

2. To Understand how Android applications work, their life cycle, manifest, Intents, and using

external resources

3. Design and develop useful Android applications with compelling user interfaces by using,

extending, and creating your own layouts and Views and using Menus.

4. To take advantage of Android's APIs for data storage, retrieval, user preferences, files, databases,

and content providers

5. To utilize the power of background services and publishing android application.

Outcomes:

1.Use the development tools in the Android development environment(PO1)

2.Use the major components of Android API set to develop their own apps(PO1)

3.Describe the life cycles of Activities, Applications and Fragments(PO7)

4.Store and manipulate data using Content Providers, Shared Preferences.(PO2)

5.Do background processing with Services and AsyncTasks(PO1)

UNIT-1 12 HRS

What is android, android versions android features, android architecture, android devices in the market,

android developers community obtaining the required tools, android SDK, installing android SDK tools,

configuring android SDK manager, Gradle build system for android, android library projects and third

party libraries, debugging android applications.

UNIT-2 12 HRS

Components, manifests and resources:

The activity component, Activity Life cycle, service component, broadcast receiver component, content

provider component, the application component, application architecture, intents.

The android application manifest:

The manifest element, Google play filters and permissions, intent filtering

Resources and Assets:

Advanced string resources, localization using resource qualifiers, using assets.

UNIT-3 12 HRS

Components of a screen:

Views and view groups, linear layout, absolute layout table layout, relative layout, frame layout, scroll

view

Utilizing action bar:

Adding action items to the action bar, customizing the action items and application icon

Using basic views:

TextView, Button, image view, image button, edit text, checkbox, radio button, radio group, Toggle

Button, auto complete text view, progress bar, time picker, date picker, list view, grid view, spinner view.

UNIT-4 12 HRS

Fragments:

What is fragment, adding fragment dynamically, life cycle of fragments, interaction between fragments.

Data persistence and content providers:


Saving and loading user preferences, accessing preferences using an activity, storing, retrieving and

modifying the preference values, saving internal storage, storing internal storage, android database design,

creating and upgrading databases, implementing query methods.

UNIT-5 12 HRS

Services and background tasks:

What is a service, service types, service creation and destruction, starting a service, binding a service,

stopping a service, running in background, communicating with service?

Publishing android applications:

Preparing for publishing, versioning your publication, digitally signing your android application.

Text books:

1. Beginning Android 4 application development by wei-meng, LEC XYROX publications

2. Android Programming, pushing the limits by Wiley ,Erik Hellman.







ANDROID BASICS LAB(ELECTIVE – II)

Objectives:



2. Take advantage of Android's APIs for data storage, retrieval, user preferences, files, databases, and

content providers.

3. Utilize the power of background services, threads, and notifications.



5. To take advantage of Android's APIs for data storage, retrieval, user preferences, files,

databases, and content providers.

Outcomes:

1. Make UI-rich apps using all the major UI components and Know UI best-practices.(po1)

2. Store and manipulate data using Content Providers, Shared Preferences and Notifications.(po1)

3. Do background processing with Services and AsyncTasks.(po7)

4. Design Apps using layouts and Views, Menus(PO7)

5. Design APIs to store data, databases, etc (PO2).

Lab List:

1) Create an application to demonstrate

a) TextView,

b) EditText,

c) Button.


a) spinner,

b) Progress bar

c) Webview


a) ListView

b) GridView.

4) Create an application to demonstrate Radio buttons and Checkbox.

5) Create an application to demonstrate ImageView and ImageButton.

6) Create an application that will change color of the screen, based on selected options from the menu.

7) Create an application that will read phonebook contacts using content providers and display in list.

8) a) Create an application to call specific entered number by user in the EditText.

b) Create an application to send SMS to specific entered number by user in the EditText.

9) Create an application that will play a media file from the memory card.

10) Create an application to make Insert, update, Delete and retrieve operation on the SQLite Database.

11) Create an application to take picture using native application.

12) Create an application to pick up any image from the native application gallery and display it on the

screen.

13) Create an application that will on/off the Bluetooth, Wi-Fi, mobile data on button click. (Use different

buttons for each click.)

14) Create sample application with registration and login module using shared preferences. (Check

username and password)

On successful login, go to next screen. And on failing login, alert user using Toast.

Also pass username to next screen.


15) Create an application to demonstrate ervice and notifications.

Reference:

TutorialsPoint -- https://www.tutorialspoint.com/android/index.htm

JavaTpoint -- http://www.javatpoint.com/android-tutorial

AndroidAll -- http://androidall.net/

https://www.tutorialspoint.com/android/index.htm

http://www.javatpoint.com/android-tutorial

http://androidall.net/







PRINCIPLES OF ANIMATION (ELECTIVE – II)

Course Objectives

1. To make students to understand what is animation

2. To provide basic knowledge in different types of animation.

3. Understanding the skills required for an animation artist

4. To make students familiar with basic principles of animation.

5. Educate students on in-betweens and story boards

Course Outcomes

1 students will be able to relate some knowledge of the history of animation(PO1)

2 students will be able to use different types of animations for different applications(PO1)

3 Ability to creatively manipulate frame time as a means of emphasizing and actualizing action and

expressing an idea.(PO7)

4 Students will be able to understand the basic principles of animation(PO1)

5 Demonstrate progress in basic drawing and animation skills(PO2)

UNIT-I 10 hours

What is Animation: Its definition, early examples of Animation. History of Animation: Stop Motion Photo

Animation, Zoetrope, Thaumatrope, Cell and Paper Animation, early Disney’s Cell Animation Processes.

UNIT-II 10 hours Types of Animation: Cell Animation, Stop Motion Animation, Computer Animation, 2-D Animation, 3-D

Animation.

UNIT-III 12 hours Skills for an Animation Artist: Visual and creative development of an Artist , importance of observation

with minute details, efficiency to draw gestures, facial expressions, good listener, hard work and patience,

creative and innovative.

UNIT-IV 15 hours Basic Principles of Animation: Illusion of Life, straight action and pose to pose Timing, Exaggeration,

Drama and Psychological Effect, Fade in and Fade out, Squash and Stretch, Anticipation, staging, follow

through and overlapping action, Arcs, Solid Drawing ,Appeal, slow in and slow out, Secondary Action.

UNIT-V 13 hours

Various Terms: Animation Drawings/Cels, Rough Drawings , Clean ups, Color reference drawings,

Layout, Model Sheet, Key Drawings and in Betweens, Master Background, Concept Piece, Character

drawing , Story Board.

References:

1.The complete animation course by Chris Patmore -Baron’s Educational Series.(New York) .

2. Animation Unleashed by Ellen Bessen, Michael Weise Productions,2008(U.S.A)

3.The Animator’s Survival Kit by Richard Williams, Arrar Straus & Giroux Pub.(U.S.A).







COMPUTER ANIMATION LAB (ELECTIVE – II)

Course objectives :

1.import knowledge on frames and timelines.

2.understanding the need and use of action script.

3.understanding how to publish documents on the web.

Course outcomes :

1creating frames and embedding them in time lines.(PO1)

2.controlling multiple time lines using action script.(PO7)

3.publishing animated documents on the web.(PO3)

ADVANCED 2D ANIMATION

1: Action scripting

Using actions to control a timeline - Using frame labels - Creating button symbols - Creating animated

buttons using movie clips – Movie Clip Controls – Browser / network.

2: Advanced Animation Methods Creating movies playing within movies (movie clips and .swf) - Controlling multiple timelines (movies)

through action scripting - Critique storyboards.

3: Streamlining Files for Use on the Web, Publishing Files to the Internet & Pre loaders Pre loaders - Controlling sound with script - Exploring types of output - Work on final project in class -

Importing video - Publishing demo (video) reels on web - Publishing and exporting files - Trouble

shooting sites.

Suggested books for Reading: Flash books The Illusion of Life: Disney Animation by Frank Thomas,

Ollie Johnston (Contributor), Collie Johnston. Adobe Flash CS3 The Animator's Survival Kit: A

Manual of Methods, Principles, and Formulas for Classical, Computer, Games, Stop Motion, and Internet

Animators by Richard Williams


PARVATHANENI BRAHMAYYA SIDDHARTHA COLLEGE OF ARTS&SCIENCE VIJAYAWADA-520 010




SOFTWARE TESTING METHODOLOGIES (ELECTIVE – II)

Course Objectives

1. To discuss bugs and various software testing issues and solutions in software and to learn flow

graphs and apply path testing.

2. To learn how to apply transaction and data flow testing techniques.

3. Distinguish various domains.

4. Apply different Paths, Path products and Regular Expressions and logic based testing

5. To learn state graphs, transition testing and graph matrices.

Course Outcomes

1. Understand the basic concepts of software testing, flow graphs and path testing (PO1)

2. Understand transaction and data flow testing techniuqes(PO1)

3. Understand various types of domain testing.(PO1)

4. Understand Paths, Path products and Regular Expressions and logic based testing(PO1)

5. Select the appropriate tests to regression test your software after changes have been made. (PO7)

UNIT-I 12hours

Introduction: Purpose of testing, Dichotomies, model for testing, consequences of bugs, taxonomy of

Bugs.

Flow Graphs and Path testing: Basics concepts of path testing, predicates, path predicates and

Achievable paths, path sensitizing, path instrumentation, application of path testing.

UNIT-II 12 hours

Transaction Flow Testing: Transaction flow, transaction flow testing techniques.

Dataflow testing: Basics of dataflow testing, strategies in dataflow testing, application of dataflow testing.

UNIT-III 12 hours

Domain Testing: domains and paths, Nice & ugly domains, domain testing domains and interfaces

Testing, domain and interface testing, domains and testability.

UNIT-IV 12 hours

Paths, Path products and Regular Expressions: Path products & path expression, reduction procedure,

Applications, regular expressions & flow anomaly detection.

Logic Based Testing: Overview, decision tables, path expressions kv charts, specifications.

UNIT-V 12 hours

State, State Graphs and Transition testing: State graphs, good & bad state graphs state testing,

Testability tips.

Graph Matrices and Application: Motivational overview, matrix of graph, relations, power of a matrix,

Node reduction algorithm, building tools. (Student should be given an exposure to a tool like J Meter or

Win runner.)

Text Book:

1. Software Testing techniques –Baris Beizerm Dreamtech, Second edition.

Reference Books

1. Software Testing Tools – Dr. K.V.K.K. Prasad, Dreamtech.

2. Software Testing Principles and Practices by Naresh Chauhan, Oxford University Press

3. The craft of software testing – Brain Matrick, Pearson Education.

4. Software Testing Techniques – SPD (Oreille)

Software Testing in the Real World-Edward Kit, Pearson.







TESTING TOOLS LAB (ELECTIVE – II)

Course objectives:

1. To learn what is a bug and how to test.

2. to learn the flow of graphs and apply path testing.

3. to learn transaction and data flow techniques.

4. to learn various types of domains.

5. to learn how to apply different testing techniques. Course outcomes:

1. Understand types of testing and bugs.(PO1)

2. Understand flow graphs and apply path testing.(PO1)

3. Apply transaction and data flow techniques.(PO1)

4. Distinguish various domains.(PO1)

5. Apply different testing techniques(PO7)

1. Introduction to win runner testing tool

2. Recording test in context sensitive & analog mode

3. Synchronizing test.

4. Checking gui objects

5. Checking bitmap objects.

6. Programming test with tsl

7. Creating data driven test

8. Maintaining test script

9. Batch test

10. Project (creating test report)


Annexure : II





SEMESTER – VI Credits: 4

E - COMMERCE

Course Objectives:

1. To develop an understanding of scope and business models of E-Commerce.

2. To develop an understanding of electronic market and market place.

3. To develop an understanding of the Hardware and Software of Server.

4. To develop an understanding of legal issues, threats of E-Commerce.

5. To develop an understanding on different online payment methodologies.

Course Outcomes:

1. Students would be able to analyse the concept of business models and standards.(PO1)

2. Students would be able to understand the electronic market and market place.(PO1, PO7)

3. Students would be able to understand the Hardware And Software of Server. (PO1, PO7)

.

4. Students would be able to understand the legal and security issues. (PO1, PO7)

5. Able to differentiate different online payment methodologies. (PO1, PO7)

UNIT–I: 15 Hours

Introduction To E-Commerce, Technology Infrastructure: The Internet and World Wide Web.

1.1.Introduction

1.1.1 Electronic Commerce: The Second Wave

1.1.2.Business Models, Revenue Models and Business Processes

1.1.3Economic Forces and Electronic Commerce

1.1.4.Identifying Electronic Commerce Opportunities.

1.2.1The Internet and The World Wide Web.

1.2.2.Internet Protocols.

1.2.3.Intranets and Extranets.

1.2.4.Internet Connection Options

UNIT–II: 15 Hours

Marketing On The Web

2.1.Introduction

2.2.Web Marketing Strategies.

2.3Communicating with Different Market Segments.

2.4.Advertising on the Web.

2.5.E-mail Marketing.

UNIT-III: 10 Hours

Web Server Hardware And Software

3.1.Introduction.

3.2.Web Server Basics.

3.3.Software for Web Servers

3.4.Electronic Mail(E-Mail).

3.5.Website and Internet Utility Programs.


UNIT-IV: 20 Hours

Electronic Commerce Software, Security Threats to Electronic Commerce.

4.1.1.Web Hosting Alternatives.

4.1.2.Basic Functions of Electronic Commerce Software.

4.1.3.Advanced Functions of Electronic Commerce Software

4.1.4.Electronic Commerce Software for Small and Midsize Companies.

4.1.5.Electronic Commerce Software for Midsize to Large Businesses.

4.1.6.Electronic Commerce Software for Large Businesses.

4.2.1.Online Security Issues Overview.

4.2.2.Security for Client Computers.

4.2.3. Security for Server Computers.

UNIT-V: 15 Hours

Implementing Electronic Commerce Security, Payment Systems for Electronic Commerce.

5.1.1.Introduction.

5.1.2.Online Payment Basics.

5.1.3.Payment Cards.

5.1.4.Elecronic Cash.

5.1.5.Electronic Wallets.

5.1.6.Stored Value Cards.

5.2.1.Planning Electronic Commerce Initiatives.

5.2.2.Strategies for Developing Electronic Commerce Web Sites.

Text Book: Electronic Commerce,Gary P.Schneider,Fourth Annual Edition,Thomson Learning

Chapters: 1,2,5,8,9,10,11,12







OPEN SOURCE SOFTWARE

Course Objective

1. To study and apply concepts related to open source software licenses, open source project

structure, distributed team software development, and current events in the open source world.

2. To study and apply concepts relating to Linux operating systems, such as kernel mode,user

mode,scheduling,cloning.

3. To study and apply concepts relating to MYSQL database such as sql commands,date and time

functions,strings.

4. To study and apply concepts relating to PHP such as variables,constants,data types,

arrays,strings,statements.

5. To study and apply concepts relating to PERL such as Variables , Statements , Subroutines,

Packages, Working with Files

Course Outcomes

1. Ability to install and run open-source operating systems. (PO1)

2. Understand the concepts of process, modes, scheduling, cloning in Linux Operating systems.(PO1,

PO7)

3. Perform various MySQL database queries.(PO1)

4. Transfer data and add interactive components to web pages using PHP(PO7)

5. Demonstrate the proper use of Perl syntax, including control structures and expressions(PO1, PO7)

UNIT-I

Introduction to Open sources – Need of Open Sources – Advantages of Open Sources–

Application of Open Sources.

UNIT-II

Open source operating systems: LINUX: Introduction – General Overview – Kernel Mode and

user mode. Process – Advanced Concepts – Scheduling – Personalities – Cloning – Signals.

UNIT-III

MySQL: Introduction – Setting up account – Starting, terminating and writing your own SQL programs –

Record selection Technology – Working with strings – Date and Time– Sorting Query Results

UNIT-IV

PHP: Introduction – variables – constants – data types – operators – Statements – Functions –

Arrays – Strings

UNIT-V

PERL :

Perl backgrounder – Perl overview – Perl parsing rules – Variables and Data –Statements and Control

structures – Subroutines, Packages, and Modules- Working with Files .

PRESCRIBED BOOK: FUNDAMENTALS OF OPEN SOURCE SOFTWARE by M.N.RAO,PHI LEARNING PRIVATE LIMITED.

Text Book LINK:

https://books.google.co.in/books?id=-

y_lBQAAQBAJ&pg=PA296&lpg=PA296&dq=text+book+covering+php,mysql,perl&source=bl&ots=6V

lJVyyHMB&sig=SSvLYsmBPbY3vazxKtNNTHvXAa0&hl=en&sa=X&ved=0ahUKEwij156_yObZAhX

JPI8KHYLsD_sQ6AEIZDAJ#v=onepage&q&f=false

37 AC Meeting Agenda 5




COMPUTER SCIENCE 2018 - 2019 B. C. A, B.Sc (H) Computer Science


CLOUD COMPUTING

Course Objectives:

1. To understand the concepts of Cloud Computing.

2. To learn Taxonomy of Virtualization Techniques.

3. To learn Cloud Computing Architecture.

4. To acquire knowledge Cloud Applications.

5. To learn Industry Cloud Platforms.

Course Outcomes: At the end of this course student will:

1. Understand the concept of virtualization and how it has enabled the development of Cloud

Computing(PO1)

2. Know the fundamentals of cloud, cloud Architectures and types of services in cloud (PO7)

3. Understand scaling, cloud security and disaster management (PO1)

4. Design different Applications in cloud (PO7)

5. Explore some important cloud computing driven commercial systems(PO3, PO7)

Unit-1:

1.1.Virtualization:

1. Virtualization and cloud computing

2. Need of virtualization

3. cost

4. administration

5. fast deployment

6. reduce infrastructure cost

1.2 Limitations

1.3 Types of hardware virtualization:

Full virtualization

partial virtualization

para virtualization

Desktop virtualization

Software virtualization

Memory virtualization

Storage virtualization

Data virtualization

Network virtualization

1.4.Microsoft Implementation: Microsoft Hyper V ,Vmware features and infrastructure – Virtual Box -

Thin client

Unit- II

2.1.Cloud Computing Overview

Origins of Cloud computing

Cloud components

2.2 Essential characteristics

1 On-demand self-service

2 Broad network access

3 Location independent resource pooling

4 Rapid elasticity

5 Measured service


Unit-III

3.1. Cloud scenarios

3.2. Benefits

3.2..1. scalability

3.2..2. simplicity

3.2..3. vendors

3.2..4. security.

3.3. Limitations

3.4. Sensitive information

3.5. Application development

3.6. Security concerns

3.7. privacy concern with a third party

3.8. security level of third party - security benefits

3.9. Regularity issues

3.9..1. Government policies

Unit-IV

4.1 Cloud architecture

4.1.1 Cloud delivery model

4.1.2 SPI framework

4.1.3 SPI evolution

4.1.4 SPI vs. traditional IT Model

4.2. Software as a Service (SaaS):

4.2.1. SaaS service providers –

4.2.1.1. Google App Engine,

4.2.1.2. Salesforce.com

4.2.1.3. Google platform

4.3. Benefits

4.3.1. Operational benefits

4.3.2. Economic benefits

4.4. Evaluating SaaS

4.5. Platform as a Service ( PaaS )

4.5.1. PaaS service providers

4.5.2. Right Scale

4.5.3. Salesforce.com

4.5.4. Rackspace

4.5.5. Force.com

4.5.6. Services and Benefits

Unit-V

1.1. Infrastructure as a Service ( IaaS)

1.1.1. IaaS service providers

1.1.2. Amazon EC2

1.1.3. GoGrid

1.1.4. Microsoft soft implementation and support

1.1.5. Amazon EC service level agreement

1.1.6. Recent developments

1.1.7. Benefits

1.2. Cloud deployment model

1.2.1. Public clouds

1.2.2. Private clouds

1.2.3. Community clouds

1.2.4. Hybrid clouds

1.2.5. Advantages of Cloud computing


Text Books:

1. Cloud Computing Bible by Barrie Sosinsky-Wiley Publication (Unit I, IV, V, Unit III – 3.3 : 3.9)

2. Cloud computing a practical approach - Anthony T.Velte , Toby J. Velte Robert Elsenpeter TATA

McGraw- Hill , New Delhi – 2010.(Unit – II)

3. NIST Cloud Computing Standards Roadmap e-resource ( Unit III – 3.1, 3.2)

Reference Books:

1 Cloud Computing: Automating the Virtualized Data Center by Venkata Josyula

2 Virtualization for Dummies by Bernard Golden, First Edition

3 Understanding Microsoft Virtualization Solutions by Mitch Tulloch







HADOOP AND R LANGUAGE ( ELECTIVE – I )

Course objectives

1. To make students understand big data ,its advantages and applications.

2. To provide basic knowledge in HDFS and other tools used in analytics.

3. Understanding map reduce programs.

4. To make students familiar with basics of R programming .

5. To educate students on graphical analysis and various plots.

Course outcomes

1. To organize big data using hadoop(PO1)

2. To perform analytics using hive and other tools used in analytics. (PO1)

3. To write map reduce programs for different applications. (PO1)

4. Organizing data in form of R objects and manipulating data. (PO1, PO7)

5. Generation of Graphs for different data. (PO1, PO7)

UNIT I 12 hours

What is BigData ?,Evolution of Big Data, Structuring Big Data, Elements of Big Data, Big Data

Analytics, Advantages of BigData Analytics, Careers in BigData,Future of Big Data, Distributed and

parallel computing for Big Data, Introducing Hadoop.

UNIT II 16 hours Hadoop Ecosystem, Hadoop distributed file system, why Map reduce ?, hadoop YARN, introducing

HBase, combining HBase and HDFS, why Hive, Pig and Pig Latin, Aqoop, ZooKeeper, Flume, Oozie?

UNIT III 12 hours The Mapreduce framework-(Exploring features of MapReduce, working of MapReduce, Exploring Map

and Reduce functions), Techniques to Optimize MapReduce jobs, Uses of MapReduce.

UNIT IV 15 hours R overview, basic syntax,types of data items, Variables, Operators, decision making statements, loops,

functions.

UNIT V 15 hours The structure of data items-vectors, data frames, matrix objects, list objects, manipulating objects,

constructing data objects.

Introduction to graphical analysis-box plot, scatter plot, pair plot, line chart, pie chart, bar chart

Text Books

Big Data Black Book(Covers Hadoop2, Map Reduce, Hive, YARN, Pig, R and Data visualization) Dream

Tech Press, authored by D.T. Editorial services(unit 1,2,3)

Mark Gardener,”Beginning R-The statistical programming language” John Wiley&Sons Inc,

2012(unit4,5)







NETWORK PROGRAMMING ( ELECTIVE – I ) course Objectives:

1.To understand the Overview of UNIX OS and inter-process and inter-system communication and overview of

TCP/IP protocols.

2. To understand socket programming in its entirety.

3.To understand TCP Echo Server – TCP Echo Client.

4. To understand usage of TCP/UDP / Raw sockets

5. To understand advanced sockets , Ipv4 and Ipv6 interoperability CLOUD

Course Outcomes:

1. Analyse the security requirements of a networked programming environment and identify the issues to be solved;

(po 1,po 3,po 7)

2. come up with knowledge of elementary TCP sockets. (po 1)

3. Implement a programming solution. Understand the key protocols that support the Internet. Understanding TCP

Echo Server – TCP Echo Client(PO 1,3,7)

4. Have a detailed knowledge of the TCP/UDP Sockets(PO 1,3,7)

5. be familiar with several common programming interfaces for network communication(PO 1)

UNIT – I 11 Hrs

INTRODUCTION : Overview of UNIX OS - Environment of a UNIX process - Process control – Process

relationships Signals – Inter-process Communication- overview of TCP/IP protocols

UNIT – II 13 Hrs

ELEMENTARY TCP SOCKETS: Introduction to Socket Programming –Introduction to Sockets – Socket

address Structures – Byte ordering functions – address conversion functions – Elementary TCP Sockets –

socket, connect, bind, listen, accept, read, write , close functions – Iterative Server – Concurrent Server.

UNIT – III 13 Hrs

APPLICATION DEVELOPMENT: TCP Echo Server – TCP Echo Client – Posix Signalhandling – Server

with multiple clients –boundary conditions: Server process Crashes, Server host Crashes, Server Crashes

and reboots, Server Shutdown – I/O multiplexing – I/O Models – select function – shutdown function –

TCP echo Server (with multiplexing) – poll function – TCP echo Client (with Multiplexing)

UNIT – IV 11 Hrs

SOCKET OPTIONS, ELEMENTARY UDP SOCKETS: Socket options – get socket and

setsocket functions – generic socket options – IP socket options –ICMP socket options – TCP socket

options – Elementary UDP sockets – UDP echo Server – UDP echo Client – Multiplexing TCP and UDP

sockets – Domain name system – gethostbyname function.

UNIT V 12 Hrs

ADVANCED SOCKETS: Ipv4 and Ipv6 interoperability – threaded servers – thread creation and

termination – TCP echo server using threads – Mutexes – condition variables – raw sockets – raw socket

creation – raw socket output – raw socket input – ping program – trace route program.

Text books

1. W. Richard Stevens, B. Fenner, A.M. Rudoff, “Unix Network Programming – The Sockets Networking

API”, 3rd edition, Pearson, 2004.

2. W. Richard Stevens, S.A Rago, “Programming in the Unix environment”, 2nd edition,Pearson,2005.







CYBER LAWS (ELECTIVE – I)

Total Hrs. 60

Course Objectives:

1. To enable students gain basic knowledge regarding Cybercrimes and Cyber offenses.

2. To enable students know about various tools and methods used in Cybercrimes.

3. To enable students to learn about Phishing and ID theft along with their counter measures.

4. To provide basic idea regarding Cyber Laws in India and other regions.

5. To enable students to analyse various mini cases and educate them about career objectives in

Cyber security.

Course Outcomes:

1. Students will gain knowledge regarding classification of Cybercrimes, Cybercriminals and

Offenses. (PO1, PO7)

2. Students will know about various crimes involved in mobile and wireless devices, credit cards

along with various tools that are used in Cybercrime.(PO1, PO7)

3. Students will have knowledge in Phishing attacks and ID thefts as well as their counter

measures.(PO1, PO5, PO7)

4. Students will have basic idea on various Cyber Laws – ITA 2000 and amendments made to

it.(PO5, PO7)

5. Students will be able to analyse various mini case studies provided regarding Cybercrime and

Cyber security. They also have knowledge in various career opportunities in Cyber

Security.(PO1, PO7)

UNIT – I Introduction to Cybercrime and Cyber offenses 12 Hrs

1.1 Introduction to Cyber Crime

1.1.1 Definitions: Cybercrime.(Including Definitions in Box 1.1)

1.1.2 Cybercrime and Information Security((including example in Box 1.2)

1.1.3 Who are Cybercriminals?

1.1.4 Classifications of Cybercrimes

1.1.5 Cybercrime: Indian Perspective(including Box 1.6)

1.1.6 Cybercrime and ITA 2000

1.1.7 Cybercrime: Global Perspective

1.2 Cyber offenses

1.2.1 Definitions for Hackers, Crackers, etc (in Box 2.1)

1.2.2 Categories of Cybercrimes

1.2.3 How Criminals plan attacks?

1.2.4 Social Engineering

1.2.5 Cyberstalking(including Cyber bullying definition in Box 2.8)

1.2.6 Cybercafe and Cybercrimes

UNIT – II Cybercrime: Mobile and Wireless Devices, Tools and Methods 12 Hrs

2.1 Cybercrime: Mobile and Wireless Devices

2.1.1 Proliferation of Mobile and Wireless Devices

2.1.2 Credit Card Frauds (including prevention tips in Box 3.2)

2.1.3 Authentication service security(excluding MPCS, N API Security)


2.1.4 Attacks on Mobile Phones

2.2 Tools and Methods used in Cybercrime

2.2.1 Proxy servers and Anonymizers(including being anonymous in Google

Search in Box 4.2)

2.2.2 Password cracking

2.2.3 Keyloggers and spywares(including Malwares in Box 4.3)

2.2.4 Virus and worms

2.2.5 Trojan horses and Backdoors

2.2.6 Steganography

2.2.7 DoS and DDoS Attacks(DoS DDoS Definitions, Classification and

Level of DoS, protecting from DoS/DDoS only)

UNIT – III Phishing and Identity Theft 12 Hrs

3.1 Phishing

3.1.1 Definition and Methods of Phishing

3.1.2 Phishing Techniques

3.1.3 Spear Phishing

3.1.4 Types of Phishing Scams

3.1.5 Phishing counter measures

3.2 Identity Theft

3.2.1 Personally Identifiable Information

3.2.2 Types of ID Theft

3.2.3 Techniques of ID Theft

3.2.4 Countermeasures

UNIT – IV Cybercrimes and Cyber security : Legal Persoectives 14 Hrs

4.1 Cybercrime and legal landscape around the world (Only Brief Comparative Study is

needed regarding Cyber Law Scenario in various regions – Asia Pacific, Canada, US,

Africa).

4.2 The Indian IT Act ( Brief Description regarding various Chapters, Sections Only)

4.3 Amendments to the Indian IT Act

4.4 Cybercrime and Punishment

UNIT – V Case Studies and Career Opportunities 10 Hrs

5.1 Case Studies (Mini Cases):

5.1.1 State of Tamil Nadu vs. Suhas Katti Case

5.1.2 The Slumdog Millionaire Movie Piracy case

5.1.3 Malicious Hacking Case – Organ Donation Database Deleted

5.1.4 Cyber Pornography involving a Juvienile Criminal

5.1.5 Pune Citibank MphasiS call center fraud

5.1.6 NASSCOM vs. Ajay Sood and others

5.1.7 Swedish case of hacking and theft of trade secrets

5.1.8 Indian case of Cybersquatting

5.2 Careers in Cyber security

5.2.1 IT security organization roles and responsibilities

5.2.2 Career Paths in Cyber security

5.2.3 Cyber security Certifications


Text Book:

Cyber Security : Understanding Cyber Crimes, Computer Forensics ad Legal Perspectives – Nina Godbole

– Sunit Belapure. Wiley India -2014.

Reference Books:

1. ChrisReed & John Angel, Computer Law , OUP,NewYork,(2007).

2. Justice YatindraSingh, Cyber Laws UniversalLaw PublishingCo, NewDelhi, (2012).

3. Verma K, MittalRaman, LegalDimensions of CyberSpace ,Indian LawInstitute,NewDelhi,

4. Jonthan Rosenoer,CyberLaw, Springer,NewYork, (1997).

5. Sudhir Naib,The InformationTechnologyAct, 2005:A Handbook,OUP,NewYork,(2011)

6. S.R. Bhansali, Information Technology Act, 2000 ,University Book HousePvt. Ltd.,Jaipur (2003).

7. Vasu Deva, Cyber Crimes and Law Enforcement ,CommonwealthPublishers,New Delhi,(2003)







ADVANCED ANDROID (ELECTIVE – II) Objectives:

1. To know the advance UI concepts of Android

2. To Understand how to use inbuilt SQLite database and its features to enhance application

3. Design and develop dynamic Android applications by connecting to external servers

4. To understand the need of Testing and Use of Kaitlin

5. To use the multimedia and location services in applications

Outcomes: 1. Use the advanced UI features in the Android development environment(PO1)

2. Use the inbuilt database and interacting with external servers(PO1)

3. Use the location based services and working with Bluetooth & Wi-Fi (PO1)

4. Use multimedia in applications to make UI rich applications (PO7)

5. Understand the need of Mobile testing and working with Kaitlin(PO7)

UNIT-1 12HRS

Advanced UI programming: ListView, GridView, Array Adapters, List Adapters, RecyclerView, working with recyclerview,

Animations

Action Bar: Introduction to Action Bar, customizing Action Bar, Modifying the icon and title text, using navigation

tabs, using menus, using drop down lists for navigation, using custom navigation views

Notifications: Introduction to Notification Manager, creating notifications and configuring the status bar display,

Notification sounds, lights, and vibrations, Customizing the notification UI

UNIT-2 12 HRS

Working with SQLite databases: Introduction to SQLite, Content values and cursors, introducing the SQLiteOpenHelper, Creating and

Opening Databases, Querying a Database, Extracting values from a cursor, CURD Operations

Networking & Web services: Introduction to web services, connecting to internet resources, accessing web services using the GET

method, JSON parsing, XML parsing, sending data to server using POST method.

Interacting with other applications: Android - Sending Email, Sending SMS, Phone Calls

UNIT-3 12 HRS

Location Based Services: Displaying maps, creating the project, Obtaining the Maps api key, displaying the map, zoom control,

changing views, navigating to a specific location, adding markers, getting the location that was touched,

geocoding

Bluetooth, NFC and Wi-Fi:

Bluetooth: Using bluetooth, managing the local Bluetooth device adapter, Managing device discoverability,

discovering remote devices, opening a bluetooth server socket listener, selecting remote bluetooth devices,

opening a client bluetooth socket connection, transmitting data bluetooth sockets.

NFC: Introduction to NFC, its working, reading NFC tags, using the Foreground dispatch system


Wi-Fi: Monitoring Wi-Fi connectivity, Monitoring Active Wi-Fi connections, scanning for hotspots, managing

and creating Wi-Fi network configurations

UNIT-4 12 HRS

Multimedia programming: Playing Audio & video, introduction to media player, preparing audio & video for playback, controlling

media player playback, volume controls, playback controls, recording sound with audio record, playing

sound with audio record

Using Camera: Using intents to take pictures, controlling camera directly, camera properties, settings, controlling Auto

focus & focus areas, using camera preview, taking picture

Recording Video: Using intents to record video, using media recorder to record video, controlling & previewing the video

stream, controlling the recording, using media effects

UNIT-5 12 HRS

Mobile Testing: Introduction to testing, Testing basics, functional & non-functional testing, mobile device testing-types,

mobile testing frameworks.

Introduction to Kotlin: What is Kotlin?, Why Kotlin, Get started with Kotlin, Kotlin features, Advantages & disadvantages

Text books: 1. Professional Android 4 application development by Reto Meier

2. Beginning Android 4 application development by wei-meng, LEC XYROX publications

3. Android Programming, pushing the limits by Wiley ,Erik Hellman.

4. Kotlin for Android developers by Antonio Leiva

Reference Book

PROGRAMMING ANDROID BY ZIGURD MEDNICKS,LAIRD DORNIN,G.BLAKE,

MEIKE & MASUMI NAKAMURA

Professional Android 4 application development by Reto Meier

HELLO ANDROID BY ED BURNETTE.







DESIGN OF VIDEO GAMES (ELECTIVE – II)

Course Objectives

1. Discuss and define the terms and principles of game design and development.

2. Define the structure and duties of the game development team.

3. Practice animation production and creation tools.

4. Select and evaluate programming and scripting languages to develop particular games.

5. Apply artificial intelligence to developing computer games.

Course Outcomes

After completing this course, students will be able

1. to understand basic principles of game development .(PO1)

2. to learn level design and modelling(PO3)

3. to understand the tools used in game design(PO1)

4. to select a programming language for game development(PO7)

5. to learn how to apply artificial intelligence in game development (PO7)

UNIT I 14 hours

History of video games, game genres, The games industry, Theory of funativity: what is fun?

UNIT II 13 hours

Game design teams and processes, Level design, Modeling

UNIT III 15 hours Human-computer interaction (HCI) & interface design, Computer graphics, collision detection, lighting,

and animation.

UNIT IV 14 hours Game scripting and programming, Game data structures and algorithms

UNIT V 14 hours Artificial intelligence, Play testing

Reference Books 1. Introduction to Game Development Edited by: Steve Rabin ISBN: 1- 58450-377-7 Charles River

Media, May 2005.

2.Game Development Essentials: An Introduction. 3rd Edition

3. A Theory of Fun for Game Design, by Koster 4. Understanding Comics: The Invisible Art, by McCloud







ADVANCED SOFTWARE TESTING (ELECTIVE – II)

Course Objectives

1. The Objective of this course is to learn and apply basic skills needed to create and

automate the test plan of a software project., to know how to plan, develop, and execute an

automated test plan.

2. Students should learn testing concepts, Test planning, Creating a test plan in Test Director ,

Breaking the test plan into manageable components ,

Designing test cases and test steps, Analyzing the test plan,

3. Developing Win Runner automated test scripts,

4. Creating a script through recording, Synchronizing the test,

5. Adding verification of GUI objects, bitmaps and text, and Managing the GUI map

Course Outcomes:

1. To be able to apply various test processes and continuous quality improvement(PO1)

2. To be able to define the types of errors and fault models(PO1)

3. To be able to use methods of test generation from requirements(PO1)

4. To be able to use UML.(PO1)

5. To be able to Test generation from FSM models(PO7)

Unit-I 15 hours

Test basics: Testing in the Software Life Cycle, specific systems, Metrics and Measurement

Unit-II 15 hours

Testing Processes: Test process models, Test Planning and Control, Test Analysis and Design, Test

Implementation and Execution, Evaluating Exit Criteria and Reporting, Test Closure

Unit-III 15 hours

Test Management: Business Value of Testing, Test Management Documentation, Test

Estimation, Test Progress Monitoring and Control, Risk based testing

Unit-IV 15 hours

Test Techniques: Specification-Based Techniques, Structure-Based Techniques, Defect Based

Techniques, Static Analysis, Dynamic Analysis

Unit-V 15 hours

Testing of Software Characteristics: Quality Attributes for Domain Testing, Quality Attributes for

Technical Testing Text book: Advanced Software Testing, Rex Black, Jamie Mitchell References: 1. Guide to Advanced Software Testing by Anne Mette Jonassen Hass






Semester : VI Credits: 2

PROJECT & VIVA-VOCE

The objective of the project is to motivate them to work in emerging/latest technologies, help the students

to develop ability, to apply theoretical and practical tools/techniques to solve real life problems related to

industry, academic institutions and research laboratories.

The project is of 2 hours/week for one (semester VI) semester duration and a student is expected to do

planning, analyzing, designing, coding, and implementing the project. The initiation of project should be

with the project proposal. The synopsis approval will be given by the project guides.

The project proposal should include the following:

Title

Objectives

Input and output

Details of modules and process logic

Limitations of the project

Tools/platforms, Languages to be used

Scope of future application

The Project work should be either an individual one or a group of not more than three members and

submit a project report at the end of the semester. The students shall defend their dissertation in front of

experts during viva-voce examinations.

****


Annexure : III




COMPUTER SCIENCE 2018 - 2019 B.Sc (H) Computer Science


Total Hrs.: 60

Web Designing

Course objective

1. To introduce basic concepts of Internet.

2. To introduce HTML for web page designing.

3. To introduce CSS.

4. To introduce basic components of Java Script.

5. Top introduce basic components of XML.

Course outcome

1. To define the basics for web page creation.(PO1, PO7)

2. To visualize the basic concept of HTML. (PO1, PO7)

3. To implement CSS in web designing. (PO1, PO7)

4. To implement Java Script and JQuery (PO1, PO7)

5. To develop the concept of web publishing (PO1, PO7)

UNIT I – INTRODUCTION

1.1 Internet Principles

1.2 Basic Web Concepts

1.3 Client / Server Model

1.4 How Web Works

1.5 HTML and Scripting Languages

1.6 Standard Generalized Mark Up Languages.

1.7 Next Generation

1.8 Internet

1.9 Protocols and Application

UNIT II – HTML

2.1 Introduction

2.2 Working on HTML

2.3 HTML Elements

2.4 HTML Headings & Comments

2.5 Font Styles

2.6 Hyperlink & Image & List Elements

2.7 Tables

2.8 Form & Form Controls

2.9 HTML5 Form Validation

2.10 HTML5 Canvas

2.11 HTML5 Media Elements

UNIT III –Cascading Style Sheet-CSS

3.1 Introduction to CSS

3.2 CSS Syntax

3.3 CSS Selectors

3.4 Formatting Text

3.5 Colors and Backgrounds

3.6 Margins & Padding & Borders


3.7 CSS Links & Comments and List Styles

3.8 Floating and Positions

3.9 Pagination & Animation & Navigations

3.10 Image Gallery Styles

UNIT IV – JAVA SCRIPT & JQUERY

4.1 Java Script

4.1.1 Introduction to Java Script

4.1.2 How Declare Variables and Data Types

4.1.3 Operators and Comments

4.1.4 Conditional Statements

4.1.5 Functions

4.1.6 Events

4.1.7 Java Script Form Validations and Expressions

4.1.8 Exception Handling

4.1.9 Animations

4.1.10 Handling Windows

4.2 JQuery

4.2.1 Introduction JQuery

4.2.2 JQuery Selecting Elements

4.2.3 JQuery Events

4.2.4 JQuery Styling and Animating

4.2.5 DOM Manipulation

UNIT V- XML

5.1 Introduction to XML

5.2 Document Type Definitions

5.3 Style Languages

5.4 Introduction Schemas

5.5 Data Types & Restrictions

5.6 XSL & Advanced XSL

5.7 XPath and Advance XPath and XPointer

References Books:

Gopalan N.P and Akilandeswari J., “Web Technology”, Prentice Hall of India 2011.

Jennifer Neediest Robbins , “Learning Web Design “, 4th

Edition 2014

Jonathan Chaffer , Karl Swedberg , “Learning JQuery”, 4th

Edition 2013

Erik Ray, O’Reilly Media, “Learning XML“, 2009 -2014 Edition 2009







Web Designing Lab

Course objective

1. Student will be Able to learn basic tags of html

2. Student will be Able to learn different types of lists

3. Student will be Able to learn concept of hyperlink

4. Student will be Able to learn different types of form components

5. Student will be Able to learn concept of frames

Course outcomes

1. To define the basics for web page creation. (PO7)

2. To visualize the basic concept of HTML.(PO7)

3. To recognize the elements of HTML.(PO7)

4. To implement form components of HTML.(PO7)

5. To develop the concept of web publishing(PO7)

Practicals

1) Write the HTML code at least with 30 lines which make use of following tags:

The Italics tag, center tag, paragraph tag, Break tag, font tag and its attributes.

2) Create the HTML file name Assignment.htm with the given text and below specification:

3) Welcome to ABC Institution

ABC was founded in 1988 to offer distance learning programs. The privately owned

independent college once named, "American Institute for Computer Sciences," changed its

name to better reflect what students can accomplish with distance education.

A typical student at ABC is 26 to 40 years old and many of them work in a tech-related

field. All of them want to better themselves by getting the college degree they need to

progress up the career ladder.

a) Specify the title/Header ‘Welcome to ABC Institute’ at the top of file.

b) Centre the above title and change font size to ARIAL, 14.

c) Give three lines spacing after the title.

d) Apply BOLD, UNDERLINE and ITALIC effect to it.

e) Select appropriate BACKGROUND and BGCOLOR attributes.

f) Use text formatting command using paragraph break and line breaks.

g) Emphasize document context using Align, Size and Width tags.

4) Looking at the screen given below write the HTML code making use of following tags.

Text Content

Example on Unordered list

• Sports Car

• Business Car

• Economy Car

Example on Ordered list

Sports Car

Business Car

Economy Car

Example on Definition list

• Sports Car

- Ferrari


• Business Car

- Tata Sumo

• Economy Car

- Maruti

5) Design a web page using the image files ‘XYZ.GIF’, ‘PQR.GIF’ and ‘DEF.GIF’

according to the following specifications. (Use an appropriate Text content)

♦ Use a Border for ‘XYZ.GIF’.

♦ Resize the width and Height ‘PQR.GIF’ and ‘DEF.GIF’ to 100 pixels each.

♦ Align the text with respect to the images so as to obtain the desired output.

6) Create a web page giving the following Flight details in a tabular format.

♦ Flight Name

♦ Starting Place

♦ Destination Place

♦ Arrival and departure time

♦ Class

♦ Fare

a) Place a border for the table and use all padding to present the cell data with clarity.

b) Align the table in the center of the screen. Use a caption saying ‘Schedule for flights’.

c) Change font style, color, and size of title ‘Schedule for flights’ to ARIAL ’15 & line

spacing 2.5 to the table data.

d) Use the appropriate background color for data of table.

e) Save the file with ‘FLIGHT.HTM’

7. Create a specimen of a corporate web page. Divide the browser screen into two frames.

The frame on the left will be a menu consisting of hyper links. Clicking on any one of these

links will lead to a new page, which must open in the target frame, which is on the right hand

side.

8 Create two links the first link that will open a page that displays the company profile, its

business and its products. The second link will display the contact address of the company.

9. Design a webpage of any educational website.

10. Create any governmental webpage.

7







Operating Systems

Total Hrs.: 60

Objectives 1. To describe basic organization of computer systems.

2. To understand the notation of a process-a program in execution, which forms the basis of all

computations

3. To understand the critical- section problem and classic problems of synchronization

4. To understand various memory management techniques, including paging and segmentation

5. To understand the function of file system.

Outcomes 1. Analyze the various ways of structuring an operating system. (PO1)

2. Analyze the various scheduling algorithms (PO1, PO7)

3. Understand the description of deadlocks and number of different methods for preventing deadlocks

in a computer system.(PO1, PO7)

4. Understand the benefits of virtual memory system and concepts of demand paging, page

replacement algorithms(PO1, PO7)

5. Analyze the characteristics of mass storage devices(PO1, PO7)

Unit - 1: 10Hrs

Operating System 1.1 Introduction

1.2 What Operating Systems do

1.3 Computer system organization

1.4 Computer system architecture

1.5 Operating system structure

1.6 Storage Management

System Structure

1.7 Operating system services

1.8 User operating system interface

1.9 System Programs

Unit – 2: 13Hrs

Process Management

2.1 Process Concepts

2.2 Process Scheduling

2.3 Inter process Communication

Multithreaded Programming

2.4 Overview

2.4.1 Motivation

2.4.2 Benefits

2.5 Multithreading models

Process Scheduling

2.6 Basic Concepts

2.7 Scheduling Criteria

2.8 Scheduling Algorithms

Unit – 3: 13Hrs

Synchronization


3.1 Background

3.2 The critical section problem

3.3 Semaphores

3.3.1 Usage

3.3.2 Implementation

3.3.3 Deadlocks and Starvation

3.4 Classic problems of synchronization

Deadlocks

3.5 System Model

3.6 Deadlock Characterization

3.7 Deadlock Prevention

Unit- 4: 12Hrs

Memory Management

4.1 Background

4.1.1 Basic hardware

4.1.2 Address Binding

4.2 Swapping

4.3 Contiguous memory allocation

4.4 Paging

4.4.1 Basic Method

4.4.2 Hardware Support

4.4.3 Protection

4.5 Segmentation

Virtual memory management

4.6 Background

4.7 Demand Paging

4.8 Page Replacement

Unit- 5: 12Hrs

File System

5.1 File Concept

5.2 Access Methods

5.3 File Sharing

Implementing File Systems

5.4 File System Implementation

5.5 Allocation Methods

Secondary Storage Structure

5.6 Overview of mass storage structure

5.7 Disk scheduling

TEXT BOOKS Operating system Concepts: Abraham Silberschatz, Peter B. Galvin, Greg Gagne, 8

th Edition, wiley.

REFERENCE BOOKS:

1. Operating System Principles, Abraham Silberchatz, Peter B. Galvin, Greg Gagne 8th Edition, Wiley

Student Edition.

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





COMPUTER SCIENCE 2018 - 2019 B. Sc (H) Computer Science


OPERATING SYSTEMS LAB

Course Objectives:

1. To introduce process system calls.

2. To introduce IO system calls

3. To introduce scheduling algorithms.

4. To introduce RR scheduling.

5. To introduce memory management.

Course Outcomes:

1. To analyse the functions provided by and the structure of an operating system.(PO1)

2. Able to do different types of CPU Scheduling Algorithms(PO1, PO7)

3. Able to know the functionality of different types of Page Replacement Algorithms(PO1, PO7)

4. Able to do different types of System Calls(PO1, PO7)

5. To implement all the file operations(PO1, PO7)

1. Write c program to implement the Process system calls.

2. Write a ‘c’ program for I/O system calls.

3. Write the program to implement CPU & scheduling algorithm for first come first serve

scheduling.

4. Write a program to implement cpu scheduling algorithm for shortest job first scheduling.

5. Write a ‘C’ program to perform priority scheduling.

6. Write a program to implement cpu scheduling for Round Robin Scheduling.

7. To implement first fit, best fit algorithm for memory management.







SOFTWARE ENGINEERING

Course Objectives:

1. The Objective of the course is to assist the student in understanding the basic theory of software engineering

2. To apply these basic theoretical principles to a group software development project.

3. To apply different existing tools on the basis of software requirements.

4. To apply different class diagrams, chart diagrams.

5.To apply different testing methodologies.

Course Outcomes:

1. Ability to gather and specify requirements of the software projects.(PO1)

2. Ability to use perfect models according to the requirements of the software projects.(PO1)

3. Ability to analyze software requirements with existing tools.(PO1)

4. Able to use different class diagrams, user interface designs, chart diagrams.(PO1, PO7)

5. Able to differentiate different testing methodologies.(PO1, PO7)

UNIT–I: 15 Hrs

Introduction: The Software Engineering – Evolution and impact, Software Development Projects,

Software Process and Project Metrics, Emergence of Software Engineering, Computer Systems

Engineering,

Software Life cycle models: Need for life Cycle model, classical waterfall model, Iterative waterfall

model, V-model, Prototyping model, Evolutionary model, Spiral model, Comparison of different life cycle

models.

UNIT–II: 10 Hrs

Software Project Management: Responsibilities of a Software Project Manager, Project planning,

Metrics for Project size estimation and scheduling.

Requirement Analysis: Requirements gathering and analysis, Software Requirements Specification ___

contents of the SRS document, Functional requirements, Traceability, Characteristics of good SRS

DOCUMENT, Organization of the SRS document.

UNIT-III: 13 Hrs

Software Design: Desirable characteristics of a good software design, Cohesion and coupling, Layer

Arrangement of Modules, Function-oriented design and Object-oriented design.

Function-oriented software Design: Overview of SA/SD methodology, structured analysis, Data Flow

Diagrams, Structured Design and Detailed Design.

UNIT-IV: 12 Hrs Unified Modeling Language: Overview of Object-oriented concepts, Unified Modeling Language, UML

diagrams, use case model class diagrams, Interaction diagrams, Activity diagrams, state chart diagrams

User Interface Design: Characteristics of good user interface design, Basic concepts, Types of user

interfaces, component-based GUI development, A user interface Design Methodology

UNIT-V: 10 Hrs Coding and Testing: Coding standards & guidelines, code review, testing, unit testing, Black-box testing,

White-box testing, Debugging, Integration testing, System testing.


Software Reliability and Quality Management: Software Reliability, Statistical Testing, Software

Quality.

Text Book: Fundamentals of Software Engineering -By RAJABMALL –PHI Third Edition

REFERENCE BOOKS:

1. Roger Pressman S., “Software Engineering: A Practitioner's Approach”, 7th Edition, McGraw Hill,

2010.

2. Sommerville, “Software Engineering”, Eighth Edition, Pearson Education, 2007.


Annexure – IV






SOFTWARE TESTING Total : 60 Hrs

Objectives:

To study fundamental concepts in software testing, including software testing objectives, process,

criteria, strategies, and methods.

To discuss various software testing issues and solutions in software unit test; integration, regression,

and system testing.

To learn how to planning a test project, design test cases and data, conduct testing operations, manage

software problems and defects, generate a testing report.

To learn how to write software testing documents, and communicate with engineers in various forms.

To gain the techniques and skills on how to use modern software testing tools to support software

testing projects.

Outcomes:

Have an ability to apply software testing knowledge and engineering methods. (PO1)

Have an ability to design and conduct a software test process for a software testing project. (PO1,

PO7)

Have an ability understand and identify various software testing problems, and solve these problems

by designing and selecting software test models, criteria, strategies, and methods.(PO1, PO7)

Have an ability to use various communication methods and skills to communicate with their

teammates to conduct their practice-oriented software testing projects. (PO1, PO7)

Have an ability to use software testing methods and modern software testing tools for their testing

projects.(PO1, PO7)

UNIT I

1.1 Introduction to Software Testing

1.1.1 Introduction

1.1.2 Evolution of Software Testing

1.1.3 Software Testing Myths and Facts

1.1.4 Goals of Software Testing

1.1.5 Psychology for Software Testing

1.1.6 Software Testing Definitions

1.1.7 Model for Software Testing

1.1.8 Effective Software Testing vs Exhaustive Software Testing

1.2 Software Testing Terminology and Methodology 1.2.1 Software Testing Terminology

1.2.2 Software Testing Life Cycle (STLC)

1.2.3 Software Testing Methodology

UNTT II

2.1 Verification and Validation

2.1.1 Verification and Validation Activities

2.1.2 Verification

2.1.3 Verification of Requirements

2.1.4 Verification of High level Design

2.1.5 Verification of Low level Design

2.1.6 How to verify Code?


2.1.7 Validation

2.2 Dynamic Testing : Black Box Testing Techniques

2.2.1 Boundary Value Analysis

2.2.2 Equivalence Class Testing

2.2.3 State Table based Testing

2.2.4 Decision Table based Testing

UNIT III

3.1 Dynamic Testing : White Box Testing Techniques

3.1.1 Need of White box testing

3.1.2 Logic Coverage Criteria

3.1.3 Basis Path Testing

3.1.3.1 Control Flow Graph

3.1.3.2 Flow graph notations of different programming constructs

3.1.3.3 Path Testing Terminology

3.1.3.4 Cyclomatic Complexity

3.1.3.5 Applications of Path Testing

3.1.4 Loop Testing

3.1.5 Data Flow Testing

3.1.5.1 State of a Data Object

3.1.5.2 Data Flow Anomalies

3.1.5.3 Terminology used in Data Flow Testing

3.1.5.4 Static Data flow testing

3.1.5.5 Dynamic Data flow testing

3.2 Static Testing 3.2.1 Inspections

3.2.2 Walkthroughs

3.2.3 Technical Reviews

UNIT IV

4.1 Validation Activities

4.1.1 Unit Validation Testing

4.1.2 Integration Testing

4.1.2.1 Decomposition Based Integration

4.1.2.2 Path Based Integration

4.1.3 Function Testing

4.1.4 System Testing

4.1.5 Acceptance Testing

4.2 Regression Testing 4.2.1 Progressive vs Regression Testing

4.2.2 Regression testing produces quality software

4.2.3 Regression Testability

4.2.4 Objectives of Regression Testing

4.2.5 When to do regression testing?

4.2.6 Regression Testing Types

4.2.7 Regression Testing Techniques

4.2.8 Benefits of Regression Testing

UNIT V

5.1 Efficient Test Suite Management

5.1.1 Why Test Suite grows?

5.1.2 Minimizing the test suite and its benefits

5.1.3 Test Suite Prioritization

5.1.4 Types of Test case Prioritization

5.1.5 Measuring Effectiveness of Prioritized Test Suite


5.2 Debugging 5.2.1 Debugging Process

5.2.2 Debugging Techniques

5.2.3 Correcting the Bugs

Text Books

1. Software Testing, Principles and Practices, Naresh Chauhan , Oxford

2. Software Testing, Principles, techniques and Tools, M G Limaye, TMH

3. Software Testing, Principles and Practices, Desikan and Ramesh, Pearson Education

Reference Books

1. Software Testing, Yogesh Singh, CAMBRIDGE

2. Software Testing Techniques, Baris Beizer, International Thomson Computer Press,

Second Edition





COMPUTER SCIENCE CSH P 61 2018 - 2019 B. Sc (H) Computer Science


SOFTWARE TESTING LAB

Course objectives:

1. To learn what is a bug and how to test.

2. To learn the flow of graphs and apply path testing.

3. To learn transaction and data flow techniques.

4. To learn various types of domains.

5. To learn how to apply different testing techniques. Course outcomes:

1. Understand types of testing and bugs.(PO1)

2. Understand flow graphs and apply path testing. (PO1)

3. Apply transaction and data flow techniques. (PO1)

4. Distinguish various domains. (PO1)

5. Apply different testing techniques. (PO7)

Problem Statement 01

Consider an automated banking application. The user can dial the bank from a personal computer, provide

a six-digit password, and follow with a series of keyword commands that activate the banking function.

The software for the application accepts data in the following form:

Area Code Blank or three-digit number

Prefix Three-digit number, not beginning with 0 or 1

Suffix Four-digit number

Password Six-character alphanumeric

Commands "Check status", "Deposit", "Withdrawal"

Design adhoc test cases to test the system


Consider an automated banking application. The user can dial the bank from a personal computer, provide

a six-digit password, and follow with a series of keyword commands that activate the banking function.

The software for the application accepts data in the following form:

Area Code Blank or three-digit number

Prefix Three-digit number, not beginning with 0 or 1

Suffix Four-digit number

Password Six-character alphanumeric

Commands "Check status", "Deposit", "Withdrawal"

Design the test cases to test the system using following Black Box testing technique:

BVA, Worst BVA, Robust BVA, Robust Worst BVA

Equivalence class testing (Input/Output domain)


Consider an application that is required to validate a number according to the following simple rules:

1. A number can start with an optional sign.

2. The optional sign can be followed by any number of digits.

3. The digits can be optionally followed by a decimal point, represented by a period.


4. If there is a decimal point, then there should be two digits after the decimal.

5. Any number-whether or not it has a decimal point, should be terminated a blank.

6. A number can start with an optional sign.

7. The optional sign can be followed by any number of digits.

8. The digits can be optionally followed by a decimal point, represented by a period.

9. If there is a decimal point, then there should be two digits after the decimal.

10. Any number-whether or not it has a decimal point, should be terminated a blank. Generate test cases to

test valid

and invalid numbers.(HINT) Use Decision table and cause-effect graph to generate test cases.


Generate test cases using Black box testing technique to Calculate Standard Deduction on Taxable

Income. The standard deduction is higher for tax payers who are 65 or older or blind. Use the method

given below to calculate tax.

1. The first factor that determines the standard deduction is the filing status. The basic standard deduction

for the

various filing status are:

Single $4,750

Married, filing a joint return $9,500

Married, filing a separate return $7,000

2. If a married couple is filing separate returns and one spouse is not taking standard

Deduction, the other spouse also is not eligible for standard deduction.

3. An additional $1,000 is allowed as standard deduction, if either the filer is 65 yrs or the spouse is 65 yrs

or older(the latter case applicable when the filing status is “Married” and filing “joint”).

4. An additional $1,000 is allowed as standard deduction, if either the filer is blind or the spouse is blind

(the latter case applicable when the filing status is “married” and filing “joint”).

(HINT):

From the above description, it is clear that the calculation of standard deduction depends on the following

3 factors:

1. Status of filing of the filer

2. Age of the filer

3. Whether the filer is blind or not

In addition, in certain cases, the following additional factors also come into play in calculating the

standard deduction.

1. Whether spouse has claimed standard deduction

2. Whether spouse is blind

3. Whether the spouse is more than 65 years old


Consider the following program segment:

1. int max (int i, int j, int k)

2. {

3. int max;

4. if (i>j) then

5. if (i>k) then max=i;

6. else max=k;

7. else if (j > k) max=j

8. else max=k

9. return (max);

10. }

a) Draw the control flow graph for this program segment


b) Determine the cyclomatic complexity for this program

c) Determine the independent paths


Source code of simple insertion sort implementation using array in ascending order in c programming

language

#include<stdio.h>

int main(){

int i,j,s,temp,a[20];

Printf ("Enter total elements: "); Scanf ("%d",&s);

printf("Enter %d elements: ",s); for(i=0;i<s;i++) scanf("%d",&a[i]); for(i=1;i<s;i++){

temp=a[i]; j=i-1; while((temp<a[j])&&(j>=0)){ a[j+1]=a[j];

j=j-1;

}

a[j+1]=temp;

}

printf("After sorting: ");

for(i=0;i<s;i++)

printf(" %d",a[i]);

return 0;

}

HINT: for loop is represented as while loop

a) Draw the program graph for given program segment b) Determine the DD path graph

c) Determine the independent paths

d) Generate the test cases for each independent path


Consider a system having an FSM for a stack having the following states and transitions:

States

Initial: Before creation

Empty: Number of elements = 0

Holding: Number of elements > 0, but less than the maximum capacity

Full: Number elements = maximum

Final: After destruction

Initial to Empty: Create

Empty to Holding, Empty to Full, Holding to Holding, Holding to Full: Add

Empty to Final, Full to Final, Holding to Final: Destroy

Holding to Empty, Full to Holding, Full to Empty: Delete

Design test cases for this FSM using state table-based testing.


Given the following fragment of code, how many tests are required for 100% decision coverage? Give the

test cases.

if width > length

then biggest_dimension = width if height > width

then biggest dimension = height end_if

else if biggest dimension = length then if height > length

then biggest_dimension = height end_if

end_if end_if

Hint 04 test cases



Given the following code, how much minimum number of test cases is required for full statement and

branch

coverage?

read p read q

if p+q> 100

then print "Large" endif

if p > 50

then print "p Large" endif

Hint 1 test for statement coverage, 2 for branch coverage


Consider a program to input two numbers and print them in ascending order given below. Find all du paths

and identify those du-paths that are not feasible. Also find all dc paths and generate the test cases for all

paths (dc paths

and non dc paths).

#include<stdio.h>

#include<conio.h>

1. void main ()

2. {

3 int a, b, t;

4. Clrscr ();

5. Printf (“Enter first number”);

6. scanf (“%d”,&a);

7. printf(“Enter second number”);

8. scanf(“%d”,&b);

9. if (a<b){

10. t=a;

11a=b;

12 b=t;

13}

14. printf (“%d %d”, a, b);

15 getch ();

}


Consider the above program and generate possible program slices for all variables. Design at least one test

case from every slice.


Consider the code to arrange the nos. in ascending order. Generate the test cases for relational coverage,

loop coverage and path testing. Check the adequacy of the test cases through mutation testing and also

compute the mutation score

for each.

i = 0;

n=4; //N-Number of nodes present in the graph

While (i<n-1) do j = i + 1;

While (j<n) do

if A[i]<A[j] then swap (A[i], A[j]); end do;

i=i+1;

end do







Information Security Total Hrs.: 60

Objectives 1. Explain the objectives of information security.

2. Understand various cryptographic Concepts and Techniques.

3. Understand various Symmetric and Asymmetric algorithms

4. Discuss authentication & hash functions.

5. Discuss E-mail Security, IP Security and Web security.

Outcomes 1. Ability to understand the current legal issues towards information security.(PO1)

2. Student will be able to understand conversion of plain text to cipher, basic cryptographic

Techniques.(PO1)

3. Ability to understand the building ciphers to ensure the confidentiality and integrity of

information.(PO1, PO7)

4. Ability to understand how to give authentication to a message by using Hash functions.(PO1, PO7)

5. Student will be able to understand security issues in different areas.(PO1, PO7)

Unit - 1: Introduction 1.1 Security Trends

1.2 The OSI Architecture

1.3 Security Approaches

1.4 Principles of Security

1.3 Security Attacks

1.3.1 Passive Attacks

1.3.2 Active Attacks

1.4 Security Services

1.5 Security Mechanisms

1.5 A Model for Network Security

Unit – 2: Cryptography Concepts and Techniques

2.1 Introduction

2.2 Plain Text and Cipher Text

2.3 Substitution Techniques

2.4 Transposition Techniques

2.5 Encryption and Decryption

2.6 Symmetric and Asymmetric Key Cryptography

2.7 Steganography

2.8 Key Range and Key Size

2.9 Possible Types of Attacks

Unit – 3: Symmetric Key and Asymmetric Key Ciphers

3.1 Symmetric Key Ciphers

3.1.1 Introduction

3.1.2 Algorithm Types and Modes

3.1.3 Overview of Symmetric Key Croptography

3.1.4 Block Cypher Principles

3.1.5 Data Encryption Standard


3.2 Asymmetric Key Ciphers

3.2.1 Introduction

3.2.2 Overview of Asymmetric Key Cryptography

3.2.3 The RSA Algorithm

3.2.4 Digital Signatures

3.2.5 Knapsack Algorithm

Unit- 4: Message Authentication and Hash Functions

4.1 Message Authentication

4.1.1 Authentication requirements

4.1.2 Authentication Functions: Public Key Encryption, MAC

4.2 Hash Functions

4.2.1 Simple Hash Functions

4.2.2 Birthday Attacks

4.2.3 Block Chaining Techniques

Unit- 5: Security Issues

5.1 E-Mail Security

5.1.1 Pretty Good Privacy

5.1.2 S/MIME

5.2 IP Security Overview

5.2.1 Applications of IPSec

5.2.3 Routing Applications

5.3 IP Security Architecture

5.3.1 IPSec Documents

5.3.2 IPSec Services

5.3.3 Security Associations

5.4 Web Security

5.4.1Web Security Considerations

5.4.2 Secure Socket Layer and Transport Layer Security - SSL Architecture

TEXT BOOKS Cryptography and Network Security : William Stallings, Pearson Education,4″‘ Edition

Cryptography and Network Security : Atul Kahate, Mc Graw Hill Edition

REFERENCE BOOKS Cryptography and Network Security: C K Shyamala, N Harin i, Dr T R Padmanabhan, Wiley India, 1”

Edition.

Cryptography and Network Security : Forouzan Mukhopadhyay, MC Graw Hill, 2″” Edition

Information Security, Principles and Practice: Mark Stamp, Wiley India.

Principles of Computer Security: WM.Arthur Conklin, Greg White, TMH

Introduction to Network Security: Neal Krawetz, CENGAGE Learning

Network Security and Cryptography: Bernard Menezes, CENGAGE Learning





COMPUTER SCIENCE CSH P 62 2018 - 2019 B.Sc (H) Computer Science


MOBILE APPLICATION DEVELOPMENT LAB

OBJECTIVES:

The student should be made to:

1. Know the components and structure of mobile application development frameworks for Android

and windows OS based mobiles.

2. Understand how to work with various mobile application development frameworks.

Learn the basic and important design concepts and issues of development of mobile applications.

3. Understand the capabilities and limitations of mobile devices.

OUTCOMES: At the end of the course, the student should be able to:

1. Design and Implement various mobile applications using emulators.

2. Deploy applications to hand-held devices

LIST OF EXPERIMENTS 1. Develop an application that uses GUI components, Font and Colours

2. Develop an application that uses Layout Managers and event listeners.

3. Develop a native calculator application.

4. Write an application that draws basic graphical primitives on the screen.

5. Develop an application that makes use of database.

6. Develop an application that makes use of RSS Feed.

7. Implement an application that implements Multi threading

8. Implement an application that writes data to the SD card.

9. Implement an application that creates an alert upon receiving a message.

10. Write a mobile application that creates alarm clock







CYBER CRIMES AND CYBER SECURITY (ELECTIVE)

Total Hrs. 60

Course Objectives:

1. To enable students gain basic knowledge regarding Cybercrimes and Cyber offenses.

2. To enable students know about various tools and methods used in Cybercrimes.

3. To enable students to learn about Phishing and ID theft along with their counter measures.

4. To provide basic idea regarding Cyber Laws in India and other regions.

5. To enable students to analyse various mini cases and educate them about career objectives in

Cyber security.

Course Outcomes:

1. Students will gain knowledge regarding classification of Cybercrimes, Cybercriminals and

Offenses. (PO1, PO7)

2. Students will know about various crimes involved in mobile and wireless devices, credit cards

along with various tools that are used in Cybercrime.(PO1, PO7)

3. Students will have knowledge in Phishing attacks and ID thefts as well as their counter

measures.(PO1, PO7)

4. Students will have basic idea on various Cyber Laws – ITA 2000 and amendments made to

it.(PO1, PO7)

5. Students will be able to analyse various mini case studies provided regarding Cybercrime and

Cyber security. They also have knowledge in various career opportunities in Cyber Security.(PO1,

PO7)

UNIT – I Introduction to Cybercrime and Cyber offenses 12 Hrs

1.3 Introduction to Cyber Crime

1.3.1 Definitions: Cybercrime.(Including Definitions in Box 1.1)

1.3.2 Cybercrime and Information Security((including example in Box 1.2)

1.3.3 Who are Cybercriminals?

1.3.4 Classifications of Cybercrimes

1.3.5 Cybercrime: Indian Perspective(including Box 1.6)

1.3.6 Cybercrime and ITA 2000

1.3.7 Cybercrime: Global Perspective

1.4 Cyber offenses

1.4.1 Definitions for Hackers, Crackers, etc (in Box 2.1)

1.4.2 Categories of Cybercrimes

1.4.3 How Criminals plan attacks?

1.4.4 Social Engineering

1.4.5 Cyberstalking(including Cyber bullying definition in Box 2.8)

1.4.6 Cybercafe and Cybercrimes

UNIT – II Cybercrime: Mobile and Wireless Devices, Tools and Methods 12 Hrs

2.3 Cybercrime: Mobile and Wireless Devices

2.3.1 Proliferation of Mobile and Wireless Devices

2.3.2 Credit Card Frauds (including prevention tips in Box 3.2)

2.3.3 Authentication service security(excluding MPCS, N API Security)

2.3.4 Attacks on Mobile Phones


2.4 Tools and Methods used in Cybercrime

2.4.1 Proxy servers and Anonymizers(including being anonymous in Google

Search in Box 4.2)

2.4.2 Password cracking

2.4.3 Keyloggers and spywares(including Malwares in Box 4.3)

2.4.4 Virus and worms

2.4.5 Trojan horses and Backdoors

2.4.6 Steganography

2.4.7 DoS and DDoS Attacks(DoS DDoS Definitions, Classification and

Level of DoS, protecting from DoS/DDoS only)

UNIT – III Phishing and Identity Theft 12 Hrs

3.3 Phishing

3.3.1 Definition and Methods of Phishing

3.3.2 Phishing Techniques

3.3.3 Spear Phishing

3.3.4 Types of Phishing Scams

3.3.5 Phishing counter measures

3.4 Identity Theft

3.4.1 Personally Identifiable Information

3.4.2 Types of ID Theft

3.4.3 Techniques of ID Theft

3.4.4 Countermeasures

UNIT – IV Cybercrimes and Cyber security : Legal Persoectives 14 Hrs

4.1 Cybercrime and legal landscape around the world (Only Brief Comparative Study is

needed regarding Cyber Law Scenario in various regions – Asia Pacific, Canada, US,

Africa).

4.2 The Indian IT Act ( Brief Description regarding various Chapters, Sections Only)

4.3 Amendments to the Indian IT Act

4.4 Cybercrime and Punishment

UNIT – V Case Studies and Career Opportunities 10 Hrs

5.1 Case Studies (Mini Cases):

5.1.1 State of Tamil Nadu vs. Suhas Katti Case

5.1.2 The Slumdog Millionaire Movie Piracy case

5.1.3 Malicious Hacking Case – Organ Donation Database Deleted

5.1.4 Cyber Pornography involving a Juvienile Criminal

5.1.5 Pune Citibank MphasiS call center fraud

5.1.6 NASSCOM vs. Ajay Sood and others

5.1.7 Swedish case of hacking and theft of trade secrets

5.1.8 Indian case of Cybersquatting

5.2 Careers in Cyber security

5.2.1 IT security organization roles and responsibilities

5.2.2 Career Paths in Cyber security

5.2.3 Cyber security Certifications

Text Book:

Cyber Security : Understanding Cyber Crimes, Computer Forensics ad Legal Perspectives – Nina Godbole

– Sunit Belapure. Wiley India -2014.


Reference Books:

1. ChrisReed & John Angel, Computer Law , OUP,NewYork,(2007).

2. Justice YatindraSingh, Cyber Laws UniversalLaw PublishingCo, NewDelhi, (2012).

3. Verma K, MittalRaman, LegalDimensions of CyberSpace ,Indian LawInstitute,NewDelhi,

4. Jonthan Rosenoer,CyberLaw, Springer,NewYork, (1997).

5. Sudhir Naib,The InformationTechnologyAct, 2005:A Handbook,OUP,NewYork,(2011)

6. S.R. Bhansali, Information Technology Act, 2000 ,University Book HousePvt. Ltd.,Jaipur (2003).

7. Vasu Deva, Cyber Crimes and Law Enforcement ,CommonwealthPublishers,New Delhi,(2003)





COMPUTER SCIENCE 2018 - 2019 B. C. A, B. Sc (H) Computer Science


CLOUD COMPUTING (ELECTIVE)

Total Hrs. 60

Course Objectives:

1. To understand the concepts of Cloud Computing.

2. To learn Taxonomy of Virtualization Techniques.

3. To learn Cloud Computing Architecture.

4. To acquire knowledge Cloud Applications.

5. To learn Industry Cloud Platforms.

Course Outcomes: At the end of this course student will:

1. Understand the concept of virtualization and how it has enabled the development of Cloud

Computing (PO1, PO3, PO7)

2. Know the fundamentals of cloud, cloud Architectures and types of services in cloud (PO7)

3. Understand scaling, cloud security and disaster management (PO7)

4. Design different Applications in cloud (PO7)

5. Explore some important cloud computing driven commercial systems(PO7)

Unit-1: 1.1.Virtualization :

7. Virtualization and cloud computing

8. Need of virtualization

9. cost

10. administration

11. fast deployment

12. reduce infrastructure cost

1.4 Limitations

1.5 Types of hardware virtualization:

1 Full virtualization

2 partial virtualization

3 para virtualization

4 Desktop virtualization

5 Software virtualization

6 Memory virtualization

7 Storage virtualization

8 Data virtualization

9 Network virtualization

1.4.Microsoft Implementation: Microsoft Hyper V ,Vmware features and infrastructure – Virtual Box -

Thin client

Unit- II

2.1.Cloud Computing Overview

1 Origins of Cloud computing

2 Cloud components

2.2 Essential characteristics

6 On-demand self-service

7 Broad network access

8 Location independent resource pooling

9 Rapid elasticity

10 Measured service


Unit-III

3.10. Cloud scenarios

3.11. Benefits

3.11..1. scalability

3.11..2. simplicity

3.11..3. vendors

3.11..4. security.

3.12. Limitations

3.13. Sensitive information

3.14. Application development

3.15. Security concerns

3.16. privacy concern with a third party

3.17. security level of third party - security benefits

3.18. Regularity issues

3.18..1. Government policies

Unit-IV

4.2 Cloud architecture

4.2.1 Cloud delivery model

4.2.2 SPI framework

4.2.3 SPI evolution

4.2.4 SPI vs. traditional IT Model

4.6. Software as a Service (SaaS):

4.6.1. SaaS service providers –

4.6.1.1. Google App Engine,

4.6.1.2. Salesforce.com

4.6.1.3. Google platform

4.7. Benefits

4.7.1. Operational benefits

4.7.2. Economic benefits

4.8. Evaluating SaaS

4.9. Platform as a Service ( PaaS )

4.9.1. PaaS service providers

4.9.2. Right Scale

4.9.3. Salesforce.com

4.9.4. Rackspace

4.9.5. Force.com

4.9.6. Services and Benefits

Unit-V

1.3. Infrastructure as a Service ( IaaS)

1.3.1. IaaS service providers

1.3.2. Amazon EC2

1.3.3. GoGrid

1.3.4. Microsoft soft implementation and support

1.3.5. Amazon EC service level agreement

1.3.6. Recent developments

1.3.7. Benefits

1.4. Cloud deployment model

1.4.1. Public clouds

1.4.2. Private clouds

1.4.3. Community clouds

1.4.4. Hybrid clouds

1.4.5. Advantages of Cloud computing


Text Books:

1. Cloud Computing Bible by Barrie Sosinsky-Wiley Publication (Unit I, IV, V, Unit III – 3.3 : 3.9)

2. Cloud computing a practical approach - Anthony T.Velte , Toby J. Velte Robert Elsenpeter TATA

McGraw- Hill , New Delhi – 2010.(Unit – II)

3. NIST Cloud Computing Standards Roadmap e-resource ( Unit III – 3.1, 3.2)

Reference Books:

1. Cloud Computing: Automating the Virtualized Data Center by Venkata Josyula

2. Virtualization for Dummies by Bernard Golden, First Edition

3. Understanding Microsoft Virtualization Solutions by Mitch Tulloch







ARTIFICIAL INTELLIGENCE (ELECTIVE)

Total Hrs. 60

Course Objectives:

1. To apply a given AI technique to a given concrete problem.

2. To understand uncertainty and Problem solving techniques.

3. To understand various symbolic knowledge representation to specify domains and reasoning tasks

of a situated software agent.

4. To understand different logical systems for inference over formal domain representations, and

trace how a particular inference algorithm works on a given problem specification.

5. To understand various learning techniques and agent technology.

Outcomes:

On successful completion of this course students will be able to:

1 Knowledge of what constitutes "Artificial" Intelligence and how to identify systems with

Artificial Intelligence. (PO1)

2 Explain how Artificial Intelligence enables capabilities that are beyond conventional

technology, for example, chess-playing computers, self-driving cars, robotic vacuum

cleaners.(PO1)

3 Implement classical Artificial Intelligence techniques, such as search algorithms, minimax

algorithm, neural networks, tracking, robot localisation.(PO1)

4 Ability to apply Artificial Intelligence techniques for problem solving.(PO1)

5 Explain the limitations of current Artificial Intelligence techniques.(PO7)

UNIT –I

1. What is artificial Intelligence?

1.1 The AI problems

1.2 The Underlying assumption.

1.3 What is AI technique?

1.4 The level of the Model.

1.5 Criteria for Success.

1.6 Some general References

1.7 One Final Word and Beyond.

2. Problems, Problem Spaces and Search

2.1 Defining the problem as a State Space Search.

2.2 Production Systems

2.3 Problem Characteristics.

2.4 Production System characteristics.

2.5 Issues in the design of Search Programs

2.6 Additional Problems

Unit- II

3. Heuristic Search Techniques


3.1 Generate and Test

3.2 Hill climbing

3.3 Best-First Search

3.4 Problem Reduction.

3.5 Constraint Satisfaction.

3.6 Means-ends Analysis.

4. Knowledge Representation Issues

4.1 Representations and Mapping.

4.2 Approaches to Knowledge Representation.

4.3 Issues in Knowledge Representation.

4.4 The Frame Problem.

Unit III

5. Using Predicate Logic

5.1 Representing Simple Facts in logic.

5.2 Representing Instance and ISA Relationships.

5.3 Computable Functions and Predicates.

5.4 Resolution.

5.5 Natural deduction.

6. Representing knowledge using Rules

6.1 Procedural versus Declarative knowledge.

6.2 Logic Programming.

6.3 Forward versus Backward Reasoning.

6.4 Matching.

6.5 Control Knowledge.

Unit-IV

7. Symbolic Reasoning under Uncertainty

7.1 Introduction to Nonmonotonic Reasoning.

7.2 Logics for Nonmonotonic Reasoning.

7.3 Implementation Issues.

7.4 Augmenting a problem-solver.

8. Implementations

8.1 Depth-first Search.

8.2 Breadth-first Search.

Unit-V

9. Statistical Reasoning.

9.1 Probability and Bayes Theorem.

9.2 Certainty Factors and Rule-Based systems.

9.3 Bayesian Networks.

9.4 Dempster-Shafer Theory.

9.5 Fuzzy Logic.

Prescribed book:

Artificial Intelligence -[Rich & Knight]-Third edition-McGraw-Hill (Chapters 1-8).






Semester : V/VI Credits: 4

PROJECT & VIVA-VOCE

The objective of the project is to motivate them to work in emerging/latest technologies, help the students

to develop ability, to apply theoretical and practical tools/techniques to solve real life problems related to

industry, academic institutions and research laboratories.

The project is of 2 hours/week for one (semester VI) semester duration and a student is expected to do

planning, analyzing, designing, coding, and implementing the project. The initiation of project should be

with the project proposal. The synopsis approval will be given by the project guides.

The project proposal should include the following:

Title

Objectives

Input and output

Details of modules and process logic

Limitations of the project

Tools/platforms, Languages to be used

Scope of future application

The Project work should be either an individual one or a group of not more than three members and

submit a project report at the end of the semester. The students shall defend their dissertation in front of

experts during viva-voce examinations.

****


Annexure - I

BCA under CBCS w.e.f. 2018-2019 Admitted Batch

Table-1: B.C.A. SEMESTER – I

Sno Course Total

Marks

Mid

Sem

Exam*

Sem

End

Exam

Teaching

Hours Credits

1 First Language

100 25 75 4 3 English

2

Foundation Course - 1

50 10 40 2 2 HVPE(Human Values and

Professional Ethics)

3 Foundation course -2

50 10 40 2 2 Communication & Soft Skills -1

4 Elementary Mathematics 100 25 75 6 5

5 Computer Fundamentals and Office

Tools 100 25 75 4 3

6 Office Tools Lab 50 0 50 2 2

7 Programming Using “C” 100 25 75 4 3

8 Programming Using “C” Lab 50 10 40 2 2

9 Digital Imaging Lab 50 10 40 2 2

10 Problem Solving Techniques 100 25 75 4 3

Total 750 32 27

Table-2: B.C.A. SEMESTER – II

Sno Course Total

Marks

Mid

Sem

Exam*

Sem

End

Exam

Teaching

Hours Credits

1 First Language

100 25 75 4 3 English

2 Foundation course – 3

50 10 50 2 2

Environmental Sci

3 Statistical Methods and their

Applications 100 25 75 6 5

4 UNIX 100 25 75 4 3

5 UNIX Lab 50 10 40 2 2

6 Data Structures 100 25 75 4 3

7 Data Structures Lab 50 10 40 2 2

8 Computer System Architecture 100 25 75 4 3

9 Scribus Lab 50 10 40 2 2

Total 700 30 25


Table-3: B.C.A. SEMESTER – III

Sno Course Total

Marks

Mid

Sem

Exam*

Sem

End

Exam

Teaching

Hours Credits

1 First Language

100 25 75 4 3 English

2 Foundation Course - 5 Entrepreneurship 50 10 40 2 2

4 Information Security Management

( Security Analyst 1) : ICT - I 100 25 75 4 3

5 DBMS 100 25 75 4 3

6 DBMS Lab 50 10 40 2 2

7 Programming with JAVA 100 25 75 4 3

8 JAVA LAB 50 10 40 2 2

10 Operating Systems 100 25 75 4 3

11 Operating Systems Lab 50 10 40 2 2

12 Accounts and Financial Mgmt. 100 25 75 6 5

13 Tally lab 50 10 40 2 2

Total 850 36 30

Table-4: B.C.A. SEMESTER – IV

Sno Course Total

Marks

Mid

Sem

Exam*

Sem

End

Exam

Teaching

Hours Credits

1

Foundation Course – 2C*


3 Foundation course -2B


2 Foundation Course – 6*

50 10 40 2 2 Analytical Skills

3 Foundation Course - 7 **

50 10 40 2 2 CE (Leadership Education)

4 Information Security Assessments

and Audits ( Security Analyst 2) :

ICT - II

100 25 75 4 3

5 Python 100 25 75 4 3

6 Advanced Java 100 25 75 4 3

7 Advanced Java Lab 50 10 40 2 2

8 Web Programming 100 25 75 4 3

9 Web Programming Lab 50 10 40 2 2

10 Python Lab 50 10 40 2 2

11 Microprocessors 100 25 75 4 3

Total 850 34 29


Table-5: B.C.A. SEMESTER – V

Sno Course Total

Marks

Mid

Sem

Exam*

Sem

End

Exam

Teaching

Hours Credits

1 Skill Development Course – 1

(University’s Choice) 50 0 50 2 2

2 Information Security Incident

Response and Management

(Security Analyst 3)

100 25 75 5 4

3 Software Engineering 100 25 75 5 4

4 OOAD 100 25 75 5 4

Elective – 1

5.1 Data Mining & Ware Housing

100 25 75 4 3 5.2 Computer Networks

5.3 Cyber Forensics

Elective – 2

6.1 Android Basics

100 25 75 4 3 6.2 Principles of Animation

6.3 Software Testing Methodologies

Elective – 1 (LAB)

7.1 Data Mining Lab

50 10 40 2 2 7.2 Computer Networks Lab

7.3 Cyber Forensics Lab

Elective – 2 (LAB)

8.1 Android Basics Lab

50 10 40 2 2 8.2 Computer Animation Lab

8.3 Testing Tools Lab

Total 650 29 24


Table-6: B.C.A. SEMESTER – VI

1 Skill Development Course – 2

50 0 50 2 2 (University’s Choice)

2 Ecommerce 100 25 75 5 4

3 Open Source Software 100 25 75 5 4

4 Cloud Computing 100 25 75 5 4

Elective – 1

5.1 Hadoop & R Language

100 25 75 5 4 5.2 Network programming

5.3 Cyber Laws

Elective – 2

6.1 Advanced Android

100 25 75 5 4 6.2 Design of Video Games

6.3 Advanced Software Testing

Project Lab

7 Main Project 100 25 75 2 2

Total 650 29 24

Total Credits : 159







Information Security Incident Response and Management (Secrity Analyst – III)

Total : 75 Hrs.

Course Objectives:

1. To introduce managing information security services.

2. To introduce trouble shooting network devices.

3. To introduce response handling, incident response roles and data backup.

4. To introduce computer security logs, and Log management.

5. To introduce handling network security incidents and malicious code incidents.

Course Outcomes:

By the end of the course students will have knowledge:

1. Configuring network devices, identifying unauthorized devices, etc(PO1, PO7)

2. Troubleshooting of network communication, devices and can handle network slowdowns.(PO1,

PO7)

3. Handling responses, understand incident response role and responsibilities, handling data

backup.(PO1, PO7)

4. Configuring and Analysing Logs, Log management and time synchronization.(PO1, PO7)

5. Network attacks and security incidents, preventing incident and handling malicious code.(PO1,

PO7)

UNIT I

Managing Information Security Services

Configuring Network Devices, Identifying Unauthorized Devices, Testing the Traffic Filtering Devices,

Configuring Router, Configuring Modes – Router/Global/Interface/Line/Privilege Exec / ROM /User

EXEC, Configuring a banner / Firewall / Bastion Host / VPN Server etc.

UNIT II

Troubleshooting Network Devices and Services

Introduction & Methodology of Troubleshooting, Troubleshooting of Network Communication –

Connectivity - Network Devices – Network Slowdowns – Systems – Modems etc.

UNIT III

Information Security Incident Management & Data Backup

Information Security Incident Management overview – Handling Response, Incident Response Roles and

Responsibilities, Incident Response Process etc.

Data Back Introduction, Types of Data Backup and its Techniques, Developing an Effective Data Backup

Strategy and Plan, Security Policy for Back Procedures.

UNIT IV

Log Correlation

Computer Security Logs, Configuring & Analyzing Windows Logs, Log Management – Functions &

Challenges, Centralized Logging and Architecture, Time Synchronization – NTP / NIST etc.

UNIT V

Handling Network Security Incidents

Network Reconnaissance Incidents, Network Scanning Security Incidents, Network Attacks and Security

Incidents, Detecting DoS attack, DoS Response Strategies, Preventing / Stopping a DoS Incident etc.


Handling Malicious Code Incidents

Incident Handling Preparation, Incident Prevention, Detection of Malicious Code, Containment Strategy,

Evidence Gathering and Handling, Eradication and Recovery, Recommendations etc.

Text Books

1. Managing Information Security Risks, The Octave Approach by Christopher Alberts and Audrey

Dorofee

2. “Cryptography and Network Security (4th

edition) by William Stallings

References:

1. https://www.sans.org/reading-room/whitepapers/incident/security-incident-handling-small-

organizations-38979

https://www.sans.org/reading-room/whitepapers/incident/security-incident-handling-small-organizations-38979

https://www.sans.org/reading-room/whitepapers/incident/security-incident-handling-small-organizations-38979





COMPUTER SCIENCE 2018-2019 B.C.A

SEMESTER – II Credits: 3

UNIX Total: 60 Hrs

Course Objectives:

1. To understand Unix Operating System

2. To explore the Basic Shell Commands

3. To perform various file operations

4. To introduce various Editors

5. To introduce Shell programming

Course Outcomes:

After this course, the student will be able to

1. understand architecture of Unix OS

2. Implement commands using the basic tool kit.

3. can perform various operations on files like printing, sorting, splitting, etc.

4. implement various commands in editors

5. write various shell programs

Unit – I: UNIX OPERATING SYSTEM 10 hr

1.1 Overview of UNIX Operating System

1.2 basic features of Unix operating System

1.3 File Structure

1.4 CPU Scheduling

1.5 Memory Management

1.6 File System Implementation of Operating System Functions in UNIX.

Unit- II: 12 hr

2.1 Starting of Unix and Text Manipulation and user-to-user communication

2.2 User Names and Groups

2.3 Logging In

2.4 Format of Unix Commands

2.5 Changing your password

2.6 Unix Documentation,

Unit – III: Files and Directories 16 hr

3.1 File permission

3.2 Basic Operation on Files

3.3 Changing Permission Modes

3.4 Standard files

3.5 Processes Inspecting Files

3.6 Operating On Files

3.7 Printing Files

3.8 Rearranging Files


3.9 Sorting Files

3.10 Splitting Files

3.11 Translating Characters

3.12 On line communication

3.13 Off line communication.

Unit- IV: VI EDITORS 10 hr

4.1 General characteristics

4.2 Adding text and Navigation

4.3 changing text, searching for text

4.4 copying and Moving text

4.5 Features of Ex

4.6 Line Editors Ex and Ed

4.7 Stream editor SED

4.8 changing several file s in SED, AWK.

Unit –V: Shell Programming 12 hr

5.1 Programming in the Bourne and C-Shell,

5.2 Wild Cards

5.3 Simple Shell program

5.4 variables

5.5 Programming Construct

5.6 Interactive Shell scripts

5.7 Advanced Features

5.8 Unix Compiler

5.9 Maintaining program System Administration

5.10 Define system Administration

5.11 Booting the system

5.12 Maintaining User Accounts

5.13 File System and special files

5.14 Backup and Restoration.

Text Books:

1. Unix and shell Programming by B.M Harwani, OXFORD University Press

References Books:

1. Unix Concept and application- Sumitabhadas

2. Unix Shell Programming-Yashwant Kanetkar

3. Unix Programming Environment- RobPike

4. Unix in a Nutshell- Donill Gily

Student Activity:

1. Load unix/linux in your system in a separate drive

2. Create graphics in unix environment





COMPUTER SCIENCE 2018 - 2019 B.C.A


UNIX Lab

1. Execute of various file/directory handling commands.

2. Write a Simple shell script for basic arithmetic and logical calculations.

3. Write Shell scripts to check various attributes of files and directories.

4. Write Shell scripts to perform various operations on give n strings.

5. Write Shell scripts to explore system variables such as PATH, HOME etc.

6. Write Shell scripts to check and list attributes of processes.

7.Execute various system administrative commands

8.Write awk script that uses all of its features.

9. Use seed instruction to process /etc/password file.

10. Write a shell script to display list of users currently logged in.

11. Write a shell script to delete all the temporary files.

12. Write a shell script to search an element from an array using binary searching.


PARVATHANENI BRAHMAYYA SIDDHARTHA COLLEGE OF ARTS & SCIENCE VIJAYAWADA -

520 010


COMPUTER SCIENCE 2019-2020

B.Sc. (Hons) Computer Science,

B.Sc (MECS, CAME, MSCS, MSCA,

MPCS), B.C.A

SEMESTER – IV Credits: 4

Python Total: 60 Hrs

Course Objectives:

1. To understand why Python is a useful scripting language for developers.

2. To learn how to write loops and decision statements in Python.

3. To learn how to write functions and pass arguments in Python.

4. To learn how to use exception handling in Python applications for error handling

5. To learn how to design object‐oriented programs with Python classes. Course Outcomes:

1. Implement a given algorithm as a computer program (in Python)

2. Adapt and combine standard algorithms to solve a given problem

3. Adequately use standard programming constructs: repetition, selection, functions, composition,

modules, aggregated data (arrays, lists, etc.)

4. Identify and repair coding errors in a program 5. Understand the concepts of object-oriented programming as used in Python: classes, subclasses, properties,

inheritance

UNIT-1: 12 Hrs

1.1 Introduction:

1.1.1 History

1.1.2 Features,

1.1.3 Setting up path

1.1.4 Working with Python

1.1.5 Basic Syntax

1.1.6 Variable and Data Types

1.1.7 Operators.

1.2 Conditional Statements :

1.2.1 If

1.2.2 If- else

1.2.3 Nested if-else

1.3 Looping

1.3.1 For

1.3.2 While

1.3.3 Nested loops

1.3.4 Break

1.3.5 Continue

1.3.6 Pass.


UNIT-2: 12 hrs

2.1 Strings:

2.1.1 string Manipulation

2.2.2 Accessing Strings

2.1.3 Basic Operations

2.1.4 String slices

2.1.5 Function and Methods.

2.2 Lists

2.2.1 Introduction

2.2.2 Accessing list

2.2.3 Operations

2.2.4 Working with lists

2.2.5 Function and Methods.

2.3 Tuple:

2.3.1 Introduction

2.3.2 Accessing tuples

2.3.3 Operations

UNIT-3 12hrs

3.1 Dictionaries:

3.1.1 Introduction,

3.1.2 Accessing values in dictionaries

3.1.3 working with dictionaries

3.1.4 Properties

3.2 Functions:

3.2.1 Defining a function

3.2.2 calling a function

3.2.3 Types of functions

3.2.4 Function Arguments

3.2.5 Anonymous functions

3.2.6 Global and local variables.

3.3 Modules:

3.3.1 Importing module

3.3.2 Math module

3.3.3 Random module

3.3.4 Packages

3.3.5 Composition.

UNIT-4: 12 hrs

4.1 Input-Output:

4.1.1 Printing on screen

4.1.2 Reading data from keyboard

4.1.3 Opening and closing file

4.1.4 Reading and writing files

4.1.5 Functions

4.2 Exception Handling :

4.2.1 Exception


4.2.3 Except clause

4.2.4 Try ? finally clause

4.2.5 User Defined Exceptions .

UNIT-5: 12 hrs


5.1 OOPs concept:

5.1.1 Classes

5.1.2 Objects,

5.1.3 Attributes and methods

5.1.4 Design with classes

5.1.5 Data modelling

5.1.6 Persistent storage of objects

5.1.7 Inheritance,Polymorphism

5.1.8 Overloading

5.1.9 Overriding

5.1.10 Data hiding

5.1.11 Abstract Class.

Reference Text Books:

1.Learn to program with Python by Richard L.Halterman

2.Learning Python 5th Edision by mark Lutz , published by O’relly media.

3. Learning with Python by Jeffrey Elkner,Chris Meyers,Allen Downey ,Dream Tech Press

4.Introduction to Computation and programming with Python by John V.Guttag,PHI



520 010


COMPUTER SCIENCE 2019 - 2020

B.Sc. (Hons) Computer Science,

B.Sc (MECS, CAME, MSCS, MSCA,

MPCS), B.C.A

SEMESTER – IV Credits: 2

Python Lab

1. Python Program to Print Hello world!

2. Python Program to Add Two Numbers

3. Python Program to Find the Square Root

4. Python Program to Calculate the Area of a Triangle

5. Python Program to Solve Quadratic Equation

6. Python Program to Swap Two Variables

7. Python Program to Generate a Random Number

8. Python program to check if a number is positive, negative or zero

9. Python Program to Check if a Number is Odd or Even

10. Python Program to Check Leap Year

11. Python Program to Find the Largest Among Three Numbers

12. Python Program to Check Prime Number

13. Python Program to Print all Prime Numbers in an Interval

14. Python Program to Find the Factorial of a Number

15. Python Program to Display the multiplication Table

16. Python Program to Print the Fibonacci sequence

17. Python Program to Check Armstrong Number

18. Python Program to Find Armstrong Number in an Interval

19. Python Program to Find the Sum of Natural Numbers

20. Python Program to Convert Decimal to Binary, Octal and Hexadecimal

21. Python Program to Find ASCII Value of Character

22. Python Program to Find LCM

23. Python Program to Find Factors of Number

24. Python Program to Make a Simple Calculator

25. Python Program to Find Sum of Natural Numbers Using Recursion

26. Python Program to Find Factorial of Number Using Recursion

27. Python Program to Add Two Matrices

28. Python Program to Transpose a Matrix

29. Python Program to Multiply Two Matrices

30. Python Program to Check Whether a String is Palindrome or Not


Annexure VI

Proposed Modified Structure for B.Sc. (Hons) Computer Science

(W.E.F 2018 – 2019 Admitted Batch)

Note: Students of B.Sc (Hons) Computer Science shall undergo for industrial training

during the summer break of IV semester for at least 3 weeks. The certificate for the

same should be produced at the starting of V semester.

SEM Title of paper L - T - P Credits Total

Marks Internal

Sem

End

I

General English – I 4 - 0 - 0 3 100 25 75

Second Lanuage - I

(Telugu / Hindi) 2 - 0 - 0 2 100 25 75

Environmental Studies 2 - 0 - 0 2 50 0 50

CSS – 1 2 - 0 - 0 2 50 0 50

Programming Fundamentals 4 - 0 - 0 4 100 25 75

Sequences, Series, Limits and

Continuity 4 - 0 - 0 4 100 25 75

Digital Electronics 4 - 0 - 0 4 100 25 75

Programming Fundamentals

Lab 0 - 0 - 2 2 50 0 50

Digital Electronics Lab 0 - 0 - 2 2 50 0 50

IT Workshop Lab 0 - 0 - 2 2 50 0 50

TOTAL 28 27 750 125 625


Marks Internal

Sem

End

II

General English – II 4 - 0 - 0 3 100 25 75

Second Lanuage - II

(Telugu / Hindi) 2 - 0 - 0 2 100 25 75

HVPE 2 - 0 - 0 2 50 0 50

Data Structures 4 - 0 - 0 4 100 25 75

Differentiation, Riemann,

Integration, vector

Differentiation and

Integration

4 - 0 - 0 4 100 25 75

Microcontroller 4 - 0 - 0 4 100 25 75

Web Designing 4 – 0 – 0 4 100 25 75

Data Structures Lab 0 - 0 - 2 2 50 0 50

Microcontroller Lab 0 - 0 - 2 2 50 0 50

Web Designing Lab 0 - 0 - 2 2 50 0 50

TOTAL 30 29 800 150 650

SEM Title of paper L - T - P Credits Total Internal Sem


Marks End

III

General English – III 4 - 0 - 0 3 100 25 75

Reasoning 2 - 0 - 0 2 50 0 50

CSS - 2 2 - 0 - 0 2 50 0 50

Entrepreneurship 2 - 0 - 0 2 50 0 50

Object Oriented Programming 4 - 0 - 0 4 100 25 75

Database Systems 4 - 0 - 0 4 100 25 75

Discrete Mathematics – I 4 - 0 - 0 4 100 25 75

Theory of Probability 4 - 0 - 0 4 100 25 75

Object Oriented Programming

Lab 0 - 0 - 2 2 50 0 50

Database Systems Lab 0 - 0 - 2 2 50 0 50

Theory of Probability Lab 0 - 0 - 2 2 50 0 50

32 31 800 125 675


Marks Internal

Sem

End

IV

CSS – 3 2 - 0 - 0 2 50 0 50

Analytical Skills 2 - 0 - 0 2 50 0 50

Leadership Education 2 - 0 - 0 2 50 0 50

Python 4 - 0 - 0 4 100 25 75

Advanced Java 4 - 0 - 0 4 100 25 75

Discrete Mathematics – II 4 - 0 - 0 4 100 25 75

Probabilty and Distribution 4 - 0 - 0 4 100 25 75

Python Lab 0 - 0 - 2 2 50 0 50

Advanced Java Lab 0 - 0 - 2 2 50 0 50

Probabilty and Distribution

Lab 0 - 0 - 2 2 50 0 50

28 28 700 100 600



Marks Internal

Sem

End

V

Computer Networks 4 - 0 - 0 4 100 25 75

Operating Systems 4 - 0 - 0 4 100 25 75

Software Engineering 4 - 0 - 0 4 100 25 75

Theory of Estimation and

Testing of Hypothesis 4 - 0 - 0 4 100 25 75

Computer Networks Lab 0 - 0 - 2 2 50 0 50

Operating Systems Lab 0 - 0 - 2 2 50 0 50

Theory of Estimation and

Testing of Hypothesis Lab 0 - 0 - 2 2 50 0 50

Project Work 0 - 0 - 2

24 22 550 100 450


Marks Internal

Sem

End

VI

Software Testing

Methadologies 4 - 0 - 0 4 100 25 75

Information Security 4 - 0 - 0 4 100 25 75

Elective Paper 4 - 0 - 0 4 100 25 75

Operations Research 4 - 0 - 0 4 100 25 75

Software Testing Lab 0 - 0 - 2 2 50 0 50

Operations Research Lab 0 - 0 - 2 2 50 0 50

Mobile Application

Development Lab 0 – 0 – 2 2 50 0 50

Project Work 0 - 0 - 2 4 100 25 75

24 26 650 125 525

Total Credits 163

Electives:

1. Cyber Crimes and Cyber Security

2. Cloud Computing

3. Artificial Intelligence



520 010


COMPUTER SCIENCE 2021 - 2022 B.Sc. (Hons) Computer Science

SEMESTER – V Credits : 4

Computer Networks

Total Hrs: 60

Course Objectives

To provide an introduction to the fundamental concepts on data communication and the Design of

computer networks.

To get familiarized with the basic protocols of computer networks.

Course Outcomes:

After this course, the student will be able to

Identify the different components in a Communication System and their respective roles.

Describe the technical issues related to the local Area Networks

Identify the common technologies available in establishing LAN infrastructure.

Unit – I 12 Hours

Introduction to Networking

1.1 Uses of computer networks

1.2 Types of computer networks

1.3 ISO OSI reference model

1.4 Multiplexing

1.4.1 Frequency Division Multiplexing

1.4.2 Wave Length Division Multiplexing

1.4.3 Time Division Multiplexing

1.5 Guided media

1.5.1 Twisted pair cable

1.5.2 Coaxial cable

1.5.1 Fiber optics

1.6 Unguided media

1.6.1 Radio waves

1.6.2 Micro waves

1.6.3 Satellites

1.7 Switching

1.7.1 Circuit switching

1.7.2 Packet switching

1.7.3 Message switching

Unit – II 12 Hours

Data Link Layer

2.1 Design issues of data link layer

2.2 Data link protocols

2.2.1 unrestricted simplex protocol

2.2.2 simplex stop and wait protocol

2.2.3 one bit sliding window protocol

2.3 Bluetooth

2.4 Error detection and correction

Unit – III 12 Hours

Network Layer


3.1 Introduction

3.2 Design issues of network layer

3.3 Virtual vs Datagram routing algorithms

3.4 Shortest path routing algorithm

3.5 Flooding

3.6 Distance vector routing algorithm

` 3.7 Congestion control algorithms

Unit – IV 12 Hours

Transport Layer

4.1 Introduction

4.2 Design issues of Transport Layer

4.3 Elements of Transport Protocols

4.3.1 Addressing

4.3.2 Connection Establishment

4.3.3 Connection Release

4.3.4 Flow control and Buffering

4.3.5 Multiplexing

4.3.6 Crash Recovery

4.4 Remote Procedure Call

4.5 User Datagram Protocol

4.6 Transmission Control Protocol

UNIT - V 12 hours

Application Layer

5.1 Domain Name system

5.2 Email architecture and services

5.3 User agent sending and receiving Email

5.4 WWW Architectural Overview

5.5 Client side Server side URL

5.6 Cookies

5.7 Cryptography

Text book :

1. Computer Networks-Andrew.S.Tanenbaum ,Pearson Edu Asia Fourth edision.

2. Introduction to Data Communications and Networking-Behrouz Forouzan,Tata McGraw Hill Edition


PARVATHANENI BRAHMAYYA SIDDHARTHA COLLEGE OF ARTS & SCIENCE VIJAYAWADA

- 520 010


COMPUTER SCIENCE 2021 - 2022 B.Sc. (Hons) Computer Science

SEMESTER – V Credits : 2

Computer Networks Lab

1. Implementation of Stop and Wait Protocol

2. Implementation of Sliding Window Protocol

3. Study of Socket Programming and Client – Server model

4. Write a code simulating ARP /RARP protocols.

5. Write a code simulating PING and TRACEROUTE commands

6. create a socket for HTTP for web page upload and download.

7. Write a program to implement RPC (Remote Procedure Call).

8. Implementation of Subnetting.

9. Applications using TCP and UDP Sockets like DNS, SNMP and File Transfer

10. Applications using TCP Sockets like

A)Echo client and echo server

B) Chat

C) File Transfer







Total Hrs.: 60

Web Designing

Course objective

6. To introduce basic concepts of Internet.

7. To introduce HTML for web page designing.

8. To introduce CSS.

9. To introduce basic components of Java Script.

10. Top introduce basic components of XML.

Course outcome

1. To define the basics for web page creation.(PO1, PO7)

2. To visualize the basic concept of HTML. (PO1, PO7)

3. To implement CSS in web designing. (PO1, PO7)

4. To implement Java Script and JQuery (PO1, PO7)

5. To develop the concept of web publishing (PO1, PO7)

UNIT I – INTRODUCTION

1.10 Internet Principles

1.11 Basic Web Concepts

1.12 Client / Server Model

1.13 How Web Works

1.14 HTML and Scripting Languages

1.15 Standard Generalized Mark Up Languages.

1.16 Next Generation

1.17 Internet

1.18 Protocols and Application

UNIT II – HTML

2.12 Introduction

2.13 Working on HTML

2.14 HTML Elements

2.15 HTML Headings & Comments

2.16 Font Styles

2.17 Hyperlink & Image & List Elements

2.18 Tables

2.19 Form & Form Controls

2.20 HTML5 Form Validation

2.21 HTML5 Canvas

2.22 HTML5 Media Elements

UNIT III –Cascading Style Sheet-CSS

3.11 Introduction to CSS

3.12 CSS Syntax

3.13 CSS Selectors

3.14 Formatting Text

3.15 Colors and Backgrounds

3.16 Margins & Padding & Borders


3.17 CSS Links & Comments and List Styles

3.18 Floating and Positions

3.19 Pagination & Animation & Navigations

3.20 Image Gallery Styles

UNIT IV – JAVA SCRIPT & JQUERY

4.3 Java Script

4.3.1 Introduction to Java Script

4.3.2 How Declare Variables and Data Types

4.3.3 Operators and Comments

4.3.4 Conditional Statements

4.3.5 Functions

4.3.6 Events

4.3.7 Java Script Form Validations and Expressions


4.3.9 Animations

4.3.10 Handling Windows

4.4 JQuery

4.4.1 Introduction JQuery

4.4.2 JQuery Selecting Elements

4.4.3 JQuery Events

4.4.4 JQuery Styling and Animating

4.4.5 DOM Manipulation

UNIT V- XML

5.8 Introduction to XML

5.9 Document Type Definitions

5.10 Style Languages

5.11 Introduction Schemas

5.12 Data Types & Restrictions

5.13 XSL & Advanced XSL

5.14 XPath and Advance XPath and XPointer

References Books:

Gopalan N.P and Akilandeswari J., “Web Technology”, Prentice Hall of India 2011.

Jennifer Neediest Robbins , “Learning Web Design “, 4th

Edition 2014

Jonathan Chaffer , Karl Swedberg , “Learning JQuery”, 4th

Edition 2013

Erik Ray, O’Reilly Media, “Learning XML“, 2009 -2014 Edition 2009







Web Designing Lab

Course objective

1. Student will be Able to learn basic tags of html

2. Student will be Able to learn different types of lists

3. Student will be Able to learn concept of hyperlink

4. Student will be Able to learn different types of form components

5. Student will be Able to learn concept of frames

Course outcomes

1. To define the basics for web page creation. (PO7)

2. To visualize the basic concept of HTML.(PO7)

3. To recognize the elements of HTML.(PO7)

4. To implement form components of HTML.(PO7)

5. To develop the concept of web publishing(PO7)

Practicals

1) Write the HTML code at least with 30 lines which make use of following tags:

The Italics tag, center tag, paragraph tag, Break tag, font tag and its attributes.

2) Create the HTML file name Assignment.htm with the given text and below specification:

3) Welcome to ABC Institution

ABC was founded in 1988 to offer distance learning programs. The privately owned

independent college once named, "American Institute for Computer Sciences," changed its

name to better reflect what students can accomplish with distance education.

A typical student at ABC is 26 to 40 years old and many of them work in a tech-related

field. All of them want to better themselves by getting the college degree they need to

progress up the career ladder.

a) Specify the title/Header ‘Welcome to ABC Institute’ at the top of file.

b) Centre the above title and change font size to ARIAL, 14.

c) Give three lines spacing after the title.

d) Apply BOLD, UNDERLINE and ITALIC effect to it.

e) Select appropriate BACKGROUND and BGCOLOR attributes.

f) Use text formatting command using paragraph break and line breaks.

g) Emphasize document context using Align, Size and Width tags.

4) Looking at the screen given below write the HTML code making use of following tags.

Text Content

Example on Unordered list

• Sports Car

• Business Car

• Economy Car

Example on Ordered list

Sports Car

Business Car

Economy Car

Example on Definition list

• Sports Car

- Ferrari


• Business Car

- Tata Sumo

• Economy Car

- Maruti

5) Design a web page using the image files ‘XYZ.GIF’, ‘PQR.GIF’ and ‘DEF.GIF’

according to the following specifications. (Use an appropriate Text content)

♦ Use a Border for ‘XYZ.GIF’.

♦ Resize the width and Height ‘PQR.GIF’ and ‘DEF.GIF’ to 100 pixels each.

♦ Align the text with respect to the images so as to obtain the desired output.

6) Create a web page giving the following Flight details in a tabular format.

♦ Flight Name

♦ Starting Place

♦ Destination Place

♦ Arrival and departure time

♦ Class

♦ Fare

a) Place a border for the table and use all padding to present the cell data with clarity.

b) Align the table in the center of the screen. Use a caption saying ‘Schedule for flights’.

c) Change font style, color, and size of title ‘Schedule for flights’ to ARIAL ’15 & line

spacing 2.5 to the table data.

d) Use the appropriate background color for data of table.

e) Save the file with ‘FLIGHT.HTM’

7. Create a specimen of a corporate web page. Divide the browser screen into two frames.

The frame on the left will be a menu consisting of hyper links. Clicking on any one of these

links will lead to a new page, which must open in the target frame, which is on the right hand

side.

8 Create two links the first link that will open a page that displays the company profile, its

business and its products. The second link will display the contact address of the company.

9. Design a webpage of any educational website.

10. Create any governmental webpage.


Annexure VII


VIJAYAWADA

Structure of B.Sc. (Computer Applications, Maths, Electronics) Syllabus Under

CBCS w.e.f. 2018 – 2019

SEM Paper Subject Hrs Credits IA ES Total

FIRST YEAR

I I

Programming in C 4 3 25 75 100

Programming in C Lab 2 2 10 40 50

II II

Data Structures 4 3 25 75 100

Data Structures Lab 2 2 10 40 50

SECOND YEAR

III III

Object Oriented

Programming Using

Java

4 3 25 75 100

Object Oriented

Programming Using

Java Lab

2 2 10 40 50

IV IV

Python 4 3 25 75 100

Python Lab 2 2 10 40 50

****


DEPARTMENT OF COMPUTER SCIENCE (PG)

Minutes of the meeting of Board of Studies in Computer Science (PG) held on 14/05/2018 at 2 P.M. in the

Department of Computer Science.

Members Present

Name of the Member Role Signature

Mr.T.S.Ravi Kiran Chairman

Prof.Y.K.Sundara Krishna Subject Expert, Krishna

University

Dr.R.Satya Prasad Subject Expert, Acharya

Nagajuna University

Prof.K.V.Samba Siva Rao Subject Expert, NRI

Institute of Technology,

Agiripalli

Prof.B.V.Subba Rao Subject Expert,

P.V.P.Siddhartha

Institute Of Technology,

Kanuru

Mr.Satya Thopalli Industry Nominee,

Sphere Solutions India

Pvt.Ltd.

Mrs.R.Vijaya Kumari Alumni, Krishna

University

Mrs.K.Sobhana Member

Mrs.Ch.Smitha Chowdary Member

Mrs.R.Aruna Member

Ms.K.Priya Member

Mrs.A.Kavitha Member

Mrs.S.P.V.N.D.Suneetha Member

Mr.V.V.Ramana Member

A G E N D A

1. To evaluate and approve revised Course Structure and Syllabus for I & II semesters of Master of

Computer Applications and M.Sc.(Computer Science) under Choice Based Credit System with

effect from the academic year 2018 -19 admitted students.

2. To evaluate and approve proposed Course Structure and Syllabus for III & IV semesters of Master

of Computer Applications and M.Sc.(Computer Science) under Choice Based Credit System with

effect from the academic year 2017 -18 admitted students.

3. To explore the possibilities of introducing any new subjects as additional optional subjects, or new

combinations of subjects.

4. To assess the potential of the courses against the employment prospects.


5. To assess the compatibility of Practical Courses to Theory Courses.

6. To approve the Model Question Papers for all the subjects

7. To approve the List of Examiners and Paper Setters for all papers.

8. Any other item with the permission of the Chair.

RESOLUTIONS Resolution – I

Resolved to recommend the revised scheme of instruction and evaluation for semesters I & II for 2018 -

’19 admitted batch and III & IV for 2017 – 18 admitted batch of the M.Sc. Computer Science s contained

in Appendix–I.

Resolution – II Resolved to recommend the revised syllabi for I and II semesters, contained in Appendix–II for the batch

of students admitted in M.Sc. Computer Science , from the year 2018-’19.

Resolution – III Resolved to recommend the syllabi for III and IV semesters, contained in Appendix–III for the batch of

students admitted in M.Sc. Computer Science , from the year 2017-’18.

Resolution – IV Resolved to recommend model question papers for III and IV semester courses for Semester End

Examinations contained in Appendix–IV.

Resolution – V Resolved to recommend the Internal & External Assessment & Evaluation for Lab / Seminar based

courses and Mini Project / Project Work contained in Appendix–V.


APPENDIX – I

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010

SEMESTER – III

S.NO. Course

Code Title of the Course

Instruction

Hours per

Week Credits

Evaluation

Total

Marks CIA Marks

SEE

Marks Duration L T P

1 CS3T1 Internet of Things (IoT) 4 4 30 70 3 Hours 100

2 CS3T2

Design & Analysis of

Algorithms 3 1 4 30 70 3 Hours 100

3 CS3T3

Data Warehousing & Data

Mining 4 4 30 70 3 Hours 100

4 CS3T4 Web Technologies 4 4 30 70 3 Hours 100

5

CS3T5A

Principles of Distributed

Database Systems 4

4 30 70 3 Hours 100 CS3T5B TCP/IP 4

CS3T5C Software Testing 4

CS3T5D Mobile Computing 4

CS3T5E

Cryptography & Network

Security 4

6 CS3L1 Web Technologies Lab 6 3 30 70 3 Hours 100

7 CS3L2 Data Mining Lab 6 3 30 70 3 Hours 100

8 CSS3P1 Mini Project 3 2 50 -- 3 Hours 50

28 260 490 750 CIA=Continuous Internal Assessment SEE=Semester End Examinations

SEMESTER – I

S.NO. Course


Instruction

Hours per

Week Credits

Evaluation

Total

Marks CIA Marks

SEE


4 CS1T4

Database Management

Systems 3 1 4 30 70 3 Hours 100 CIA=Continuous Internal Assessment SEE=Semester End Examinations

SEMESTER – II

S.NO. Course


Instruction

Hours per

Week Credits

Evaluation

Total

Marks CIA Marks

SEE


1 CS2T2 Operations Research 4 4 30 70 3 Hours 100

2 CS2T3 Theory of Computation 3 1 4 30 70 3 Hours 100

3 CS2T4 Software Engineering 4 4 30 70 3 Hours 100

4 CS2T5 Operating Systems 4 4 30 70 3 Hours 100 CIA=Continuous Internal Assessment SEE=Semester End Examinations


SEMESTER – IV

S.NO. Course


Instruction

Hours per

Week Credits

Evaluation

Total

Marks CIA Marks

SEE


1 CS4T1 Cloud Computing 4 4 30 70 3 Hours 100 2 CS4T2 AI & Machine Learning 3 1 4 30 70 3 Hours 100

3

CS4T3A Visual Programming 4

4 30 70 3 Hours 100 CS4T3B Big Data Analytics 4

CS4T3C Cyber Security 4

CS4T3D Python Programming 4

4 CS4L1 Visual Programming Lab

6 6 30 70 3 Hours 100 CS4L2 Big Data Analytics Lab

5 CS4P1 Project Work 18 18 10

CIA=Continuous Internal Assessment SEE=Semester End Examinations

Mr.T.S.Ravi Kiarn Mrs.K.Sobhana

Prof.Y.K.Sundara Krishna Mrs.Ch.Smitha Chowdary

Mrs.R.Vijaya Kumari Mrs.R.Aruna

Dr.R.Satya Prasad Ms.K.Priya

Mr.Satya Thopalli Mrs.A.Kavitha

Prof.K.V.Sambasiva Rao Mrs.S.P.V.N.D.Suneetha

Prof.B.V.Subbarao Mr.V.V.Ramana


APPENDIX – II

REVISED SYLLABI OF I SEMESTER

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: I

LTP Hours/per week: 4 - -

Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Database Management Systems Max Marks:100

Course Code: CS1T4 Course: M.Sc.(Computer Science)

Course Objectives:

1. To understand and study the different issues involved in the design and implementation of a database system. 2. To understand and use data manipulation language to query, update, and manage a database and familiar with

the relational database theory, and be able to write relational algebra expressions for queries. 3. To learn the sound design principles for logical design of databases, including the E-R modeling, UML

modeling and Normalization approach. 4. To know with basic database storage structures and access techniques: file and page organizations, indexing

methods including B-tree, B+-tree and Hashing. 5. To develop an understanding of essential DBMS concepts such as database security, integrity, concurrency,

distributed database and client/server database.

Course Outcomes:

1. To have good understanding on basics of database design and implementation, and conceptual modeling

techniques. (PO4) (PO3) (PSO2)

2. To be able to specify, modify and retrieve the data. (PO1) (PO4) (PSO1)

3. Get acquainted with the sound design principles of databases, including the E-R modelling and Normalization

approach.(PO2) (PO4) (PSO1)

4. Understand basic database storage structures and access techniques. (PO3) (PSO1)

5. Understand the logical units of database processing, non-interference property. (PO1) (PSO1)

UNIT I Databases and Database Users: Introduction, An Example, Characteristics of the Database Approach,

Actors on the Scene, Workers behind the Scene, Advantage of Using the DBMS Approach. Database System Concepts and Architecture: Data Models, Schemas, and Instances, Three-Schema Architecture

and Data Independence, Database Languages and Interfaces, The Database System Environment, Centralized and

Client/Server Architectures for DBMSs. The Relational Data Model and Relational Database Constraints: Relational Model Concepts, Relational Model

Constraints and Relational Database Schemas, Update Operations, Transactions, and Dealing with Constraint

Violations.

UNIT II

Basic SQL: SQL Data Definition and Data Types, Specifying Constraints in SQL, Basic Retrieval

Queries in SQL, INSERT, DELETE, and UPDATE Statements in SQL. More SQL: More Complex SQL Retrieval Queries,Views (Virtual Tables) in SQL, Schema Change Statements in

SQL. The Relational Algebra and Relational Calculus: Unary Relational Operations: SELECT and PROJECT,

Relational Algebra Operations from Set Theory, Binary Relational Operations: JOIN and DIVISION, Additional

Relational Operations, Examples of Queries in Relational Algebra, The Tuple Relational Calculus, The Domain

Relational Calculus. UNIT III Data Modeling Using the Entity-Relationship (ER) Model: Using High-Level Conceptual Data Models for

Database Design, Entity Types, Entity Sets, Attributes, Keys, Relationship Types, Relationship Sets, Roles,

Structural Constraints, Weak Entity Types, ER Diagrams, Naming Conventions, Design Issues. The Enhanced Entity-Relationship (EER) Model: Subclasses, Superclasses, Inheritance, Specialization and

Generalization, Constraints and Characteristics of Specialization and Generalization Hierarchies, Modeling of

UNION Types Using Categories, A Sample UNIVERSITY EER Schema, Design Choices, Formal Definitions.


Functional Dependencies: Introduction, Basic Definitions, Trivial and Non-Trivial Dependencies, Closure of set of

Dependencies, Closure of set of Attributes, Irreducible sets of dependencies.

Further Normalization 1NF, 2NF, 3NF, BCNF: Introduction, Nonloss decomposition and functional

dependencies, 1st, 2

nd and 3

rd normal forms, Boyce-Codd Normal Form.Multivalued Dependency and Fourth

Normal Form, Join Dependencies and Fifth Normal.

UNIT IV Disk Storage, Basic File Structures and Hashing: Secondary Storage Devices, Buffering of Blocks,

Placing File Records on Disk, Operations on Files, Files of Unordered Records (Heap Files), Files of

Ordered Records (Sorted Files),Hashing Techniques, Parallelizing Disk Access Using RAID Technology. Indexing Structures for Files: Types of Single-Level Ordered Indexes, Multilevel Indexes, Dynamic Multilevel

Indexes Using B-Trees and B+-Trees.

UNIT V Introduction to Transaction Processing Concepts and Theory: Introduction to Transaction Processing,

Transaction and System Concepts, Desirable Properties of Transactions, Characterizing Schedules Based

on Recoverability, Characterizing Schedules Based on Serializability, Transaction Support in SQL. Concurrency Control Techniques: Two-Phase Locking Techniques for Concurrency Control, Concurrency

Control Based on Timestamp Ordering, Multiversion Concurrency Control Techniques, Validation (Optimistic)

Concurrency Control Techniques, Granularity of Data Items and Multiple Granularity Locking, Using Locks for

Concurrency Control in Indexes. Distributed Databases: Distributed Database Concepts, Types of Distributed Database Systems, Distributed

Database Architectures, Data Fragmentation, Replication, and Allocation Techniques for Distributed Database

Design.

Prescribed Text Book

Author Title Publisher

Chapters 1 Ramez Elmasri,

Shamkant B. Navathe Fundamentals of

Database Systems. Pearson Education, Seventh Edition, 2017

2 C.J. Date, A.Kannan,

S.Swamynathan An Introduction to

Database Systems VII Edition Pearson Education (2006).

Reference Text Books


1 Peter Rob, Carlos

Coronel Database Systems– Design,

Implementation and Management Eigth Edition, Thomson (2008)

2 Raman A Mata –

Toledo, Panline K.

Cushman

Database Management Systems Schaum’s Outlines, TMH

(2007)

3 Steven Feuerstein Oracle PL/SQL – Programming 10th Anniversary Edition,

OREILLY (2008)


REVISED SYLLABI OF II SEMESTER

Course Objectives:

1. To Formulate a real-world problem as a mathematical programming model and describe various

solutions of Simplex Method

2. To solve specialized linear programming problems like transportation problems.

3. To solve specialized linear programming problems like assignment problems

4. To analysing pure strategy game dominance principle and solving mixed strategy games.

5. To construct a simple network diagram

Courses Outcomes:

After completion of the course students should able to

1. Understand the meaning, scope and role of computers in OR, Formulate the liner programming problems using

graphical method, simplex method and artificial variable techniques. (PO2)(PO7)(PSO2)

2. Recognize and formulate transportation problems and drive their optimum solution.(PO2)(PSO1)(PO7)

3. Recognize and formulate assignment problems and drive their optimum solution(PO2)(PSO1)(PSO7)

4. Students should have the knowledge and skills to understand how game theorists think and approach a strategic

problem.(PO2)(PO1)(PSO2)

5. Apply the concepts of PERT and CPM for decision making and optimally managing projects.(PO6) (PSO1)

(PO7)

UNIT I

Linear programming: Nature, Meaning and Scope of Operations Research, Role of Computers in OR, Introduction

and Formulation of LP problems, Linear Programming: Graphical Solution for Two Variable Problem, Simplex

Method, Artificial Variable Technique: Big M and Two-Phase Methods

UNIT II

Transportation Problem: L. P Formulation of the Transportation Problem, Tabular Representation, Initial Basic

Feasible Solution (I.B.F.S.) to Transportation Problem: North West Corner, Least Cost, Vogel’s

Approximation Methods, The Optimality Test, Transportation Algorithm, MODI(Modified Distribution Method),

Some Exceptional Cases: Unbalanced, Prohibited, Maximization Transportation Problems, Time

minimization Transportation problem, Simple Problems.

UNIT III

Assignment Problem: Mathematical formulation of the problem, Hungarian method for Assignment problem,

Special cases in Assignment problems: Unbalanced, Prohibited, Maximization, Travelling Salesman Problem, A

Typical Assignment Problem, Simple Problems.

UNIT IV

Game Theory: Introduction, Pure Strategy, Mixed Strategy, Two Person Zero Sum Game, Minimax-Maximin

Criteria, Solution of Games with Saddle Point, Solution of Game without Saddle Point, Principle of Dominance,

Solution of game Without Saddle Point, Graphical Method for 2×N and M×2 Games, Solution of Game without

Saddle Point - Simplex Method, Simple Problems.

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: II LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Operations Research Max Marks:100



UNIT V

Project Management: Introduction, Rules for Network Construction, Network Diagram Representation, Critical

Path Analysis-Forward Pass Calculation, Backward Pass Calculation; Float and Slack Times, Project Evaluation

and Review Technique(PERT), Simple Problems

Prescribed Text Books


Chapters 1 S.D.Sharma,

HimanshuSharma Operations Research Theory,

Methods and Applications Improved and Enlarged Edition, Kedar

NathRamNath& Co., Meerut.

2 Dr. R. K. Gupta Krishna’s Operations Research 27thEdition,2010, Krishna Prakashan

Media (P) Ltd., Meerut

3 J.K.Sharma Operations Research: Theory

and Applications 5th Edition, 2013, Macmillan.

4 Hamdy Operations Research: An

Introduction A.Taha, 9th edition ,2010Prentic Hall.



Chapters 1 KantiSwarup, P.K.Gupta,

Man Mohan Operations Research

15th

Edition, 2010, Sultan

Chand & Sons, New Delhi.


Course Objectives: Student should be able to familiarize with

1. The design of DFA’s, NFA’s and epsilon NFA’s and Converting NFA’s to DFA’s.

2. The properties of Regular Languages and Minimizing FA's.

3. Grammars of Context Free Languages and PDA’s.

4. Context-Free Languages and Turing machines.

5. Undecidable Problems.

Course Outcomes: To get familiar with

1. The student should be able to understand the different types of machine structure for regular

languages.(PO2) (PSO1)

2. The student should be able to understand the laws and properties of Regular expressions and

Regular languages.(PO4) (PSO2)

3. The student should be able to understand the Grammars and PDA’s.(PO1) (PSO1)

4. Ability to have knowledge of CFL and Turing machine.(PO4) (PSO1)

5. Ability to have knowledge of Undecidable problems.(PO3) (PSO2)

UNIT 1 Automata: The Methods and the Madness: Why study Automata Teory?, Introduction to Formal Proof,

Additional Forms of Proof, Inductive Proofs, The Central Concepts of Automata Theory.

Finite Automata: An Informal Picture of Finite Automata, Deterministic Finite Automata, Nondeterministic Finite

Automata, Finite Automata With Epsilon-Transitions.

UNIT 2 Regular Expressions and Languages: Regular Expressions, Finite Automata and Regular

Expressions, Algebraic Laws for Regular expressions.

Properties of Regular Languages: Proving Language not to be Regular, Closure Properties of

Regular Languages, Decision Properties of Regular Languages, Equivalence and Minimization of

Automata.

UNIT 3 Context-Free Grammars and Languages: Context – Free Grammars, Parse Trees, Ambiguity in Grammars and

Languages.

Pushdown Automata: Definition of the Pushdown Automaton, The Languages of a PDA,

Equivalence of PDA’s and CFG’s, Deterministic Pushdown Automata.

UNIT 4 Properties of Context Free Languages: Normal Forms for Context – Free Grammars, The Pumping Lemma for

Context – Free Languages, Closure Properties of Context- Free Languages.

Introduction to Turing Machines: Problem That Computers Cannot Solve, The Turing Machine, Programming

Techniques for Turing Machines, Extensions to the Basic Turing Machines, Restricted Turing Machines, Turing

Machines and Computers.

UNIT 5 Undecidability: A Language That Is Not Recursively Enumerable, An Undecidable Problem That is RE,

Undecidable Problems About Turing Machines, Post’s Correspondence Problem.

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: II LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Theory of Computation Max Marks:100




S.No. Author Title Publisher

1 J E Hopcroft, Rajeev

Motwani , Jeffrey

D.Ullman

Introduction to Automata Theory,

Languages and Computation

Pearson Education,

3rd

Edition



1 H.R.Lewis and

C.H.Papadimitriou

Elements of

The theory of Computation

Second Edition,

Pearson Education / PHI,

2003

2 J.Martin Introduction to Languages and the

Theory of Computation

Third Edition, TMH,

2003.

3 Micheal Sipser Introduction of the Theory and

Computation

Thomson Brokecole, 1997.


Course Objectives:

To understand

1. Basic knowledge on software engineering methods and practices, general understanding of software process

models and agile development. 2. Knowledge of core principles, requirements & modelling concepts. 3. Understand different software testing approaches and various aspects of software quality assurance. 4. Represent various process & project management concepts. 5. Estimate software projects, & performs formal methods modelling.

Learning Outcomes:

Upon successful completion of this course, the student gains complete knowledge on: 1. Basic knowledge on software engineering methods and practices, general understanding of software process

models and agile development.(PO2)(PO7)(PSO2) 2. Core principles, requirements & modelling concepts. (PO2)(PSO2) 3. Different software testing approaches and various aspects of software quality assurance.(PO1)(PO7)(PSO2) 4. Various process & project management concepts.(PO1)(PO7)(PSO2) 5. Estimating software projects & performs formal methods modelling. (PO1)(PO7)(PSO2) UNIT I Software and Software Engineering: The Nature of Software: Defining Software, Software Application Domains,

Legacy Software, The Unique Nature of WebApps, Software Engineering, The Software Process, Software

Engineering Practices: The Essence of Practice, General Principles, Software Myths. Process Models: A Generic Process Model: Defining a Framework Activity, Identifying a Task Set, Process

Patterns, Process Assessment and Improvement, Prescriptive Process Models:The Waterfall Model, Incremental

Process Models, Evolutionary Process Models, Concurrent Models, A Final Word on Evolutionary Processes,

Specialized Process Models: Component-Based Development, The Formal Methods Model, Aspect-Oriented

Software Development, The Unified Process:A Brief History, Phases of the Unified Process, Personal and Team

Process Models: Personal Software Process (PSP), Team Software Process (TSP). Agile Development: What Is Agility, Agility and the Cost of Change, What Is an Agile Process: Agility

Principles, The Politics of Agile Development, Human Factors, Extreme Programming (XP): XP Values, The XP

Process, Industrial XP, The XP Debate, Other Agile Process Models: Adaptive Software Development (ASD),

Scrum, Dynamic Systems Development Method (DSDM), Crystal, Feature Driven Development (FDD), Lean

Software Development (LSD), Agile Modeling (AM), Agile Unified Process (AUP).

UNIT II Principles that Guide Practice: Core Principles: Principles That Guide Process, Principles That Guide Practice,

Principles That Guide Each Framework Activity: Communication Principles, Planning Principles, Modeling

Principles, Construction Principles, Deployment Principles Requirements Modeling: Scenarios, Information, and Analysis Classes: Requirements Analysis: Overall

Objectives and Philosophy, Analysis Rules of Thumb, Domain Analysis, Requirements Modeling Approaches,

Scenario-Based Modeling: Creating a Preliminary Use Case, Refining a Preliminary Use Case, Writing a Formal

Use Case, UML Models That Supplement the Use Case: Developing an Activity Diagram, Swimlane Diagrams. Data Modeling Concepts: Data Objects, Data Attributes, Relationships, Class-Based Modeling: Identifying

Analysis Classes, Specifying Attributes, Defining Operations, Class-Responsibility-Collaborator (CRC) Modeling,

Associations and Dependencies, Analysis Packages.

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: II LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Software Engineering Max Marks:100



UNIT III Software Quality Assurance: Background Issues, Elements of Software Quality Assurance, SQA Tasks, Goals,

and Metrics: SQA Tasks, Goals, Attributes, and Metrics, Formal Approaches to SQA, Statistical Software Quality

Assurance: A Generic Example, Six Sigma for Software Engineering, Software Reliability: Measures of Reliability

and Availability, Software Safety, The ISO 9000 Quality Standards, The SQA Plan. Software Testing Strategies: A Strategic Approach to Software Testing:Verification and Validation, Organizing

for Software Testing, Software Testing Strategy-The Big Picture, Criteria for Completion of Testing, Strategic

Issues, Test Strategies for Conventional Software: Unit Testing, Integration Testing, Test Strategies for Object-

Oriented Software: Unit Testing in the OO Context, Integration Testing in the OO Context, Test Strategies for

WebApps, Validation Testing: Validation-Test Criteria, Configuration Review, Alpha and Beta Testing, System

Testing: Recovery Testing, Security Testing, Stress Testing, Performance Testing, Deployment Testing, The Art of

Debugging:The Debugging Process, Psychological Considerations, Debugging Strategies, Correcting the Error Testing Conventional Applications: Software Testing Fundamentals, Internal and External Views of Testing,

White-Box Testing, Basis Path Testing: Flow Graph Notation, Independent Program Paths, Deriving Test Cases,

Graph Matrices, Control Structure Testing: Condition Testing, Data Flow Testing, Loop Testing, Black-Box

Testing: Graph-Based Testing Methods, Equivalence Partitioning, Boundary Value Analysis, Orthogonal Array

Testing,

UNIT IV Project Management Concepts: The Management Spectrum: The People, The Product, The Process, The Project,

People: The Stakeholders, Team Leaders, The Software Team, Agile Teams, Coordination and Communication

Issues, The Product:Software Scope, Problem Decomposition, The Process: Melding the Product and the Process,

Process Decomposition,The Project, The W5HH Principles. Process and Project Metrics: Metrics in the Process and Project Domains:Process Metrics and Software Process

Improvement, Project Metrics, Software Measurement: Size-Oriented Metrics, Function-Oriented Metrics,

Reconciling LOC and FP Metrics, Object-Oriented Metrics, Use-Case–Oriented Metrics, WebApp Project Metrics,

Metrics for Software Quality: Measuring Quality, Defect Removal Efficiency.

UNIT V Formal Modeling And Verification: The Cleanroom Strategy, Functional Specification: Black-Box Specification,

State-Box Specification, Clear-Box Specification, Cleanroom Design: Design Refinement, Design Verification,

Cleanroom Testing: Statistical Use Testing, Certification, Formal Methods Concepts, Applying Mathematical

Notation for Formal Specification, Formal Specification Languages: Object Constraint Language (OCL), The Z

Specification Language. Estimation for Software Projects: Resources: Human Resources, Reusable Software Resources, Environmental

Resources, Software Project Estimation, Decomposition Techniques: Software Sizing , Problem-Based Estimation,

An Example of LOC-Based Estimation, An Example of FP-Based Estimation, Empirical Estimation Models: The

Structure of Estimation Models, The COCOMO II Model, The Software Equation, Estimation for Object-Oriented

Projects.



1 Roger S

Pressman Software Engineering-A

Practitioner's Approach Seventh Edition, McGraw-Hill, a business unit of

The McGraw-Hill Companies, Inc., 2010

Reference books Author Title Publisher

1 Sommerville Software engineering 7th edition, Pearson education

2 S.A.Kelkar Software Engineering - A

Concise Study PHI.

3 Waman S.Jawadekar Software Engineering TMH.

4 AH Behforooz and

Frederick J.Hudson Software Engineering

Fundamentals Oxford (2008)


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: II


Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Operating Systems Max Marks:100


Course Objectives: 1. To introduce students with basic concepts of operating system, its functions and services.

2. To familiarize the students with various views and management policies adopted by operating system as

pertaining with Processes, Deadlock, memory, File and I/O operations.

3. To brief the students about functionality of various operating systems like Unix, Linux and Windows 7 as

pertaining to resource management.

4. To provide the knowledge of basic concepts towards Process Synchronization and related issues.

5. To provide better understanding on Protection & Security.

Course Outcomes:

1. To understand the basic concepts of operating system, its functions and services. (PO4) (PO3) (PO7) (PSO1)

2. To familiarize the students with various views and management policies adopted by operating system as

pertaining with Processes, Deadlock, memory, File and I/O operations.(PO3) (PSO1)

3. Compare the various algorithms and comment about performance of various algorithms used for Processes,

Deadlock, memory, File and I/O operations. (PO2) (PO4) (PSO2)

4. Knowledge of basic concepts towards Process Synchronization and related issues. (PO1) (PO4) (PSO2)

5. Better understanding on Protection & Security. (PO1) (PSO1)

UNIT I Introduction: What Operating Systems Do, Computer-System Organization, Computer-System Architecture,

Operating-System Structure, Operating-System Operations, Process Management, Memory Management, Storage

Management, Protection and Security, Kernel Data Structures, Computing Environments, Open-Source Operating

Systems. Operating-System Structures: Operating-System Services, User and Operating-System Interface, System Calls,

Types of System Calls, System Programs, Operating-System Design and Implementation, Operating-System

Structure. Processes: Process Concept, Process Scheduling, Operations on Processes, Inter Process Communication,

Communication in Client–Server Systems.

UNIT II Threads: Overview, Multicore Programming, Multithreading Models, Thread Libraries, Implicit Threading,

Threading Issues. Process Synchronization: Background, The Critical-Section Problem, Peterson’s Solution, Synchronization

Hardware, Mutex Locks, Semaphores, Classic Problems of Synchronization, Monitors. CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread Scheduling, Multiple-

Processor Scheduling.

UNIT III Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention,

Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock. Main Memory: Swapping, Contiguous Memory Allocation, Segmentation, Paging, Structure of the Page Table,

Intel 32 and 64-bit Architectures. Virtual Memory: Background, Demand Paging, Copy-on-Write, Page Replacement, Allocation of Frames,

Thrashing.

UNIT IV Mass-Storage Structure: Overview of Mass-Storage Structure, Disk Structure, Disk Attachment, Disk Scheduling,

Swap-Space Management, RAID Structure.


File-System Interface: File Concept, Access Methods, Directory and Disk Structure, File-System Mounting,

Protection. File-System Implementation: File-System Structure, File-System Implementation, Directory Implementation,

Allocation Methods, Free-Space Management, Efficiency and Performance, Recovery.

UNIT V I/O Systems: Hardware, Application I/O Interface, Kernel I/O Subsystem, Transforming I/O Requests to Hardware

Operations, STREAMS, Performance. Protection: Goals of Protection, Principles of Protection, Domain of Protection, Access Matrix, Implementation of

the Access Matrix. Security: The Security Problem, Program Threats, System and Network Threats, Cryptography as a Security Tool,

User Authentication, Firewalling to Protect Systems and Networks.



1 Abraham Silberschatz,

Peter Baer Galvin, Greg

Gagne

Operating System concepts Ninth Edition, Wiley, 9th Edition,

2015



1 William Stallings Operating Systems-Internals and

Design Principles Fifth Edition, Pearson Education (2007)

2 Achyut S Godbole Operating Systems Second Edition, TMH (2007).

3 Flynn/McHoes Operating Systems Cengage Learning (2008).

4 Deitel & Deitel Operating Systems Third Edition, Pearson Education

(2008)


APPENDIX – III

SYLLABI FOR III SEMESTER

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: III


Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Cryptography & Network

Security Max Marks:100


Course

Objectives: 1. To Identify some of the factors driving the need for network security 2. To Identify and classify particular examples of attacks 3. To define the terms vulnerability, threat and attack 4. To Identify physical points of vulnerability in simple networks 5. To Compare and contrast symmetric and asymmetric encryption systems and their vulnerability to attack, and

explain the characteristics of hybrid systems.

Learning Outcomes: On successful completion of this course, the students able to 1. Identify some of the factors driving the need for network security. (PO1)(PSO1) 2. Identify and classify particular examples of attacks. (PO2)(PSO1) 3. Define the terms vulnerability, threat and attack. (PO3)(PSO1) 4. Identify physical points of vulnerability in simple networks. (PO4)(PSO1) 5. Compare and contrast symmetric and asymmetric encryption systems and their vulnerability to attack, and

explain the characteristics of hybrid systems. (PO4) (PSO1)

UNIT I Introduction: Security Trends, The OSI Security Architecture, Security Attacks, Security Services, Security

Mechanisms, A Model for Network Security. Classical Encryption Techniques: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques,

Rotor Machines, Steganography.

Advanced Encryption Standard: Evaluation Criteria for AES, The AES Cipher.

Confidentiality using Symmetric Encryption: Placement of Encryption Function, Traffic Confidentiality, Key

Distribution, Random Number Generator.

UNIT II Public Key Cryptography and RSA: Principles of Public Key Crypto Systems, The RSA Algorithm. Key Management: Other Public-Key Crypto Systems: Key Management, Diffie-Hellman Key Exchange. Message Authentication and Hash Functions: Authentication Requirements, Authentication Functions, Message

Authentication Codes, Hash Functions, Security of Hash Functions and Macs.

UNIT III Digital Signatures And Authentication Protocols: Digital Signatures, Authentication Protocols, Digital Signature

Standard. Authentication Applications: Kerberos, X.509 Authentication Servic. Email Security: Pretty Good Privacy, S/MIME

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Cryptography & Network


Course Code: CA4T3 Course: M.C.A


UNIT IV IP Security: IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security

Payload Web Security: Web Security Considerations, Secure Socket Layer and Transport Layer Security.

UNIT V Intruders: Intruders, Intrusion Detection, Password Management. Firewalls: Firewall Design Principles, Trusted Systems, Common Criteria for Information Technology, Security

Evaluation.


Author Title Publisher 1 William Stallings Cryptography and Network Security

PHI, Fourth Edition

Reference Text Book


1 William Stallings Network Security Essentials-

Applications and Standards Pearson Education (2007),

Third Edition.

2 Chris McNab

Network Security Assessment OReilly (2007), 2nd

Edition

3 Jon Erickson

NOSTARCH

Hacking-The Art of Exploitation Press (2006),SPD

4 Neal Krawety

Introduction to Network Security Thomson (2007).

5 Ankit Fadia

Network Security-A Hackers

Perspective Macmillan (2008)



LTP Hours/per week: 3 1 -

Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Design & Analysis of

Algorithms Max Marks:100


Course Objectives: 1. Analyze the asymptotic performance of algorithms.

2. Demonstrate a familiarity with major algorithms and data structures.

3. Apply important algorithmic design paradigms and methods of analysis.

4. To develop algorithms for sorting, searching, insertion and matching.

5. To acquire knowledge in NP Hard and complete problem.

Course Outcomes: 1. Understanding basic ideas about algorithms and the concept of data structures. (PO4)(PSO1)

2. Computing complexity measures of algorithms, including recursive algorithms using

recurrence relations (PO2) (PSO2)

3. Applying the design techniques to solve complex problems.(PO3)(PO1)(PSO1)

4. Analyzing the problems based on their space and time complexities. (PO2) (PSO2).

5. Ability to categorize the problems as NP-Hard and NP -Complete problems.(PO1) (PO7)

(PSO1)

UNIT I Introduction: What IS Algorithm, Algorithm Specification Pseudocode Conventions, Recursive Algorithms,

Performance Analysis: Space Complexity Time Complexity, Asymptotic Notation, Performance Measurement,

Randomized Algorithms: Basics of Probability Theory, Randomized Algorithms Identifying the Repeated Element,

Primality Testing: Advantages and Disadvantages.

Elementary Data Structures: Stacks and Queues, Trees: Terminology, Binary Trees, Dictionaries: Binary Search

Trees, Priority Queues, Heaps , Heapsort , Sets and Disjoint Set Union: Introduction-Union and Find Operations,

Graphs: Introduction, Definitions, Graph Representations.

UNIT II

Divide -and -Conquer: General Method, Defective Chess Board, Binary Search, Finding Maximum and Minimum,

Merge Sort, Quick Sort, Selection Problem, Strassen's Matrix Multiplication, Convex Hull: Some Geometric

Primitives, The Quick Hull Algorithm, Graham's Scan, An O(nlogn) Divide and Conquer Algorithm.

The Greedy Method: The General Method, Container Loading, Knapsack Problem, Tree Vertex Splitting, Job

Sequencing with Deadlines, Minimum Cost Spanning Trees: Prim's Algorithm, Kruskal's Algorithm, Optimal

Storage on Tapes, Optimal Merge Patterns, Single Source Shortest Paths.

UNIT III

Dynamic Programming: The General Method, Multi Stage Graphs, All Pairs Shortest Paths, Single Source

Shortest Paths, Optimal Binary Search Trees, String Editing -0/1 Knapsack, Reliability Design, The Traveling Sales

Person Problem, Flow Shop Scheduling.

Basic Traversal and Search Techniques: Techniques for Binary Trees, Techniques for Graphs: Breadth First

Search and Traversal-Depth First Search, Connected Components and Spanning Trees, Bi-Connected Components

and DFS.

UNIT IV

Backtracking: The General Method, The 8-Queens Problem, Sum of Subsets, Graph Coloring, Hamiltonian

Cycles, Knapsack Problem.

Branch and Bound : The Method: Least Cost Search, The 15 Puzzle Control Abstractions for LC Search,

Bounding, FIFO Branch and Bound , LC Branch and Bound, 0/1 Knapsack Problem, LC Branch and Bound

Solution, FIFO Branch and Bound Solution, Traveling Sales person.

UNIT V


NP-Hard and NP -complete problems: Basic Concepts: Non Deterministic Algorithms, The Classes NP Hard and

NP Complex, Cook's Theorem, NP Hard Graph Problems, Clique Decision Problem, Node Cover Decision Problem

Chromatic Number Decision Problem, Directed Hamiltonian Cycle, Traveling Sales Person Decision Problem,

AND/OR Graph Decision Problem, NP-Hard Scheduling Problems, Scheduling Identical Processors, Flow Shop

Scheduling, Job Scheduling, NP-Hard Code Generation Problems, Code Generation With Common Sub

Expressions, Implementing Parallel Assignment Instructions, Some Simplified NP-Hard Problems.


S.No

.


1 Sartaj Sahni Fundamentals of Computer

Algorithms

Second Edition, Universities

Press (2008)


S.No

.


1 Anany Levitin Introduction to the Design & Analysis

of Algorithms

Second Edition, Pearson

Education (2007) 2 I.Chandra Mohan Design and Analysis of Algorithms PHI

3 Prabhakar Gupta,

Vineet Agrawal

Design and Analysis of Algorithms PHI

4 Parag Himanshu, Dave Design and Analysis of Algorithms Pearson Education (2008)




Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Data Warehousing &

Data Mining. Max Marks:100


Course Objectives: 1. To introduce the basic concepts of Data Warehouse. 2. To know the process of constructing Data Warehouse. 3. To introduce the basic concepts of Data Mining techniques. 4. Examine the types of the data to be mined and apply preprocessing methods on raw data. 5. Discover interesting patterns, analyze supervised and unsupervised models and estimate the accuracy of the algorithms.

Course Outcomes:

1. The student will be able to understand the basics of data warehouse and the people involved in its design. (PO1) (PO3)

(PSO1)

2. Aware of constructing the data warehouse, its techniques and concepts.(PO4) (PO1) (PSO1)

3. Should be able to understand Data Mining concepts, functionalities and patterns.(PO4) (PSO1)

4. Should be able to classify the data by implementing various algorithms.(PO2) (PSO1)

5. Should be able to find the similarities among the data using algorithms.(PO1) (PSO1)

UNIT I Warehouse What is it, Who Need It, and Why? : Problems with Current Reporting Architecture, Goal of

Business Intelligence, What is Data Warehouse, Business Intelligence defers from Transaction Processing, Return

on Investment. Things to Consider: Be Pragmatic, Start with Business Requirements, What goes into Warehouse, Data Mart or

Data Warehouse, Big Bang vs. Small Iteration, Long Live RI. Managing the Data Warehouse Project: Driving force behind the Data Warehouse, Getting ready for your

Project, Picking a Target and moving forward, Project Management, Scope Statement, Work Break Down Structure,

Project Estimating, Scope Creep, Track your Project Progress. Data Warehouse Design Methodology: Information Utility, Utility’s Infrastructure, Preferred Architecture.

UNIT II

Start Schema Design: Data Mart user Accessible data, Star Schema, Design Process, Summary Tables, Common

Design Complexities. Fundamentals of ETL Architecture: ETL Infrastructure, Fundamentals of ETL and Data Warehousing, ETL

Silver Bullet where to Start. Partitioning Data: Why Partition Data, Difference between Partition and Non-partitioned Objects, Partition

decisions, Types of Partitions.

UNIT III

Data Mining Introduction: Data Mining on What Kind of Data, Data Mining Functionalities, Classification of

Data Mining Systems, Major Issues in Data Mining.

Mining Association Rules in Large Databases: Rule Mining, Mining Single Dimensional Boolean Association

Rules From Transactional Databases, Mining Multi Dimensional Association Rules From Relational Databases and

Data Warehouses.

UNIT IV

Classification and Prediction: Introduction Classification by Decision Tree Induction, Bayesian Classification,

Other Classification Methods, Classification by Back Propagation, Prediction, Classifier Accuracy.


UNIT V

Cluster Analysis Introduction: Types of Data in Cluster Analysis, A Categorization of Major Clustering Methods,

Portioning Methods, Hierarchical Methods. Density Based Methods: DBSCAN, Grid Based Method: STING, Model Based Clustering Method: Statistical

Approach, Outlier Analysis.

Text Books

Author Title Publisher 1 Michael Corey, Michael

Abbey, Ian Abramson,

Ben Taub

Oracle 8i Data Warehousing

TMH

2 Jiawei Han, Micheline

Kamber Data mining & Techniques

Morgan Kaufmann 3rd

Edition

Reference Books

Author Title Publisher 1 Ralph Kimball The Data Warehousing Toolkit Wiley

2 S.N.Sivanandam,

S.Sumathi Data Mining-Concepts, Tasks

and Techniques

Thomson




Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Web Technologies Max Marks:100


Course Objectives:

To make the students

1. Familiar with Client/Server Architecture and able to develop a Web Application using Java

Technologies.

2. To gain the skills and Project-Based Experience needed for entry into Web Application and Development

careers.

Course Outcomes:

1. Students are able to describe the concepts of WWW including browser and HTTP protocol and various HTML

tags and use them to develop the user friendly web pages. (PO2)(PSO1)

2. Students will be able to use the JavaScript and VBScript to develop the dynamic web pages. (PO4) (PO5)

3. Students will be able to define the CSS with its types and develop the modern web pages using the HTML and

XML elements with different layouts as per need of applications. (PO4) (PSO1)

4. Students use server side scripting with PHP to generate the web pages dynamically using the database

connectivity. (PO2) (PO5) (PSO2)

5. Develop the modern Web applications using the client and server side technologies and the web design

fundamentals. (PO6) (PO1)

UNIT I

Introduction: What is Internet, History of Internet, Internet Services and Accessibility, Uses of the Internet,

Protocols, Web Concepts: The Client/Server Model, Retrieving Data from the Web, How the Web Works?, Web

Browsers, Searching information on the Web, Internet Standards.

HTML: Outline of an HTML Document, Head Section Body Section: Headers, Paragraphs, Text Formatting,

Linking, Internal Linking, Embedded Images, Lists, Tables, Frames, Other Special Tags and Characters, HTML

Forms.

UNIT II

Java Script: Introduction to Scripting, Control Statements I, Control Statements II, Functions, Arrays, Objects,

Document Object Model, Events.

VB Script: Introduction, Embedded VBScript code in an HTML Document, Comments, Variables, Array

Variables, Operator, Assignment Operators, Numerical Operators, String Concatenation, Procedures, Sub

Procedure, Function Procedure, Conditional Statements, Looping Statements, Object and VB script, Cookies,

Cookie Variables, Creating a Cookie, A Cookie with Multiple Values, Reading Cookie Value.

UNIT III

Dynamic HTML (DHTML): Introduction, Cascading Style Sheets (CSS), Coding CSS, Properties of Tags,

Property Values, Other Style Properties, In Line Style Sheets, Embedded Style Sheets, External Style Sheets,

Grouping, Inheritance, Class as Selector, ID as Selector, Contextual Selector, Pseudo Classes and Pseudo Elements,

Positioning, Backgrounds, Element Dimensions, DHTML Document Object Model and Collections, Using the

Collections All, Moving Object around the Document, Event Handling, Assigning Event Handlers, Event Bubbling,

Filters and Transition Filters, Transitions, Data Binding, Using Tabular Data Control, Sorting Data, Dynamic

Sorting, Filtering.

XML: Introduction, HTML vs. XML, Syntax of XML Document, XML Attributes, Use of elements vs. Use of

Attributes, XML Validation, Well Formed XML Documents, Valid XML Documents, XML DTD: internal DTD,

external DTD, the buildings blocks of XML documents, DTD Elements: Declaring an Element, Empty Elements,

Elements with Data, Elements with Children, Wrapping, Declaring only one Occurrence of the Same Elements,

Declaring Minimum one Occurrence of the Same Element, Defining Zero or One Occurrence of the Same Element,

Declaring Mixed Content, DTD Attributes: Declaring Attributes, Default Attribute Value, Implied attribute,

required attribute, fixed attribute value, enumerated attribute values, DTD Entries, DTD Validation, XSL, XSL

Transformation, XML NameSpaces, XML Schema.


UNIT IV

Servlets: Introduction, Advantages of Servlets over CGI, Installing Servlets, The Servlet Life Cycle, Servlets API,

A Simple Servlet, Handling HTTP Get requests, Handling HTTP Post Requests, Cookies, Session Tracking, Multi

Tier Applications using Database Connectivity, Servlets Chaining.

PHP: Introduction, PHP basics, String Processing and Regular Expressions, Form Processing and Business Logic,

Connecting to a Database, Using Cookies, Dynamic Content, Operator Precedence Chart.

UNIT V

Java Server Pages (JSP): Introduction, Advantages of JSP, Developing first JSP, Components of JSP, Reading

Request Information, Retrieving the Data Posted from a HTML File to a JSP File, JSP Sessions, Cookies, Disabling

Sessions.

Active Server Pages (ASP): Introduction, Advantages of ASP, First ASP Script, Processing ASP Scripts with

Forms, Variables and Constructs, Subroutines, Include/Virtual, ASP Cookies, ASP Objects, Connecting to Data

with ASP.



1 N.P.Gopalan,

J.Akilandeswari

Web Technologies-A Developer’s

Perspective

PHI(2008)

2 Harvey M. Deitel and

Paul 1. Deitel

Internet and World Wide Web

How To Program, 5e

Prentice Hall; 4th

edition



1 Robert W. Sebesta Programming the world wide

web.

Third Edition, Pearson

Education (2007)

2 Anders Moller and

Michaelschwarzbach

An Introduction to XML and

web technologies.

Addison Wesley (2006)

3 Chris Battes Web programming-Building

Internet Application.

Second Edition, Wiley (2007).

4 Jeffrey C. fackson Web Technologies- Computer

Science Perspective.

Pearson Education (2008).




Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Principles of Distributed Database

Systems Max Marks:100

Course Code: CS3T5A Course: M.Sc.(Computer Science)

Course Objectives:

To make the students familiar with

1. Distributed database design, Database Interaction and Cleaning.

2. Data Access and Query Processing.

3. Applying Query Optimization and Multi Database Query Processing.

4. Distributed Concurrency Control and Distributed DBMS Reliability.

5. Parallel Database Systems, Parallel Query Processing and Distributed Object and Storage.

Course Outcomes: Upon successful completion of this course, the student gains complete knowledge on:

1. The Distributed Database Design, Database Interaction and Cleaning.(PO7)(PSO1)

2. Data Access and Query Processing.(PO1)(PO2)(PO7)(PSO1)

3. Applying Query Optimization and Multi Database Query Processing. (PO2)(PO4)(PO7)(PSO1)

4. Distributed Concurrency Control and Distributed DBMS Reliability. (PO2)(PO7)(PSO1)

5. Parallel Database Systems, Parallel Query Processing and Distributed Object and Storage.

(PO2)(PO7)(PSO2)

UNIT I

Distributed Database Design:

Top-Down Design Process, Distribution Design Issues: Reasons for Fragmentation, Fragmentation Alternatives,

Degree of Fragmentation, Correctness Rules of Fragmentation, Allocation Alternatives, Information Requirements,

Fragmentation: Horizontal Fragmentation, Vertical Fragmentation, Hybrid Fragmentation, Allocation: Allocation

Problem, Information Requirements, Allocation Model, Solution Methods, Data Directory.

Database Integration: Bottom-Up Design Methodology, Schema Matching: Schema Heterogeneity, Constraint-based Matching

Approaches, Learning-based Matching, Combined Matching Approaches, Schema Integration, Schema Mapping:,

Mapping Creation, Mapping Maintenance, Data Cleaning.

UNIT II

Data and Access Control:

View Management: Views in Centralized DBMS, Views in Distributed DBMS, Maintenance of Materialized

Views, Data Security: Discretionary Access Control, Multilevel Access Control, Distributed Access Control,

Semantic Integrity Control: Centralized Semantic Integrity Control, Distributed Semantic Integrity Control.

Overview of Query Processing:

Query Processing Problem, Objectives of Query Processing, Complexity of Relational Algebra Operations,

Characterization of Query Processors: Languages, Types of Optimization, Optimization Timing, Statistics,

Decision Sites, Exploitation of the Network Topology, Layers of Query Processing: Query Decomposition, Data

Localization, Global Query Optimization, Distributed Query Execution.

UNIT III

Query Optimization: Search Space, Search Strategy, Distributed Cost Model. Centralized Query Optimization:

Dynamic Query Optimization, Static Query Optimization, Hybrid Query Optimization,Join Ordering in

Distributed Queries: Join Ordering, Semijoin Based Algorithms, Join versus Semijoin, Distributed Query

Optimization: Dynamic Approach, Static Approach, Hybrid Approach.

Multidatabase Query Processing: Issues in Multi Database Query Processing, Multidatabase Query Processing

Architecture, Query Rewriting Using Views: Datalog Terminology, Rewriting in GAV, Rewriting in LAV, Query

Optimization and Execution: Heterogeneous Cost Modeling, Heterogeneous Query Optimization, Adaptive Query

Processing, Query Translation and Execution.


UNIT IV

Distributed Concurrency Control: Serializability Theory, Taxonomy of Concurrency Control Mechanisms, Locking-Based Concurrency Control Algorithms:Centralized 2PL, Distributed 2PL, Timestamp-Based

Concurrency Control Algorithms: Basic TO Algorithm, Conservative TO Algorithm, Multiversion TO Algorithm,

Optimistic Concurrency Control Algorithms, Deadlock Management: Deadlock Prevention, Deadlock Avoidance,

Deadlock Detection and Resolution, “Relaxed” Concurrency Control: Non-Serializable Histories, Nested

Distributed Transactions.

Distributed DBMS Reliability: Reliability Concepts and Measures: System, State, and Failure, Reliability and

Availability, Mean Time between Failures/Mean Time to Repair, Failures in Distributed DBMS: Transaction

Failures, Site (System) Failures, Media Failures, Communication Failures, Local Reliability Protocols:

Architectural Considerations, Recovery Information, Execution of LRM Commands, Check pointing, Handling

Media Failures, Distributed Reliability Protocols: Components of Distributed Reliability Protocols, Two-Phase

Commit Protocol, Variations of 2PC, Dealing with Site Failures: Termination and Recovery Protocols for 2PC,

Three-Phase Commit Protocol, Network Partitioning: Centralized Protocols, Voting-based Protocols, Architectural

Considerations.

UNIT V

Parallel Database Systems: Parallel Database System Architectures: Objectives, Functional Architecture,

Parallel DBMS Architectures, Parallel Data Placement, Parallel Query Processing: Query Parallelism, Parallel

Algorithms for Data Processing, Parallel Query Optimization, Load Balancing: Parallel Execution Problems, Intra-

Operator Load Balancing, Inter-Operator Load Balancing, Intra-Query Load Balancing, Database Clusters:

Database Cluster Architecture, Replication, Load Balancing, Query Processing, Fault Tolerance.

Distributed Object Database Management: Fundamental Object Concepts and Object Models: Object, Types

and Classes, Composition (Aggregation), Sub classing and Inheritance.



1 Chhanda Ray Distributed Database Systems Pearson, 2009

ISBN: 978-81-317-2718-8

2 Saeed K.Rahimi and

Frank S.Haug Distributed Database

Management Systems: A

Practical Approach

IEEE Computer Society, 2010

ISBN: 978-0-470-40745-5



1 M. Tamer Ozsu, Patrick

Valduriez

Principles of Distributed

Database Systems

Springer, Third Edition, 201.

ISBN 978-1-4419-8833-1

https://books.google.co.in/books?id=VryuBgAAQBAJ&printsec=frontcover&dq=PRINCIPLES+OF+DISTRIBUTED+DATABASE+SYSTEMS&hl=en&sa=X&ved=0ahUKEwiWyqKR7MzUAhUaSY8KHZz7BdIQ6AEIQjAF






Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: TCP/IP Max Marks:100

Course Code: CS3T5B Course: M.Sc.(Computer Science)

UNIT I

Introduction: Introduction to Internetworking, Overview of OSI Model TCP/IP Protocol Suite, Basics of Switching

Technologies and Switches, Comparisons of Different Models, Gateways.

UNIT II

Internet Protocol: Purpose of Internet Protocol, Internet Datagram, Options, Checksum, ARP and RARP, Routing

Methods: Routing Table and Routing Module, ICMP, IGMP. IP Addresses: Introduction, Address Classification, A Sample Internet with Classful Addressing, Subnetting,

Supernetting, Classless Addressing, Security at the IP Layer, IPSec, IPv4 and IPv6 Packet Formats. UNIT III

Routing Protocols: Unicast Routing Protocols Interior and Exterior Routing, RIP, OSPF, BGP,

Multicasting:Introduction, Multicast Routing, Multicast Routing Protocols, Multicast Trees, DVMRP, MOSPF,

CBT,PIM, MBONE.

UNIT IV

Transport Control Protocol: TCP Operation, Segment, Sliding Window, Silly Window, Options, TCP State

Machine, Karn’s Algorithm, Congestion Control- Leaky Bucket and Token Bucket algorithms.

UDP: User Datagram, UDP operations, Checksum calculation.

UNIT V

TCP/IP over ATM Networks: ISDN and B-ISDN, ATM Reference Model, ATM Switch, Interconnection

Network, Virtual Circuit in ATM, Paths, Circuits and Identifiers, ATM Cell bTransport and Adaptation Layers,

Packet Type and Multiplexing, IP Address Binding in an ATM Network, Logical Subnet Concept and Connection

Management.



1 Comer Internetworking with TCP/IP PHI, Volume 1

2 Behrouz A. Forouzan TCP/IP Protocol Suite TMH



1 James F. Kurose, Keith

W. Ross

Computer Networking PearsonEducation

2 Wright and Stevens TCP/IP Illustrated Pearson Education, Volume 2

3 Kenneth C. Mansfield, Jr.

James, L.Antonakes

Introduction to Computer

Networks

PHI


Course Objectives: To make the students familiar with

1. Introduction of Software Testing, Taxonomy of Bugs, Flow Graphs and Path Testing Strategies.

2. Transaction Flow Testing and Data Flow Testing.

3. Domain Testing, Paths, Path Products and Regular Expressions.

4. Syntax Testing and Logic Based Testing.

5. State, State Graphs & Transition Testing and Graph Matrices &Application.

Course Outcomes:

Upon successful completion of this course, the student gains complete knowledge on:

1. Software Testing, Taxonomy of Bugs, Flow Graphs and Path Testing Strategies. (PO2) (PO3)(

PO5)(PO6)(PSO1)(PSO2) 2. Transaction Flow Testing and Data Flow Testing (PO2)(PO3)(PO5)(PO6)(PSO1)(PSO2)

3. Domain Testing, Paths, Path Products and Regular Expressions. (PO2)(PO3)(PO5)(

PO6)(PSO1)(PSO2) 4. Syntax Testing and Logic Based Testing. (PO2)(PO3)(PO5)(PO6)(PSO1)(PSO2)

5. State, State Graphs & Transition Testing and Graph Matrices &Application. (PO2)(PO3)

(PO5)(PO6)(PSO1)(PSO2)

UNIT I

Introduction: Purpose of Testing, Dichotomies, Model for Testing.

Taxonomy of Bugs: Consequences of Bugs, Taxonomy of Bugs. Flow Graphs and Path Testing: Basics Concepts of Path Testing, Predicates, Path Predicates and Achievable

Paths, Path Sensitizing, Path Instrumentation, Implementation and Application of Path Testing.

UNIT II

Transaction Flow Testing: Transaction Flows, Transaction Flow Testing Techniques. Dataflow Testing: Basics of Dataflow Testing, Strategies in Dataflow Testing, Application of Dataflow Testing.

UNIT III

Domain Testing: Domains and Paths, Nice & ugly Domains, Domain Testing, Domains and Interface

Testing, Domains and Testability. Paths, Path Products and Regular Expressions: Path Products & Path Expression, Reduction Procedure,

Applications, Regular Expressions & Flow Anomaly Detection.

UNIT IV

Syntax Testing: Why What and How, A Grammar for Formats, Test Case Generation, Implementation

and Application, Testability Tips. Logic Based Testing: Overview, Decision Tables, Path Expressions, KV Charts, Specifications.

UNIT V

State, State Graphs and Transition Testing: State Graphs, Good & Bad State Graphs, State Testing,

Testability Tips.

Graph Matrices and Application: Motivational Overview, Matrix of Graph, Relations, Power of a

Matrix, Node Reduction Algorithm, Building Tools.

Note: Student should be given an exposure to a tool like JMeter or Winrunner.


Semester: III LTP Hours/per week: 4 - -

Department: Computer Science (PG) No. of Credits: 4

Title of the Paper: Software Testing Max Marks:100

Course Code: CS3T5C Course: M.Sc.(Computer Science)




1 Baris Beizer Software Testing Techniques Dreamtech, Second Edition.

2 Dr.K.V.K.K.Prasad Software Testing Tools Dreamtech



1 The Craft of Software Testing Brian Marick Pearson Education

2 Software Testing P.C.Jorgensen 3rd edition, Aurbach

Publications(Dist. by SPD). 3 Software Testing in the Real World Edward Kit Pearson 4 Effective Methods of Software

Testing

Perry, John Wiley 2nd Edition, 1999

5 Art of Software Testing Meyers, John Wiley

6 Software Testing N.Chauhan Oxford University Press.

7 Software Testing M.G.Limaye TMH

8 Software Testing S.Desikan, G.Ramesh Pearson

9 Foundations of Software Testing D.Graham & Others Cengage Learning.


Course Objectives: 1. To acquire knowledge about wireless networks, Internet applications. 2. To elicit the architecture of mobile computing and wireless access technologies. 3. To learn about IPV4 and IPV6. 4. To go through the working of mobile IP. 5. To gain understanding about operating system and software to develop applications in Mobile.

Course Outcomes: At the end of the course, the student will be able to: 1. Understand the basic concepts of worldwide networks, wireless transmission and generations of Mobile

systems.(PO1)(PSO1) 2. Perceive the architecture and common technologies for mobile communication. (PO4)(PSO2) 3. Grasp the IP network protocols and methods used in IP routing of packets. (PO3)(PSO1) 4. Apprehend the working of Mobile IP. (PO4)(PSO1) 5. Gains knowledge regarding the NGNs, operating systems, application development using WML, XML in

Mobiles. (PO4)(PSO1)

UNIT-I

Introduction: World Wide Networks:Computer Networking, Significance of TCP/IP Protocol Stack in

World Wide Networking, Internet Applications

Wireless Networks: Limitations, Mobile Computing Paradigm, Promises/Novel Application Generation of Mobile Systems: Features of First Generation, Second Generation, Third Generation,

Fourth Generation and Comparison.

UNIT-II

Mobile System Architectures: GSM:System Architecture, Functional Subsystems of GSM: Radio

Interfaces, Protocols, Handover, New Data Services

GPRS: System Architecture, Protocol Layers, Comparison of GSM & GPRS Mobility Management: Location Management, Handover, Mobility Management in GSM & GPRS. Wireless Access Technologies: WPAN, Bluetooth, WLAN, Wi-Fi, WMAN, Wi-MAX.

UNIT III

IPV4: Features of IPV4, Classes in IPV4 Addressing Mobile IP: Entities and Terminology, IP Packet Delivery, Agent Discovery, Registration, Tunneling and

Encapsulation, IPV6, IPV4 versus IPV6.

UNIT IV

Mobile Transport Layer: Traditional TCP: Congestion Control, Slow Start, Fast Retransmit/Fast

Recovery, Implications of Mobility. Wireless TCP: Indirect TCP, Snooping TCP, Mobile TCP, Fast Retransmit/Fast Recovery,

Transmission/Time out Freezing, Selective Retransmission, Transaction Oriented TCP, TCP over 2.5/3G

Wireless Networks.

UNIT V




Title of the Paper: Mobile Computing Max Marks:100

Course Code: CS3T5D Course: M.Sc.(Computer Science)


Next Generation Networks: Architecture of NGN, Core Network, Access Network, Capabilities of

NGN, Characteristics of NGN, Generalised Mobility on NGN, Transport Independent Service Paradigm. File Systems: Coda, Little Work, Ficus, Mio-NFS, Rover Mobile Operating Systems: Symbian, Android

Wireless Markup Language (WML) and WML Script, Extensible Mark up Language and its Applications.



1 Jochen Schiller Mobile Communications Pearson Education, Second

Edition 2002

2 Mobile Computing Rajkamal Oxford (2008)

Reference Text Book


1 Ashok K Talukder and

Roopa R Yavagal

Mobile Computing TMH (2008)


Course Objectives: The objective of the course is to: 1. Vision and Introduction to IoT.

2. Understand IoT Market perspective.

3. Data and Knowledge Management and use of Devices in IoT Technology. 4. Understand State of the Art – IoT Architecture.

5. Real World IoT Design Constraints, Industrial Automation and Commercial Building Automation in IoT.

Course Outcomes: 1. Understand the visual sense of IOT from worldwide context. (PO1) (PO2) (PSO1)

2. Determine the market orientation of IOT. (PO2) (PO4) (PSO1)

3. Use of devices, gateways, and data management in IOT. (PO3) (PO4) (PSO1)

4. Building state of art architecture in IOT. (PO3) (PO4) (PSO1)

5. Application of IOT in industrial and commercial Building automation and real world design constraint.(PO2) (PO7)

(PSO1)

UNIT 1 Introduction: M2M to IoT: The Vision-Introduction, From M2M to IoT, M2M towards IoT-the global context, A use case

example, Differing Characteristics.

UNIT II M2M to IoT - A Market Perspective: Introduction, Some Definitions, M2M Value Chains, IoT Value Chains, An

emerging industrial structure for IoT, The international driven global value chain and global information

monopolies. M2M to IoT - An Architectural Overview: Building an architecture, Main design principles and needed

capabilities, An IoT architecture outline, standards considerations.

UNIT III M2M and IoT Technology Fundamentals: Devices and gateways, Local and wide area networking, Data

management, Business processes in IoT, Everything as a Service(XaaS), M2M and IoT Analytics, Knowledge

Management

UNIT IV IoT Architecture-State of the Art: Introduction, State of the art. Architecture Reference Model: Introduction, Reference Model and architecture, IoT reference Model

UNIT V IoT Reference Architecture: Introduction, Functional View, Information View, Deployment and Operational

View, Other Relevant architectural views. Real-World Design Constraints: Introduction, Technical Design constraints-hardware is popular again, Data

representation and visualization, Interaction and remote control. Industrial Automation: Service-oriented architecture-based device integration, SOCRADES: realizing the

enterprise integrated Web of Things, IMC-AESOP: from the Web of Things to the Cloud of Things. Commercial Building Automation: Introduction, Case study: phase one-commercial building automation today,

Case study: phase two- commercial building automation in the future.




Title of the Paper: Internet of Things Max Marks:100

Course Code: CS3T5E Course: M.Sc.(Computer Science)




1 Jan Holler, Vlasios

Tsiatsis, Catherine

Mulligan, Stefan

Avesand, Stamatis

Karnouskos, David

Boyle

From Machine-to-Machine to the

Internet of Things: Introduction to

a New Age of Intelligence

1st Edition, Academic Press, 2014.



1 Vijay Madisetti and

Arshdeep Bahga,

Operating Systems-Internals and

Design PrinciplesInternet of Things

(A Hands-on-Approach).

1st Edition, VPT, 2014.

2 Francis daCosta, Rethinking the Internet of Things: A

Scalable Approach to Connecting

Everything.

1st Edition, Apress Publications,

2013


Course Objectives:

1. To Build functional web applications HTML.

2. To Incorporates multimedia capabilities and web page designs using Cascading Style Sheets.

3. To Code Client-Server interaction Programs using Java based server Technology named Servlets.

4. To Create dynamic web pages wherein client interaction is facilitated using advanced server technology like

JSP.

5. To integrate offline data storage, background processes and APIs using database connectivity and ASP.

Course Outcomes: 6. Build functional web applications HTML. (PO1) (PSO1)

7. Incorporates multimedia capabilities and web page designs using Cascading Style Sheets. (PO2) (PSO1)

8. Code Client Server interaction Programs using Java based server Technology named Servlets. (PO2) (PSO1)

9. Create dynamic web pages wherein client interaction is facilitated using advanced server technology like

JSP.(PO3) (PSO1)

10. Integrate offline data storage, background processes and APIs using database connectivity and ASP.

(PO4)(PSO1)

HTML:

1. Write HTML code to provide intra document linking.

2. Write HTML code to provide inter document linking.

3. Write a program to implement the three types of lists.

4. Create a HTML page using frames.

5. Write a program to embed college picture into your web page and write a short note on your college using

paragraph tag.

6. With a suitable example, depict how we can align text using a table tag as follows.

7. Write a program to create the time table as follows:




Title of the Paper: Web Technologies Lab Max Marks:100

Course Code: CS3L2 Course: M.Sc.(Computer Science)

II MCA Pass percenetage=95%

Fail percentage=5%

III MCA Pass percenetage=97%

Fail percentage=3%


8. Create a Registration form that interacts with the user. Collect login name, password, date of birth,sex,

address, qualification and display a “Thank you for registering” message when the user submits the form.

Login name:

Enter Password:

Reenter Password:

Birthdate:

Sex: Female Male

Enter Address

Enter qualification

Login clear

Item details Price of item Click here to select

8399

5000

450


Java Script:

9. Write a script to compare two strings using String object.

10. Write a script to generate random numbers within 1 to 10 and display the numbers in a table.

11. Write a Java Script to update the information into the array, in the “onClick” event of the button “Update”.

12. Create a web page for a shopping mall that allows the user to tick off his purchases and obtain the bill with the

total being added up simultaneously.

13. Write a script to find the duplicate elements of an array.

14. Write a script which generates a different greeting each time the script is executed.

15. Write a javascript to check the number is Armstrong number or not by getting the number from textbox and

the result is displayed in a alert dialog box.

16. Using functions write a java script code that accepts user name and password from user,Check their

correctness and display appropriate alert messages.

VB Script:

17. Write a script that takes input from user and displays the same in upper case and lowercase.

18. Write a program to implement cookies in VB Script.

DHTML:

19. Create an inline style sheet.Illustrate the use of an embedded style sheet.

20. Create an external style sheet to illustrate the “Font” elements.

21. Write a program to switch on and off light using onClick event.

22. Illustrate different types of filters (atleast six) on a sample text.

23. Write a program to illustrate tabular data control for data binding.

XML:

24. Create a small XML file designed to contain information about student performance on a module. Each student

has a name , a roll number, a subject mark and an exam mark.

25. Create a internal DTD file.

26. Create an external DTD file.

27. Create a XSLT stylesheet to display the student data as an HTML table.

PHP:

28. Calculate the factorial of a given number using PHP declarations and expressions.

29. Write a PHP program that interacts with the user .Collect first name lastname and date of birth and displays

that information back to the user .

JSP:

30. Write a program to implement JSP directives.

31. Write a JSP program for session tracking.

ASP: 32. Write a Asp program to change the background of a page based on the user’s choice.

33. Write a Asp Program to retrieve data from students table.

34. Write a Asp program to insert data into student table.

399

YOUR TOTAL BILL IS 5450



LTP Hours/per week: - - 6

Department: Computer Science (PG) No. of Credits: 6 Title of the Paper: Data Mining Lab Max Marks:100


Course Objectives:

The objective of the course is to:

Understand the various kinds of tools.

Apply mining techniques for realistic data.

Understand the basic concepts in R.

Understand how to import and export CSV files and package installation in R.

Develop and visualization of data mining algorithms in R.

Course Outcomes:

After completion of the course the student should be able

1. To understand the various kinds of tools.(PO3)(PSO1)

2. Ability to apply mining techniques for realistic data.(PO2)(PSO1)(PSO2)

3. To understand the basic concepts in R. (PO1)(PSO2)

4. Understand how to import and export CSV files and package installation in R.(PO6)(PO7)(PSO2)

5. To develop and visualization of data mining algorithms in R.(PO6)(PO7)(PSO1)(PSO2)

Lab List Programs:

Using Weka Tool:

1. How to create and load data set in weka

2. List all the categorical (or nominal) attributes and the real-valued attributes separately.

3. Load each dataset into Weka and run Aprior algorithm with different support and confidence values.

Study the rules generated..

4. Implement Multilayer Perceptron | Neural Network .

5. Implement time series analysis Using R Programming:

6. Import data into R from text and excel files using read.table () and read.csv () functions.

7. Generating association rules using aprior algorithm in R 8. Implement k-Means clustering algorithm using R.

9. Implement k-Medoids clustering using R

10. Implement hierarchical clustering using R

11. Implement Density based clustering using R

12. Implement Decision tree in R using package party and rpart

13. Implement k-Nearest Neighbour using R

14. Detecting and removing outlier using R

15. Implement Linear Regression using R

16. Implement Naive Bayes classification using R

17. Finding Outlier Detection by Clustering using R

18. Implement time series analysis using R

19. Implement Outlier Detection with LOF using R

20. Implement Outlier Detection by Clustering

21. Implement Outlier Detection from Time Series

22. Implement Time Series Classification using R

23. Implement word count using R

24. Implement Time Series Decomposition using R

25. Implement Time Series Forecasting using R

26. Implement Hierarchical Clustering with Euclidean Distance

27. Implement Hierarchical Clustering with Dynamic Time Wrapping Distance


SYLLABI FOR IV SEMESTER

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV


Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Cloud Computing Max Marks:100


Course Objectives:

1. To understand the benefits of cloud computing and virtualization.

2. To understand the services and deployment models of cloud computing.

3. To develop cloud applications using open source cloud software.

4. To understand the AAA Model.

5. To understand the challenges and benefits of mobile cloud computing.

Course Outcomes: 1. Articulate the main concepts, key technologies, strengths, and limitations of cloud computing and the core

issues of virtualization. (PO3) (PSO1)

2. Understand the open source architectures and services of cloud computing. (PO4)(PO7) (PSO2)

3. Develop and deploy cloud applications using popular cloud platforms. (PO1) (PO2)(PSO1)

4. Explore the risks, consequences and costs of cloud computing and understand the implementations of AAA

model in the cloud. (PO4) (PSO1)

5. Introduce the broad perspective of Mobile Cloud Computing. (PSO2) (PO3) (PSO2)

UNIT I

Era of Cloud Computing: Getting to Know the Cloud, Peer-to-Peer, Client-Server and Grid Computing, Cloud

Computing versus Client-Server Architecture, Cloud computing versus Peer-To-Peer Architecture , Cloud

computing versus Grid Computing, How we got to the Cloud, Server Virtualization versus Cloud Computing,

Components of Cloud Computing, Cloud Types, Cloud Computing Service Delivery Models.

Introducing Virtualization: Introducing Virtualization and its Benefits, Implementation Levels of Virtualization,

Virtualization at the OS Level, Virtualization Structure, Virtualization Mechanisms, Open Source Virtualization

Technology, Binary Translation with Full Virtualization, Virtualization of CPU, Memory and I/O Devices,

Hardware support for Virtualization in Intex x86 Processor.

UNIT II

Cloud Computing Services: Infrastructure as a Service, Platform as a Service, Language and Pass, Software as a

Service, Database as a Service.

Open Source Cloud Implementations and Administration: Open-Source Eucalyptus Cloud Architecture, Open-

Source Open Stack Cloud Architecture.

UNIT III

Application Architecture for Cloud: Cloud Application Requirements, Recommendations for Cloud Application

Architecture, Fundamental Requirements for Cloud Application Architecture, Relevance and use of Client-Server

architecture for Cloud Application, Service Oriented Architecture for Cloud Applications.

Cloud Programming: Programming Support for Google Apps Engine, Big Table as Google’s NOSQL System,

Chubby as Google Distributed Lock Service, Programming Support for Amazon EC2, Elastic Block Store (ESB).

UNIT IV

Risks, Consequences and Costs for Cloud Computing: Introducing Risks in Cloud Computing, Risk Assessment

and Management, Risk of Vendor Lock-In, Risk of Loss Control, Risk of Not Meeting Regulatory Compliances,

Risk of Resource Scarcity, Risk in Multi Tenant Environment, Risk of Failure, Risk of Failure of Supply Chain,


Risk of Malware and Internet Attacks, Risk of Inadequate SLA , Risk of Management of Cloud Resources, Risk of

Network Outages, Risks in the Physical Infrastructure, Legal Risk due to Legislation, Risks with Software and

Application Licensing, Security and Compliance Requirements in a Public Cloud, Direct and Indirect Cloud Costs,

Calculating Total Cost of Ownership for Cloud Computing, Cost Allocations in a Cloud.

AAA Administration for Clouds: The AAA Model, Single Sign-On for Clouds, Industry Implementations for

AAA, Authentication Management in the Cloud, Authorization Management in the Cloud.


S.No Author Title Publisher

1 Kailash Jayaswal,Jagannath Kallakurchi,

Donald J. Houde & Dr. Deven Shah

Cloud Computing,

Black Book

Dreamtech

Press

Reference Books


1 Thomas Erl, Zaigham

Mahmood, Ricardo Puttini

Cloud Computing- Concepts

Technology and Architecture

Pearson

2 Raj Kumar Buyya,

Christen Vecctiola, S

Tammarai selvi

Mastering Cloud Computing,

Foundations and Application

Programming

TMH




Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Artificial Intelligence &

Machine Learning Max Marks:100


Course Objectives:

The objective of the course is

1. To present an overview of artificial intelligence (AI) Principles and Approaches.

2. To develop a basic understanding of the building blocks of AI as presented in terms of intelligent agents:

Search, Knowledge Representation, Inference, Logic, and Learning.

3. To understand basics of machine learning and Artificial Neural Networks.

Course outcomes: 1. Identify problems that are amenable to AI techniques and analyze those problems based on their

characteristics.(P03)(P01)

2. Formalize and implement different AI algorithms to solve the problems and understand various Knowledge

Representations and its issues.(PO4)(PO7)

3. Identify the importance of planning and natural language processing to solve AI problems.(PO4)

4. Understands about basics of machine learning and conceptual learning.(P03)(PO7).

5. To acquire knowledge about ANN and Computational learning theory.(PO4)(PO7)(PSO2)

UNIT I

What is AI? : The AI Problems, The Underlying Assumption, What is AI Technique?, The level of the Model,

Criteria for Success.

Problems, Problem Spaces & Search: Defining the problem as a State Space Search, Production Systems,

Problem Characteristics, Production System Characteristics, Issues in the design of Search Programs, Additional

Problems.

UNIT II

Heuristic Search Techniques: Generate and Test, Hill Climbing, Best First Search, Problem Reduction, Constraint

Satisfaction, Means Ends Analysis.

Knowledge Representation Issues: Representations and Mappings, Approaches to Knowledge Representation,

Issues in Knowledge Representation, The Frame Problem

Using Predicate Logic: Representing Simple Facts in Logic, Representing Instance and Is a Relationships,

Computable Functions and Predicates, Resolution, Natural Deduction.

UNIT III

Representing Knowledge using Rules: Procedural versus Declarative Knowledge, Logic Programming, Forward

versus Backward Reasoning, Matching, Control Knowledge.

Weak Slot & Filler Structures: Semantic Nets, Frames.

Natural Language Processing: Introduction, Syntactic Processing, Semantic Analysis, Discourse and Pragmatic

Processing. UNIT IV

Introduction to Machine Learning: Well-Posed Learning Problems, Designing a Learning System, Perspectives

and Issues in Machine Learning.

Concept Learning and the General-to-Specific Ordering: A Concept Learning Task, Concept Learning as

Search, FIND-S: Finding a Maximally Specific Hypothesis, Version Spaces and the CANDIDATE-ELIMINATION

Algorithm, Inductive Bias.


UNIT V

Artificial Neural Networks: Neural Network Representation, Appropriate Problems for Neural Network Learning,

Perceptrons, Multilayer Networks and the BACKPROPAGATION Algorithm, Remarks on the

BACKPROPAGATION Algorithm, Alternative Error Functions, Alternative Error Minimization Procedures,

Recurrent Networks, Dynamically Modifying Network Structure.

Computational Learning Theory: Probably Learning on Approximately Correct Hypothesis, Sample Complexity

of Finite Hypothesis Spaces, Sample Complexity of Infinite Hypothesis Spaces, Mistake Bound Model of Learning.



1 Rich & Knight Artificial Intelligence TMH (1991)

2 Tom.M. Mitchell Machine Learning TMH (2013)

Reference Books


1 Winston. P.H Artificial Intelligence Addison Wesley (1993)

2 Peter Flach Machine Learning The

Art and Science of

Algorithms that Make

Sense of Data

Cambridge University

Press




Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Visual Programming Max Marks:100

Course Code: CS4T3A Course: M.Sc.(Computer Science)

Course Objectives:

1. To understand fundamentals, windows forms controls, object oriented concepts & exception handling

in visual basic .net.

2. To know fundamentals, windows forms controls, object oriented concepts & exception handling in C#

.net.

3. Using standard controls, navigation controls, validation controls and login controls of ASP.Net.

4. Working with login controls & master pages & themes.

5. Implementing, caching, web & WCF services and silverlight.

Learning Outcomes: Upon successful completion of this course, the student gains complete knowledge on:

1. Fundamentals, windows forms controls, object oriented concepts & exception handling in visual basic

.net. (PO1)(PO2)(PO3)(PO7)(PSO1)(PSO2)

2. Fundamentals, windows forms controls, object oriented concepts & exception handling in C# .net.

(PO1)(PO2)(PO4)(PO7)(PSO1)(PSO2)

3. Standard controls, navigation controls & validation controls and of ASP.Net.


4. Login controls & master pages & themes. (PO1)(PO7)(PSO1)(PSO2)

5. Implementing, caching, web & WCF services and silverlight. (PO1)(PO7) (PSO1)(PSO2)

UNIT I

Getting Started with Visual Basic 2012:

Visual Basic 2012 Keywords, Operators, Arithmetic Operators, Assignment Operators, Comparison

Operators, Concatenation Operators, Logical and Bitwise Operators, Miscellaneous Operators, Operator

Precedence, Data Types in Visual Basic 2012, Visual Basic Statements, Working with Selection

Statement, Working with Iteration Statement, Variables, Constants, Arrays, Enumerations.

Windows Forms: Windows Forms Controls-I: Introducing the Control Class, Using the Label Control, Using the Text Box

Control, Using the Button Control, Using the Radio Button Control, Using the Check Box Control, Using

the Combo Box Control, Using the List Box Control, Using the Group Box Control, Using the Panel

Control, Using the Picture Box Control, Using the Timer Control, Using the Progress Bar Control. Windows Forms Controls-II: Using the Tool Strip Control, Using the Menu Strip Control, Using the Status Strip

Control, Working with Dialog Boxes, Using the Folder Browser Dialog Control, Using the Open File Dialog

Control, Using the Save File Dialog Control, Using the Font Dialog Control, Using the Color Dialog Control, Using

the Print Dialog and Print Document Controls.

Object Oriented Programming: Basic Principles of Object Oriented Programming, Member Access Modifiers,

Define Class, Creating Objects, Constructors, Inheritance, Abstract Classes, Interfaces, Polymorphism.

Errors and Exceptions Handling: Exploring Types of Errors, Syntax Errors, Runtime Errors, Logical Errors,

Handling Exceptions, Using the try-catch-finally Statement, Using the throw Statement, Using the User-Defined

Exception Class.

UNIT II

Getting Started with C#2012: Introducing Key words and Identifiers, Describing Operators and Operator,

Precedence, Exploring Data Types in C# 2012, Value Types, Reference Types, Pointer Types, Explaining Data

Type Conversion, Implicit Conversion, Explicit Conversion, Describing Variables and Constants, Declaring

Variables, Initializing Variables, Declaring Variables of Nullable Type, Declaring Constants, Working with Arrays,

Single-Dimensional Arrays, Exploring Control Flow Statements, Selection Statements, Iteration Statements, Jump

Statements.


Errors and Exceptions Handling: Exploring Types of Errors, Syntax Errors, Runtime Errors, Logical Errors,

Handling Exceptions, Using the try-catch-finally Statement, Using the throw Statement, Using the User-Defined

Exception Class.

Object Oriented Programming: Basic Principles of Object Oriented Programming, Member Access Modifiers,

Define Class, Creating Objects, Constructors, Inheritance, Abstract Classes, Interfaces, Polymorphism

UNIT III

Standard Controls: Introducing the WebControl Class, Using the Label Control, Using the TextBox Control,

Using the Button Control, Using the ImageButton Control, Using the ListBox Control, Using the RadioButton

Control, Using the CheckBox Control, Using the Table Control, Using the Wizard Control, Using the Calendar

Control, Using the AdRotator Control.

Navigation Controls: Working with the SiteMapPath Control, Using the SiteMapPath Control, Customizing

Appearance of the SiteMapPath Control, Working with the Menu Control, Creating Static Menus, Creating

Dynamic Menus, Working with the TreeView Control.

Validation Controls: Introducing the Base Validator Class, Using the RequiredFieldValidator Control, Using the

RangeValidator Control, Using the RegularExpressionValidator Control, Using the CompareValidator Control,

Using the CustomValidator Control, Using the ValidationSummary Control.

UNIT IV

Login Controls: Creating a User Account in ASP.NET 4.5, Using the Login Control, Using the Login Name

Control, Using the Login View Control, Using the Login Status Control, Using the Password Recovery Control,

Configuring the web.config File for Password Recovery.

Master Pages and Themes: Creating Master Pages, Simple Master Page, Nested Master Page, Explaining Themes,

Creating Themes, Applying Themes on Controls at Runtime, Using the Stylesheet Theme Attribute.

Database Access: Working with ADO.NET, Accessing Data Using ADO.NET, Data Base Access in using the

Controls of VB.Net, Data Base Access using the Controls of C#.Net, Data Base Access in using the Controls of

ASP.Net, Simple Data Binding, Complex Data Binding, Data Base Access using Data Grid View Control.

UNIT V

Caching in ASP.NET 4.5: Caching in ASP.NET, Introducing the Cache Class, Describing Output Caching, The

Location Attribute, The Shared Attribute, The VaryByCustom Attribute, The VaryByParam Attribute,

Implementing Output Caching, Describing Partial-Page Output Caching, Understanding the Disc Output Cache,

Describing Post-Cache Substitution and Substitution Control, Data Caching, Adding Items to Cache, Retrieving

Data from Cache, Deleting Items from Cache, Implementing Data Caching, Explaining Cache Dependencies.

Developing Web and WCF Services: Exploring New Features of WCF 4.5, Routing Service, Default

Configuration, Support for Discovery Behaviours, Improved REST Service Development, Support for Integration of

WCF with WF, Creating a Web Service, Using a Web Service, Creating a WCF Service, Using a WCF Service,

Creating WCF Data Services.

Introducing Silverlight 5: Exploring Key Features of Silverlight, Supported by .NET Programming Model,

Comprehensive UI Framework, Support for Deep Zoom Technology, Support for 3D Graphics, Animations, and

Multimedia, Support for Networking, Support for Higher Quality Video and Audio, Out-of-Browser Capabilities,

Exploring New Features of Silverlight 5, Explaining the Silverlight Architecture, Assemblies and Files in

Silverlight, Applications.



1 Vikas Gupta Comdex .Net 4.5 Programming Course Kit Dreamtech Press, 2014



1 Kogent Learning Solutions Inc.

ASP .Net Black Book Dreamtech Press,2011


Visual Basic 2010

Programming Black Book,

Platinum ed

Dreamtech Press,2011


Visual Basic 2010

Programming Black Book,

Platinum ed

Dreamtech Press,2011




Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Big Data Analytics Max Marks:100

Course Code: CS4T3B Course: M.Sc.(Computer Science)

Course Objectives:

1. To learn big data, to learn the analytics of Big Data

2. To understand how data is stored and processed in Hadoop

3. To learn about NoSQL databases

4. To learn R tool and understand how data is analyzed using R features

5. To learn Visualization of data with Tableau \

Course Outcomes:

Upon successful completion of this course, the student will be able to understand: 1. Big data and its role in daily life. (PO2)(PO3)(PSO1)

2. How data is stored and processed in Hadoop.(PO4)

3. Modern databases used in Big Data Analytics.(PO4)

4. Usage o f R Programming in Analytics.(PO4)(PSO2)

5. Visualization of data with Tableau.(PO3)

UNIT I

Types of Digital Data: Classification of Digital Data

Introduction to Big Data: Characteristics of Data, Evolution of Big Data, Definition of Big Data, Challenges with

Big Data, What is Big Data?, Other Characteristics of Data, Why Big Data?, Traditional Business Intelligence

versus Big Data, Typical Data Warehouse Environment, Typical Hadoop Environment, Coexistence of Big Data

and Data Warehouse, What is Changing in the realms of Big Data.

Big Data Analytics: What is Big Data Analytics, What Big Data Analytics Isn’t?, Why This sudden Hype Around

Big Data Analytics?, Classification of Analytics, Greatest Challenges that Prevent Business from Capitalizing Big

Data, Top Challenges Facing Big Data, Why Big Data Analytics Important?, What Kind of Technologies are we

Looking Toward to Help Meet the Challenges Posed by Big Data?, Data Science, Data Scientist, Terminologies

used in Big Data Environments

UNIT II

Hadoop: Features of Hadoop, Key advantages of Hadoop, Versions of Hadoop, Overview of Hadoop Ecosystem,

Hadoop Distributions, Why Hadoop?, Why not RDBMS, RDBMS versus Hadoop, Distribution Computing

Challenges, History of Hadoop, Hadoop Overview, Hadoop Distributed File System

UNIT III

Processing Data with Hadoop, Managing Resource and Applications with Hadoop with YARN(Yet Another

Recourse Negotiator), Interfacing with Hadoop Ecosystem

Introduction to Map Reduce Programming: Introduction, Mapper, Reducer, Combiner, Partitioner, Searching,

Sorting, Compression,

NoSQL: Where it is used?, What is it?, Types of NoSQL Databases, Why NoSQL?, Advantages of NoSQL, What

we miss with NoSQL?, Use of NoSQL in Industry, SQL vrsus NoSQL.

UNIT IV

What is R?, Why use R for Analytics?, How to run R?, First R Example, Functions, A Short Programming Example,

Some Important R Data Structures, Vectors, Matrices, Lists, R Programming Structures.

UNIT V

Introducing Visualization and Tableau: Why Data Visualization?, What can Data Visualization Help With?, An

Introduction to Visualization:Which domain is leveraging the power of Data Visualization?, Who is Using Data

Visualization?, Top Data Visualization Tools, History of Data Visualization, What are the expectations for a Data

Visualization Tool?, Let us see How Tableau Fulfils the Expectations, Reasons to Make a Switch to Tableau,

Positioning of Tableau, Tableau Product Line, File Types in Tableau, Tableau Workbook (TWB),Tableau


Packaged Workbook (TWBX), Tableau Data Source (TDS) File, Tableau Packaged Data Source (TDSX) File,

Contents Tableau Bookmark, Tableau Data Extract.

Working with Single and Multiple Data Sources: Desktop Architecture:Data Layer, Data Connectors, Live

Connection, In-Memory, Tableau Environment:to open, to close, start , Data Source Page, Work Space, Work

Books and Sheets, Visual Cues and Icons in Tableau, Connect to a File:Connect to a TextbFile, Connect to A MS

Access, Connect to R Data Files, Connect to a Server: Connect to MS SQL Server, Connect to MySQL, Connect to

NO SQL Data Bases, Metadata Grid, Joins: Adding Fields to the Data Pane, Exploring different Types of Join,

Union, Custom SQL, Data Blending and Data Extracts.



1 Seema Acharya, Subhashini

Chellappan

BigData and Analytics Wiley Publications.(Unit I, II, III)

2 Norman Matloff The art of R programming 2009 (Unit IV)

3 Acharya, Seema, Chellappan,

Subhashini

A Step-by-Step Guide Apress 2017(Unit V)



1 Nathan, Marz James Warren Big Data Principles and Best

Practices of Scalable Real Time

Data Systems

MANNING Publications 2015

2 Tom White Hadoop: The Definitive Guide O’Reilly, Yahoo Press, 3e

3 Sandeep Rakshit Introduction to R McGrawHill Education, 2016


Course Objectives: 1. To gain knowledge on foundational theory behind information security. 2. To understand cyber crime in mobile and wireless devices.

3. To know about Phishing and Identity Theft.

4. To familiar with Computer Forensics.

5. To gauge the protections and limitations provided by today's technology.

Course Outcomes: Upon successful completion of this course, the student gains complete knowledge on:

1. Foundational theory behind information security. (PO1)(PO2)(PSO1) 2. Cyber crime in mobile and wireless devices. (PO3)(PO4)(PSO2)

3. Phishing and Identity Theft .(PO5)(PO6)(PSO1)

4. Computer Forensics. (PO1)(PO2)(PSO1)

5. Estimation of protections and limitations provided by today's technology. (PO6)(PO7)(PSO2)

UNIT-I

Introduction to Cybercrime: Introduction, Cybercrime and Information Security, Who are Cybercriminals, Classifications of Cybercrimes,

Cybercrime: The legal Perspectives and Indian Perspective, Cybercrime and the Indian ITA 2000, A Global

Perspective on Cybercrimes.

Cyber offenses: Introduction, How, Criminals plan the Attacks, Social Engineering, Cyber Stalking, Cyber Cafe

and Cybercrimes, Botnets: The Fuel for Cybercrime, Attack Vector, Cloud Computing.

UNIT-II

Cybercrime:Mobile and Wireless Devices Introduction, Proliferation of Mobile and Wireless Devices, Trends in Mobility, Credit Card Frauds in Mobile and

Wireless Computing Era, Security Challenges Posed by Mobile Devices, Registry Settings for Mobile Devices,

Authentication Service Security, Attacks on Mobile/Cell Phones, Laptops.

UNIT-III

Phishing and Identity Theft: Phishing: Methods of Phishing, Phishing Techniques, Spear Phishing, Types of Phishing Scams, Phishing Toolkits

and Spy Phishing, Phishing Counter Measures. Identity theft: Personally Identifiable Information (PII), Types of Identity Theft, Techniques of ID Theft, Identity

Theft: Counter Measures, How to efface your Online Identity.

UNIT-IV Understanding Computer Forensics :Introduction, Historical background of Cyber Forensics, Digital Forensics

Science, The Need for Computer Forensics, Cyber Forensics and Digital Evidence, Forensics Analysis of Email,

Digital Forensics Lifecycle, Chain of Custody Concept, Network Forensics, Approaching a Computer, Forensics

Investigation, Challenges in Computer Forensics, Special Tools and Techniques, Forensics Auditing.

UNIT -V Cyber Security: Organizational Implications Introduction, Cost of Cybercrimes and IPR issues, Web threats for

Organizations, Security and Privacy Implications, Protecting People’s Privacy in the Organization.



Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Cyber Security Max Marks:100

Course Code: CS4T3C Course: M.Sc.(Computer Science)



Authors Title Publisher

1 Nina Godbole and

Sunil Belapure

Cyber Security: Understanding Cyber Crimes,

Computer Forensics and Legal Perspectives

Wiley INDIA



1 Chwan-Hwa(john)

Wu,J.David Irwin

Introduction to Cyber

Security

CRC Press T&F Group

2 James Graham, Richard

Howard and Ryan Otson Cyber Security

Essentials

CRC Press.




Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Python Programming Max Marks:100

Course Code: CS4T3D Course: M.Sc.(Computer Science) Course Objectives: Student should be able to familiarize with

1. Develop a basic understanding of programming and the Python programming language.

2. See the value of programming in a variety of different applications.

3. Appreciate the value of experimentation.

4. Be comfortable with the fact that there is more than one right solution to a problem.

5. How to handle errors in Python.

Course Outcomes: Upon the successful completion of this course, the student will be able to:

1. Install and run the Python interpreter and understand the basic concepts of Python language.

(PO1) (PSO1) 2. Create applications using Python and execute the programs. (PO2) (PSO2)

3. To extract the list and index it for easy searching in a list. (PO2) (PSO1)

4. Understand the concepts of file I/O to read and write data from a text file using Python.

(PO3) (PSO1) 5. Plot data using appropriate Python visualization. Or To learn how to use exception handling in

Python applications for error handling. (PO4) (PSO1)

UNIT I Introduction to Python: The Basic Elements of Python, Branching Programs, Control Structures, Strings and

Input, Iteration

Functions, Scoping And Abstraction: Functions and Scoping, Specifications, Recursion,

Global Variables, Modules, Files, System Functions and Parameters .

UNIT II

Structured Types, Mutability and Higher-Order Functions: Strings, Tuples, Lists And Dictionaries, Lists And

Mutability, Functions as Objects.

Testing, Debugging, Exceptions and Assertions: Types of Testing, Black-Box and Glass-Box, Debugging,

Handling Exceptions, Assertions.

UNIT III

Classes and Object-Oriented Programming: Abstract Data Types and Classes, Inheritance, Encapsulation and

Information Hiding.

Simple Algorithms and Data Structures: Search Algorithms, Sorting Algorithms, Hash Tables.

UNIT IV

Advanced Topics I: Regular Expressions-Res and Python, Plotting Using Pylab, Networking and Multithreaded

Programming-Sockets, Threads and Processes, Chat Application.

UNIT V Advance Topics II : Security-Encryption and Decryption, Classical Cyphers, Graphics and GUI Programming-

Drawing Using Turtle, Tkinter and Python, Other GUIs.



S.No

.


1 Kenneth A. Lambert The Fundamentals of Python:First

Programs

CENGAGE

Publication


S.No

.


1 John V Guttag

Introduction to Computation and

Programming Using Python

Prentice Hal

2 R. Nageswara Rao

Core Python Programming

Dreamtech

3 Wesley J. Chun

Core Python Programming

Prentice Hall




Department: Computer Science (PG) No. of Credits: 6 Title of the Paper: Visual Programming Lab Max Marks:100


Course Objectives:

1. To understand fundamentals, windows forms controls, object oriented concepts & exception handling

in visual basic .net.

2. To know fundamentals, windows forms controls, object oriented concepts & exception handling in C#

.net.

3. Using standard controls, navigation controls, validation controls and login controls of ASP.Net.

4. Working with databases & web part controls.

5. Implementing master pages & themes, caching, web & WCF services and silverlight.

Learning Outcomes: Upon successful completion of this course, the student will be able to: 1. Understand fundamentals, windows forms controls, object oriented concepts & exception handling in

visual basic .net.(PO1)(PO2)(PO3)(PO7)(PSO1)(PSO2)

2. Know fundamentals, windows forms controls, object oriented concepts & exception handling in C#

.net.(PO1)(PO2)(PO4)(PO7)(PSO1)(PSO2)

3. Use standard controls, navigation controls, validation controls and login controls of

ASP.Net.(PO1)(PO7)(PSO1)(PSO2)

4. Work with databases & web part controls. (PO1)(PO7)(PSO1)(PSO2)

5. Implement master pages & themes, caching, web & WCF services and silverlight.


Visual Programming Lab List

1. Write VB.Net & C#.net programs to demonstrates Polymorphism using Function overloading and Operator

overloading

2. Write an Abstract Class to calculate the area of circle and square in VB.Net & C# .Net.

3. Write a VB.Net & C#.Net programs to demonstrate Interfaces.

4. Write a VB.Net & C#.Net programs to explain Method Overriding.

5. Write C#.Net Codes to illustrate Static Classes.

6. Write VB.Net C#.Net Codes to explain Constructors.

7. Write a VB.Net C#.Net codes to demonstrate Inheritance.

8. Write VB.Net program to simulate traffic signals.

9. Develop an application for billing system in coffee shop by using the controls text boxes, label boxes, group

boxes, check boxes, radio buttons and buttons.


10. Transfer the selected item, all the items from one list to another list using the controls list boxes and buttons

11. Transfer the selected item from one list to another list with example using controls checked list boxes and

buttons.

12. Write C# program for user profile checking with the help of timer control.

13. Develop Simple Notepad application in C#.Net

14. Validation the control text box for integers, characters and real number in VB.Net

15. Validate the control text box for characters, integers through procedures or functions.

16. Validate the common dialog control input box such a way that the input box must accept characters in first three

positions and numbers in next three positions.

17. Write VB.Net application to store the data using Files.

18. Write C#.Net program to access the data with ORACLE data base connection using objects OLEDB

19. Design your own control access the table ORACLE database

20. Create your own control and palace it in toolbox

21. Display a table using Data Grid Control and also add, delete and modify the records.

22. Implement Simple Data Binding & Complex Data Binding in VB.Net & C#.Net.

23. Design Tree-view & List view by using the controls of VB.Net & C#.Net

24. Draw Oval, Rectangle using graphic objects of VB.Net

25. Demonstrate Output Caching using the controls of ASP.Net

26. Explain Substitution Control in ASP.Net

27. Implement Data Caching Example in ASP.Net

28. Create and use Web Service in ASP.Net

29. Create and use WCF Service in ASP.Net

30. Create and use WCF Data Service in ASP.Net

31. Create Simple Silver Light Application

32. Hosting video in a Web site by writing Silver Light Application




Department: Computer Science (PG) No. of Credits: 6 Title of the Paper: Big Data Analytics Lab Max Marks:100


Course Objectives:

1. To acquire and knowledge in HDFS and map reduce

2. To acquire analytical skills of big data through R tool and importing data from MS-

Excel, XML, and Web

3. To learn Visualization of data with Tableau

Course Outcomes: Upon successful completion of this course, the student will be able to:

1. Install and implement Hadoop and MapReduce. (PO2)(PO4)(PSO1)

2. Do R programming in analytics.(PO4)(PSO2)

3. Do visualization using data sets in Tableau.(P05)(PSO1)

Part A - Hadoop

1. Study of Hadoop Ecosystem

2. Programming exercises on Hadoop. E.g. Word count program

3. Programming exercises in NoSQL/MongoDB

4. Implementing simple algorithms in Map Reduce Matrix Multiplication, Aggregates, Joins, Sorting, Searching

etc

Part B

5. Create an R Script File which contains R commands and execute it.

6. Calculating mean and standard deviation of a vector of numbers without using built in function.

7. Create two matrixes with 30 elements and six rows filled with random numbers& perform matrix addition,

subtraction and multiplication

8. Downloading data from the internet importing data to R and apply statistical averages and plotting the data

distribution.

9. Create CSV file with empid, employee name, salary, start-date and dept and read and display the data and

analyze it.

10. Create a XML file, read that file and print that file.

11. Create a JSON (Java Script Object Notation) file, read that file and convert it into R data frame.

Part C

12. Prepare Build an Area Chart, Bar Chart, Gantt Chart, Scatter Plot, Text Table, Treemap in Tableau

13. Prapare Timeseries, Aggregation, and Filters

14. Prepare Maps and Scatterplots

15. Joining and Blending Data using Tableau


APPENDIX – IV

MODEL QUESTION PAPERS

P.B.Siddhartha College of Arts & Science

III Semester M.Sc. (Computer Science) Examination

CS3T3: Data Warehouseing and Data Mining

(Regulation 2017-18)

Time: Three Hours Maximum: 70 Marks

Answer ALL questions

All questions carry equal marks (5 × 14 Marks)

1. a) Explain the purose of managing a data warehouse. 7 Marks b) Discuss the architecture of data warehouse. 7 Marks

or 2. a) Explain in detail about scope creep? 7 Marks b) What are the ways in which progress of projects is tracked? 7 Marks

3. a) Explain data partioning and types of partions. 7 Marks b) Expalin the fundamental of ETL. 7 Marks

or 4. a) Explain star schema design in deatil. 7 Marks b) Brief the ETL versus Manual Tools. 7 Marks

5. a) Explain Association Rule Mining and state its support. 7 Marks b) State the issues of Data Mining. 7 Marks

or 6. a) Explain FP tree contruction and reduction of scans through this process. 7 Marks b) Brief Multidimensional association rule mining. 7 Marks

7 a) Expalin an algorithm for classification by Back Propagation? 7 Marks b) Explain the issues regarding Classification and Prediction? 7 Marks

or 8. a) Expain Bayes Theorem. 7 Marks b) Brief Naive Baysian Classification. 7 Marks

9. What is Cluster Analysis? Explain Types of data in Cluster Analysis? 14 Marks or

10. a) Explain STING apporach. 7 Marks b) Discuss about DBSCAN algoritm in detail. 7 Marks


P.B. Siddhartha College of Arts & Science, Vijayawada Fourth Semester M.Sc.(Computer Science) Examination

CS3T5A: Principles of Distributed Database Systems

Time: Three Hours Maximum: 70 Marks Answer ALL questions

All questions carry equal marks ( 5 × 14 Marks )

1. a) What types of Fragmentations can be applied in Distributed Databases? 14 Marks

OR

b) What is Data Dictionary? Explain in detail. 7 Marks

c) What is Data Cleaning? Explain in detail. 7 Marks

2. a) Describe various Access Controls Mechanisms of Distributed DBMS. 14 Marks

OR

b) Describe about Data Localization in Distributed DBMS. 7 Marks

c) State objectives of Query Processing. 7 Marks

3. a) Explain various Centralized Query Optimization approaches. 14 Marks

OR

b) State various issues in Multi Database Query Processing . 7 Marks

c) Describe about Query Translation and Execution. 7 Marks

4. a) Illustrate various Timestamp-Based Concurrency Control Algorithms. 14 Marks

OR

b) State various failures in distributed DBMS. 7 Marks

c) Describe about Two-Phase Commit Protocol. 7 Marks

5. a) Describe various aspects of Distributed Object Database Management. 14Marks

OR

b) What is Load Balancing? Explain in detail. 14 Marks


P.B. Siddhartha College of Arts & Science, Vijayawada IV

th Semester M.Sc.(Computer Science) Examination

CS4T3A: Visual Programming Time: Three Hours Maximum: 70 Marks

Answer ALL questions All questions carry equal marks ( 5 × 14 Marks )

1. a) Create simple Note Pad Application in VB.Net by using various Windows Forms Controls. 14 Marks OR

c) Describe Polymorphism with function overloading by writing VB.Net program. 7 Marks

d) What is an Exception? Explain Divide by Zero exception with try-catch-finally

statement. 7 Marks

2. a) Explain various Control Flow Statements of C#.Net. 7 Marks b) List various Exceptions of C#.Net. 7Marks

OR c) What is Abstract Class? Write C#.Net Program to illustrate Abstract Class. 7 Marks d) What is a Polymorphism? Explain Polymorphism with an example program. 7 Marks

3. a) Design Tree View by using C#.Net or VB.Net Controls. 7 Marks b) Explain Required Field Validator and Range Validator Controls of ASP.Net.

7Marks OR c) Describe Site Map Path Control with example. 7 Marks d) Explain about Regular Expression Validator and Compare Validator Controls of

ASP.Net. 7 Marks

4. a) By using the controls write a VB.Net program to access the employee table of the database. 14 Marks

OR b) Explain about Login Name Control and Login View Control of ASP.Net. 7 Marks

c) Describe about Master Pages and Nested Master Pages. 7 Marks

5. a) Write a program to implement Data Caching in ASP.Net. 14 Marks OR

b) Create and use WCF Service in ASP.Net. 14 Marks



IIIrd

Semester M.Sc. (Computer Science) Examination

CS3T5C: Software Testing (Regulation 2017-18)




1. State and explain various dichotomies in Software testing. 14 Marks or

2. a) State and explain Predicate Blindness with examples. 7 Marks b) Write in detail about Predicate Interpretation and Predicate Coverage. 7 Marks

3. a) What is meant by Program’s Control Flow? How is it useful for Path Testing? 7 Marks b) State and explain various Path Selection Rules? 7 Marks

or 4. a) Write a short notes on the following 7 Marks (i) Slicing & Dicing (ii) Data Flow (iii) Debugging. b) Define Transaction & Transaction Flow Testing with an example. 7 Marks

5. a) What is meant by Domain Testing? Discuss about Nice and Ugly Domains. 7 Marks b) Write a short note on Domain Dimensionality. 7 Marks

or 6. Explain Regular Expressions and Flow Anomaly Detection with an example. 7 Marks

7.a) Explain Unreachable States and Dead States in detail?. 7 Marks b) Define State Testing? What is the impact of Bugs in State Testing. 7 Marks

or 8 . What are the rules for Boolean Algebra? Illustrate the rules to the following expression

and explain. 7 Marks

9) a) Write a Partition Algorithm. 7 Marks b) Write about loops in matrix representation. 7 Marks

or 10) a) Discuss Node Reduction Algorithm. 7 Marks b) How a Node Reduction Optimization can be done. 7 Marks



IIIrd

Semester M.Sc. (Computer Science) Examination

CS3T5D: Mobile Computing (Regulation 2017-18)




1. a) Explain Significance of TCP/IP Protocol Stack. 14 Marks

or b) i) Describe Internet Applications. 5 Marks ii) Describe Features of 1G,2G,3G,4G IN Mobile Computing. 9 Marks

2. a) Explain GSM System Architecture with a neat diagram. 14 Marks

or b) i) Discuss Handover in GSM. 7 Marks

ii) Describe the features of WMAN, WiMAX. 7 Marks

3. a) i) What are the features of IPV4? 7 Marks ii) Compare IPV4 and IPV6. 7 Marks or

b) Explain about the working of IP Packet Delivery. 14 Marks

4. a) What are the Functions of Snooping Sub Layer in the TCP Protocol? How do the TCP Packets Transfer from a Mobile Node to the Receiver End? 14 Marks

or b) Explain Mobile TCP. How does a Supervisory Host send TCP Packets to the Mobile

Node and to fixed TCP Connection. 14 Marks

5. a) Explain about NGN Characteristics and architecture with a neat diagram. 14 Marks

or b) Discuss ANDROID OS Features. 14 Marks



CS4T3D: Python Programming



1. (a) How to comment specific line(s) in Python program? Write a Python program to print

Fibonacci series upto n terms. 7 Marks

(b) What is list in Python? Demonstrate use of any three methods of list. 7 Marks

OR (c) What is the use of islower() and isupper() method? Give the syntax and significance of

raw_input() and input() methods. 7 Marks

(d) Write a Python program to check whether the given no is Armstrong or not using

user defined function. 7 Marks

2. (a) Explain the function that is used to retrieve the parts of URL. Write a python program to

create a TCP/IP client-server chat application. 7 Marks

(b) What are the differences between C and Python? 7 Marks

OR (c) How map can be used in Python program? Explain with a suitable example. Give the syntax

and significance of string functions: title() and capitalize(). 7 Marks

(d) Write a Python program to implement the concept of inheritance. 7 Marks

3. (a) Briefly describe the methods of regular expression. How filter can be used in Python

program? Explain with a suitable example. 7 Marks

(b) Write a python program to search a specific value from a given list of values using binary

search method. 7 Marks

OR (c) What is duck typing philosophy of python? What is Method Resolution Order (MRO)?

Explain the principles followed by MRO with example. 7 Marks

(d) Write a python program to arrange the characters of a given string 'welcome' in an

alphabetical order using insertion sort algorithm. 7 Marks

4. (a) Explain the types of methods available in python with a suitable example of each method.

(b) Which are the different ways of creation of threads? Explain each with an example. 7 Marks

OR (c) What are the differences between abstract class and interface? Write a python program in

which Maruti and Santro sub classes implement the abstract methods of the super class Car.

7 Marks

(d)Create a class student with following member attributes: roll no, name, age and total marks.

Create suitable methods for reading and printing member variables. Write a python program

to overload ‘==’ operator to print the details of students having same marks. 7 Marks

5. (a) Explain the function which is used to retrieve the parts of URL. Read a text file in Python

and print no. of lines and no. of unique words. 7 Marks

(b) Explain steps to create widgets. Write Python program to display a label on clicking a

push button. 7 Marks

OR

(c) Explain the major steps used to create widgets. Write a python program to display a label

upon clicking a push button. 7 Marks

(d) Write a Python GUI program to create three push buttons using Tkinter. The background

color of frame should be different when different buttons are clicked. 7 Marks


APPENDIX – V

1. CRITERIA FOR INTERNAL ASSESSMENT IN LAB COURSES

There should be one internal practical lab examination for 15 marks at the end of each semester and the

assessment of internal practical examination is to be done for 5 marks for Written Procedure, plus 5 marks

for Program Execution, plus 5 marks for Viva-Voce / Online Test in respective Laboratory Courses

(papers). Maximum 15 marks are to be awarded for practical laboratory performance basing on the average of best

75% marks scored in completed lab exercises from the complete lab list. The schema for awarding these 15

marks is given as under:

2. INTERNAL ASSESSMENT FOR SEMINAR BASED COURSES

Internal marks for seminar are based on Documentation of 25 Marks, Presentation of 10 marks, Personal

Characteristics of 5 marks and Attendance of 10 Marks. The time duration allotted for each student to deliver the seminar is 10-20 minutes.

Evaluation Method for Internal Seminar Documentation Presentation Personal

Characteristics Attendance Total

Maturity/Balanced

/Thoughtful

Presentation

Use of Audio

Visual aids

A B C D E (A+B+C+D+E)

25 Marks 5 Marks 5 Marks 5 Marks 10 Marks 50 Marks

3. EXTERNAL EVALUATION OF LAB COURSES

The external evaluation of practical examination shall comprise of 10 Marks for Lab Record, 25 Marks for

Written Procedure, 25 Marks for Program Execution and 10 Marks for Viva-Voce / Online Test. Evaluation Method for External Practical Examination

Lab Record Written Procedure

Program

Execution Viva Voce /

Online Test Total

A B C D (A+B+C+D)

Written

Procedure Program

Execution Viva Voce / Online Test Total

A B C D=(A+B+C) 5 Marks 5 Marks 5 Marks 15 Marks

Schema of Continuous Internal Evaluation of Individual Student for Practical Laboratory Courses Course: M.Sc.,(Computer Science) Course Code: Semester: Title of

Laboratory: Total

Number of

Exercises:

Registration Number: Name of the Student:

Exercise

Number Exercise

Name Date of

Execution Record

(5 Marks)

Execution (10 Marks)

Total (15 Marks)

Signature of

Student

Signature of

Faculty


10 Marks 25 25 Marks 10 Marks 70 Marks

Evaluation Criteria for allocation of the 10 Marks to Lab Record in External Practical Examination S.No. Percentage of Lab Exercises completed in the

Lab List Marks to be Awarded

1 Above or Equal to 95% 10 Marks 2 Above or Equal to 90 and below 95% 9 Marks 3 Above or Equal to 85 and below 90% 8 Marks 4 Above or Equal to 80 and below 85% 7 Marks 5 Above or Equal to 75 and below 80% 6 Marks 6 Less than 75% Not Allowed to Write Lab Examination

4. MINI PROJECT / PROJECT WORK

Internal assessment of Mini Project / Project Work will be done by the concerned Project Internal guide and

HOD for 100 marks.

External evaluation will be carried out by the External Examiner appointed by the Controller of

Examinations for 100 Marks.

Every faculty member must guide a minimum of five students in Mini Project / Project Work off the

designated workload

Evaluation Schema for Continuous Internal Assessment of Mini Project

Review-I Submission of Abstract 20 Marks

Review-II Submission of Data Dictionary &

UML/ER Diagrams

20 Marks

Review-III Project Execution 30 Marks

Record Submission 30 Marks

Total 100 Marks

Evaluation Schema for External Assessment of Project Work

Project Record 40 Marks

Execution 100 Marks

Viva Voce 60 Marks

Total 200 Marks


Minutes of the meeting of Board of Studies in Computer Science (PG) held on 14/05/2018 at 2 P.M. in the

Department of Computer Science.

Members Present

Name of the Member Role Signature

Mr.T.S.Ravi Kiran Chairman

Prof.Y.K.Sundara Krishna Subject Expert, Krishna

University

Dr.R.Satya Prasad Subject Expert, Acharya

Nagajuna University

Prof.K.V.Samba Siva Rao Subject Expert, NRI

Institute of Technology,

Agiripalli

Prof.B.V.Subba Rao Subject Expert,

P.V.P.Siddhartha

Institute Of Technology,

Kanuru

Mr.Satya Thopalli Industry Nominee,

Sphere Solutions India

Pvt.Ltd.

Mrs.R.Vijaya Kumari Alumni, Krishna

University

Mrs.K.Sobhana Member

Mrs.Ch.Smitha Chowdary Member

Mrs.R.Aruna Member

Ms.K.Priya Member

Mrs.A.Kavitha Member

Mrs.S.P.V.N.D.Suneetha Member

Mr.V.V.Ramana Member

A G E N D A

1. To evaluate and approve revised Course Structure and Syllabus for I & II semesters of Master of

Computer Applications and M.Sc.(Computer Science) under Choice Based Credit System with effect

from the academic year 2018 -19 admitted students. 2. To evaluate and approve proposed Course Structure and Syllabus for III & IV semesters of Master of

Computer Applications and M.Sc.(Computer Science) under Choice Based Credit System with effect

from the academic year 2017 -18 admitted students.

3. To explore the possibilities of introducing any new subjects as additional optional subjects, or new

combinations of subjects.

4. To assess the potential of the courses against the employment prospects.

5. To assess the compatibility of Practical Courses to Theory Courses.

6. To approve the Model Question Papers for all the subjects 7. To approve the List of Examiners and Paper Setters for all papers. 8. Any other item with the permission of the Chair.


RESOLUTIONS Resolution – I Resolved to recommend the revised scheme of instruction and evaluation for semesters I & II for 2018 -

’19 admitted batch and III & IV for 2017 – 18 admitted batch of the M.C.A programmes contained in

Appendix–I.

Resolution – II Resolved to recommend the revised syllabi for I and II semesters, contained in Appendix–II for the batch

of students admitted in M.C.A, from the year 2018-’19.

Resolution – III Resolved to recommend the syllabi for III and IV semesters, contained in Appendix–III for the batch of

students admitted in M.C.A, from the year 2017-’18.

Resolution – IV Resolved to recommend model question papers for III and IV semester courses for Semester End

Examinations contained in Appendix–IV.

Resolution – V Resolved to recommend the Internal & External Assessment & Evaluation for Lab / Seminar based

courses and Mini Project / Project Work contained in Appendix–V.


APPENDIX - I


SEMESTER – II

S.NO. Course


Instruction

Hours per

Week Credits

Evaluation

Total

Marks CIA Marks

SEE


1 CA2T1 Operating Systems 4 4 30 70 3 Hours 100

2 CA2T4 Database Management

Systems 3 1 4 30 70 3 Hours 100

3 CA2T5 Probability & Statistics 4 4 30 70 3 Hours 100 CIA=Continuous Internal Assessment SEE=Semester End Examinations

III SEMESTER

S.NO. Course


Instruction

Hours per

Week Credits

Evaluation

Total

Marks CIA Marks

SEE


1 CA3T1 Design and Analysis of

Algorithms 3 1 4 30 70 3 Hours 100

2 CA3T2 Computer Networks 4 4 30 70 3 Hours 100

3 CA3T3 Web Technologies 3 1 4 30 70 3 Hours 100

4 CA3T4 Software Engineering 4 4 30 70 3 Hours 100

5 CA3T5 Operations Research 4 4 30 70 3 Hours 100

6 CA3L1 Computer Networks and

Operating Systems Lab 6 3 30 70 3 Hours 100

7 CA3L2 Web Technologies Lab 6 3 30 70 3 Hours 100

8 CA3S1 Seminar III 3 2 50 -- 3 Hours 100

Total 35 28 260 490 750 CIA=Continuous Internal Assessment SEE=Semester End Examinations


IV SEMESTER

S.NO. Course


Instruction

Hours per

Week Credits

Evaluation

Total

Marks CIA Marks

SEE


1 CA4T1 Data Mining Techniques 3 1 4 30 70 3 Hours 100

2 CA4T2 Mobile Computing 4 4 30 70 3 Hours 100

3 CA4T3 Cryptography & Network

Security 3 1 4 30 70 3 Hours 100

4 CA4T4 Theory of Computation 4 4 30 70 3 Hours 100

5

CA4T5A Advanced Database

Management System 4

4 30 70 3 Hours 100

CA4T5B TCP/IP 4

CA4T5C Software Testing 4

CA4T5D Distributed Operating

Systems 4

CA4T5E Cloud Computing 4

CA4T5F Microprocessors and

Interfacing 4

6 CA4L1 Data Mining Lab 6 3 30 70 3 Hours 100

7 CA4L2 Mobile Computing Lab 6 3 30 70 3 Hours 100

8 CA4P1 Mini Project I 3 30 70 3 Hours 100

Total 32 28 310 490 800 CIA=Continuous Internal Assessment SEE=Semester End Examinations


APPENDIX - II REVISED SYLLABI OF II

SEMESTER

Course

Objectives: 1. To introduce students with basic concepts of operating system, its functions and services. 2. To familiarize the students with various views and management policies adopted by operating system as

pertaining with Processes, Deadlock, memory, File and I/O operations. 3. To brief the students about functionality of various operating systems like Unix, Linux and Windows 7 as

pertaining to resource management. 4. To provide the knowledge of basic concepts towards Process Synchronization and related issues. 5. To provide better understanding on Protection & Security.

Course Outcomes: 1. To understand the basic concepts of operating system, its functions and services. (PO4) (PO3) (PO7) (PSO1) 2. To familiarize the students with various views and management policies adopted by operating system as

pertaining with Processes, Deadlock, memory, File and I/O operations.(PO3) (PSO1) 3. Compare the various algorithms and comment about performance of various algorithms used for Processes,

Deadlock, memory, File and I/O operations. (PO2) (PO4) (PSO2) 4. Knowledge of basic concepts towards Process Synchronization and related issues. (PO1) (PO4) (PSO2) 5. Better understanding on Protection & Security. (PO1) (PSO1)

UNIT I Introduction: What Operating Systems Do, Computer-System Organization, Computer-System Architecture,

Operating-System Structure, Operating-System Operations, Process Management, Memory Management, Storage

Management, Protection and Security, Kernel Data Structures, Computing Environments, Open-Source Operating

Systems. Operating-System Structures: Operating-System Services, User and Operating-System Interface, System Calls,

Types of System Calls, System Programs, Operating-System Design and Implementation, Operating-System

Structure. Processes: Process Concept, Process Scheduling, Operations on Processes, Inter Process Communication,

Communication in Client–Server Systems.

UNIT II Threads: Overview, Multicore Programming, Multithreading Models, Thread Libraries, Implicit Threading,

Threading Issues. Process Synchronization: Background, The Critical-Section Problem, Peterson’s Solution, Synchronization

Hardware, Mutex Locks, Semaphores, Classic Problems of Synchronization, Monitors. CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread Scheduling, Multiple-

Processor Scheduling.

UNIT III Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention,

Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock. Main Memory: Swapping, Contiguous Memory Allocation, Segmentation, Paging, Structure of the Page Table,

Intel 32 and 64-bit Architectures. Virtual Memory: Background, Demand Paging, Copy-on-Write, Page Replacement, Allocation of Frames,

Thrashing.

UNIT IV Mass-Storage Structure: Overview of Mass-Storage Structure, Disk Structure, Disk Attachment, Disk Scheduling,

Swap-Space Management, RAID Structure.

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: II LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Operating Systems Max Marks:100



File-System Interface: File Concept, Access Methods, Directory and Disk Structure, File-System Mounting,

Protection. File-System Implementation: File-System Structure, File-System Implementation, Directory Implementation,

Allocation Methods, Free-Space Management, Efficiency and Performance, Recovery.

UNIT V I/O Systems: Hardware, Application I/O Interface, Kernel I/O Subsystem, Transforming I/O Requests to Hardware

Operations, STREAMS, Performance. Protection: Goals of Protection, Principles of Protection, Domain of Protection, Access Matrix, Implementation of

the Access Matrix. Security: The Security Problem, Program Threats, System and Network Threats, Cryptography as a Security Tool,

User Authentication, Firewalling to Protect Systems and Networks.



1 Abraham Silberschatz,

Peter Baer Galvin, Greg

Gagne

Operating System concepts Ninth Edition, Wiley, 9th Edition,

2015



1 William Stallings Operating Systems-Internals and

Design Principles Fifth Edition, Pearson Education (2007)

2 Achyut S Godbole Operating Systems Second Edition, TMH (2007).

3 Flynn/McHoes Operating Systems Cengage Learning (2008).

4 Deitel & Deitel Operating Systems Third Edition, Pearson Education

(2008)


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: I LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Database Management Systems Max Marks:100


Course Objectives: 1. To understand and study the different issues involved in the design and implementation of a database system. 2. To understand and use data manipulation language to query, update, and manage a database and familiar with

the relational database theory, and be able to write relational algebra expressions for queries. 3. To learn the sound design principles for logical design of databases, including the E-R modeling, UML

modeling and Normalization approach. 4. To know with basic database storage structures and access techniques: file and page organizations, indexing

methods including B-tree, B+-tree and Hashing. 5. To develop an understanding of essential DBMS concepts such as database security, integrity, concurrency,

distributed database and client/server database.

Course Outcomes: 1. To have good understanding on basics of database design and implementation, and conceptual modeling

techniques. (PO4) (PO3) (PSO2) 2. To be able to specify, modify and retrieve the data. (PO1) (PO4) (PSO1) 3. Get acquainted with the sound design principles of databases, including the E-R modelling and Normalization

approach.(PO2) (PO4) (PSO1) 4. Understand basic database storage structures and access techniques. (PO3) (PSO1) 5. Understand the logical units of database processing, non-interference property. (PO1) (PSO1)

UNIT I Databases And Database Users: Introduction, An Example, Characteristics of the Database Approach,

Actors on the Scene, Workers behind the Scene, Advantage of Using the DBMS Approach. Database System Concepts and Architecture: Data Models, Schemas, and Instances, Three-Schema Architecture

and Data Independence, Database Languages and Interfaces, The Database System Environment, Centralized and

Client/Server Architectures for DBMSs. The Relational Data Model and Relational Database Constraints: Relational Model Concepts, Relational Model

Constraints and Relational Database Schemas, Update Operations, Transactions, and Dealing with Constraint

Violations.

UNIT II Basic SQL: SQL Data Definition and Data Types, Specifying Constraints in SQL, Basic Retrieval

Queries in SQL, INSERT, DELETE, and UPDATE Statements in SQL. More SQL: More Complex SQL Retrieval Queries,Views (Virtual Tables) in SQL, Schema Change Statements in

SQL. The Relational Algebra and Relational Calculus: Unary Relational Operations: SELECT and PROJECT,

Relational Algebra Operations from Set Theory, Binary Relational Operations: JOIN and DIVISION, Additional

Relational Operations, Examples of Queries in Relational Algebra, The Tuple Relational Calculus, The Domain

Relational Calculus.

UNIT III Data Modeling Using the Entity-Relationship (ER) Model: Using High-Level Conceptual Data Models for

Database Design, Entity Types, Entity Sets, Attributes, Keys, Relationship Types, Relationship Sets, Roles,

Structural Constraints, Weak Entity Types, ER Diagrams, Naming Conventions, Design Issues. The Enhanced Entity-Relationship (EER) Model: Subclasses, Superclasses, Inheritance, Specialization and

Generalization, Constraints and Characteristics of Specialization and Generalization Hierarchies, Modeling of

UNION Types Using Categories, A Sample UNIVERSITY EER Schema, Design Choices, Formal Definitions. Functional Dependencies: Introduction, Basic Definitions, Trivial and Non-Trivial Dependencies, Closure of set of

Dependencies, Closure of set of Attributes, Irreducible sets of dependencies.


Further Normalization 1NF, 2NF, 3NF, BCNF: Introduction, Nonloss decomposition and functional

dependencies, 1st, 2

nd and 3

rd normal forms, Boyce-Codd Normal Form.Multivalued Dependency and Fourth

Normal Form, Join Dependencies and Fifth Normal.

UNIT IV Disk Storage, Basic File Structures and Hashing: Secondary Storage Devices, Buffering of Blocks,

Placing File Records on Disk, Operations on Files, Files of Unordered Records (Heap Files), Files of

Ordered Records (Sorted Files),Hashing Techniques, Parallelizing Disk Access Using RAID Technology. Indexing Structures for Files: Types of Single-Level Ordered Indexes, Multilevel Indexes, Dynamic Multilevel

Indexes Using B-Trees and B+-Trees.

UNIT V Introduction to Transaction Processing Concepts and Theory: Introduction to Transaction Processing,

Transaction and System Concepts, Desirable Properties of Transactions, Characterizing Schedules Based

on Recoverability, Characterizing Schedules Based on Serializability, Transaction Support in SQL. Concurrency Control Techniques: Two-Phase Locking Techniques for Concurrency Control, Concurrency

Control Based on Timestamp Ordering, Multiversion Concurrency Control Techniques, Validation (Optimistic)

Concurrency Control Techniques, Granularity of Data Items and Multiple Granularity Locking, Using Locks for

Concurrency Control in Indexes. Distributed Databases: Distributed Database Concepts, Types of Distributed Database Systems, Distributed

Database Architectures, Data Fragmentation, Replication, and Allocation Techniques for Distributed Database

Design.



Chapters 1 Ramez Elmasri,

Shamkant B. Navathe Fundamentals of

Database Systems. Pearson Education, Seventh Edition, 2017

2 C.J. Date, A.Kannan,

S.Swamynathan An Introduction to

Database Systems VII Edition Pearson Education (2006).



1 Peter Rob, Carlos

Coronel Database System-Design,

Implementation and Management Eigth Edition, Thomson (2008)

2 Raman A Mata-Toledo,

Panline K. Cushman Database Management Systems Schaum’s Outlines, TMH (2007)

3 Steven Feuerstein Oracle PL/SQL-Programming 10th Anniversary Edition,

OREILLY (2008)



Semester: II LTP Hours/per week: 4 - -


Title of the Paper: CA2T5 Max Marks:100

Course Code: Probability and Statistics Course: M.C.A

Course Objectives: 1. To help the students in getting a thorough understanding of the fundamentals of probability and usage of

statistical techniques like testing of hypothesis, ANOVA and Design of experiments. Course Outcomes: 1. It is expected that the students are capable enough to calculate probabilities of events and Expectations of

random variables for elementary problems. 2. It is expected that the students would recognize situations in which it is appropriate to consider the relevance of

the Normal distribution and/or the Exponential distribution. 3. It is expected that the students, given a distribution, apply basic principle estimators (mean and variance) which

exhibit desirable properties. 4. It is expected that the students, given a sample situation, formulate a hypothesis and carryout appropriate tests to

check its acceptability. 5. It is expected that the students recognize circumstances under which it is appropriate to investigate relationships

between variables and estimate the prediction value.

UNIT I Theory of Probability: Axiomatic Approach to Probability, Law of Addition of Probabilities, Multiplication Law

of Probability and Conditional Probability, Bayes Theorem and simple problems Random Variables: Discrete Random Variable-Definition, Properties, Probability Mass Function and simple

problems,Continuous Random Variable – Definition, Properties, Probability Density Function and simple problems Distribution-Functions (Cumulative Distribution Function): Distribution Function- Discrete random variables,

Distribution Function-Continuous random variables, Properties of Distribution Function, Simple Problems.

UNIT II Mathematical Expectation and Generating Functions: Mathematical Expectation, Properties of mathematical

expectation, Variance and Covariance, Properties of variance and Covariance. Probability Distributions-Discrete Probability Distributions: Binomial Distribution- Definition, Properties and

Applications of Binomial distributions, Simple problems, Poisson Distribution-Definition, Properties and

Applications of Binomial distribution, Simple problems. Probability Distributions-Continuous Probability Distributions: Normal Distribution- Definition, Properties and

Applications of Normal distribution, Simple problems using area property, The Exponential Distribution-Definition,

Properties and Applications of Exponential distribution, Weibul Distribution-Definition, Properties and

Applications of Weibul Distribution

UNIT III Correlation Analysis: Correlation-Definition, Types of correlation, Methods of studying correlation: Scatter

Diagram, Karl Pearson coefficient of correlation, Spearman’s Rank correlation, Properties of coefficient of

correlation, Simple problems- Bivariate Distribution-ungrouped data and using properties Regression Analysis: Lines of Regression , Regression Coefficients , Properties of Regression

Coefficients, Simple problems- Bivariate Distribution– ungrouped data and using properties

UNIT IV Test of hypothesis: Populations and samples, Statistical hypothesis-Null and Alternative Hypothesis, Level of

Significance, Type I and Type II errors, One tail, two-tail tests, Procedure for Test of significance. Large Sample Tests: Test based on the normal distribution-Z-test for single mean, Difference of means,

Single proportion, Difference of proportions and simple problems. Small sample Tests-I: t-test: t- distribution-properties and applications, t- test for single mean, Difference of

means, paired t-test and simple problems


UNIT V Small Sample test- Chi-Square and F- distributions:. Chi-square distribution-properties and applications,

Chi-Square test of goodness of fit and independence of attributes,F-distribution-properties and applications,

F-test for difference of two population variances. Analysis of variance: One way classification, Two-way classification, ANOVA Table, imple Problems



1 Dr.J.Ravichandran Probability & Statistics for

Engineers Wiley India Pvt. Limited,

2010

2 E.Rukmagadachar&E.kesha

va Reddy Probability &Statistics Pearson Publisher



1 S.C.Gupta, V.K.Kapoor Fundamentals of Mathematical

Statistics Sultan Chand, 11/e, 2002

2 S.C. Gupta and V.K.Kapoor Fundamentals of Applied

Statistics Sultan Chand & Sons;

Fourth edition (2014), New

Delhi


APPENDIX - III SYLLABI FOR III SEMESTER

Course Objectives: 1. Analyze the asymptotic performance of algorithms. 2. Demonstrate a familiarity with major algorithms and data structures. 3. Apply important algorithmic design paradigms and methods of analysis. 4. To develop algorithms for sorting, searching, insertion and matching. 5. To acquire knowledge in NP Hard and complete problem.

Course Outcomes: 1. Understanding basic ideas about algorithms and the concept of data structures. (PO4)(PSO1) 2. Computing complexity measures of algorithms, including recursive algorithms using recurrence relations.

(PO2) (PSO2) 3. Applying the design techniques to solve complex problems. (PO3)(PO1)(PSO1) 4. Analyzing the problems based on their space and time complexities. (PO2) (PSO2) 5. Ability to categorize the problems as NP-Hard and NP -Complete problems. (PO1) (PO7) (PSO1)

UNIT I Introduction: What IS Algorithm, Algorithm Specification Pseudocode Conventions, Recursive Algorithms,

Performance Analysis: Space Complexity Time Complexity, Asymptotic Notation, Performance Measurement,

Randomized Algorithms: Basics of Probability Theory, Randomized Algorithms Identifying the Repeated Element,

Primality Testing: Advantages and Disadvantages. Elementary Data Structures: Stacks and Queues, Trees: Terminology, Binary Trees, Dictionaries: Binary Search

Trees, Priority Queues, Heaps, Heap sort , Sets and Disjoint Set Union: Introduction-Union and Find Operations,

Graphs: Introduction, Definitions, Graph Representations.

UNIT II Divide -and -Conquer: General Method, Defective Chess Board, Binary Search, Finding Maximum and Minimum,

Merge Sort, Quick Sort, Selection Problem, Strassen's Matrix Multiplication, Convex Hull: Some Geometric

Primitives, The Quick Hull Algorithm, Graham's Scan, An O(nlogn) Divide and Conquer Algorithm. The Greedy Method: The General Method, Container Loading, Knapsack Problem, Tree Vertex Splitting, Job

Sequencing with Deadlines, Minimum Cost Spanning Trees: Prim's Algorithm, Kruskal's Algorithm, Optimal

Storage on Tapes, Optimal Merge Patterns, Single Source Shortest Paths.

UNIT III Dynamic Programming: The General Method, Multi Stage Graphs, All Pairs Shortest Paths, Single Source

Shortest Paths, Optimal Binary Search Trees, String Editing -0/1 Knapsack, Reliability Design, The Traveling Sales

Person Problem, Flow Shop Scheduling. Basic Traversal and Search Techniques: Techniques for Binary Trees, Techniques for Graphs: Breadth First

Search and Traversal-Depth First Search, Connected Components and Spanning Trees, Bi-Connected Components

and DFS.

UNIT IV Backtracking: The General Method, The 8-Queens Problem, Sum of Subsets, Graph Coloring, Hamiltonian

Cycles, Knapsack Problem. Branch and Bound : The Method: Least Cost Search, The 15 Puzzle Control Abstractions for LC Search,

Bounding, FIFO Branch and Bound , LC Branch and Bound, 0/1 Knapsack Problem, LC Branch and Bound

Solution, FIFO Branch and Bound Solution, Traveling Sales person.

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: III LTP Hours/per week: 3 1 - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Design & Analysis of

Algorithms Max Marks:100



UNIT V NP-Hard and NP -Complete Problems: Basic Concepts: Non Deterministic Algorithms, The Classes NP Hard and

NP Complex, Cook's Theorem, NP Hard Graph Problems, Clique Decision Problem, Node Cover Decision Problem

Chromatic Number Decision Problem, Directed Hamiltonian Cycle, Traveling Sales Person Decision Problem,

AND/OR Graph Decision Problem, NP-Hard Scheduling Problems, Scheduling Identical Processors, Flow Shop

Scheduling, Job Scheduling, NP-Hard Code Generation Problems, Code Generation With Common Sub

Expressions, Implementing Parallel Assignment Instructions, Some Simplified NP-Hard Problems.


S.No

.


1 Sartaj Sahni Fundamentals of Computer

Algorithms Second Edition, Universities

Press (2008)


S.No

. Author Title Publisher

1 Anany Levitin Introduction to the Design & Analysis

of Algorithms Second Edition, Pearson

Education (2007) 2 I.Chandra Mohan Design and Analysis of Algorithms PHI

3 Prabhakar Gupta,

Vineet Agrawal Design and Analysis of Algorithms PHI

4 Parag Himanshu, Dave Design and Analysis of Algorithms Pearson Education (2008)



Semester: Second LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Computer Networks Max Marks:100

Course Code: CA3T2 Course: M.C.A Course Objectives: At the end of this course students will be able to 1. Learn functionality of layered network architecture, Different types of network topologies 2. Learn various network devices and their functions within a network 3. Learn IP address and various routing algorithms used inter networking 4. Learn different transport layer protocols 5. Learn various application layer protocols, applications and security issues over Internet

Course Outcomes: At the end of this course students will be able to 1. Understand functionality of layered network architecture, Different types of network topologies.

(P03)(P04) 2. Understand various network devices and their functions within a network. (P04) (PS01) 3. Understand the IP address and various routing algorithms used internetworking.(P04)(PS02) 4. Understand different transport layer protocols 5. Understand the various application layer protocols and security issues over Internet.(P03)(PS02)

UNIT I Introduction: Uses of Computer Networks: Business Application, Home Applications, Mobile Users, Social

Issues,Network Hardware: Local Area Networks, Metropolitan Area Networks, Wide Area Networks, Wireless

Networks, Home Networks, Internetworks, Network Software: Protocol Hierarchies, Design Issues for the Layers,

Connection Oriented and Connectionless Services, Service Primitives, The relationship of Services to Protocols,

Reference Models: The OSI Reference Model, The TCP/IP Reference Model, A Comparison of OSI and TCP/IP

Reference Model, A Critique of the OSI Model and Protocols, A Critique of the TCP/IP reference model, Example

Networks: The Internet, The Third Generation Mobile Phone Networks, Wireless LANs, RFID and Sensor

Networks. Physical Layer: Guided Transmission Media: Magnetic Media, Twisted Pair, Coaxial Cable, power lines ,Fiber

Optics Data Link Layer: Data Link Layer Design Issues: Services Provided to the Network Layer, Framing, Error

Control, Flow Control, Error Correcting Codes, Error Detecting Codes, Elementary Data Link Protocols: An

Utopian Simplex Protocol, A Simplex Stop and Wait Protocol, A Simplex Protocol for a Noisy Channel, Sliding

Window Protocols: A One Bit Sliding Window Protocol, A Protocol Using Go Back N, A Protocol using Selective

Repeat

UNIT II The Medium Access Control Sub Layer: Ethernet: Ethernet Cabling, Manchester Encoding, The Ethernet MAC

sub layer Protocol, The Binary Exponential Backoff Algorithm, Ethernet Performance , Switched Ethernet , Fast

Ethernet , Gigabit Ethernet, 10-bit Gigabit Ethernet , Wireless Lans: The 802.11 Protocol Stack, The 802.11

Physical Layer, The 802.11 MAC Sub Layer Protocol, The 802.11 Frame Structure, Bluetooth: Bluetooth

Architecture, Bluetooth Applications, The Bluetooth Protocol Stack, The Bluetooth Radio Layer, The Bluetooth

Link Layers, The Bluetooth Frame Structure, Data Link Layer Switching: Uses of Bridges, Learning Bridges

,Spanning Tree Bridges, Remote Bridges, Repeaters, Hubs, Bridges, Switches, Routers and Gateways, Virtual

LANs.

UNIT III The Network Layer: Network Layer Design Issues: Store and Forward Packet Switching, Services provided to the

Transport Layer, Implementation of Connectionless Services, Implementation of Connection Oriented Services,

Comparison Of Virtual Circuit and Datagram subnets. Routing Algorithms : The Optimality Principle, Shortest

Path Routing, Flooding , Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast Routing,

Multicast Routing. Internet Working: How Networks Differ, How Networks can be connected, Concatenated


Virtual Circuits, Connectionless Internetworking, Tunneling, Internetwork Routing, Packet Fragmentation, The

Network Layer in the Internet: The IPVersion 4 Protocol, IP address, Internet Control Protocols, OSPF, The

Internet Gateway Routing Protocol, BGP, The Exterior Gateway Routing Protocol.

UNIT IV The Transport Layer: The Transport Service: Services provided to the Upper Layers, Transport Services

Primitives, Berkeley Sockets. Elements of Transport Protocols: Addressing, Connection Establishment,

Connection Release, Flow Control and Buffering, Multiplexing. The Internet Transport Protocols: Introduction to

UDP: Remote Procedure Call, The Real Time Transport Protocol. The Internet Transport Protocols: TCP

Introduction to TCP, The TCP Service Model, the TCP Protocol, The TCP segment header, TCP connection

establishment, TCP connection release, Modeling TCP connection management, TCP Sliding Window TCP

congestion Control, TCP Timer Management, Future of TCP.

UNIT V The Application Layer: DNS: The Domain Name System: The DNS Name Space, Resource Records, Name

Servers. Electronic Mail: Architecture and Services, The User Agent, Message Formats, Message Transfer, Final

Delivery. The World Wide Web: Architecture Overview, Static Web Pages, Dynamic Web Pages and Web

Applications. HTTP- The Hyper Text Transfer Protocol. Streaming Audio and Video: Digital Audio, Digital

Video, Streaming Stored Media, Streaming Live Media, Real Time Conferencing. Network Security: Introduction

to cryptography, Public Key algorithms-RSA.

Prescribed Text Book Author Title Publisher 1 Andrew S.

Tanenbaum Computer Networks Fifth Edition, PHI

Chapters: 1.1 to 1.5, 2.2, 3.1 to 3.4, 4.3, 4.4, 4.6, 4.8

5.1, 5.2.1 to 5.2.8, 5.5, 5.6.1 to 5.6.4,5.6.6,5.6.7 6.1.1 to

6.1.3, 6.2.1 to 6.2.5, 6.4, 6.5, 7.1 ,7.2, 7.3.1 to 7.3.4, 7.4.1

to 7.4.5 ,8.1.1,8.3.1

Reference books


1 James F.Kurose, Keith

W.Ross Computer Networking Third Edition, Pearson

Education

2 Behrouz A Forouzan Data Communications and

Networking Fourth Edition, TMH (2007)

3 Michael A. Gallo, William

M. Hancock Computer Communications and

Networking Technologies Cengage Learning (2008)


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: III LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Web Technologies Max Marks:100


Course Objectives: To make the students 1. Familiar with Client/Server Architecture and able to develop a Web Application using Java

Technologies. 2. To gain the skills and Project-Based Experience needed for entry into Web Application and Development

careers.

Course Outcomes: 1. Students are able to describe the concepts of WWW including browser and HTTP protocol and various HTML

tags and use them to develop the user friendly web pages. (PO2)(PSO1) 2. Students will be able to use the JavaScript and VBScript to develop the dynamic web pages. (PO4) (PO5) 3. Students will be able to define the CSS with its types and develop the modern web pages using the HTML and

XML elements with different layouts as per need of applications. (PO4) (PSO1) 4. Students use server side scripting with PHP to generate the web pages dynamically using the database

connectivity. (PO2) (PO5) (PSO2) 5. Develop the modern Web applications using the client and server side technologies and the web design

fundamentals. (PO6) (PO1)

UNIT I Introduction: What is Internet, History of Internet, Internet Services and Accessibility, Uses of the Internet,

Protocols, Web Concepts: The Client/Server Model, Retrieving Data from the Web, How the Web Works?, Web

Browsers, Searching information on the Web, Internet Standards. HTML: Outline of an HTML Document, Head Section Body Section: Headers, Paragraphs, Text Formatting,

Linking, Internal Linking, Embedded Images, Lists, Tables, Frames, Other Special Tags and Characters, HTML

Forms.

UNIT II Java Script: Introduction to Scripting, Control Statements I, Control Statements II, Functions, Arrays, Objects,

Document Object Model, Events. VB Script: Introduction, Embedded VBScript code in an HTML Document, Comments, Variables, Array

Variables, Operator, Assignment Operators, Numerical Operators, String Concatenation, Procedures, Sub

Procedure, Function Procedure, Conditional Statements, Looping Statements, Object and VB script, Cookies,

Cookie Variables, Creating a Cookie, A Cookie with Multiple Values, Reading Cookie Value.

UNIT III Dynamic HTML (DHTML): Introduction, Cascading Style Sheets (CSS), Coding CSS, Properties of Tags,

Property Values, Other Style Properties, In Line Style Sheets, Embedded Style Sheets, External Style Sheets,

Grouping, Inheritance, Class as Selector, ID as Selector, Contextual Selector, Pseudo Classes and Pseudo Elements,

Positioning, Backgrounds, Element Dimensions, DHTML Document Object Model and Collections, Using the

Collections All, Moving Object around the Document, Event Handling, Assigning Event Handlers, Event Bubbling,

Filters and Transition Filters, Transitions, Data Binding, Using Tabular Data Control, Sorting Data, Dynamic

Sorting, Filtering. XML: Introduction, HTML vs. XML, Syntax of XML Document, XML Attributes, Use of elements vs. Use of

Attributes, XML Validation, Well Formed XML Documents, Valid XML Documents, XML DTD: internal DTD,

external DTD, the buildings blocks of XML documents, DTD Elements: Declaring an Element, Empty Elements,

Elements with Data, Elements with Children, Wrapping, Declaring only one Occurrence of the Same Elements,

Declaring Minimum one Occurrence of the Same Element, Defining Zero or One Occurrence of the Same Element,

Declaring Mixed Content, DTD Attributes: Declaring Attributes, Default Attribute Value, Implied attribute,

required attribute, fixed attribute value, enumerated attribute values, DTD Entries, DTD Validation, XSL, XSL

Transformation, XML NameSpaces, XML Schema.


UNIT IV Servlets: Introduction, Advantages of Servlets over CGI, Installing Servlets, The Servlet Life Cycle, Servlets API,

A Simple Servlet, Handling HTTP Get requests, Handling HTTP Post Requests, Cookies, Session Tracking, Multi

Tier Applications using Database Connectivity, Servlets Chaining. PHP: Introduction, PHP basics, String Processing and Regular Expressions, Form Processing and Business Logic,

Connecting to a Database, Using Cookies, Dynamic Content, Operator Precedence Chart.

UNIT V Java Server Pages (JSP): Introduction, Advantages of JSP, Developing first JSP, Components of JSP, Reading

Request Information, Retrieving the Data Posted from a HTML File to a JSP File, JSP Sessions, Cookies, Disabling

Sessions. Active Server Pages (ASP): Introduction, Advantages of ASP, First ASP Script, Processing ASP Scripts with

Forms, Variables and Constructs, Subroutines, Include/Virtual, ASP Cookies, ASP Objects, Connecting to Data

with ASP.



1 N.P.Gopalan, J.Akilandeswari

Web Technologies-A Developer’s

Perspective PHI(2008)

2 Harvey M. Deitel and Paul 1. Deitel

Internet and World Wide Web How To Program, 5e

Prentice Hall; 4th edition

Reference Text Books S.No. Author Title Publisher 1 Robert W. Sebesta Programming the world wide

web. Third Edition, Pearson

Education (2007) 2 Anders Moller and

Michaelschwarzbach An Introduction to XML and

web technologies. Addison Wesley (2006)

3 Chris Battes Web programming-Building

Internet Application. Second Edition, Wiley (2007).

4 Jeffrey C. fackson Web Technologies- Computer

Science Perspective. Pearson Education (2008).


Course Objectives:

To understand

6. Basic knowledge on software engineering methods and practices, general understanding of software process

models and agile development. 7. Knowledge of core principles, requirements & modelling concepts. 8. Understand different software testing approaches and various aspects of software quality assurance. 9. Represent various process & project management concepts. 10. Estimate software projects, & performs formal methods modelling.

Learning Outcomes:

Upon successful completion of this course, the student gains complete knowledge on: 6. Basic knowledge on software engineering methods and practices, general understanding of software process

models and agile development.(PO2)(PO7)(PSO2) 7. Core principles, requirements & modelling concepts. (PO2)(PSO2) 8. Different software testing approaches and various aspects of software quality assurance.(PO1)(PO7)(PSO2) 9. Various process & project management concepts.(PO1)(PO7)(PSO2) 10. Estimating software projects & performs formal methods modelling. (PO1)(PO7)(PSO2)

UNIT I Software and Software Engineering: The Nature of Software: Defining Software, Software Application Domains,

Legacy Software, The Unique Nature of WebApps, Software Engineering, The Software Process, Software

Engineering Practices: The Essence of Practice, General Principles, Software Myths. Process Models: A Generic Process Model: Defining a Framework Activity, Identifying a Task Set, Process

Patterns, Process Assessment and Improvement, Prescriptive Process Models:The Waterfall Model, Incremental

Process Models, Evolutionary Process Models, Concurrent Models, A Final Word on Evolutionary Processes,

Specialized Process Models: Component-Based Development, The Formal Methods Model, Aspect-Oriented

Software Development, The Unified Process:A Brief History, Phases of the Unified Process, Personal and Team

Process Models: Personal Software Process (PSP), Team Software Process (TSP). Agile Development: What Is Agility, Agility and the Cost of Change, What Is an Agile Process: Agility

Principles, The Politics of Agile Development, Human Factors, Extreme Programming (XP): XP Values, The XP

Process, Industrial XP, The XP Debate, Other Agile Process Models: Adaptive Software Development (ASD),

Scrum, Dynamic Systems Development Method (DSDM), Crystal, Feature Driven Development (FDD), Lean

Software Development (LSD), Agile Modeling (AM), Agile Unified Process (AUP).

UNIT II Principles that Guide Practice: Core Principles: Principles That Guide Process, Principles That Guide Practice,

Principles That Guide Each Framework Activity: Communication Principles, Planning Principles, Modeling

Principles, Construction Principles, Deployment Principles Requirements Modeling: Scenarios, Information, and Analysis Classes: Requirements Analysis: Overall

Objectives and Philosophy, Analysis Rules of Thumb, Domain Analysis, Requirements Modeling Approaches,

Scenario-Based Modeling: Creating a Preliminary Use Case, Refining a Preliminary Use Case, Writing a Formal

Use Case, UML Models That Supplement the Use Case: Developing an Activity Diagram, Swimlane Diagrams. Data Modeling Concepts: Data Objects, Data Attributes, Relationships, Class-Based Modeling: Identifying

Analysis Classes, Specifying Attributes, Defining Operations, Class-Responsibility-Collaborator (CRC) Modeling,

Associations and Dependencies, Analysis Packages.

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: III LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Software Engineering Max Marks:100



UNIT III Software Quality Assurance: Background Issues, Elements of Software Quality Assurance, SQA Tasks, Goals,

and Metrics: SQA Tasks, Goals, Attributes, and Metrics, Formal Approaches to SQA, Statistical Software Quality

Assurance: A Generic Example, Six Sigma for Software Engineering, Software Reliability: Measures of Reliability

and Availability, Software Safety, The ISO 9000 Quality Standards, The SQA Plan. Software Testing Strategies: A Strategic Approach to Software Testing:Verification and Validation, Organizing

for Software Testing, Software Testing Strategy-The Big Picture, Criteria for Completion of Testing, Strategic

Issues, Test Strategies for Conventional Software: Unit Testing, Integration Testing, Test Strategies for Object-

Oriented Software: Unit Testing in the OO Context, Integration Testing in the OO Context, Test Strategies for

WebApps, Validation Testing: Validation-Test Criteria, Configuration Review, Alpha and Beta Testing, System

Testing: Recovery Testing, Security Testing, Stress Testing, Performance Testing, Deployment Testing, The Art of

Debugging:The Debugging Process, Psychological Considerations, Debugging Strategies, Correcting the Error Testing Conventional Applications: Software Testing Fundamentals, Internal and External Views of Testing,

White-Box Testing, Basis Path Testing: Flow Graph Notation, Independent Program Paths, Deriving Test Cases,

Graph Matrices, Control Structure Testing: Condition Testing, Data Flow Testing, Loop Testing, Black-Box

Testing: Graph-Based Testing Methods, Equivalence Partitioning, Boundary Value Analysis, Orthogonal Array

Testing,

UNIT IV Project Management Concepts: The Management Spectrum: The People, The Product, The Process, The Project,

People: The Stakeholders, Team Leaders, The Software Team, Agile Teams, Coordination and Communication

Issues, The Product:Software Scope, Problem Decomposition, The Process: Melding the Product and the Process,

Process Decomposition,The Project, The W5HH Principles. Process and Project Metrics: Metrics in the Process and Project Domains: Process Metrics and Software Process

Improvement, Project Metrics, Software Measurement: Size-Oriented Metrics, Function-Oriented Metrics,

Reconciling LOC and FP Metrics, Object-Oriented Metrics, Use-Case–Oriented Metrics, WebApp Project Metrics,

Metrics for Software Quality: Measuring Quality, Defect Removal Efficiency.

UNIT V Formal Modeling And Verification: The Cleanroom Strategy, Functional Specification: Black-Box Specification,

State-Box Specification, Clear-Box Specification, Cleanroom Design: Design Refinement, Design Verification,

Cleanroom Testing: Statistical Use Testing, Certification, Formal Methods Concepts, Applying Mathematical

Notation for Formal Specification, Formal Specification Languages: Object Constraint Language (OCL), The Z

Specification Language. Estimation for Software Projects: Resources: Human Resources, Reusable Software Resources, Environmental

Resources, Software Project Estimation, Decomposition Techniques: Software Sizing , Problem-Based Estimation,

An Example of LOC-Based Estimation, An Example of FP-Based Estimation, Empirical Estimation Models: The

Structure of Estimation Models, The COCOMO II Model, The Software Equation, Estimation for Object-Oriented

Projects.



1 Roger S

Pressman Software Engineering-A

Practitioner's Approach Seventh Edition, McGraw-Hill, A Business Unit of

the McGraw-Hill Companies, Inc., 2010

Reference books Author Title Publisher

1 Sommerville Software engineering 7th

Edition, Pearson education

2 S.A.Kelkar Software Engineering - A

Concise Study PHI.

3 Waman S.Jawadekar Software Engineering TMH.

4 AH Behforooz and

Frederick J.Hudson Software Engineering

Fundamentals Oxford (2008)


Course Objectives:

1. To Formulate a real-world problem as a mathematical programming model and describe various solutions of Simplex Method

2. To solve specialized linear programming problems like transportation problems. 3. To solve specialized linear programming problems like assignment problems 4. To analysing pure strategy game dominance principle and solving mixed strategy games. 5. To construct a simple network diagram

Courses Outcomes:

After completion of the course students should able to

1. Understand the meaning, scope and role of computers in OR, Formulate the liner programming problems using

graphical method, simplex method and artificial variable techniques. (PO2)(PO7)(PSO2) 2. Recognize and formulate transportation problems and drive their optimum solution.(PO2)(PSO1)(PO7) 3. Recognize and formulate assignment problems and drive their optimum solution(PO2)(PSO1)(PSO7) 4. Students should have the knowledge and skills to understand how game theorists think and approach a strategic

problem.(PO2)(PO1)(PSO2) 5. Apply the concepts of PERT and CPM for decision making and optimally managing projects.(PO6) (PSO1)

(PO7)

UNIT I Linear programming: Nature, Meaning and Scope of Operations Research, Role of Computers in OR, Introduction

and Formulation of LP problems, Linear Programming: Graphical Solution for Two Variable Problem, Simplex

Method, Artificial Variable Technique: Big M and Two-Phase Methods

UNIT II Transportation Problem: L. P Formulation of the Transportation Problem, Tabular Representation, Initial Basic

Feasible Solution (I.B.F.S.) to Transportation Problem: North West Corner, Least Cost, Vogel’s

Approximation Methods, The Optimality Test, Transportation Algorithm, MODI(Modified Distribution Method),

Some Exceptional Cases: Unbalanced, Prohibited, Maximization Transportation Problems, Time

minimization Transportation problem, Simple Problems.

UNIT III Assignment Problem: Mathematical formulation of the problem, Hungarian method for Assignment problem,

Special cases in Assignment problems: Unbalanced, Prohibited, Maximization, Travelling Salesman Problem, A

Typical Assignment Problem, Simple Problems.

UNIT IV Game Theory: Introduction, Pure Strategy, Mixed Strategy, Two Person Zero Sum Game, Minimax-Maximin

Criteria, Solution of Games with Saddle Point, Solution of Game without Saddle Point, Principle of Dominance,

Solution of game Without Saddle Point, Graphical Method for 2×N and M×2 Games, Solution of Game without

Saddle Po

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: II LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Operations Research Max Marks:100



UNIT V Project Management: Introduction, Rules for Network Construction, Network Diagram Representation, Critical

Path Analysis-Forward Pass Calculation, Backward Pass Calculation; Float and Slack Times, Project Evaluation

and Review Technique(PERT), Simple Problems



Chapters 1 S.D.Sharma,

HimanshuSharma Operations Research Theory,

Methods and Applications Improved and Enlarged Edition, Kedar

NathRamNath& Co., Meerut. 2 Dr. R. K. Gupta Krishna’s Operations Research 27

thEdition,2010, Krishna Prakashan

Media (P) Ltd., Meerut

3 J.K.Sharma Operations Research: Theory

and Applications 5th Edition, 2013, Macmillan.

4 Hamdy Operations Research: An

Introduction A.Taha, 9th edition ,2010Prentic Hall.



Chapters 1 KantiSwarup, P.K.Gupta,

Man Mohan

Operations Research 15

th Edition, 2010, Sultan

Chand & Sons, New Delhi.


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: Second LTP Hours/per week: - - 6 Department: Computer Science (PG) No. of Credits: 3 Title of the Paper: Computer Networks &

Operating Systems Lab Max Marks:100


Course Objectives: At the end of this course students will be able to Learn Unix Shell Scripting and AWK Programming Learn Operating System Scheduling Algorithms Learn hands on preparation of Patch Cards and Network Monitoring Tools Learn Network Programming to obtain IP Address, Machine Name and Communication etc., Learn CISCO Packet Tracer to design various Networks and Algorithms

Course Outcomes: At the end of this course students will be able to 1. Write Unix Shell Scripting and AWK Programming. (P02)(P04)(PS01) 2. Implement Operating System Scheduling Algorithms.(P04)(PS01) 3. Prepare Patch Cards and Implement Network Monitoring Tools.(PS02) 4. Implement Network Programming to obtain IP address, Machine Name and Communication etc. (P04) 5. Design various networks with CISCO Packet Tracer and implement various Network Algorithms.

(P04)(P07)(PS01)(PS02)

LAB LIST PART A

Shell Scripting Introduction to basic UNIX commands. 1. Write a shell script to accept the name of the file from standard input and perform the following tests on

whether the file exists, if exists test file permissions whether file is executable, readable, writable, both read &

writable. 2. Write a script that will ask user, fullname (first, middle, last name) greet user by first name. Ask users DOB and

calculate user’s age. 3. Write a shell script which will display fibonacci series up to a given number of arguments. 4. Write a shell script to accept student number, name, marks in 5 subjects. Find total, average and grade. Display

the result of student and store in a file called stu.dat Rules: if avg >80 grade A, 71–80 grade B, 61-70 grade C,

51-60 grade D, 41-50 grade E else grade F 5. Write a shell script to accept empno, empname, and basic. Find DA, HRA, TA, PF using following rules.

Display empno, empname, basic, DA, HRA, PF, TA, GROSS SAL and NETSAL. Also store details in a file

called emp.dat. Rules: RA is 18% of basic if basic > 5000 otherwise 550 DA is 35% of basic, PF is 12% of

basic + DA, TA is 10% of basic. 6. Write a shell script to display reverse numbers from given arguments

AWK scripting 7. Write awk script for the following a. To print the numbers of even lines in a file. b. To print the numbers of Odd lines in a file. c. To Delete empty lines in a file. d. To Display lines having more than 60 characters. e. To display the lines which match the multiple patterns. f. To display the lines which do not match the patterns. g. To display the lines or records 5-9 both inclusive.


8. Write awk script for the following a. To display the lines between two patterns (both inclusive). b. To display the specified line 5 or record in a file. c. List out the files which are created in March. d. Print the total size occupied by the files in your directory. e. Print the all lines by changing in to upper case. f. Print line where fields have multiple field separators. 9. Write an awk program to display employee’s pay bill (data file may be comma separated file containing

(eno,name,basic) caluculate DA,HRA,TA,PF(basic+da)

PART B 10. Scheduling algorithms

a) Write program to implement FCFS scheduling algorithm. b) Write program to implement Round Robin scheduling algorithm. c) Write program to implement SJF scheduling algorithm. d) Write program to implement priority based scheduling algorithm.

PART C 11. Study different type of Guided media. Coaxial, UTP & OFC. Prepare straight and cross wire UTP cable. 12. Study network devices in detail (repeater, hub, switch, router, gateway). 13. Study of IP address (IPV4-classification, Sub netting, super netting, IPV6). 14. Connect the computers in a local area Network. 15. Study basic network commands (ping, finger, ftp, traceroute, nslookup, pathping, telnet, arp).

PART D (Using Java) 16. Program to fetch the IP address of a system. 17. Program to obtain the information about the (a) Host (b) Port (c) protocol. 18. Write a program to accept the Website name and return its IP address. 19. Write a program to implement Echoclient and Echoserver. 20. Write a program to use ARP. 21. Write a program to implement TCP client-server program. 22. Write a program to use File Transfer Protocol. 23. Write a program to use Simple Mail Transfer Protocol. 24. Write a program to use the Domain Name System using UDP. 25. To implement simple calculator on a remote host and invoke operations from a client using RMI. 26. Implementation of sliding window protocol. 27. Find the subnet mask and Network address for the given IP address. 28. Program to implement RPC using remote command execution.

PART E 29. Using Cisco packet tracer (freely available Current version 7) 30. Configure a network using a server with five nodes using packet tracer. 31. Configure a network using a DHCP server with five nodes using packet tracer. 32. Configure a network using two DHCP servers with nodes using packet tracer. 33. Configure a network using three DHCP servers with nodes using packet tracer. 34. Configure a network with DHCP servers with wired and wireless nodes using cisco packet tracer. 35. Exhibit spanning tree algorithms.





Title of the Paper: Web Technologies Lab Max Marks:100

Course Code: CA3L2 Course: M.C.A

Course Objectives: 1. To Build functional web applications HTML. 2. To Incorporates multimedia capabilities and web page designs using Cascading Style Sheets. 3. To Code Client-Server interaction Programs using Java based server Technology named Servlets. 4. To Create dynamic web pages wherein client interaction is facilitated using advanced server technology like

JSP. 5. To integrate offline data storage, background processes and APIs using database connectivity and ASP.

Course Outcomes: 6. Build functional web applications HTML. (PO1) (PSO1) 7. Incorporates multimedia capabilities and web page designs using Cascading Style Sheets. (PO2) (PSO1) 8. Code Client Server interaction Programs using Java based server Technology named Servlets. (PO2) (PSO1) 9. Create dynamic web pages wherein client interaction is facilitated using advanced server technology like

JSP.(PO3) (PSO1) 10. Integrate offline data storage, background processes and APIs using database connectivity and ASP.

(PO4)(PSO1)

HTML: 1. Write HTML code to provide intra document linking. 2. Write HTML code to provide inter document linking. 3. Write a program to implement the three types of lists. 4. Create a HTML page using frames. 5. Write a program to embed college picture into your web page and write a short note on your college using

paragraph tag. 6. With a suitable example, depict how we can align text using a table tag as follows.

II MCA Pass percenetage=95%

Fail percentage=5%

III MCA Pass percenetage=97%

Fail percentage=3%


7. Write a program to create the time table as follows:

8. Create a Registration form that interacts with the user. Collect login name, password, date of birth,sex,

address, qualification and display a “Thank you for registering” message when the user submits the form.

Java Script:

9. Write a script to compare two strings using String object. 10. Write a script to generate random numbers within 1 to 10 and display the numbers in a table. 11. Write a Java Script to update the information into the array, in the “onClick” event of the button “Update”. 12. Create a web page for a shopping mall that allows the user to tick off his purchases and obtain the bill with the

total being added up simultaneously.

Item details Price of

item Click here to select

Login name: Enter Password:

Reenter Password:

Birthdate:

Sex: Female Male

Enter Address

Enter qualification

Login clear


13. Write a script to find the duplicate elements of an array. 14. Write a script which generates a different greeting each time the script is executed. 15. Write a javascript to check the number is Armstrong number or not by getting the number from textbox and

the result is displayed in a alert dialog box. 16. Using functions write a java script code that accepts user name and password from user,Check their

correctness and display appropriate alert messages. VB Script:

17. Write a script that takes input from user and displays the same in upper case and lowercase. 18. Write a program to implement cookies in VB Script.

DHTML: 19. Create an inline style sheet.Illustrate the use of an embedded style sheet. 20. Create an external style sheet to illustrate the “Font” elements. 21. Write a program to switch on and off light using onClick event. 22. Illustrate different types of filters (atleast six) on a sample text. 23. Write a program to illustrate tabular data control for data binding.

8399

5000

450

399

YOUR TOTAL BILL IS 5450


XML: 24. Create a small XML file designed to contain information about student performance on a module. Each student

has a name , a roll number, a subject mark and an exam mark. 25. Create a internal DTD file. 26. Create an external DTD file. 27. Create a XSLT stylesheet to display the student data as an HTML table.

PHP: 28. Calculate the factorial of a given number using PHP declarations and expressions. 29. Write a PHP program that interacts with the user .Collect first name lastname and date of birth and displays

that information back to the user . JSP: 30. Write a program to implement JSP directives. 31. Write a JSP program for session tracking.

ASP: 32. Write a Asp program to change the background of a page based on the user’s choice. 33. Write a Asp Program to retrieve data from students table. 34. Write a Asp program to insert data into student table.


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Data Mining Techniques Max Marks:100


Course Objectives: 1. To introduce the basic concepts of Data Warehouse. 2. To know the process of constructing Data Warehouse. 3. To introduce the basic concepts of Data Mining techniques. 4. Examine the types of the data to be mined and apply preprocessing methods on raw data. 5. Discover interesting patterns, analyze supervised and unsupervised models and estimate the accuracy of the algorithms.

Course Outcomes:

1. The student will be able to understand the basics of data warehouse and the people involved in its design. (PO1) (PO3)

(PSO1)

2. Aware of constructing the data warehouse, its techniques and concepts.(PO4) (PO1) (PSO1)

3. Should be able to understand Data Mining concepts, functionalities and patterns.(PO4) (PSO1)

4. Should be able to classify the data by implementing various algorithms.(PO2) (PSO1)

5. Should be able to find the similarities among the data using algorithms.(PO1) (PSO1)

UNIT I Warehouse What is it, Who Need It, and Why? : Problems with Current Reporting Architecture, Goal of

Business Intelligence, What is Data Warehouse, Business Intelligence defers from Transaction Processing, Return

on Investment. Things to Consider: Be Pragmatic, Start with Business Requirements, What goes into Warehouse, Data Mart or

Data Warehouse, Big Bang vs. Small Iteration, Long Live RI. Managing the Data Warehouse Project: Driving force behind the Data Warehouse, Getting ready for your

Project, Picking a Target and moving forward, Project Management, Scope Statement, Work Break Down Structure,

Project Estimating, Scope Creep, Track your Project Progress. Data Warehouse Design Methodology: Information Utility, Utility’s Infrastructure, Preferred Architecture.

UNIT II Start Schema Design: Data Mart user Accessible data, Star Schema, Design Process, Summary Tables, Common

Design Complexities. Fundamentals of ETL Architecture: ETL Infrastructure, Fundamentals of ETL and Data Warehousing, ETL

Silver Bullet where to Start. Partitioning Data: Why Partition Data, Difference between Partition and Non-partitioned Objects, Partition

decisions, Types of Partitions.

UNIT III Data Mining Introduction: Data Mining on What Kind of Data, Data Mining Functionalities, Classification of

Data Mining Systems, Major Issues in Data Mining. Mining Association Rules in Large Databases: Rule Mining, Mining Single Dimensional Boolean Association

Rules From Transactional Databases, Mining Multi Dimensional Association Rules From Relational Databases and

Data Warehouses.

UNIT IV Classification and Prediction: Introduction Classification by Decision Tree Induction, Bayesian Classification,

Other Classification Methods, Classification by Back Propagation, Prediction, Classifier Accuracy.

UNIT V Cluster Analysis Introduction: Types of Data in Cluster Analysis, A Categorization of Major Clustering Methods,

Portioning Methods, Hierarchical Methods. Density Based Methods: DBSCAN, Grid Based Method: STING, Model Based Clustering Method: Statistical

Approach, Outlier Analysis.


Text Books Author Title Publisher 1 Michael Corey, Michael

Abbey, Ian Abramson,

Ben Taub

Oracle 8i Data Warehousing

TMH

2 Jiawei Han, Micheline

Kamber Data mining & Techniques

Morgan Kaufmann 3rd

Edition

Reference Books Author Title Publisher 1 Ralph Kimball The Data Warehousing Toolkit Wiley

2 S.N.Sivanandam,

S.Sumathi Data Mining-Concepts, Tasks

and Techniques Thomson



Semester: IV LTP Hours/per week: 4 - -


Title of the Paper: Mobile Computing Max Marks:100


Course Objectives: 1. To acquire knowledge about wireless networks, Internet applications. 2. To elicit the architecture of mobile computing and wireless access technologies. 3. To learn about IPV4 and IPV6. 4. To go through the working of mobile IP. 5. To gain understanding about operating system and software to develop applications in Mobile.

Course Outcomes: At the end of the course, the student will be able to: 1. Understand the basic concepts of worldwide networks, wireless transmission and generations of Mobile

systems.(PO1)(PSO1) 2. Perceive the architecture and common technologies for mobile communication. (PO4)(PSO2) 3. Grasp the IP network protocols and methods used in IP routing of packets. (PO3)(PSO1) 4. Apprehend the working of Mobile IP. (PO4)(PSO1) 5. Gains knowledge regarding the NGNs, operating systems, application development using WML, XML in

Mobiles. (PO4)(PSO1)

UNIT I Introduction: World Wide Networks:Computer Networking, Significance of TCP/IP Protocol Stack in World Wide

Networking, Internet Applications Wireless Networks: Limitations, Mobile Computing Paradigm, Promises/Novel Application Generation of Mobile Systems: Features of First Generation, Second Generation, Third Generation, Fourth

Generation and Comparison. UNIT II Mobile System Architectures: GSM:System Architecture, Functional Subsystems of GSM: Radio Interfaces,

Protocols, Handover, New Data Services GPRS: System Architecture, Protocol Layers, Comparison of GSM & GPRS Mobility Management: Location Management, Handover, Mobility Management in GSM & GPRS. Wireless Access Technologies: WPAN, Bluetooth, WLAN, Wi-Fi, WMAN, Wi-MAX.

UNIT III IPV4: Features of IPV4, Classes in IPV4 Addressing Mobile IP: Entities and Terminology, IP Packet Delivery, Agent Discovery, Registration, Tunneling and

Encapsulation, IPV6, IPV4 versus IPV6.

UNIT IV Mobile Transport Layer: Traditional TCP: Congestion Control, Slow Start, Fast Retransmit/Fast Recovery,

Implications of Mobility. Wireless TCP: Indirect TCP, Snooping TCP, Mobile TCP, Fast Retransmit/Fast Recovery, Transmission/Time out

Freezing, Selective Retransmission, Transaction Oriented TCP, TCP over 2.5/3G Wireless Networks.

UNIT V Next Generation Networks: Architecture of NGN, Core Network, Access Network, Capabilities of NGN,

Characteristics of NGN, Generalised Mobility on NGN, Transport Independent Service Paradigm. File Systems: Coda, Little Work, Ficus, Mio-NFS, Rover Mobile Operating Systems: Symbian, Android Wireless

Markup Language (WML) and WML Script, Extensible Mark up Language and its Applications.


Prescribed Text Books Author Title Publisher 1 Jochen Schiller Mobile Communications Pearson Education, Second

Edition 2002

2 Mobile Computing Rajkamal Oxford (2008)

Reference Text Book Author Title Publisher 1 Ashok K Talukder and

Roopa R Yavagal Mobile Computing TMH (2008)


Course Objectives: 6. To Identify some of the factors driving the need for network security 7. To Identify and classify particular examples of attacks 8. To define the terms vulnerability, threat and attack 9. To Identify physical points of vulnerability in simple networks 10. To Compare and contrast symmetric and asymmetric encryption systems and their vulnerability to attack, and

explain the characteristics of hybrid systems.

Learning Outcomes: On successful completion of this course, the students able to 6. Identify some of the factors driving the need for network security. (PO1)(PSO1) 7. Identify and classify particular examples of attacks. (PO2)(PSO1) 8. Define the terms vulnerability, threat and attack. (PO3)(PSO1) 9. Identify physical points of vulnerability in simple networks. (PO4)(PSO1) 10. Compare and contrast symmetric and asymmetric encryption systems and their vulnerability to attack, and

explain the characteristics of hybrid systems. (PO4) (PSO1)

UNIT I Introduction: Security Trends, The OSI Security Architecture, Security Attacks, Security Services, Security

Mechanisms, A Model for Network Security. Classical Encryption Techniques: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques,

Rotor Machines, Steganography.

Advanced Encryption Standard: Evaluation Criteria for AES, The AES Cipher.

Confidentiality using Symmetric Encryption: Placement of Encryption Function, Traffic Confidentiality, Key

Distribution, Random Number Generator.

UNIT II Public Key Cryptography and RSA: Principles of Public Key Crypto Systems, The RSA Algorithm. Key Management: Other Public-Key Crypto Systems: Key Management, Diffie-Hellman Key Exchange. Message Authentication and Hash Functions: Authentication Requirements, Authentication Functions, Message

Authentication Codes, Hash Functions, Security of Hash Functions and Macs.

UNIT III Digital Signatures And Authentication Protocols: Digital Signatures, Authentication Protocols, Digital Signature

Standard. Authentication Applications: Kerberos, X.509 Authentication Servic. Email Security: Pretty Good Privacy, S/MIME

UNIT IV IP Security: IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security

Payload Web Security: Web Security Considerations, Secure Socket Layer and Transport Layer Security.

UNIT V Intruders: Intruders, Intrusion Detection, Password Management. Firewalls: Firewall Design Principles, Trusted Systems, Common Criteria for Information Technology, Security

Evaluation.

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Cryptography & Network




Reference Text Book


1 William Stallings Network Security Essentials-

Applications and Standards Pearson Education (2007),

Third Edition.

2 Chris McNab

Network Security Assessment OReilly (2007), 2nd

Edition

3 Jon Erickson

NOSTARCH

Hacking-The Art of Exploitation Press (2006),SPD

4 Neal Krawety

Introduction to Network Security Thomson (2007).

5 Ankit Fadia

Network Security-A Hackers

Perspective Macmillan (2008)


Author Title Publisher 1 William Stallings Cryptography and Network Security

PHI, Fourth Edition


Course Objectives: Student should be able to familiarize with 1. The design of DFA’s, NFA’s and epsilon NFA’s and Converting NFA’s to DFA’s. 2. The properties of Regular Languages and Minimizing FA's. 3. Grammars of Context Free Languages and PDA’s. 4. Context-Free Languages and Turing machines. 5. Undecidable Problems.

Course Outcomes: To get familiar with 1. The student should be able to understand the different types of machine structure for regular languages.(PO2) (PSO1) 2. The student should be able to understand the laws and properties of Regular expressions and Regular languages.(PO4) (PSO2) 3. The student should be able to understand the Grammars and PDA’s.(PO1) (PSO1) 4. Ability to have knowledge of CFL and Turing machine.(PO4) (PSO1) 5. Ability to have knowledge of Undecidable problems.(PO3) (PSO2)

UNIT I Automata: The Methods and the Madness: Why study Automata Teory?, Introduction to Formal Proof,

Additional Forms of Proof, Inductive Proofs, The Central Concepts of Automata Theory. Finite Automata: An Informal Picture of Finite Automata, Deterministic Finite Automata, Nondeterministic Finite

Automata, Finite Automata With Epsilon-Transitions.

UNIT II Regular Expressions and Languages: Regular Expressions, Finite Automata and Regular Expressions, Algebraic Laws for Regular expressions. Properties of Regular Languages: Proving Language not to be Regular, Closure Properties of Regular Languages, Decision Properties of Regular Languages, Equivalence and Minimization of Automata.

UNIT III Context-Free Grammars and Languages: Context – Free Grammars, Parse Trees, Ambiguity in Grammars and

Languages. Pushdown Automata: Definition of the Pushdown Automaton, The Languages of a PDA, Equivalence of PDA’s and CFG’s, Deterministic Pushdown Automata.

UNIT IV Properties of Context Free Languages: Normal Forms for Context – Free Grammars, The Pumping Lemma for

Context – Free Languages, Closure Properties of Context- Free Languages. Introduction to Turing Machines: Problem That Computers Cannot Solve, The Turing Machine, Programming

Techniques for Turing Machines, Extensions to the Basic Turing Machines, Restricted Turing Machines, Turing

Machines and Computers.

UNIT V Undecidability: A Language That Is Not Recursively Enumerable, An Undecidable Problem That is RE,

Undecidable Problems About Turing Machines, Post’s Correspondence Problem.

P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Theory of Computation Max Marks:100





1 J E Hopcroft, Rajeev

Motwani , Jeffrey D.Ullman Introduction to Automata Theory,

Languages and Computation Pearson Education, 3

rd

Edition



1 H.R.Lewis and

C.H.Papadimitriou Elements of The theory of Computation

Second Edition, Pearson Education / PHI,

2003 2 J.Martin Introduction to Languages and the

Theory of Computation Third Edition, TMH, 2003.

3 Micheal Sipser Introduction of the Theory and

Computation Thomson Brokecole, 1997.


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Advanced Data Base

Management System Max Marks:100

Course Code: CA4T5A Course: M.C.A

Course Objectives: 1. To track the algorithms for query processing and optimization. 2. To learn the concepts of database system architecture and system catalog.

3. To follow distributed database concepts and advanced concepts of design. 4. To be familiar with object oriented databases. 5. To know OODBMS standards & emerging database technologies & applications. Course Outcomes: 1. On successful completion of this course, the students able to 2. Track the algorithms for query processing and optimization. (PO2)

3. Learn the concepts of database system architecture and system catalog.(PO1)(PO2) 4. Follow distributed database concepts and advanced concepts of design.(PO1)(PO4)(PO7) 5. Familiar with object oriented databases.(PO5)(PO7) 6. Know OODBMS standards & emerging database technologies & applications.(PO5)(PO7)

UNIT I Algorithms for Query Processing and Optimization: Translating SQL Queries into Relational Algebra,

Algorithms for External Sorting, Algorithms for Select and Join Operations, Algorithms for Project and Set

Operations, Implementing Aggregate Operations and Outer Joins, Combining Operations Using Pipelining, Using

Heuristics in Query Optimization

UNIT I I Data Base Systems Architecture and the System Catalog: System Architectures for DBMS

s, Catalogs for

Relational DBMS’s, System Catalog Information in Oracle, Practical Database Design and Tuning, Physical

Database Design in Relational Databases, An Overview of Database Tuning In Relational Systems.

UNIT III Distributed DBMS Concepts and Design: Introduction, Function and Architecture of a Distributed DBMS,

Distributed Relational Database Design, Transparencies in a Distributed DBMS, Date's Twelve Rules for

Distributed DBMS. Distributed DBMS advanced Concepts: Distributed Transaction Management, Distributed Concurrency Control,

Distributed Deadlock Management, Distributed Database Recovery, The X/Open Distributed Transaction

Processing Model, Replication Servers.

UNIT IV Introduction to Object DBMS’

s: Advanced Database Applications,Weaknesses of RDBMS’

s, Object Oriented

Concepts, Storing Objects in a Relational Database, Next Generation Database Systems, Object Oriented DBMS’s

Concepts and Design: Introduction to Object, Oriented Data Models and DBMSs, OODBMS Perspectives

Persistence, Issues in OODBMS’s, The Object Oriented Database System Manifesto, Advantages and

Disadvantages of OODBMS’s, Object Oriented Database Design.

UNIT V Object-Oriented DBMS’

s-Standards and Systems: Object Management Group-Object Database Standard

ODMG3.0, 1999-Object Store. Object Relational DBMSs: Introduction to Object, Relational Database Systems,

Third Generation Database Manifesto, Postgres, An early ORDBMS, SQL3. Emerging Database Technologies and Applications: Hadoop, Big Data Characteristics, NO SQL Databases,

BASE, Brewer's Theorem, Relationship Between CAP, ACID and No SQL Databases, Comparison with Relational

Databases, No SQL Databases Types, Comparative Study of NoSQL Products, Case Studies Using MangoDB and

Cassandra.


Prescribed Text Book Author Title Publisher 1 Elmasri Navate Fundamentals of Database

Systems

5th

Edition, Pearson

Education

2 S Ceri and Palgettgi Principles of distributed

databases TMH

3 Gaurav Vaish Getting started with No

SQL Databases

Reference Text Book Author Title Publisher 1 Ozsu Principles of Distributed

Database Systems 2nd Edition, PHI


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: TCP/IP Max Marks:100

Course Code: CA4T5B Course: M.C.A

UNIT I Introduction: Introduction to Internetworking, Overview of OSI Model TCP/IP Protocol Suite, Basics of Switching

Technologies and Switches, Comparisons of Different Models, Gateways.

UNIT II Internet Protocol: Purpose of Internet Protocol, Internet Datagram, Options, Checksum, ARP and RARP, Routing

Methods: Routing Table and Routing Module, ICMP, IGMP. IP Addresses: Introduction, Address Classification, A Sample Internet with Classful Addressing, Subnetting,

Supernetting, Classless Addressing, Security at the IP Layer, IPSec, IPv4 and IPv6 Packet Formats. UNIT III Routing Protocols: Unicast Routing Protocols Interior and Exterior Routing, RIP, OSPF, BGP,

Multicasting:Introduction, Multicast Routing, Multicast Routing Protocols, Multicast Trees, DVMRP, MOSPF,

CBT,PIM, MBONE.

UNIT IV Transport Control Protocol: TCP Operation, Segment, Sliding Window, Silly Window, Options, TCP State

Machine, Karn’s Algorithm, Congestion Control- Leaky Bucket and Token Bucket algorithms. UDP: User Datagram, UDP Operations, Checksum Calculation.

UNIT V TCP/IP over ATM Networks: ISDN and B-ISDN, ATM Reference Model, ATM Switch, Interconnection

Network, Virtual Circuit in ATM, Paths, Circuits and Identifiers, ATM Cell bTransport and Adaptation Layers,

Packet Type and Multiplexing, IP Address Binding in an ATM Network, Logical Subnet Concept and Connection

Management.

Prescribed Text Book Author Title Publisher 1 Comer Internetworking with TCP/IP PHI, Volume 1

2 Behrouz A. Forouzan TCP/IP Protocol Suite TMH

Reference Text Books Author Title Publisher 1 James F. Kurose, Keith

W. Ross Computer Networking PearsonEducation

2 Wright and Stevens TCP/IP Illustrated Pearson Education, Volume 2

3 Kenneth C. Mansfield, Jr.

James, L.Antonakes Introduction to Computer

Networks PHI





Title of the Paper: Software Testing Max Marks:100

Course Code: CA4T5C Course: M.C.A

Course Objectives: To make the students familiar with 1. Introduction of Software Testing, Taxonomy of Bugs, Flow Graphs and Path Testing Strategies.

2. Transaction Flow Testing and Data Flow Testing.

3. Domain Testing, Paths, Path Products and Regular Expressions.

4. Syntax Testing and Logic Based Testing.

5. State, State Graphs & Transition Testing and Graph Matrices &Application.

Course Outcomes: Upon successful completion of this course, the student gains complete knowledge on: 1. Software Testing, Taxonomy of Bugs, Flow Graphs and Path Testing Strategies. (PO2) (PO3)(

PO5)(PO6)(PSO1)(PSO2) 2. Transaction Flow Testing and Data Flow Testing (PO2)(PO3)(PO5)(PO6)(PSO1)(PSO2)

3. Domain Testing, Paths, Path Products and Regular Expressions. (PO2)(PO3)(PO5)(

PO6)(PSO1)(PSO2) 4. Syntax Testing and Logic Based Testing. (PO2)(PO3)(PO5)(PO6)(PSO1)(PSO2)

5. State, State Graphs & Transition Testing and Graph Matrices &Application. (PO2)(PO3)


UNIT I Introduction: Purpose of Testing, Dichotomies, Model for Testing.

Taxonomy of Bugs: Consequences of Bugs, Taxonomy of Bugs. Flow Graphs and Path Testing: Basics Concepts of Path Testing, Predicates, Path Predicates and Achievable

Paths, Path Sensitizing, Path Instrumentation, Implementation and Application of Path Testing.

UNIT II Transaction Flow Testing: Transaction Flows, Transaction Flow Testing Techniques. Dataflow Testing: Basics of Dataflow Testing, Strategies in Dataflow Testing, Application of Dataflow Testing.

UNIT III Domain Testing: Domains and Paths, Nice & ugly Domains, Domain Testing, Domains and Interface

Testing, Domains and Testability. Paths, Path Products and Regular Expressions: Path Products & Path Expression, Reduction Procedure,

Applications, Regular Expressions & Flow Anomaly Detection.

UNIT IV Syntax Testing: Why What and How, A Grammar for Formats, Test Case Generation, Implementation

and Application, Testability Tips. Logic Based Testing: Overview, Decision Tables, Path Expressions, KV Charts, Specifications.

UNIT V State, State Graphs and Transition Testing: State Graphs, Good & Bad State Graphs, State Testing,

Testability Tips.

Graph Matrices and Application: Motivational Overview, Matrix of Graph, Relations, Power of a

Matrix, Node Reduction Algorithm, Building Tools.

Note: Student should be given an exposure to a tool like JMeter or Winrunner.


Prescribed Text Book Author Title Publisher 1 Baris Beizer Software Testing Techniques Dreamtech, Second Edition.

2 Dr.K.V.K.K.Prasad Software Testing Tools Dreamtech

Reference Text Books Author Title Publisher 1 The Craft of Software Testing Brian Marick Pearson Education

2 Software Testing P.C.Jorgensen 3rd edition, Aurbach

Publications(Dist. by SPD). 3 Software Testing in the Real World Edward Kit Pearson 4 Effective Methods of Software

Testing

Perry, John Wiley 2nd Edition, 1999

5 Art of Software Testing Meyers, John Wiley

6 Software Testing N.Chauhan Oxford University Press.

7 Software Testing M.G.Limaye TMH

8 Software Testing S.Desikan, G.Ramesh Pearson

9 Foundations of Software Testing D.Graham & Others Cengage Learning.





Title of the Paper: Distributed Operating Systems Max Marks:100

Course Code: CA4T5D Course: M.C.A

Course Objectives: It helps the student learn about the operating System which enables the pupil to A program that is executed by the

processor that frequently relinquishes control and must depend on the processor to regain control. 1. To brief the processor that frequently relinquishes control and must depend on the processor to regain control. 2. The program that mediates between application programs and the hardware 3. The set of procedures that enable a group of people to use a computer system. 4. The program that controls the execution of application programs 5. An interface between applications and hardware

Course outcomes: 1. Understand the processor that frequently relinquishes control and must depend on the processor to regain

control. (PO1) (PSO1) 2. A program that mediates between application programs and the hardware. (PO2) (PSO2) 3. A set of procedures that enable a group of people to use a computer system. (PO3) (PSO2) 4. A program that controls the execution of application programs. (PO4) (PSO1) 5. An interface between applications and hardware (PO2) (PO7) (PSO1)

UNIT I Introduction to Distributed Systems: What is a Distributed System?, Hardware concepts, Software

concepts, Design issues.

Communication in Distributed Systems: Layered Protocols, ATM networks, The Client - Sever model,

Remote Procedure call, Group communication.

UNIT II Synchronization in Distributed System: Clock Synchronization, Mutual Exclusion, Election algorithms,

Atomic transactions, Deadlocks in Distributed Systems.

UNIT III Process and processors in Distributed System: Threads, System Models, Processors allocation,

Scheduling in Distributed System, Fault tolerance, Real time Distributed System.

UNIT IV Distributed File Systems: Distributed File System Design, Distributed File System implementation,

Trends in Distributed File System.

UNIT V Distributed Shared Memory: Introduction, What is Shared Memory?, Consistency models, Page based

Distributed Shared memory, Shared Variable Distributed Shared memory, Object based Distributed

Shared Memory.

Text Book

S.No Title Author

1 Distributed Operating Systems Andrew S. Tanenbanm

Reference Book

S.No Title Author

1 Advanced Concepts in Operating

Systems

Makes Singhal and Niranjan G.Shivaratna


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Cloud Computing Max Marks:100

Course Code: CA45E Course: M.C.A

Course Objectives: 1. To understand the benefits of cloud computing and virtualization. 2. To understand the services and deployment models of cloud computing. 3. To develop cloud applications using open source cloud software. 4. To understand the AAA Model. 5. To understand the challenges and benefits of mobile cloud computing. Course Outcomes: 1. Articulate the main concepts, key technologies, strengths, and limitations of cloud computing and the core

issues of virtualization. (PO3) (PSO1) 2. Understand the open source architectures and services of cloud computing. (PO4)(PO7) (PSO2) 3. Develop and deploy cloud applications using popular cloud platforms. (PO1) (PO2)(PSO1) 4. Explore the risks, consequences and costs of cloud computing and understand the implementations of AAA

model in the cloud. (PO4) (PSO1) 5. Introduce the broad perspective of Mobile Cloud Computing. (PSO2) (PO3) (PSO2)

UNIT I Era of Cloud Computing: Getting to Know the Cloud, Peer-to-Peer, Client-Server and Grid Computing, Cloud

Computing versus Client-Server Architecture, Cloud computing versus Peer-To-Peer Architecture , Cloud

computing versus Grid Computing, How we got to the Cloud, Server Virtualization versus Cloud Computing,

Components of Cloud Computing, Cloud Types, Cloud Computing Service Delivery Models. Introducing Virtualization: Introducing Virtualization and its Benefits, Implementation Levels of Virtualization,

Virtualization at the OS Level, Virtualization Structure, Virtualization Mechanisms, Open Source Virtualization

Technology, Binary Translation with Full Virtualization, Virtualization of CPU, Memory and I/O Devices,

Hardware support for Virtualization in Intex x86 Processor.

UNIT II Cloud Computing Services: Infrastructure as a Service, Platform as a Service, Language and Pass, Software as a

Service, Database as a Service. Open Source Cloud Implementations and Administration: Open-Source Eucalyptus Cloud Architecture, Open-

Source Open Stack Cloud Architecture.

UNIT III Application Architecture for Cloud: Cloud Application Requirements, Recommendations for Cloud Application

Architecture, Fundamental Requirements for Cloud Application Architecture, Relevance and use of Client-Server

architecture for Cloud Application, Service Oriented Architecture for Cloud Applications. Cloud Programming: Programming Support for Google Apps Engine, Big Table as Google’s NOSQL System,

Chubby as Google Distributed Lock Service, Programming Support for Amazon EC2, Elastic Block Store (ESB).

UNIT IV Risks, Consequences and Costs for Cloud Computing: Introducing Risks in Cloud Computing, Risk Assessment

and Management, Risk of Vendor Lock-In, Risk of Loss Control, Risk of Not Meeting Regulatory Compliances,

Risk of Resource Scarcity, Risk in Multi Tenant Environment, Risk of Failure, Risk of Failure of Supply Chain,

Risk of Malware and Internet Attacks, Risk of Inadequate SLA , Risk of Management of Cloud Resources, Risk of

Network Outages, Risks in the Physical Infrastructure, Legal Risk due to Legislation, Risks with Software and

Application Licensing, Security and Compliance Requirements in a Public Cloud, Direct and Indirect Cloud Costs,

Calculating Total Cost of Ownership for Cloud Computing, Cost Allocations in a Cloud. AAA Administration for Clouds: The AAA Model, Single Sign-On for Clouds, Industry Implementations for

AAA, Authentication Management in the Cloud, Authorization Management in the Cloud.


UNIT V Application Development for Cloud: Developing On-Premise Versus Cloud Applications, Modifying Traditional

Applications for Deployment in Cloud, Stages during the development process of Cloud Application, Managing a

Cloud Application, Using Agile Software Development for Cloud Application, Cloud Applications: What Not to do,

Static Code Analysis for Cloud Applications, Developing Synchronous and Asynchronous Cloud Applications.

Mobile Cloud Computing: Definition of Mobile Cloud Computing, Architecture of Mobile Cloud Computing,

Benefits of Mobile Cloud Computing, Mobile Cloud Computing Challenges.

Prescribed Text Books S.No Author Title Publisher

1 Kailash Jayaswal,Jagannath Kallakurchi, Donald J. Houde & Dr. Deven Shah

Cloud Computing,

Black Book Dreamtech

Press

Reference Books S.No Author Title Publisher 1 Thomas Erl, Zaigham

Mahmood, Ricardo Puttini Cloud Computing- Concepts

Technology and Architecture Pearson

2 Raj Kumar Buyya,

Christen Vecctiola, S

Tammarai selvi

Mastering Cloud Computing,

Foundations and Application

Programming

TMH


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: 4 - - Department: Computer Science (PG) No. of Credits: 4 Title of the Paper: Microprocessor and

Interfacing Max Marks:100

Course Code: CA45F Course: M.C.A

Course Objectives: 1. To introduce 8086 architecture and programming in assembly language.

2. To introduce basic concepts of interfacing memory and peripheral devices to a microprocessor.

3. To introduce serial and parallel bus standards.

4. To introduce various advanced processor architectures such as 80X86, Pentium and Multicore Processors

Course Outcomes: Upon completion of the course the student will be able to: 1. Perceive 8086 architecture and do programming in assembly language.(PO2)(PSO1) 2. Understand basic concepts of interfacing memory and peripheral devices to a microprocessor. (PO4)(PSO1) 3. Apprehend the serial and parallel bus standards.(PO4)(PSO1) 4. Understand working of I/O Interfaces.(PO4)(PSO1) 5. Learn about various advanced processor architectures such as 80X86, Pentium and Multi Core Processors, SUN

SPARC microprocessor. (PO3)(PSO1)

UNIT I Introduction: Overview of Microcomputer Systems: Hardware, Software, Addresses, General Operation of a Computer,

Microprocessors in Digital System Design. 8086 Architecture: CPU Architecture, Internal Operation, Machine Language Instruction: Addressing modes,

Instruction Formats.

UNIT II Assembler Language Programming: Assembler Instruction Format, Data Transfer Instructions, Arithmetic

Instructions: Binary Arithmetic, Packed BCD Arithmetic, Unpacked BCD Arithmetic, Branch Instructions:

Conditional Branch Instructions, Unconditional Branch Instructions, Loop Instructions, NOP and HLT Instructions,

Flag Manipulation Instructions, Logical Instructions, Shift and Rotate Instructions, Directives and Operators: Data

Definition and Storage allocation - Structures -Records - Assigning Names to Expressions - Segment

Definitions - Program Termination - Alignment Directives - Value returning attribute operators.

UNIT III Modular Programming: Linking and Relocation: Segment Combination,Access to External Identifiers, Stacks ,

Procedures: calls, returns, and Procedure Definitions -Saving and Restoring Registers - Procedure Communication

- Recursive Procedures, Interrupts and Interrupt Routines, Macros: ASM-86 Macro Facilities , Local Labels,Nested

Macros, Controlled Expansion and Other Functions. I/O Programming: Fundamental I/O Considerations, Programmed I/O, Interrupt I/O, Block Transfers and DMA

UNIT IV System Bus Structure: Basic 8086/8088 Configurations: Minimum Mode,Maximum Mode, System Bus

Timing, Interrupt Priority Management: Interrupt System Based on a Single 8259A. I/O Interfaces: Serial Communication Interfaces: Asynchronous Communication,Synchronous

Communication,Physical Communication Standards, 8251A Programmable Communication Interface, Parallel

Communication: 8255A Programmable Peripheral Interface,A/D and D/A Example, Programmable Timers and Event

Counters: Intel's 8254 Programmable Interval Timer, Interval Timer, Application to A/D, DMA Controllers.

UNIT V Advanced Microprocessors: The 80386: Introduction, Operating Modes, Processor Model, Programming Model,

The 80486: Introduction, Processor Model, Programming Model, The Pentium: Introduction, Processor Model,

Programming Model , The Pentium Evolves, The Pentium MMX, The P6 Processors: Introduction Overview, Processor

Model, New Architectural Features, ARM Processors.


Prescribed Text Books S.No Author Title Publisher

1 Yu-Cheng Liu, Glenn A Gibson Microcomputer Systems:

The 8086/8088 Family Second Edition, Pearson

Education (2008) Chapters:

1.1, 1.3 - 1.5,2.1 -2.3,3.1 -

3.10, 4.1 - 4.5, 6.1-

6.4,8.1 -8.2, 8.3.1, 9.1.1,

9.1.2, 9.1.4,9.2,9.3,9.5


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: - - 6 Department: Computer Science (PG) No. of Credits: 6 Title of the Paper: Data Mining Lab Max Marks:100


Course Objectives:


1. Understand the various kinds of tools.

2. Apply mining techniques for realistic data.

3. Understand the basic concepts in R.

4. Understand how to import and export CSV files and package installation in R.

5. Develop and visualization of data mining algorithms in R.

Course Outcomes: After completion of the course the student should be able 1. To understand the various kinds of tools.(PO3)(PSO1)





Lab List Programs: Using Weka Tool: 1. How to create and load data set in weka





5. Implement time series analysis Using R Programming: 6. Import data into R from text and excel files using read.table () and read.csv () functions.

7. Generating association rules using aprior algorithm in R 8. Implement k-Means clustering algorithm using R. 9. Implement k-Medoids clustering using R 10. Implement hierarchical clustering using R 11. Implement Density based clustering using R 12. Implement Decision tree in R using package party and rpart 13. Implement k-Nearest Neighbour using R 14. Detecting and removing outlier using R 15. Implement Linear Regression using R 16. Implement Naive Bayes classification using R 17. Finding Outlier Detection by Clustering using R 18. Implement time series analysis using R 19. Implement Outlier Detection with LOF using R 20. Implement Outlier Detection by Clustering 21. Implement Outlier Detection from Time Series 22. Implement Time Series Classification using R 23. Implement word count using R 24. Implement Time Series Decomposition using R 25. Implement Time Series Forecasting using R 26. Implement Hierarchical Clustering with Euclidean Distance 27. Implement Hierarchical Clustering with Dynamic Time Wrapping Distance


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: - - 6 Department: Computer Science (PG) No. of Credits: 6 Title of the Paper: Data Mining Lab Max Marks:100


Course Objectives:


1. Understand the various kinds of tools.

2. Apply mining techniques for realistic data.

3. Understand the basic concepts in R.

4. Understand how to import and export CSV files and package installation in R.

5. Develop and visualization of data mining algorithms in R.

Course Outcomes: After completion of the course the student should be able 1. To understand the various kinds of tools.(PO3)(PSO1)





Lab List Programs:

Using Weka Tool:

1. How to create and load data set in weka





5. Implement time series analysis

Using R Programming:

6. Import data into R from text and excel files using read.table () and read.csv () functions.

7. Generating association rules using aprior algorithm in R 8. Implement k-Means clustering algorithm using R. 9. Implement k-Medoids clustering using R 10. Implement hierarchical clustering using R 11. Implement Density based clustering using R 12. Implement Decision tree in R using package party and rpart 13. Implement k-Nearest Neighbour using R 14. Detecting and removing outlier using R 15. Implement Linear Regression using R 16. Implement Naive Bayes classification using R 17. Finding Outlier Detection by Clustering using R 18. Implement time series analysis using R 19. Implement Outlier Detection with LOF using R 20. Implement Outlier Detection by Clustering 21. Implement Outlier Detection from Time Series 22. Implement Time Series Classification using R 23. Implement word count using R


24. Implement Time Series Decomposition using R 25. Implement Time Series Forecasting using R 26. Implement Hierarchical Clustering with Euclidean Distance 27. Implement Hierarchical Clustering with Dynamic Time Wrapping Distance


P.B.Siddhartha College of Arts & Science :: Vijayawada-520 010 Semester: IV LTP Hours/per week: - - 6 Department: Computer Science (PG) No. of Credits: 6 Title of the Paper: Mobile Computing Lab Max Marks:100


Course Objectives: 1. To acquire knowledge about Mobile Operating Systems available.

2. To develop Programming Applications on a Mobile System.

3. To acquire skill to manage Data and Knowledge.

Course Outcomes: 1. At the end of the course, the student will be able to demonstrate:

2. A working understanding of the characteristics and limitations of mobile hardware devices including

their user-interface modalities.(PO1)(PSO1)

3. The ability to develop applications that are mobile-device specific and demonstrate current practice

in mobile computing contexts.(PO1) (PSO2)

4. A comprehension and appreciation of the design and development of context-aware solutions for

mobile devices.(PO4)(PSO1)

5. An awareness of professional and ethical issues, in particular those relating to security and privacy of

user data and user behavior.(PO1)(PSO2)

Lab List

1. Animate an image using WML/J2ME

2. Design of simple game using WML/J2ME

3. Design a Timer to System Time using WML/J2ME

4. Design of Calendar for any given month and year using WML/J2ME

5. Design of simple Calculator having +,* and / using WML/J2ME

6. Develop an application that uses GUI components, Font and Colours USING Android OS.

7. Implement an application that writes data to the SD card using Android OS.

8. Develop a native application that uses GPS location information using Android OS.

9. Implement an application that implements Multi threading using Android OS.

10. Implement an application that creates an alert upon receiving a message in android.


APPENDIX-IV

MODEL QUESTION PAPERS

P.B.Siddhartha College of Arts & Science III

rd Semester M.Sc. (Computer Science) Examination

CS3T3: Data Warehouseing and Data Mining

(Regulation 2017-18) Time: Three Hours Maximum: 70 Marks

Answer ALL questions All questions carry equal marks (5 × 14 Marks)

1. a) Explain the purose of managing a data warehouse. 7 Marks b) Discuss the architecture of data warehouse. 7 Marks

or 2. a) Explain in detail about scope creep? 7 Marks b) What are the ways in which progress of projects is tracked? 7 Marks

3. a) Explain data partioning and types of partions. 7 Marks b) Expalin the fundamental of ETL. 7 Marks

or 4. a) Explain star schema design in deatil. 7 Marks b) Brief the ETL versus Manual Tools. 7 Marks

5. a) Explain Association Rule Mining and state its support. 7 Marks b) State the issues of Data Mining. 7 Marks

or 6. a) Explain FP tree contruction and reduction of scans through this process. 7 Marks b) Brief Multidimensional association rule mining. 7 Marks

7 a) Expalin an algorithm for classification by Back Propagation? 7 Marks b) Explain the issues regarding Classification and Prediction? 7 Marks

or 8. a) Expain Bayes Theorem. 7 Marks b) Brief Naive Baysian Classification. 7 Marks

9. What is Cluster Analysis? Explain Types of data in Cluster Analysis? 14 Marks or

10. a) Explain STING apporach. 7 Marks b) Discuss about DBSCAN algoritm in detail. 7 Marks



CS3T5A: Principles of Distributed Database Systems



1. a) What types of Fragmentations can be applied in Distributed Databases? 14 Marks OR

b) What is Data Dictionary? Explain in detail. 7 Marks c) What is Data Cleaning? Explain in detail. 7 Marks

2. a) Describe various Access Controls Mechanisms of Distributed DBMS. 14 Marks OR

b) Describe about Data Localization in Distributed DBMS. 7 Marks c) State objectives of Query Processing. 7 Marks

3. a) Explain various Centralized Query Optimization approaches. 14 Marks OR

b) State various issues in Multi Database Query Processing . 7 Marks c) Describe about Query Translation and Execution. 7 Marks

4. a) Illustrate various Timestamp-Based Concurrency Control Algorithms. 14 Marks OR

b) State various failures in distributed DBMS. 7 Marks c) Describe about Two-Phase Commit Protocol. 7 Marks

5. a) Describe various aspects of Distributed Object Database Management. 14Marks OR

b) What is Load Balancing? Explain in detail. 14 Marks


P.B. Siddhartha College of Arts & Science, Vijayawada IV

th Semester M.Sc.(Computer Science) Examination

CS4T3A: Visual Programming Time: Three Hours Maximum: 70 Marks

Answer ALL questions All questions carry equal marks ( 5 × 14 Marks )

1. a) Create simple Note Pad Application in VB.Net by using various Windows Forms Controls. 14 Marks OR

c) Describe Polymorphism with function overloading by writing VB.Net program. 7 Marks d) What is an Exception? Explain Divide by Zero exception with try-catch-finally statement. 7 Marks

2. a) Explain various Control Flow Statements of C#.Net. 7 Marks b) List various Exceptions of C#.Net. 7Marks

OR c) What is Abstract Class? Write C#.Net Program to illustrate Abstract Class. 7 Marks d) What is a Polymorphism? Explain Polymorphism with an example program. 7 Marks

3. a) Design Tree View by using C#.Net or VB.Net Controls. 7 Marks b) Explain Required Field Validator and Range Validator Controls of ASP.Net.

7Marks OR c) Describe Site Map Path Control with example. 7 Marks d) Explain about Regular Expression Validator and Compare Validator Controls of ASP.Net. 7 Marks

4. a) By using the controls write a VB.Net program to access the employee table of the database. 14 Marks

OR b) Explain about Login Name Control and Login View Control of ASP.Net. 7 Marks c) Describe about Master Pages and Nested Master Pages. 7 Marks

5. a) Write a program to implement Data Caching in ASP.Net. 14 Marks OR

b) Create and use WCF Service in ASP.Net. 14 Marks




CS3T5C: Software Testing (Regulation 2017-18)



1. State and explain various dichotomies in Software testing. 14 Marks or

2. a) State and explain Predicate Blindness with examples. 7 Marks b) Write in detail about Predicate Interpretation and Predicate Coverage. 7 Marks

3. a) What is meant by Program’s Control Flow? How is it useful for Path Testing? 7 Marks b) State and explain various Path Selection Rules? 7 Marks

or 4. a) Write a short notes on the following 7 Marks (i) Slicing & Dicing (ii) Data Flow (iii) Debugging. b) Define Transaction & Transaction Flow Testing with an example. 7 Marks

5. a) What is meant by Domain Testing? Discuss about Nice and Ugly Domains. 7 Marks b) Write a short note on Domain Dimensionality. 7 Marks

or 6. Explain Regular Expressions and Flow Anomaly Detection with an example. 7 Marks

7.a) Explain Unreachable States and Dead States in detail?. 7 Marks b) Define State Testing? What is the impact of Bugs in State Testing. 7 Marks

or 8 . What are the rules for Boolean Algebra? Illustrate the rules to the following expression and explain. 7 Marks

9) a) Write a Partition Algorithm. 7 Marks b) Write about loops in matrix representation. 7 Marks

or 10) a) Discuss Node Reduction Algorithm. 7 Marks b) How a Node Reduction Optimization can be done. 7 Marks




CS3T5D: Mobile Computing (Regulation 2017-18)



1. a) Explain Significance of TCP/IP Protocol Stack. 14 Marks or b) i) Describe Internet Applications. 5 Marks ii) Describe Features of 1G,2G,3G,4G IN Mobile Computing. 9 Marks

2. a) Explain GSM System Architecture with a neat diagram. 14 Marks or b) i) Discuss Handover in GSM. 7 Marks

ii) Describe the features of WMAN, WiMAX. 7 Marks

3. a) i) What are the features of IPV4? 7 Marks ii) Compare IPV4 and IPV6. 7 Marks

or b) Explain about the working of IP Packet Delivery. 14 Marks

1. a) What are the Functions of Snooping Sub Layer in the TCP Protocol? How do the TCP Packets Transfer from a Mobile Node to the Receiver End? 14 Marks

or

b) Explain Mobile TCP. How does a Supervisory Host send TCP Packets to the Mobile Node and to fixed TCP Connection. 14 Marks

5. a) Explain about NGN Characteristics and architecture with a neat diagram. 14 Marks

or b) Discuss ANDROID OS Features. 14 Marks



CS4T3D: Python Programming



1. (a) How to comment specific line(s) in Python program? Write a Python program to print Fibonacci series upto n terms. 7 Marks (b) What is list in Python? Demonstrate use of any three methods of list. 7 Marks

OR (c) What is the use of islower() and isupper() method? Give the syntax and significance of raw_input() and input() methods. 7 Marks (d) Write a Python program to check whether the given no is Armstrong or not using user defined function. 7 Marks 2. (a) Explain the function that is used to retrieve the parts of URL. Write a python program to create a TCP/IP client-server chat application. 7 Marks (b) What are the differences between C and Python? 7 Marks

OR (c) How map can be used in Python program? Explain with a suitable example. Give the syntax and significance of string functions: title() and capitalize(). 7 Marks (d) Write a Python program to implement the concept of inheritance. 7 Marks

3. (a) Briefly describe the methods of regular expression. How filter can be used in Python program? Explain with a suitable example. 7 Marks (b) Write a python program to search a specific value from a given list of values using binary search method. 7 Marks

OR (c) What is duck typing philosophy of python? What is Method Resolution Order (MRO)? Explain the principles followed by MRO with example. 7 Marks (d) Write a python program to arrange the characters of a given string 'welcome' in an alphabetical order using insertion sort algorithm. 7 Marks

4. (a) Explain the types of methods available in python with a suitable example of each method. (b) Which are the different ways of creation of threads? Explain each with an example. 7 Marks

OR (c) What are the differences between abstract class and interface? Write a python program in which Maruti and Santro sub classes implement the abstract methods of the super class Car.

7 Marks (d)Create a class student with following member attributes: roll no, name, age and total marks. Create suitable methods for reading and printing member variables. Write a python program to overload ‘==’ operator to print the details of students having same marks. 7 Marks

5. (a) Explain the function which is used to retrieve the parts of URL. Read a text file in Python and print no. of lines and no. of unique words. 7 Marks (b) Explain steps to create widgets. Write Python program to display a label on clicking a push button. 7 Marks

OR

(c) Explain the major steps used to create widgets. Write a python program to display a label upon clicking a push button. 7 Marks (d) Write a Python GUI program to create three push buttons using Tkinter. The background color of frame should be different when different buttons are clicked. 7 Marks


APPENDIX - V

1. CRITERIA FOR INTERNAL ASSESSMENT IN LAB COURSES

There should be one internal practical lab examination for 15 marks at the end of each semester and the

assessment of internal practical examination is to be done for 5 marks for Written Procedure, plus 5 marks

for Program Execution, plus 5 marks for Viva-Voce / Online Test in respective Laboratory Courses

(papers). Maximum 15 marks are to be awarded for practical laboratory performance basing on the average of best

75% marks scored in completed lab exercises from the complete lab list. The schema for awarding these 15

marks is given as under:

Schema of Continuous Internal Evaluation of Individual Student for Practical Laboratory Courses Course: M.Sc.,(Computer Science) Course Code: Semester: Title of

Laboratory: Total

Number of

Exercises:

Registration Number: Name of the Student:

Exercise

Number Exercise

Name Date of

Execution Record

(5 Marks)

Execution (10 Marks)

Total (15 Marks)

Signature of Student

Signature of

Faculty

2. INTERNAL ASSESSMENT FOR SEMINAR BASED COURSES

Internal marks for seminar are based on Documentation of 25 Marks, Presentation of 10 marks, Personal

Characteristics of 5 marks and Attendance of 10 Marks. The time duration allotted for each student to deliver the seminar is 10-20 minutes.

Evaluation Method for Internal Seminar Documentation Presentation Personal

Characteristics Attendance Total

Maturity/Balanced

/Thoughtful

Presentation

Use of Audio

Visual aids

A B C D E (A+B+C+D+E)

25 Marks 5 Marks 5 Marks 5 Marks 10 Marks 50 Marks

Written

Procedure Program

Execution Viva Voce / Online Test Total

A B C D=(A+B+C)

5 Marks 5 Marks 5 Marks 15 Marks


3. EXTERNAL EVALUATION OF LAB COURSES

The external evaluation of practical examination shall comprise of 10 Marks for Lab Record, 25 Marks for

Written Procedure, 25 Marks for Program Execution and 10 Marks for Viva-Voce / Online Test. Evaluation Method for External Practical Examination

Lab Record Written Procedure

Program

Execution Viva Voce /

Online Test Total

A B C D (A+B+C+D)

10 Marks 25 25 Marks 10 Marks 70 Marks

Evaluation Criteria for allocation of the 10 Marks to Lab Record in External Practical Examination S.No. Percentage of Lab Exercises completed in the

Lab List Marks to be Awarded

1 Above or Equal to 95% 10 Marks 2 Above or Equal to 90 and below 95% 9 Marks 3 Above or Equal to 85 and below 90% 8 Marks 4 Above or Equal to 80 and below 85% 7 Marks 5 Above or Equal to 75 and below 80% 6 Marks 6 Less than 75% Not Allowed to Write Lab Examination

4. MINI PROJECT / PROJECT WORK

Internal assessment of Mini Project / Project Work will be done by the concerned Project Internal guide and

HOD for 100 marks. Evaluation Schema for Continuous Internal Assessment of Mini Project

Review-I Submission of Abstract 20 Marks Review-II Submission of Data Dictionary &

UML/ER Diagrams 20 Marks

Review-III Project Execution 30 Marks

Record Submission 30 Marks

Total 100 Marks

External evaluation will be carried out by the External Examiner appointed by the Controller of

Examinations for 100 Marks.

Every faculty member must guide a minimum of five students in Mini Project / Project Work off the

designated workload

Evaluation Schema for External Assessment of Project Work Project Record 40 Marks

Execution 100 Marks

Viva Voce 60 Marks

Total 200 Marks