0866-2565679 k. b. n. college : pg centre (autonomous)kbncollege.info/attachments/msccs.pdf · unit...

MSc (COMPUTER SCIENCE) I SEMESTER

: 0866-2565679

K. B. N. COLLEGE : PG CENTRE (AUTONOMOUS) (Sponsored by: S.K.P.V.V. Hindu High Schools Committee)

Kothapeta, Vijayawada – 520 001. UGC : CPE NAAC – ‘A’ Grade ISO 9001 : 2008 NIRF 92

nd Rank (All

India)

OOPS THROUGH JAVA MCS10117 w.e.f : 2017 - 2018 I MSC I Semester

Total No of Hours

Duration of

Instructional Hours Semester End

for Teaching -

Max Marks Credits

for Week Examination in

Learning

Hours

60 Hours

Theory Practical 3 Hours

CIA SEE 7

4

6

30

70

Course Objectives:

To make the students understand the OOPs Concepts and fundamentals of Java programming.

To expose the students to Window based applications using AWT

To make the students to design appropriate Exception Handling in Java

methods.

To make the students to understand the concepts of Threads, Files and

I/O Streams, Applets, Networking in java.

Course Outcomes:

Understand the principles of OOP

The student would become competent enough to write, debug, and document well-structured java

applications

Demonstrate good object-oriented programming skills in Java

Able to describe, recognise, apply and implement selected design patterns in Java

Understand the capabilities and limitations of Java

Be familiar with common errors in Java and its associated libraries

Develop excellent debugging skills.

Unit -1 Introduction to OOPs

(12Hrs) Problems in Procedure Oriented Approach, Features of Object Oriented Programming

Systems-Class, Object, Encapsulation, Abstraction, Inheritance, Polymorphism.

Introduction to Java: Features of Java, JVM, Differences between c++ and Java, Sample

Java programming.

Naming Conventions and Data Types and Operators in Java

Java Basics:

Control statements in Java, Input and Output, Arrays, Strings, String Buffer Class

Unit-2 Classes and Objects-Object Creation, Initializing the instance variables, access

(12Hrs) specifiers Constructors.

Methods in Java,

Inheritance: Inheritance, The Keyword ‗super‗, the protected specifier, Types of

Inheritance

Polymorphism: Polymorphism with variables, polymorphism using methods-static &

dynamic polymorphism, polymorphism with final methods

Unit-3 Abstract Classes, Interfaces and Packages:

(12Hrs) Abstract Classes,

Interfaces:

Interface, Multiple inheritance using Interfaces, Abstract classes vs. Interfaces.

Packages: Package, Different types of packages, Interfaces in Package, Creating sub

package in a package, Access specifiers in Java

Unit-4 Exception handling and Threads :

(12Hrs) Exception Handling, Handling Multiple Exceptions, Try statement, Throws Clause,

Throw Clause, Types of Exceptions.

Threads: Single Tasking, Multi-Tasking, Uses of Threads, Creating a thread and running

it, terminating the thread, thread life cycle. Thread priorities, Daemon threads,

Applications of Threads

Unit-5 Streams and files: Stream, Creating File using File Output Stream, Reading Data from

(12Hrs) a File using File Input Stream, Creating File using File Writer, Reading a File using File

Reader, Zipping and Unzipping file, Serialization of Objects.

Applets: Creating an Applet, Uses of Applets, Applet Life Cycle, Simple Applet.

JDBC: Database servers, database clients, JDBC, working with oracle database, stage in

a JDBC program, registering the driver, connecting to a database, preparing SQL

statements.

DETAILED SYLLABUS

TEXT BOOKS:

Author Title Publisher

R Nageswara rao JAVA8 Core Java Black Book.

An Integrated approach

REFERENCE BOOKS:

Author Title Publisher Venkateswarlu,EV Prasad, Learn Object Oriented Programming S CHAND

S. Chand using Java

Dr K SomaSundaram Programming in Java2 JAICO Publishing house P. Radha Krishna Object Oriented Programming through University Press

Java

: 0866-2565679



nd Rank (All

India)

COMPUTER ORGANIZATION MCS10217 w.e.f : 2017 - 2018 I MSC I Semester

Objectives:

To make the students aware of basic hardware and software concepts of

computer organization.

To make the students understand the different circuits.

To make the students learn multiplexers and decoders.

To discuss the memory hierarchy and memory types.

Learning Outcomes:

The student will be able to simplify the Boolean expressions using K-maps.

The student will be able to design combinational and sequential circuits,

The student would have good exposure with concepts like addressing modes and instruction cycles

The student would be familiar with the performance of CPU and memory operations.

Unit1(12Hr

s)

Digital Logic Circuits: Digital Computers, Logic Gates, Boolean algebra,

MapSimplification, Combinational Circuits, Flip-flops, Sequential Circuits.

Digital Components: Integrated Circuits, Decoders,Multiplexers, Registers,

ShiftRegisters,

Binary Counters, Memory Unit.

Unit2

(12Hre)

Data Representation: Data types, Complements,Fixed-point Representation,Floating-

point

representation, other binary codes, Error detection Codes. Register Transfer and

Micro

operations:Register transferlanguage, Register transfer, Bus&memory Transfers,

Arithmetic

micro operations, logic micro

Total No of Hours

for Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits

60 Hours Theory Practical

3 Hours CIA SEE

4 4 0 30 70


1 V. Rajaraman, T.Radha Krishnan

Computer Organization and Architecture

PHI

2 BehroozParhami Computer Architecture Oxford (2007)

3 ISRD group Computer Organization ace series, TMH(2007)

4 WilliamStallings ComputerOrganizationandArchitecture –

Designing forPerformance

Pearson Education(2005)

5 P.Chakraborty Computer Architecture andOrganization JaicoBooks(2008)

operations,Shiftmicrooperations,ArithmeticLogicShiftUnitBasic Computer

Organization

and Design: Instruction Codes, Computer registers, Computer Instructions, Timing and

Control, Instruction Cycle, Memory- Reference Instructions, Input-output Interrupt

Unit3

(12Hrs)

Micro programmed Control: Control memory, Address Sequencing,

MicroprogramExample, Design of control Unit.

CentralProcessingUnit: General Register Organization,StackOrganization, Instruction

Formats, Addressing Modes, Data Transfer and Manipulation, Program Control

Unit4

(12Hrs)

Computer Arithmetic: Introduction, Addition and subtraction,

Multiplicationalgorithm,Floatingpointarithmeticoperations,DecimalArithmeticunit,Dec

imalA

rithmetic operations

Unit5

(12Hrs)

Input-Output Organization: Peripheral Devices, Input-Output

Interface,Asynchronous Data Transfer, Modes ofTransfer, Priority Interrupt

MemoryOrganization: Memory Hierarchy, Main Memory, Auxiliary Memory,

Associative

Memory, Cache Memory

TEXT BOOKS:

Textbooks


1 M. Morris Mano Computer SystemArchitecture 3rd

Edition, PearsonEducation(2008). Chapters : 1,2,3,4,5.1to5.7,7,8.1

to8.7,10.2to10.5,11.1 to 11.5, 12.1 to 12.5

Reference books

: 0866-2565679



nd Rank (All

India)

DISCRETE MATHEMATICAL

STRUCTURE MCS10317 w.e.f : 2017 - 2018 I MSC I Semester

Total No of Hours

Duration of


for Teaching -

Max Marks Credits


Learning

Hours

60 Hours


CIA SEE 7

4

0

30

70

Objectives:

To make the students understand the basics of Computer Science and Mathematics.

To expose students to the logical arguments and verify the mathematical proofs.

To make the students understand the skills in solving problems on permutations and combinations,

Principle of Inclusion and Exclusion.

To make the student understand the concepts of graph theory.

Learning Outcomes:

The student will be able Validate the arguments, verify the proofs and draw inferences.

The students would be able to solve complex problems using mathematical inductions and apply

the binomial theorem to solve mathematical expressions.

The student would be able to apply different types of counting techniques.

The students would gain knowledge about trees, graphs and applications of graph coloring.

Unit1(12Hrs) The Foundations: Logic and Proofs: Proposotional Logic, Propositonal

Equivalences,

Predicates and Quantifiers, Connectives, Well-formed formulas, Truth Tables,

tautology,

equivalence implication,

Predicates : Predicative logic, Free & Bound variables, Rules of inference,

Consistency, proof of contradiction

Basic Structures: Sets , Functions

Unit2

(12Hrs)

The Fundamentals: Algorithms, the Integers and Matrices: Algorithms, The

growth of

functions,complexity of algorithms,Integers and Division ,Primes and Greatest

Common

Divisors, Mathematical Induction

Counting: Basis of counting, Pigeon hole Principle, Combinations &

Permutations, with

repetitions, Constrained repetitions, Binomial Coefficients, Binomial Multinomial

theorems,

Generalized Permutations & Combinations.

Unit3

(12Hrs)

Advanced Counting Techniques :Recurrence Relation ,Solving Linear

Recurrence

Relations, Generating Functions, Inclusion –Exclusion Principle and its

applications.

Relations: Relations and its properties, Representing Relations, Closure of

Relations,

Equivalence Relations, Partial Ordering

Unit4

(12Hrs)

Graphs: Graphs and Graph models, Graph terminology and special types of

graphs, Graph

Isomorphism, Euler and Hamilton path, Shortest path problems, Planar graphs,

Graph

coloring

Unit5

(12Hrs)

Trees: Tree Terminology , Tree traversal, Spanning Trees , Minimum Spanning

trees -

Krushkals , Prims Algorithm

Boolean Algebra: Boolean Functions, Representing Boolean functions, Logic

gates,

Minimization of Circuits

TEXT BOOKS:


1 KennethH Rosen Discrete Mathematics and Its Applications McGrawHill

2 A Kandel, TP Baker PHI.PHI.

Discrete mathematics Structures with applications to

computer science by J.P.Tremblay ,R Manohar

McGraw Hill

REFERENCE BOOKS

Author Title Publisher Thomas Koshy, Elsevier Discrete Mathematics with Applications 1

st Edition

BernandKolman, Roberty C. Busby, Sharn Cutter Ross

Discrete Mathematical Structures Pearson Education/PHI

Malik &Sen Discrete Mathematical structures Theory and

application Clenage Learning

Marc Lipson Seymour lipschutz Discrete Mathematics for Computer science 3rd

edition

: 0866-2565679



nd Rank (All

India)

OPERATING SYSTEMS MCS10417 w.e.f : 2017 - 2018 I MSC I Semester

Total No of Hours

Duration of


for Teaching -

Max Marks Credits


Learning

Hours

60 Hours


CIA SEE 7

4

6

30

70

Course Objectives

Have a fundamental understanding of the general architecture of computers.

Describe, contrast and compare different structures for operating systems.

Understand and analyse theory and implementation of: processes, resource control (concurrency etc.),

physical and virtual memory, scheduling, I/O and files.

The tradeoffs in design and implementation concepts used in the development of Operating Systems.

Learning Outcomes:

To make the students aware of features and functionalities of an operating system .

The students would be able to recognize the importance of scheduling algorithms.

The students would be able to understand the concept of deadlock handling.

To make the students understand memory management techniques and

virtual memory concepts

DETAILED SYLLABUS

Unit1

(12Hrs)

What is an operating system, Operating System Structure , Process

Management - Memory

Management - Storage Management ,System Calls ,Types of System Calls

,Interprocess

Communication - Examples of IPC Systems ,Communication in Client

Server Systems

Unit2

(12Hrs)

Multithreaded Programming, Multithreading Models , Thread Libraries ,

Process

Scheduling: Basic Concepts - Scheduling Criteria ,Scheduling Algorithms ,

Multiple

Processor Scheduling -The Critical Section Problem, Peterson's solution,

synchronization, Semaphores , Classic Problem of Synchronization -

Monitors

Unit3

(12Hrs)

Deadlocks: Deadlock Characterization -Methods for Handling Deadlocks

,Deadlock

Prevention -, Deadlock Avoidance, Deadlock Detection, Recovery from

Deadlock,

Memory Management Strategies, Swapping, Contiguous Memory

Allocation, Paging -

Structure of the Page Table page replacement algorithm

Unit4

(12Hrs)

File System: File Concept - Access Methods , Directory Structure ,File

System Mounting

Files haring - Protection, File System Structure - File System

Implementation - Directory

Implementation - Allocation Methods.

Unit5

(12Hrs)

Secondary Storage Structure: Overview of Mass Storage Structure, Disk

Structure, Disk

Scheduling, Disk Management, Swap Space Management, RAID structure,.

I/O Systems:

Overview ,I/O Hardware ,Application I/O Interface .

TEXT BOOKS:

AUTHOR TITLE PUBLISHER

AbrahamSilbersChatz,Peter Baer Galvin, Greg Gagne

OPERATING SYSTEMS PRINCIPLES 7Th

Edition, Wiley

REFERENCE BOOKS:


WiiliamStalings Operating System internals and Design Principles 5th

edition pearson

Deitel&Deitel Operating Systems 3rd

Edition Pearson

Flynn/McHoes Operating systems Ceneage learning

: 0866-2565679



nd Rank (All

India)

OPERATION

RESEARCH MCS10517 w.e.f : 2017 - 2018 I MSC I Semester

Total No of Hours

Duration of


for Teaching -

Max Marks Credits


Learning

Hours

60 Hours


CIA SEE 7

4

0

30

70

Course Objectives

The reasoning and techniques used in formulating and solving deterministic problems in operations research.

Different techniques of analyzing the time involved in completing a project and the related costs are

presented after defining the prerequisites of networks under project management.

Apply the techniques used in operations research to solve real life problem in mining industry

Principle of optimality and optimisation techniques.

Course Outcomes

The student would develop an ability to work in a team: specifically to solve larger problems, communicate

technical knowledge, partition a problem into smaller tasks, and complete tasks on time.

The student would develop a quantitative approach for effective decision making.

The student would identify linear programming techniques

The student would be able to draw network paths

Write and apply computer code to problems, including (a) mathematical optimisation techniques; (b)

using existing optimisation toolkits; (c) writing computer programs to implement algorithms, and solve

problem; and (d) methods to deal with ingesting data.

DETAILED SYLLABUS

Unit1

(12Hrs)

Uses, scope and applications of operational research in managerial decision

making,OR models ,

formulation Of models , using models for problem solving ,technical for

OR, linear programming ,mathematical

formulation of LPP Models

for product mix problems.

Unit2

(12Hrs)

Graphical method and simplex method and its applications, duality and

sensitive analysis, duality in

linear Programming.

Unit3

(12Hrs)

Transportation problem:

Introduction, methods for finding initial solution, optimal soluti

on, MODI

method, assignment problem.

Unit4

(12Hrs)

Game theory: Introduction, two person zero sum game, pure mixed

strategies, dominance principle,

graphical method, Decision making theory and its applications.

Unit5

(12Hrs)

Basic concepts of project schedule

network analysis, construction of the network diagram, CPM/PERT

techniques Critical path method. Determination of critical path, project

evaluation and review techniques

(PERT).

LIST OF REFERENCES: -

1. S.D.Sarma: Operation Research, Meerut Publications

2. Dr.R.K.Gupta: Operation Research, Krishna prakashan Media (p) Ltd, Meerut.

3. Hadly: Linear programming, Addiosn-weslesy

MSc (COMPUTER SCIENCE) II SEMESTER

: 0866-2565679



nd Rank (All

India)

COMPUTER NETWORKS MCS 20117 w.e.f : 2017 - 2018 I MSC II Semester

Total No of Hours

for Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

7 4 6 30 70

Objectives:

To make the students familiarize with the fundamentals of communication, computer networks, types,

application of networks.

To make the students learn OSI reference model and services offered by the seven layers.

To make the students understand the different error detection and correction techniques.

To compare the various routing algorithms.

Learning Outcomes:

The students would be able to know the necessity of Reference Models.

The students would become aware of guided and unguided transmission Media and their performance.

The students would be able to understand the congestion problem during the transmission of data.

The student would become familiar with blue tooth and multimedia applications.

DETAILED SYLLABUS

Unit1 Introduction:UsesofComputerNetworks:BusinessApplication,HomeApplications,

MobileUsers– SocialIssues.NetworkHardware:LocalAreaNetworks–Metropolitan

AreaNetworks–WideArea Networks–WirelessNetworks–HomeNetworks–

Internetworks.NetworkSoftware:ProtocolHierarchies–DesignIssuesfortheLayers–

ConnectionOrientedandConnectionless Services–ServicePrimitives–

Therelationship ofServicestoProtocols.ReferenceModels:TheOSIReferenceModel–

TheTCP/IP ReferenceModel–AComparison ofOSIandTCP/IPreferenceModel.

PhysicalLayer:GuidedTransmissionMedia:MagneticMedia–TwistedPair–

CoaxialCable–FiberOptics. DataLinkLayer:DataLinkLayerDesignIssues:Services

Provided totheNetwork Layer–Framing– ErrorControl–

FlowControl.ErrorDetectionandCorrection: ErrorcorrectingCodes–ErrorDetecting

Codes.ElementaryDataLinkProtocols:Anunrestricted SimplexProtocol–

AsimplexStop-and–wait Protocol–

AsimplexProtocolforaNoisychannel.SlidingWindowProtocols: Aone-

bitslidingWindow Protocol –AProtocol usingGoBackN–

AProtocolusingselectiveRepeat. ExampleDataLinkProtocols: HDLC–

TheDataLinkLayerintheInternet.

Unit2 TheMediumAccessControlSublayer:Ethernet:EthernetCabling–

ManchesterEncoding–The EthernetMACsublayerProtocol–

TheBinaryExponentialBackoffAlgorithm–EthernetPerformance – SwitchedEthernet–

FastEthernet–GigabitEthernet–IEEE802.2:LogicalLinkControl–Retrospective

onEthernet. Wireless Lans:The802.11ProtocolStack-The802.11PhysicalLayer-

The802.11MAC sublayerProtocol-

The802.11FrameStructure.Bluetooth:BluetoothArchitecture–BluetoothApplications–

TheBluetooth ProtocolStack. DataLinkLayerSwitching:Bridgesfrom802.x to802.y–

LocalInternetworking–SpanningTreeBridges–RemoteBridges–

Repeaters,Hubs,Bridges,Switches,RoutersandGateways–VirtualLANs.

Unit3 TheNetworkLayer:NetworkLayerDesignIssues:Store–andForwardPacketSwitching

–Services ProvidedtotheTransportLayer–ImplementationofConnectionless Services–

Implementation of ConnectionOrientedServices–

ComparisonOfVirtualCircuitandDatagramsubnets.RoutingAlgorithms:

TheOptimalityPrinciple–ShortestPathRouting–Flooding–DistanceVectorRouting–

LinkState Routing–Hierarchical Routing –Broadcast Routing–MulticastRouting–

RoutingforMobileHosts. InternetWorking:HowNetworksDiffer–

HowNetworkscanbeconnected–ConcatenatedVirtual Circuits–

ConnectionlessInternetworking –Tunneling–InternetworkRouting–

Fragmentation.The NetworkLayerintheInternet:TheIPProtocol–IPaddress–

InternetControlProtocols–OSPF–

Unit4 TheTransportLayer:TheTransport Service:ServicesprovidedtotheUpperLayers–

Transport ServicesPrimitives–BerkeleySockets.Elements ofTransport Protocols

:Addressing–ConnectionEstablishment– ConnectionRelease–FlowControland

Buffering–Multiplexing–CrashRecovery.TheInternetTransport

Protocols:UDPIntroduction toUDP–RemoteProcedureCall–

TheRealTimeTransportProtocol.TheInternetTransport Protocols:TCPIntroduction

toTCP–TheTCPServiceModel–theTCPProtocol–TheTCPsegment header – TCP

connection establishment – TCP connection release – ModelingTCP connection

management-TCPTransmission Policy–

Unit5 TheApplication Layer:DNS:TheDomainNameSystem:TheDNSNameSpace–

ResourceRecords-NameServers.ElectronicMail:Architectureand Services–TheUser

Agent–MessageFormats– Message Transfer–

FinalDelivery.TheWorldWideWeb:Architecture Overview–StaticWebDocuments–

DynamicWebDocuments–HTTP–TheHyperTextTransferProtocol–

PerformanceEnhancements–The

WirelessWeb.Multimedia:IntroductiontoDigitalAudio–AudioCompression–

StreamingAudio– InternetRadio–VoiceOverIP–IntroductiontoVideo–

VideoCompression–VideoonDemand.

Author Title

eeeee

Publisher 1 Andrew S.

Tanenbaum Computer Networks Fourth Edition, PHI


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, WilliamM.

Hancock

Computer Communications and NetworkingTechnologies

Cengage Learning(2008)

Reference books

: 0866-2565679

K. B. N. COLLEGE : PG CENTRE (AUTONOMOUS)

(Sponsored by: S.K.P.V.V. Hindu High Schools Committee)


nd Rank (All

India)

DATA STRUCTURES MCS 20217 w.e.f : 2017 - 2018 I MSC II Semester

Total No of Hours

for Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

7 4 6 30 70

Objectives:

To introduce the students the fundamentals of Data Structures and types.

To make the students analyse the various searching and sorting techniques and comparing their time

complexities

To develop the data structures concepts using the programming language.

To make the students understand the real time applications of data structures.

Learning Outcomes:

The student would be able to understand the usuage of different data structures for a given application.

The student would be able to identify the appropriate data structure for a given problem

The student would be able to implement a data structure into a program.

The student would be able to understand the concept of recursive programming.

Understand the various types of trees and graphs.

DETAILED SYLLABUS

Unit1: Linear Data Structure Introduction : Why we need data structure? Concepts of data

structures: a) Data and data structure b) Abstract Data Type and Data Type. Algorithms and programs,

basic idea of pseudo-code. Algorithm efficiency and analysis, time and space analysis of algorithms –

order notations.

Array :Different representations – row major, column major. Sparse matrix - its implementation and

usage. Array representation of polynomials.Linked List: Singly linked list, circular linked list, doubly

linked list, linked list representation of polynomial and applications.

Unit2: Linear Data Structure-Stack and Queue :Stack and its implementations (using array, using

linked list), applications.Queue, circular queue, dequeue. Implementation of queue- both linear and

circular (using array, using linked list), applications.Recursion :Principles of recursion – use of stack,

differences between recursion and iteration, tail recursion. Applications - The Tower of Hanoi

Unit3: Nonlinear Data structures - Trees :Basic terminologies, forest, tree representation (using

array, using linked list). Binary trees - binary tree traversal (pre-, in-, post- order), threaded binary tree

(left, right, full) ,expression tree.Binary search tree- operations (creation, insertion, deletion,

searching).Height balanced binary tree – AVL tree (insertion, deletion with examples only).B- Trees –

operations (insertion, deletion with examples only).B- Trees – operations (insertion, deletion with

examples only).

Unit4: Graph definitions and concepts (directed/undirected graph, weighted/un-weighted edges, sub-

graph, complete graph, connected components strongly connected component, weakly connected

component, path, shortest path, (isomorphism). Graph representations/storage implementations

Adjacency matrix, adjacency list, adjacency multi-list.Graph traversal and connectivityDepth-first

search (DFS), Breadth-first search (BFS)

Unit5: Searching, Sorting :Sorting Algorithms: Bubble sort and its optimizations, insertion sort,

shell sort, selection sort, merge sort, quick sort, heap sort (concept of max heap, application – priority

queue), radix sort. Searching: Sequential search, binary search, interpolation search.Hashing: Hashing

functions, collision resolution techniques

Text Books


1 Seymour Lipschutz Data Structure Mc. GrawHill(Schaum‘s Outlines)

Reference Books:

Author Ttitle Publisher

1 M.A.Weiss Data Structure and algorithms in C Addison Wisley

: 0866-2565679



nd Rank (All

India)

DATA BASE MANAGEMENT SYSTEMS MCS 20317 w.e.f : 2017 - 2018 I MSC II Semester

Total No of Hours

for Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

7 4 6 30 70

Course Objectives:

To understand need of DBMS, models and functions of DBMS.

To make the students learn the architecture of DBMS.

To expose the students learn the advantages of normalisation.

To make the students understand the RAID strategies.

To make the students understand the need for transaction processing,

Indexing techniques for physical implementation of databases.

Learning Outcomes:

The student would be able to understand Database Architecture, Client Server architecture.

The student develops an ability to write Queries in Database languages and design database Using SQL

The student would be able to apply the concepts of relational algebra, calculus on Databases.

The student would be able to normalize the relations while designing a data base.

Understand the issues in transaction processing and implement them to maintain data reliability and

integrity.

Unit1: Databasesand DatabaseUsers: Introduction,Characteristicsofthe DatabaseApproach,Actorson

theScene,Workersbehindthescene, AdvantagesoftheusingtheDBMSApproach.DatabaseSystemConceptsand

Architecture: DataModels,Schemasand Instances,ThreeSchemaarchitectureand DataIndependence,Database

LanguagesandInterfaces,Centralizedand Client/ServerArchitecture

forDBMS,ClassificationofDatabaseManagementSystems.DataModellingUsingtheERModel:

ConceptualDatamodels,Entity Types,EntitySets,Attributesand Keys,Relationshiptypes, Relationship

sets,rolesandstructuralConstraints, WeakEntity types,RelationshipTypesof

DegreeHigherthanTwo,RefiningtheER DesignfortheCOMPANYDatabaseTheEnhancedEntity-

RelationshipModel:Subclasses,Superclasses and Inheritance,Specializationand Generalization,Constraintsand

Characteristics ofSpecialization andGeneralization Hierarchies, ModelingofUnionTypesusingCategories,An

ExampleUniversityERR Schema,DesignChoicesandFormalDefinitions.

Unit2: The RelationalDataModeland RelationalDatabaseConstraints: Relational Model Concepts,

Relational Model Constraints and Relational Database Schemas, Update Operations, Transactions and

DealingwithConstraintViolations.The RelationalAlgebraand RelationalCalculus:UnaryRelational

Operations:SELECTandPROJECT,RelationalAlgebraOperationsfrom set Theory, Binary Relational Operations:

JOIN and DIVISION, AdditionalRelationalOperations,Examples.SQL-

99:SchemaDefinition,Constraints,QueriesandViews: SQL Data

DefinitionsandDataTypes,SpecifyingConstraintsinSQL,Schema ChangeStatementson SQL,BasicQueriesin

SQL,MoreComplexSQL Queries,INSERT,DELETEandUPDATEstatementsin SQL,Triggersand Views.

Unit3: FunctionalDependenciesandNormalizationfor RelationalDatabases: InformalDesignGuidelinesfor

RelationSchemas,Functional dependencies, Normal Forms Based in Primary Keys, General Definitions

ofSecondandThirdNormalForms,Boyce-CoddNormal Form.RelationalDatabaseDesignAlgorithmsand

FurtherDependencies: Propertiesof RelationalDecompositions,AlgorithmsforRelational

DatabaseSchemaDesign,MultivaluedDependenciesandFourthNormal Form, JoinDependencies and Fifth Normal

Form, Inclusion Dependencies,OtherDependenciesandNormalForms.

Unit4: DiskStorage,BasicFileStructuresand Hashing:Introduction,

SecondaryStorageDevices,BufferingofBlocks,PlacingfileRecords onDisk,Operationson Files,Filesof

UnorderedRecords,Filesof Ordered Records, Hashing Techniques, Other Primary File

Organizations,ParallelizingDiskAccessusingRAIDTechnology.Indexing Structuresfor Files: Types of Single-

Level Ordered Indexes,MultilevelIndexes,DynamicMultilevelIndexesUsingB-

TreesandB+Trees,IndexesonMultipleKeys,OtherTypesofIndexes.

Unit5: Introductionto TransactionProcessingConceptsandTheory: Introductionto

TransactionProcessing,TransactionandSystem Concepts,DesirablePropertiesof Transactions,Characterizing

SchedulesBasedon Recoverability,CharacterizingschedulesBasedon

Serializability.ConcurrencyControlTechniques: TwoPhaseLockingTechniquesfor Concurrency Control,

Concurrency Control Based on Timestamp Ordering,Multiversion Concurrency controltechniques, Validation

concurrency control Techniques, Granularity of Data Items and multipleGranularityLocking

Text Books:


1 RamezElmasri,

ShamkantB. Navathe,

Fundamentals of Database Systems

FifthEdition,PearsonEducation(20

07)

Reference Books:


1 Peter Rob,Carlos Coronel DataBase Systems Design

Implementation and Management

Eight Editon Thomson(2008)

2 C.J.Date,A.KannanS.Swamynanatha

n

An Intorduction to Data Base Systems VII Edition Pearson Education(2006)

: 0866-2565679



nd Rank (All

India)

THEORY OF COMPUTATION MCS 20417 w.e.f : 2017 - 2018 I MSC II Semester

Total No of Hours

for Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

7 4 0 30 70

Course Objectives:

To Analyse and design finite automata, pushdown automata, Turing machines, formal languages, and

grammars.

Model, compare and analyse different computational models using combinatorial methods.

Apply rigorously formal mathematical methods to prove properties of languages, grammars and automata.

Construct algorithms for different problems and argue formally about correctness on different restricted

machine models of computation.

Course outcomes:

Students would be able to demonstrate knowledge of basic mathematical models of computation

Students would be able to understand that there are limitations on what computers can do, and learn

examples of unsolvable problems.

Students would be able to apply mathematical foundations, algorithmic principles and computer science

theory to the modeling and design of computer based systems.

Students would be able to apply design and development principles in the construction of software systems of

varying complexity.

Unit1 Automata: The methods and the Madness, Finite Automata

Unit2 Regular Expressions and Languages, Properties of Regular Languages

Unit3 Context-Free Grammars & Languages, Push Down Automata

Unit4 Properties of Context Free Languages, Introduction to Turing Machines

Unit5 Undecidability

Text Books:

Sl.N

o.


1 J E Hopcroft, Rajeev Motwani,

Jeffrey D.Ullman

Introduction to Automata Theory,

Languages and Computation

Pearson education,

2nd

Edition

Reference books

Sl.No. AUTHOR TITLE PUBLISHER

1 Daniel I.A.Cohen

Introduction to Computer Theory Wiley

2 Peter Linz Theory of Computation Narosa

: 0866-2565679



nd Rank (All

India)

SOFTWARE ENGINEERING MCS 20517 w.e.f : 2017 - 2018 I MSC II Semester

Total No of Hours

for Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

7 4 0 30 70

Objectives:

To provide the students with an overall view over Software Engineering as an

engineering discipline and with insight into the processes of software development.

To gain students in-depth knowledge in Software Engineering, Software Life-cycle Models, Software

Requirements, Software Integration and Testing and Software Quality.

Different Process Models and Software Development Life Cycle.

To understand the various Testing Strategies

Learning Outcomes:

Have knowledge about software development models

Through knowledge about methods and process to develop software

The student would be able to implement Software Requirement Analysis

Understanding of Testing strategies implemented in development process and able to do Risk analysis

The student can develop good coding practices and also can build a career as a software tester or analyser

DETAILED SYLLABUS

UNIT - I:Introduction to Software Engineering: The evolving role of software, Changing Nature of

Software, Software myths.A Generic view of process: Software engineering- A layered technology, a process

framework, The Capability Maturity Model Integration (CMMI), Process patterns, process assessment,

personal and team process models.Process models: The waterfall model, Incremental process models,

Evolutionary process models, The Unified process, Agile process models

UNIT - II:Software Requirements: Functional and non-functional requirements, User requirements,

System requirements, Interface specification, the software requirements document. Requirements

engineering process: Feasibility studies, Requirements elicitation and analysis, Requirements validation,

Requirements management. System models : Context Models, Behavioral models, Data models, Object

models, structured methods.

UNIT - III:Design Engineering: Design process and Design quality, Design concepts, the design

model. Creating an architectural design: Software architecture, Data design, Architectural styles

and patterns, Architectural Design.Object-Oriented Design: Objects and object classes, An Object-Oriented

design process, Design evolution. Performing User interface design: Golden rules, User interface analysis

and design, interface analysis, interface design steps, Design evaluation.

UNIT - IV:Testing Strategies: A strategic approach to software testing, test strategies for conventional

software, Black-Box and White-Box testing, Validation testing, System testing, the art of Debugging.Product

metrics: Software Quality, Metrics for Analysis Model, Metrics for Design Model, Metrics for source code,

Metrics for testing, Metrics for maintenance. Metrics for Process and Products : Software Measurement,

Metrics for software quality.

UNIT - V:Risk management: Reactive vs. Proactive Risk strategies, software risks, Risk identification,

Risk projection, Risk refinement, RMMM, RMMM Plan. Quality Management: Quality concepts, Software

quality assurance, Software Reviews, Formal technical reviews, Statistical Software quality Assurance,

Software reliability, The ISO 9000 quality standards.

TEXT BOOKS :

1. Software Engineering A practitioner‘s Approach, Roger S Pressman, 6th edition. McGrawHill International

Edition.

2. Software Engineering, Ian Sommerville, 7th edition, Pearson education.

REFERENCE BOOKS :

1. Software Engineering, A Precise Approach, PankajJalote, Wiley India, 2010.

2. Software Engineering: A Primer, Waman S Jawadekar, Tata McGraw-Hill, 2008

3. Fundamentals of Software Engineering, Rajib Mall, PHI, 2005

4. Software Engineering, Principles and Practices, Deepak Jain, Oxford University Press.

5. Software Engineering1: Abstraction and modelling, Diner Bjorner, Springer International edition, 2006.

6. Software Engineering2: Specification of systems and languages, Diner Bjorner, Springer International

edition 2006.

MSc (COMPUTER SCIENCE) III SEMESTER

: 0866-2565679

K. B. N. COLLEGE: PG CENTRE (AUTONOMOUS) (Sponsored by: S.K.P.V.V. Hindu High Schools

Committee) Kothapeta, Vijayawada – 520 001. UGC: CPE NAAC – ‘A’ Grade ISO 9001 : 2008 NIRF 92nd Rank (All

India)

CRYPTOGRAPHY &

NETWORK SECURITY

SECURITY

MCS 30117

w.e.f : 2017 - 2018

II MSC

III Semester

Total No of Hours

for Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

Objectives:

To make the students aware of the basics of security, types of attacks on Networks, the concepts of

encryption and decryption, symmetric and asymmetric cryptography.

To make the students understand block ciphers and stream ciphers.

To expose the students to digital signatures, e-mail security, firewalls and viruses.

Learning Outcomes:

Have a fundamental understanding of the objectives of cryptography and network security.

Identify and classify computer and security threats and develop a security model to prevent, detect and

recover from attacks.

The student would be able to understand the use of secure electronic transactions.

Encrypt and decrypt messages using block ciphers.

The student would be able to evaluate the security of communications systems.

Become familiar with the cryptographic techniques that provide information and network security

DETAILED SYLLABUS

Unit 1

(12Hrs)

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.

Block cipher and the data encryption standard: Block cipher principles, the

strength of DES, Differential and linear cryptanalysis, Block cipher design

principles.

Confidentiality using Symmetric Encryption: Placement of encr yption function,

Unit 2

(12Hrs)

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 MAC s.

Unit 3

(12Hrs)

Digital signatures and authentication protocols: Digital signatures,

Authentication protocols, Digital Signature standard Authentication Applications: Kerberos, X.509 authentication service

Unit 4

(12Hrs)

Email Security: Pretty good privacy, S/MIME

IP security: IP security overview, IP security architecture, Authentication header,

Encapsulating security payload, combining security associations, key management.

Web security: Web security considerations, Secure Socket Layer and transport

layer security, Secure electronic transaction.

Unit 5

(12Hrs)

Intruders: Intruders, Intrusion detection, password management

Malicious Software: Viruses and related threads, virus counter measures,

distributed denial of service attacks.

Firewalls: Firewall Design principles, trusted systems, common criteria for

information technology, security evaluation.

TEXT BOOKS


1 William

Stallings

Cryptography and

Network Security

Fourth edition, PHI

REFERENCE BOOKS


1 Willia

m

Network Security Essentials

— Applications and

Third Edition,

Pearson Education

2 Chris McNab Network Security Assessment

3 Jon Erickson Hacking — The Art of Exploitation SPD, NOSTARCH

Press (2006).

4 Neal Krawety Introduction to Network Security Thomson (2007)

5 Ankit Fadia Network Security — A

Hackers Perspective

Macmillan (2008)

: 0866-2565679

K. B. N. COLLEGE : PG CENTRE (AUTONOMOUS)

(Sponsored by: S.K.P.V.V. Hindu High Schools

Committee) Kothapeta, Vijayawada – 520 001. UGC : CPE NAAC – ‘A’ Grade ISO 9001 : 2008 NIRF 92nd Rank (All

India)

Objectives:

To make the students understand the time and space complexities of an algorithm.

To make the students compare design techniques like divide and conquer, greedy algorithms and dynamic

programming to solve algorithmic problems.

To make the students understand the computability concepts NP-hard and NP complete.

To make the students understand different ways to analyze randomized algorithms (expected running time,

probability of error).

DESIGN AND ANALYSIS

OF ALGORITHMS

MCS 30217

w.e.f : 2017 - 2018

II MSC

III Semester

Total No of Hours

for Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

Learning Outcomes:

Apply and analyze the complexity of certain divide and conquer, greedy, and dynamic programming

algorithms.

Differentiate between various algorithms for sorting, searching and selection and when to use them.

Describe the classes P, NP, and NP-Complete and be able to prove that a certain problem is NP -Complete.

Explain and apply backtracking and branch and bound techniques to deal with some hard problems.

It is expected that the students are able to understand the techniques used for designing graph theory

algorithms

DETAILED SYLLABUS Unit-1

(12Hrs)

Introduction to Algorithm, Algorithm definition, properties, Different areas to study about

Algorithms, Pseudo code expressions for an algorithm, Performance Analysis, Time

complexity & Space complexity, Asymptotic notations, Introduction to Divide and Conquer-

Binary search, Binary search analysis, Quick sort, Quick sort analysis, Merge sort, Merge sort

Analysis, Strassen‗s matrix multiplication, Finding Maximum and minimum.

Unit-2

(12Hrs)

Greedy Method introduction, General method, Job sequencing with deadlines, Single source

shortest path problem, Example problems, Optimal storage on tapes, Knapsack problem,

Minimum cost spanning trees – Prim‗s Algorithm, Kruskal‗s Algorithm, Basic search and

Traversal Techniques, Tree Traversals, Bi-connected components, DFS, BFS

Unit-3

(12Hrs)

Dynamic programming, Single source shortest path problem, Multi stage graphs, All pairs

shortest path, Optimal Binary search tree, 0/1 knapsack problem, Example problem,

Travelling sales person problem, Flow shop scheduling

Unit-4

(12Hrs)

Introduction to back tracking, General method, sum of subsets, N-queens problem, Sum of sub

sets problem, Graph coloring, Hamiltonian cycles, knapsack problem.

Unit-5

(12Hrs)

Introduction to Branch and Bound, Travelling sales person problem, 0/1 Knapsack problem ,

LCBB, FIFOBB, Introduction to NPHARD & NPCOMPLETE, Example problem, Basic

concepts, Non deterministic Algorithms, Np-hard class, NP–complete class, Cooks theorm,

TEXT BOOKS:


Sartaj Sahni Fundamentals of Computer Algorithms

Second Edition , University press (2008). Chapters 1 – 8

& 11.

REFERENCE BOOKS:

S.NO Author Title Publisher

1 L.Chandra Mohan, Design and analysis of Algorithms

PHI Publications

2 Prabhakar Gupta, Vineeth Agarwal

Design and analysis of Algorithms

PHI Publications

3 Anany Leviton Introduction to Design and analysis of Algorithms

Pearson Education

: 0866-2565679

K. B. N. COLLEGE : PG CENTRE (AUTONOMOUS) (Sponsored by: S.K.P.V.V. Hindu High Schools


India)

WEB TECHNOLOGIES

MCS30317

w.e.f : 2017 - 2018

II MSC

III Semester

Total No of

Hours for

Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

7 4 6 30 70

Course Objectives:

Developing the web sites which are secure and dynamic in nature and writing scripts which get executed on

server as well.

The web page site planning, management and maintenance.

Developing Internet based applications using Java Technologies.

Course Outcomes:

Understand, analyse and apply the role languages like HTML, CSS, XML, JavaScript and protocols in the

workings of web and web applications.

Understand about network and security programming using Java and know about the application of dynamic

page functionality in web pages using CGI, Servlets, JSP, and ASP.

Create and communicate between client and server using Java and create a good, effective and dynamic

website.

Develop a dynamic webpage by the use of java script and DHTML.

Understand and write a well formed / valid XML document

DETAILED SYLLABUS

UNIT I

(12Hrs)

INTRODUCTION

Internet Principles – Basic Web Concepts – Client/Server model – retrieving data from

Internet – HTML and Scripting Languages – Standard Generalized Mark –up languages –

Next Generation – Internet –Protocols and Applications

UNIT II

(12Hrs)

COMMON GATEWAY INTERFACE PROGRAMMING

HTML forms – CGI Concepts – HTML tags Emulation – Server – Browser

Communication – E-mail generation – CGI client Side applets – CGI server applets

authorization and security.

UNIT III

(12Hrs)

SCRIPTING LANGUAGES

Dynamic HTML-Cascading style sheets-Object model and Event model- Filters and

Transitions-Active X Controls-Multimedia-Client side script - VB Script programming

– Forms – Scripting Object

UNIT IV

(12Hrs)

SERVER SIDE PROGRAMMING

XML – Server side includes – communication – DTD – Vocabularies – DOM methods –

Firewalls– Proxy Servers, Introduction to Servlets, Servlet Life Cycle, Data base connection

using JDBC through Servlets

UNIT V

(12Hrs)

JSP

JSP Technology Introduction-JSP- Running JSP Applications Basic JSP- JavaBeans Classes

and JSP-Tag Libraries and Files- Support for the Model- View- Controller Paradigm- Case

Study- Related Technologies

TEXT BOOKS:

1. Deitel H.M. and Deitel P.J., ―Internet and World Wide Web How to program‖,

Pearson International, 2012, 4th Edition. (Ch-1,4,5,6,12,14,26,27)

2. Gopalan N.P. and Akilandeswari J., ―Web Technology‖, Prentice Hall of India,

2011.(Ch- 1 to 11)

3. Paul Dietel and Harvey Deitel,‖Java How to Program‖, Prentice Hall of India,

8th Edition.(Ch-29)

REFERENCE BOOKS:

1. Web Technologies Black Book

: 0866-2565679



India)

Course Objectives

To understand the DOTNET framework, C# language features and

.NET PROGRAMMING MCS30417 w.e.f : 2017 - 2018 II MSC III Semester

Total No of

Hours for

Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

7 4 6 30 70

Web development using ASP.NET

Course Outcomes

Use .net framework architecture, various tools, and Validation techniques, use of different templates

available in Visual Studio, Implementation and testing strategies in real time applications.

Use advanced concepts related to Web Services, WCF, and WPF in project development

DETAILED SYLLABUS

Unit I

(12Hrs)

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.

Window Forms:

Window 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 Checkbox Control , Using The ComboBox Control,

Using The ListBox Control, Using The GroupBox Control, Using The Panel

Control, Using The PictureBox Control, Using The Timer Control, Using The

ProgressBar Control.

Windows Forms Controls-II: Using The ToolStrip Control, Using The MenuStrip Control,

Using The StatusStrip Control, Working with DialogBoxes, Using The

FolderBrowserDialog Control,Using the Open File Dialog Control, Using The

Save File Dialog Control, Using The Font Dialog Control, Using The Colordialog

Control, Using The Print Dialog and Print Document Controls.

Recovery.

Unit 2

(12Hrs)

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,Initiallizing Variables, Declaring Variables Of Nullable

Type, Declaring constants, Working With Arrays, Single – Dimensional Arrays,

Exploring Control Flow Statements, Selection Statements, Iteration Statements,

Jump Statements.

Object Oriented Programming: Basic Principles Of Object Oriented

Programming, Member Of 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 3

(12Hrs)

ASP.NET

Standard Controls: Introducing The Web Control Class, Using The Label

Control, Using The Textbox Control, Using The Button Control, Using The

Image Button Control, Using The List Box Control, Using The Radio Button

Control, Using The Checkbox Control, Using The Table Control, Using The

Wizard Control, Using The Calendar Control, Using The Ad Rotator Control.

Navigation Controls: Working With The Sitemap Path Control, Using The

Sitemap Path Control, Customizing Appearance Of The Sitemap Path Control,

Working With The Menu Control, Creating Static Menus, Creating Dynamic

Menus, Working With The Tree View Control.

Validation Controls: Introducing The Basic Validator Class, Using The

Requiredfieldvalidator Control, Using The Range Validator Control, Using The

Regular Exception Validator Control, Using The Compare Validator Control,

Using The Custom Validator Control, Using The Validation Summary Control.

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

UNIT 4

(12Hrs)

Database Controls: Working With ADO.NET 4.5,Exploring Disconnected Data Architecture,

Accessing Data Using ADO.NET, Introducing Data source Controls, The SQL

Data Source Control, The Access Data Source Control, The Object Data Source

Control, The XML Data Source Control, The Linq Data Source Control, The Site

Map Data Source Control, The Entity Data Source Control, Working with Data-

Bound Controls, Using The Grid view Control, Using The Data list Control,

Using The Details View Control, Using The Form view Control, Using The List

view And Data Pager Controls, Using The Repeater Control, Using The Chart

Control, Using The Query Extender Control.

Web parts Controls: Introducing Web Parts Controls, Using The Web part

Manager Control, Using The Catalog Zone Control, Using The Web part Zone

Control, Using The Proxy Web Part Manager Control, Creating A Web

Application Using Web parts Controls

Unit 5

(12Hrs)

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 Style sheet Theme Attribute

Caching In ASP.NET 5.4 : Caching In ASP.NET, Introducing The Cache

Class, Describing Output Caching, The Location Attribute, The Shared

Attribute, The Vary By Custom Attribute, The Vary By Param 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.

TEXT BOOKS


1.Vikas Gupta Comdex .Net 4.5 Programming

Course Kit

Dreamtech Press, 2014

REFERENCE BOOKS

S.No Author Title Publisher

1 Kogent Learning Solutions Inc. ASP.Net Black Book Dreamtech Press, 2011

2 Kogent Learning Solutions Inc. Visual Basic 2010

Programming Black Book,Platinum ed

Dreamtech Press,

2011

: 0866-2565679


Kothapeta, Vijayawada – 520 001. UGC : CPE NAAC – ‘A’ Grade ISO 9001 : 2008 NIRF 92nd Rank (All India)

Elective I- ARTIFICIAL

INTELLIGENCE

MCS30517

w.e.f : 2017 - 2018

II MSC

III Semester

Total No of

Hours for

Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

COURSE OBJECTIVES:

To make the students understand problem solving, knowledge

representation, reasoning, decision making, planning.

Given a search problem, analyse and formalize the problem (as a State space, graph, etc.), select the

appropriate search method, and write the algorithm for it.

Explain important search concepts, such as the difference between Informed and uninformed search, the

definitions of admissible and consistent heuristics and completeness and optimality. Algorithms.

Develop small rule -based and search -based expert systems, predict performance characteristics.

Describe the role of rule chaining and search in intelligent system engineering

LEARNING OUTCOMES:

Find appropriate idealizations for converting real world problems into AI search problems formulated

using the appropriate search algorithm. .

Implement A* and iterative deepening search. Derive Heuristic functions for A* search that are

appropriate for a given problem.

It is expected that the learners select and apply a variety of graph search

algorithms underpinning AI applications.

It is expected that the students to apply techniques to design expert systems.

UNIT-I

(12Hrs)

What is AI? The AI Problem, The Underlying Assumption, What is an 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, Productions System Characteristics, Issues in

the design of Search Programs, Additional Problems.

Heuristic Search Techniques: Generate and Test, Hill Climbing, Best First Search, Problem Reduction, Constraint Satisfaction, Means-Ends Analysis

UNIT-II

(12Hrs)

Knowledge Representation Issues: Representations and Mappings, Approaches to Knowledge Representation, Issues in Knowledge Representation, Issues in Knowledge

Representation, The Frame Problem.

Using Predicate Logic: Representing Simple Facts in Logic, Representing Instances and

Isa Relationships, Computable Functions and Predicates, Resolution, Natural Deduction.

Representing Knowledge Using Rules: Procedural Versus Declarative Knowledge, Logic

Programming, Forward Vs Backward Reasoning, Matching, Control Knowledge

UNIT-III

(12Hrs)

Symbolic Reasoning Under Uncertainty: Introduction to Non monotonic Reasoning, Logics for Non monotonic Reasoning, Implementation Issues, Augmenting a Problem

Solver, Implementation Depth-First Search, Breadth-First Search.

Weak Slot-and Filler Structures: Semantic Nets, Frames.

UNIT-IV

(12Hrs)

Planning: Overview, An Example Domain: The Blocks World, Components of a Planning System, Goal Stack Planning, Nonlinear Planning Using Constraint Posting, Hierarchical

Planning, Reactive Systems, Other Planning Techniques.

Natural Language Processing: Introduction, Syntactic Processing, Semantic Analysis,

Discourse and Pragmatic Processing.

UNIT-V

(12Hrs)

Common Sense: Qualitative Physics, Common-sense Ontologies, Memory Organization, Case- Based Reasoning.

Expert Systems: Representing and Using Domain Knowledge, Expert System Shells,

Explanation, Knowledge Acquisition.

Prescribed Text Book

Artificial Intelligence, Rich & Knight, Tata McGraw-Hill Edition, Third Edition.

References

Artificial Intelligence, Winston.P.H., Addison Wesley Publisher.

: 0866-2565679



Elective I- COMPUTER

GRAPHICS

MCS30517

w.e.f : 2017 - 2018

II MSC

III Semester

Total No of

Hours for

Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

Course Objectives:

To expose students on the introduction to computer graphics techniques,focusing on 2D and 3D concepts.

To describe the general software architecture of programs that use 3D computer graphics.

To discuss the current models for surfaces (e.g., geometric; polygonal; hierarchical; mesh; curves,

splines.

Tto discuss hardware system architecture for computer graphics. This includes, but is not limited to:

graphics pipeline, frame buffers etc.

Learning Outcomes:

It is expected that the students understand the concepts of input devicesand display devices.

It is expected that the students understand the multimedia concepts

To design and implement model and viewing transformations, the graphics pipeline and an interactive

render loop with a 3D graphics API.

Implement 2D Graphical algorithms including: line drawing, polygon filling, clipping, and

transformations.

The students would be able to use a current 3D graphics API (e.g., OpenGL or DirectX).

DETAILED SYLLABUS

UNIT-I

(12Hrs)

Introduction: Application areas of Computer Graphics, Overview of graphics systems,

Video-display devices,

Raster-scan systems, Random scan systems.

Output primitives : Points and lines, Line drawing algorithms, Mid-point circle and

ellipse algorithms.

Filled area primitives: Scan line Polygon Fill algorithm, Boundary-fill and Flood-fill

algorithms

UNIT – II

(12Hrs)

2D&3D Geometrical Transformations: Translation, Scaling, Rotation, Reflection

and Shear transformations,

Matrix representations and homogeneous coordinates, Composite transformations,

Transformations between

coordinate systems, Cohen-Sutherland line clipping algorithm, Sutherland–Hodgeman

polygon clipping algorithm.

UNIT – III

(12Hrs)

Introduction to Digital Image Processing : Examples of fields that use Digital image

processing, Fundamental

steps in Digital image processing, Components of image processing system.

Digital Image Fundamentals: A simple image formation model, Image sampling and

quantization, Basic

relationships between pixels, Color models.

UNIT – IV

(12Hrs)

Image enhancement in the spatial domain: Basic gray-level transformation,

Histogram processing,

Enhancement using arithmetic and logic operators, Basic spatial filtering, Smoothing

and sharpening spatial

filters, Combining the spatial enhancement methods

UNIT - V

(12Hrs)

Morphological Image Processing: Preliminaries, Dilation, Erosion, Open and

Closing, Hit or miss

transformation, Basic morphologic algorithms

Image Segmentation: Detection of discontinuous, Edge linking and boundary

detection, Thresholding, Region–based segmentation

TEXT BOOKS

1.―Computer Graphics C version‖, Donald Hearn and M.Pauline Baker, Pearson Education. ( Units I & II)

2.Digital Image Processing, Rafeal C.Gonzalez, Richard E.Woods, Second Edition, Pearson Education/PHI. (

Units III,IV & V)

REFERENCE BOOKS

1. Procedural elements for Computer Graphics, David F Rogers, Tata MCA

Graw hill, 2nd edition.

2. Computer Graphics, Steven Harrington, TMH

3. Image Processing, Analysis, and Machine Vision, Milan Sonka, Vaclav Hlavac and Roger

Boyle, Second Edition, Thomson Learning.

4. Introduction to Digital Image Processing with Matlab, Alasdair MCAAndrew, Thomson Course

Technology

5. Computer Vision and Image Processing, Adrian Low, Second Edition, B.S.Publications

: 0866-2565679



Elective I- SYSTEM

SOFTWARE

MCS30517

w.e.f : 2017 - 2018

II MSC

III Semester

Total No of

Hours for

Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

Course Objectives:

Distinguish between Operating Systems software and Application Systems software.

Describe commonly used operating systems.

Identify the primary functions of an Operating System.

Describe the ―boot‖ process.

Identify Desktop and Windows features.

Use Utility programs.

Discuss the pros and cons of the three major operating systems.

Learning Outcomes:

Analyze the structure of OS and basic architectural components involved in OS design

Analyze and design the applications to run in parallel either using process or thread

models of different OS

Analyze the various device and resource management techniques for timesharing and

distributed systems

Understand the Mutual exclusion, Deadlock detection and agreement protocols of

Distributed operating system

Interpret the mechanisms adopted for file sharing in distributed Applications

Conceptualize the components involved in designing a contemporary OS

UNIT –I

INTRODUCTION : System software and machine architecture – The

Simplified Instructional Computer (SIC) - Machine architecture - Data and

instruction formats - addressing modes - instruction sets - I/O and

programming.

UNIT -II

ASSEMBLER : Basic assembler functions - A simple SIC assembler –

Assembler algorithm and data structures - Machine dependent assembler

features - Instruction formats and addressing modes – Program relocation -

Machine independent assembler features - Literals – Symbol-defining

statements – Expressions - One pass assemblers and Multi pass assemblers -

Implementation example - MASM assembler.

UNIT -III

LOADERS & LINKERS: Basic loader functions - Design of an Absolute

Loader – A Simple Bootstrap Loader - Machine dependent loader features -

Relocation – Program Linking – Algorithm and Data Structures for Linking

Loader - Machine-independent loader features - Automatic Library Search –

Loader Options - Loader design options - Linkage Editors – Dynamic Linking

– Bootstrap Loaders - Implementation example - MSDOS linker.

UNIT –IV

MACRO PROCESSORS : Basic macro processor functions - Macro

Definition and Expansion – Macro Processor Algorithm and data structures -

Machine-independent macro processor features - Concatenation of Macro

Parameters – Generation of Unique Labels – Conditional Macro Expansion –

Keyword Macro Parameters-Macro within Macro-Implementation example -

MASM Macro Processor – ANSI C Macro language.

UNIT –V

SYSTEM SOFTWARE TOOLS : Text editors - Overview of the Editing

Process - User Interface – Editor Structure. - Interactive debugging systems -

Debugging functions and capabilities – Relationship with other parts of the

system – User-Interface Criteria.

TEXT BOOK

1. Leland L. Beck, ―System Software – An Introduction to Systems Programming‖, 3rd

Edition, Pearson Education Asia, 2000. REFERENCES

1. D. M. Dhamdhere, ―Systems Programming and Operating Systems‖, Second

Revised Edition, Tata McGraw-Hill, 1999.

: 0866-2565679


Kothapeta, Vijayawada – 520 001. UGC : CPE NAAC – ‘A’ Grade ISO 9001 : 2008 NIRF 92nd Rank (All India

ELECTIVE-I TCP/IP MCS 305.417

w.e.f : 2017 - 2018

IIMSC

III Semester

Total No of

Hours for

Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

Course Objectives:

Configure subnets using IP classes B and C

Explain TCP/IP protocols, ports, sockets, and data encapsulation

Describe the process of packet fragmentation and reassembly

Explain the key features and functions of TCP and UDP

Use Wireshark to identify ICMP request and reply packets

Describe the DHCP discovery process

Explain DNS queries, name resolution, zone data transfers and reverse DNS queries

Describe how basic routing works including the use of routing protocols

Learning Outcomes:

Real life trouble shooting techniques

OSI Model uses

Introducing TCP/IP

IP Addressing and Related Topics

Data Link and Network Layer TCP/IP Protocols

Internet Control Message Protocol (ICMP)

Transport Layer TCP/IP Protocols

Basic TCP/IP Services

Domain Name System (DNS)

The Dynamic Host Configuration Protocol (DHCP)

Securing TCP/IP Environments

latest Security techniques and Trends

Routing the IP Environment

Monitoring and Managing IP Networks

TCP/IP, NETBIOS, and WINS

Internet Protocol Version 6 (IPv6)

DETAILED SYLLABUS

UNIT I Introduction and Underlying Technologies

A BRIEF HISTORY

ARPANET, Birth of the Internet, Transmission Control,

Protocol/Internetworking Protocol (TCP/IP), MILNET, CSNET, NSFNET,

ANSNET, The Internet Today World Wide Web, Time Line, Growth of the

Internet.

PROTOCOLS AND STANDARDS

Protocols ,Standards

STANDARDS ORGANIZATIONS

Standards Creation Committees ,Forums ,Regulatory Agencies

INTERNET STANDARDS

Maturity Levels ,Requirement Levels

INTERNET ADMINISTRATION

Internet Society (ISOC),Internet Architecture Board (IAB) ,Internet

Engineering Task Force (IETF), Internet Research Task Force (IRTF) ,Internet

Assigned Numbers Authority (IANA) and Internet

THE OSI MODEL AND THE TCP/IP PROTOCOL SUITE

PROTOCOL LAYERS

Hierarchy, Services.

THE OSI MODEL

Layered Architecture ,Layer-to-Layer Communication ,Encapsulation ,Layers

in the OSI Model

TCP/IP PROTOCOL SUITE

Comparison between OSI and TCP/IP Protocol Suite ,Layers in the TCP/IP

Protocol Suite

UNIT II Underlying Technologies

WIRED LOCAL AREA NETWORKS

IEEE Standards ,Frame Format ,Addressing ,Ethernet Evolution ,Standard

Ethernet ,Fast Ethernet, Gigabit Ethernet ,Ten-Gigabit Ethernet

WIRELESS LANS

IEEE 802.11, MAC Sub layer, Addressing Mechanism, Bluetooth.

Network Layer

SWITCHING

Circuit Switching ,Packet Switching

PACKET SWITCHING AT NETWORK LAYER


1 Behrouz &

A.Forouzan

TCP/IP

Protocol Suite

Fourth edition, McGraw-Hill Forouzan

Networking Series

Connectionless Service ,Connection-Oriented Service

NETWORK LAYER SERVICES

An Example ,Logical Addressing ,Services Provided at the Source Computer

,Services Provided at Each Router ,Services Provided at the Destination

Computer

UNIT III IPV4 ADDRESSES

INTRODUCTION

Address Space ,Notation ,Range of Addresses ,Operations

CLASSFUL ADDRESSING

Classes, Classes and Blocks, Two-Level Addressing, An Example, Three-

Level Addressing: Sub netting, Supernetting.

Delivery and Forwarding of IP Packets

DELIVERY

Direct Delivery ,Indirect Delivery

FORWARDING

Forwarding Based on Destination Address ,Forwarding Based on Label

UNIT IV Internet Protocol Version 4 (IPv4)

DATAGRAMS

FRAGMENTATION

Maximum Transfer Unit (MTU), Fields Related to Fragmentation

OPTIONS

Format ,Option Types

Address Resolution Protocol (ARP)

ADDRESS MAPPING

Static Mapping ,Dynamic Mapping

THE ARP PROTOCOL

Packet Format ,Encapsulation ,Operation ,Proxy ARP

UNIT V Internet Control Message Protocol Version 4

(ICMPv4)

INTRODUCTION

MESSAGES Message Format, Error Reporting Messages ,Query Messages

Checksum

DEBUGGING TOOLS

Ping , Trace route

Mobile IP 268

ADDRESSING

Stationary Hosts ,Mobile Hosts

AGENTS

Home Agent ,Foreign Agent

MSc (COMPUTER SCIENCE) IV SEMESTER

: 0866-2565679



India)

Course Objectives:

To introduce the basic concepts of Data Warehouse and Data Mining techniques.

Examine the types of the data to be mined and apply preprocessing methods on raw data.

Discover interesting patterns, analyze supervised and unsupervised models and estimate the accuracy of the

algorithms.

Course Outcomes

Students who complete this course should be able to

Process raw data to make it suitable for various data mining algorithms.

Discover and measure interesting patterns from different kinds of databases.

Apply the techniques of clustering, classification, association finding, feature selection and visualization to real

world data.

DATAWAREHOUSING AND

MINING

MCS40117

w.e.f : 2017 - 2018

II MSC

IV Semester

Total No

of Hours

for

Teaching

-

Learning

Instructional

Hours for

Week

Duration of

Semester End

Examination

in Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 6 30 70

UNIT-I Introduction: Fundamentals of data mining, Data Mining Functionalities,

Classification of Data Mining systems, Major issues in Data Mining, Data Warehouse

and OLAP Technology for Data Mining Data Warehouse, Multidimensional Data

Model, Data Warehouse Architecture

Data Pre-processing: Needs Pre-processing the Data, Data Cleaning, Data Integration

and Transformation, Data Reduction

UNIT-2 Concepts Description: Characterization and Comparison: Data Generalization and

Summarization-Based Characterization, Analytical Characterization: Analysis of

Attribute Relevance, Mining Class Comparisons: Discriminating between

Different Classes, Mining Descriptive Statistical Measures in Large Databases

UNIT-3 Mining Association Rules in Large Databases: Association Rule Mining,

Mining Single-Dimensional Boolean Association Rules from Transactional Databases,

Mining Multilevel Association Rules from Transaction Databases, Mining

Multidimensional Association Rules from Relational Databases and Data

Warehouses, From Association Mining to Correlation Analysis, Constraint-Based

Association Mining.

UNIT-4 Classification and Prediction: Issues Regarding Classification and

Prediction, Classification by Decision Tree Induction, Bayesian Classification,

Classification by Back propagation, Classification Based on Concepts from

Association Rule Mining, Other Classification Methods, Prediction, Classifier

Accuracy.

UNIT-5 Cluster Analysis Introduction :Types of Data in Cluster Analysis, A Categorization of

Major Clustering Methods, Partitioning Methods, Density-Based Methods, Grid-

Based Methods, Model-Based Clustering Methods, Outlier Analysis

Types of Data Bases: Spatial Databases, Mining Multimedia Databases,

Mining Time-Series and Sequence Data, Mining Text Databases, Mining the World

Wide Web.

TEXT BOOKS:

1. Data Mining – Concepts and Techniques - JIAWEI HAN & MICHELINE KAMBER Harcourt India.

2. Data Mining Techniques – ARUN K PUJARI, University Press

3. Building the DataWarehouse- W. H. Inmon, Wiley Dreamtech India Pvt. Ltd..

REFERENCE BOOKS:

1. Data Warehousing in the Real World – SAM ANAHORY & DENNIS MURRAY.

Pearson Edn Asia.

2. Data Warehousing Fundamentals – PAULRAJ PONNAIAH WILEY STUDENT EDITION

3. The Data Warehouse Life cycle Tool kit – RALPH KIMBALL WILEY STUDENT EDITION

4. Data Mining Introductory and advanced topics –MARGARET H DUNHAM, PEARSON EDUCATION.

: 0866-2565679



India)

CLOUD COMPUTING

MCS40217

w.e.f : 2017 - 2018

II MSC

IV Semester

Objectives:

The objective of this course is to provide graduate students of MSc Information Systems with the

comprehensive and in-depth knowledge of Cloud Computing concepts, technologies, architecture and

applications by introducing and researching state-of-the-art in Cloud Computing fundamental issues,

technologies, applications and implementations.

Total No

of Hours

for

Teaching

-

Learning

Instructional

Hours for

Week

Duration of

Semester End

Examination

in Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

Another objective is to expose the students to frontier areas of Cloud Computing and information systems,

while providing sufficient foundations to enable further study and research.

Learning Outcomes:

Articulate the main concepts, key technologies, strengths, and limitations of cloud computing and the

possible applications for state-of-the-art cloud computing

Identify the architecture and infrastructure of cloud computing, including SaaS, PaaS, IaaS, public cloud,

private cloud, hybrid cloud, etc.

Explain the core issues of cloud computing such as security, privacy, and interoperability.

Choose the appropriate technologies, algorithms, and approaches for the related issues.

Identify problems, and explain, analyze, and evaluate various cloud computing solutions.

Provide the appropriate cloud computing solutions and recommendations according to the applications used.

Attempt to generate new ideas and innovations in cloud computing.

Collaboratively research and write a research paper, and present the research online.

Unit 1 Systems modeling, Clustering and virtualization: Scalable Computing over the

Internet, Technologies for Network based systems, System models for Distributed and

Cloud Computing, Software environments for distributed systems and clouds,

Performance, Security And Energy Efficiency.

Unit 2 Virtual Machines and Virtualization of Clusters and Data Centers:Implementation

Levels of Virtualization, Virtualization Structures/ Tools and mechanisms, Virtualization

of CPU, Memory and I/O Devices, Virtual Clusters and Resource Management,

Virtualization for Data Center Automation.

Unit 3 Cloud Platform Architecture:Cloud Computing and service Models, Architectural Design of

Compute and Storage Clouds, Public Cloud Platforms, Inter Cloud Resource Management, Cloud

Security and Trust Management. Service Oriented Architecture, Message Oriented Middleware.

Cloud Programming and Software Environments: Features of Cloud and Grid Platforms, Parallel

& Distributed Programming Paradigms, Programming Support of Google App Engine,

Programming on Amazon AWS and Microsoft Azure, Emerging Cloud Software Environments

Unit 4 Cloud Resource Management and Scheduling : Policies and Mechanisms for Resource

Management Applications of Control Theory to Task Scheduling on a Cloud, Stability of a Two

Level Resource Allocation Architecture, Feedback Control Based on Dynamic Thresholds.

Coordination of Specialized Autonomic Performance Managers, Resource Bundling, Scheduling

Algorithms for Computing Clouds, Fair Queuing, Start Time Fair Queuing, Borrowed Virtual

Time, Cloud Scheduling Subject to Deadlines, Scheduling MapReduce Applications Subject to

Deadlines.

Unit 5 Storage Systems: Evolution of storage technology, storage models, file systems and database,

distributed file systems, general parallel file systems. Google file system., Apache Hadoop,

BigTable, Megastore, Amazon Simple Storage Service(S3)

Text Books


1 Kai Hwang, Geoffry

C. Fox, Jack J.

Dongarra

Distributed and Cloud Computing MK Elsevier

2 Dan C Marinescu Cloud Computing, Theory and

Practice

MK Elsevier

3 Arshadeep Bahga,

Vijay Madisetti

Cloud Computing, A Hands on

approach

University Press

Reference Books :


1 Anthony T Velte,

Toby J Velte, Robert

Elsenpeter

Cloud Computing, A Practical

Approach

TMH

2 Raj Kumar Buyya,

Christen

vecctiola, S Tammarai

selvi

Mastering Cloud Computing,

Foundations and Application

Programming

TMH

: 0866-2565679



India)

ELECTIVE-II

MACHINE LEARNING

MCS40317

w.e.f : 2017 - 2018

II MSC

IV Semester

Course Objectives

Be able to formulate machine learning problems corresponding to different applications.

Understand a range of machine learning algorithms along with their strengths and weaknesses.

Understand the basic theory underlying machine learning.

Be able to apply machine learning algorithms to solve problems of moderate complexity.

Be able to read current research papers and understand the issues raised by current research.

Course Outcomes

Have a good understanding of the fundamental issues and challenges of machine learning: data, model

selection, model complexity, etc.

Have an understanding of the strengths and weaknesses of many popular machine learning approaches.

Appreciate the underlying mathematical relationships within and across Machine Learning algorithms and

the paradigms of supervised and un-supervised learning.

Be able to design and implement various machine learning algorithms in a range of real-world applications

Total No of

Hours for

Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

UNIT-I

Introduction: An illustrative learning task, and a few approaches to it. What

is known from algorithms? Theory, Experiment. Biology. Psychology.

Concept Learning: Version spaces. Inductive Bias. Active queries. Mistake

bound PAC model. basic results. Overview of issues regarding data sources,

success criteria.

UNIT —II

Decision Tree Learning: – Minimum Description Length Principle.

Occam‘s razor. Learning with active queries

Neural Network Learning: Perceptions and gradient descent back

propagation

UNIT —III

Sample Complexity and Over fitting: Errors in estimating means. Cross

Validation and jack-knifing VC dimension.

Irrelevant features: Multiplicative rules for weight tuning.

Bayesian Approaches: The basics Expectation Maximization. Hidden

Markov Models

UNIT IV

Instance-based Techniques: Lazy vs. eager generalization. K nearest

neighbor, case- based reasoning.

UNIT V

Genetic Algorithms: Different search methods for induction – Explain

nation based Learning: using prior knowledge to reduce sample complexity.

TEXT BOOKS

Tom Michel, Machine Learning, McGraw Hill, 1997

Trevor Has tie, Robert Tibshirani & Jerome Friedman. The Elements

of Statically Learning, Springer Verlag, 2001.

REFERENCE BOOKS

Machine Learning Methods in the Environmental Sciences, Neural Networks, William W Hsieh, Cambridge

Univ Press.

Richard o. Duda, Peter E. Hart and David G. Stork, pattern classification, John Wiley & Sons Inc., 2001.

Chris Bishop, Neural Networks for Pattern Recognition, Oxford University Press, 1995.

: 0866-2565679



Elective II-SOFTWARE

TESTING

MCS40317

w.e.f : 2017 - 2018

II MSC

IV Semester

Total No of

Hours for

Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

Course Objectives:

To discuss the various test processes and continuous quality improvement

To make the students understand the need of software testing before releasing at the end of SDLC.

To discuss the methods of test generation from requirements

Learning Outcomes:

The student would be able to identify the types of errors and fault models

Master the modelling of static attributes of a system design

The student would be able to prepare test cases and execute them.

The student would be able to implement the different functional testing tools.

Unit 4

(12Hrs)

Structural Testing: Control Flow Testing, Data Flow Testing, Slice Based Testing, Mutation

Testing.

Unit 5

(12Hrs)

Object Oriented Testing: What Is Object Orientation?, What Is Object Oriented Testing?,

Path Testing, State Based Testing, Class Testing.

Unit 1

(12Hrs)

Introduction: Some Software Failures, Testing Process, Terminologies, Limitations Of

Testing, The V Shaped Software Life Cycle Model.

Software Testing Activities: Levels Of Testing: Unit Testing, Integration Testing, System

Testing, Acceptance Testing, Debugging, Software Testing Tools, Software Test Plan.

Unit 2

(12Hrs)

Software Verification: Verification Methods, SRS Document Verification, SDD Document

Verification, Source Code Reviews, User Documentation Verification.

Metrics And Models In Software Testing: Software Metrics, Categories Of Metrics, Object

Oriented Metrics Used In Testing, What Should We Measure During Testing?

Unit 3

(12Hrs)

Functional Testing: Boundary Value Analysis, Equivalence Class Testing, Decision Table

Based Testing, Cause-Effect Graphing Technique.

TEXT BOOKS


1 Yogesh Singh Software Testing Cambridge

University Press

REFERENCE BOOKS


1 Aditya P.Mathur Foundations Of

Software Testing

2nd

Edition,Pearson

Education

: 0866-2565679

KAKARAPARTI BHAVANARAYANA PG COLLEGE (AUTONOMOUS)


Kothapeta, Vijayawada – 520 001. UGC : CPE NAAC – ‘A’ Grade ISO 9001 : 2008 NIRF 92nd Rank

(All India)

ELECTIVE-II

EMBEDDED SYSTEMS MCS40317 w.e.f : 2017 - 2018 II MSC Semester

Total No of

Hours for

Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

Course Objectives:

To introduce students to the modern embedded systems and to show how to

understand and program such systems using a concrete platform built around

A modern embedded processor like the Intel ATOM.

Course Outcomes:

Describe the differences between the general computing system and the embedded system, also recognize the classification of embedded systems..

Become aware of the architecture of the ATOM processor and its programming aspects (assembly Level) Become aware of interrupts, hyper threading and software optimization.

Design real time embedded systems using the concepts of RTOS.

Analyze various examples of embedded systems based on ATOM processor.

Text Book:

Frank Vahid / Tony Givargis, ―Embedded System Design‖, Third

edition, Wiley (2008). Chapters : 1 to 8. Reference book:

Raj Kamal, ―Embedded Systems‖, Second Edition , TMH (2008).

UNIT I

Introduction.:Embedded system overview,Design challenges, Processor

technology.,IC technology, Design technology,Trade offs.

Custom single purpose processors: Hardware: Introduction, Combinational

logic, Sequential logic, Custom single purpose processor design, RT-level

custom single purpose processor design, Optimizing custom single purpose

processor design.

UNIT II

General purpose processors : Software : Introduction, Basic architecture,

Operation, Programmer‘s view, Development environment, Application specific

instruction set processors, Selecting a microprocessor, General purpose

processor design

UNIT III

Standard single purpose processors: Peripherals: Introduction, Timers,

Counters, Watchdog timers, UART, Pulse width modulators, LCD controllers,

Keypad controllers, Stepper motor controller, Analog to digital converters, Real

time clocks.

Memory: Introduction, Memory write ability and storage permanence,

Common memory types, Composing memory, Advanced RAM

UNIT IV

Interfacing: Introduction, Communication basics, Microprocessor interfacing –

I/O addressing, Microprocessor interfacing–Interrupts, Microprocessor

interfacing–DMA, Arbitration,Multi level bus architectures, Advanced

communication principles, Serial protocols, Parallel protocols, Wire less

protocols

Digital camera example: Introduction, Introduction to simple digital camera,

Requirements specifications, Design

UNIT V

State machine and concurrent process models: Introduction, Models Vs

languages, text Vs graphics, An introductory example, A basic state machine

model-FSM, Finite state machine with data path model-FSMD,Using state

machine, HCFSM and stack charts languages, Program state machine model –

PSM, The role an appropriate model and language,Concurrent process model,

Concurrent processes, Communication among the processes, Synchronization

among the processes, Implementation, Data flow model, Real time systems

: 0866-2565679

KAKARAPARTI BHAVANARAYANA PG COLLEGE (AUTONOMOUS)


Kothapeta, Vijayawada – 520 001. UGC : CPE NAAC – ‘A’ Grade ISO 9001 : 2008 NIRF 92nd Rank

(All India)

ELECTIVE-II

NEURAL NETWORKS

MCS40317 w.e.f : 2017 - 2018 II MSC IVSemester

Course Objectives:

to introduce the neural networks for classification and regression;

to give design methodologies for artificial neural networks;

to provide knowledge for network tunning and overfitting avoidance;

to offer neural network implementations in Matlab;

to demonstrate neural network applications on real-world tasks.

Course Outcomes: understand the differences between networks for supervised and unsupervised learning;

design single and multi-layer feed-forward neural networks;

develop and train radial-basis function networks;

program linear and nonlinear models for data mining;

Analyse the performance of neural networks.

Total No of

Hours for

Teaching -

Learning

Instructional Hours

for Week

Duration of

Semester End

Examination in

Hours

Max Marks

Credits


3 Hours CIA SEE

4 4 0 30 70

TEXT BOOK

LaureneV. Fausett, ―Fundamentals of Neural Networks-Architectures, Algorithms and

Applications‖, Pearson Education, 2011.

REFERENCES

1. James. A. Freeman and David.M.Skapura, "Neural Networks Algorithms,

Applications and Programming Techniques ",Pearson Education, Sixth Reprint, 2011. 2. Simon Haykin,"Neural Networks and Learning Methods‖, PHI Learning Pvt.

Ltd., 2011.

3. James A. Anderson,―An Introduction to Neural Networks‖,PHI Learning Pvt.

Ltd., 2011.

4. Martin T. Hagan, Howard B. Demuth, Mark Beale, ―Neural Network Design‖,

Cengage Learning, Fourth Indian Reprint, 2010.

5. Bart Kosko, ―Neural Networks and Fuzzy Systems-A Dynamical Approach to

Machine Intelligence”, PHI Learning Pvt. Ltd., 2010.

UNIT I INTRODUCTION: Definition of ANN-Biological Neural Networks-

Applications of ANN-Typical Architectures-Setting the weights-

Common Activation functions-Development of Neural Networks-

McCulloch-Pitts Neuron

UNIT II SIMPLE NEURAL NETS FOR PATTERN CLASSIFICATION:

General discussion - Hebb net – Perceptron-Adaline - Backpropagation

neural net- Architecture- Delta Learning Rule Algorithm-Applications

UNIT III PATTERN ASSOCIATION:Training Algorithm for Pattern

Association-Hetero associative memory neural network applications-

Auto associative net-Iterative Auto associative net- Bidirectional

Associative Memory-Applications

UNIT IV NEURAL NETS BASED ON COMPETITION:Fixed Weights

Competitive Nets- Kohonen‘s Self-Organizing Map –Applications-

Learning Vector Quantization-Applications-Counter Propagation Network-

Applications.

UNIT V ADAPTIVE RESONANCE THEORY AND

NEOCOGNITRON:Motivation – Basic Architecture- Basic

Operation-ART1-ART2-Architecture- Algorithm-applications-Analysis

Probabilistic Neural Net-Cascade Correlation- Neocognitron:

Architecture—Algorithm-Applications.