SKPVV Hindu High Schools Committee) Vijayawada - KBN ...

ISO 9001:2008 NAAC – ‘A’ UGC – CPE

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

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

PG DEPARTMENT OF COMPUTER SCIENCE MCA

Course Structure and Scheme of Teaching and Examination (With effect from 2019-20)

I SEMESTER

Paper Code

Paper Title Teaching

Hours/ week

Internal

Marks

External

Marks

No. of

Credits L/T/P

MCA10119 C & Data Structures 4 30 70 4

MCA10217 Computer Organisation 4 30 70 4

MCA10317 Discrete Mathematical Structures 4 30 70 4

MCA10417 Operating Systems 4 30 70 4

MCA10517 Accounting & Financial Management 4 30 70 4

MCA10619 C& DS Lab 6 30 70 3

MCA10717 OS Lab (UNIX) 6 30 70 3

MCA10817 Soft Skills 3 50 -- 2

Library 1 -- -- --

Total 36 260 490 28

II SEMESTER

Paper Code

Paper Title

Teaching

Hours/ week

Internal

Marks

External Marks

No. of Credits

L/T/P MCA20117 Computer networks 4 30 70 4

MCA20219 OOPS through java 4 30 70 4

MCA20317 Data base management systems 4 30 70 4

MCA20418 Probability & statistics 4 30 70 4

MCA20517 e-commerce 4 30 70 4

MCA20619 OOPS through java lab 6 30 70 3

MCA20719 DBMS lab 6 30 70 3

MCA20819 Technical report writing 3 50 -- 2

Library 1 -- -- --

Total 36 260 490 28

III SEMESTER

Paper Code

Paper Title

Teaching

Hours/ week

Internal

Marks

External Marks

No. of Credits

L/T/P MCA30119 Python programming 4 30 70 4

MCA30217 Cryptography and network

security

4 30 70 4

MCA30319 Web technology 4 30 70 4

MCA30417 Software engineering 4 30 70 4

MCA30517 Operation research 4 30 70 4

MCA30619 Python programming lab 6 30 70 3

MCA30719 Web Technology lab 6 30 70 3

MCA30817 Project planning and seminar 3 50 -- 2

Library 1 -- -- --

Total 36 260 490 28

: 0866-2565679


(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)

C & DATA STRUCTURES

MCA10119

w.e.f : 2019 - 2020

I MCA

I Semester

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

7 4 6 30 70

COURSE OBJECTIVES :

Programmers looking for jobs

Programmers wanting to write efficient code

Computer Science students having Data Structures as part of their curriculum

Non Computer science students wanting to enter IT industry

LEARNING OUTCOMES:

Understand the purpose of programming.

Download and understand the role of IDE in writing "C" programs.

Gain knowledge about how one can write Software Programs.

Write interactive programs to perform input and output operations.

Apply logic using programming techniques & decision making statements.

Understand the advantage of using Arrays and Pointers for handling large data.

Learn how to break up a big task into smaller units using functions.

Understand how memory can be dynamically allocated and de-allocated for pointers.

Persist data of the program into data files for using at later point of time.

Create and process data in files using file I/O functions. Read and consume command like

arguments in a program.

DETAILED SYLLABUS

Unit1

(12Hrs) Structure of C program, A Simple C program, identifiers, basic data types and sizes,

Constants, variables, arithmetic, relational and logical operators, increment and decrement

operators, conditional operator, bit-wise operators, assignment operators, expressions, type

conversions, conditional expressions, precedence and order of evaluation.

Input-output statements, statements and blocks, if and switch statements, loops- while, do-

while and for statements, break, continue, goto and labels, programming examples.

Unit2

(12Hrs) Functions, basics, parameter passing, storage classes- extern, auto, register, static, user defined

functions, standard library functions, recursive functions, C preprocessor, example c

programs.

Arrays- concepts, declaration, definition, accessing elements, storing elements, arrays and

functions, two-dimensional and multi-dimensional arrays, applications of arrays, strings.

Unit3

(12Hrs) Pointers- concepts, initialization of pointer variables, pointers and function arguments, address

arithmetic.

Derived types- structures- declaration, definition and initialization of structures, accessing

structures, nested structures, arrays of structures, structures and functions, pointers to

structures, unions, typedef, C program examples.

Unit4

(12Hrs) Introduction to data structures, classification and operations of Data structures, singly linked

lists, doubly linked lists, circular list, representing stacks and queues in C using arrays and

linked lists, infix to post fix conversion, postfix expression evaluation.

Unit5

(12Hrs) Trees- Binary tress, terminology, representation, traversals, graphs - terminology,

representation, graph traversals (DFS & BFS)

Searching - Linear and binary search methods, sorting - Bubble sort, selection sort, Insertion

sort, Quick sort, merge sort.

TEXT BOOK

Author Title Publisher 1 B.A. Forouzan and R.F.

Gilberg, Third edition, Thomson

Computer science, A structured programming approach using C

_

2 A.S.Tanenbaum, Y. Langsam, and M.J. Augenstein

DataStructures Using C PHI/Pearson education

REFERENCE BOOKS:

Author Title Publisher 1 P. Padmanabham C& Data structures B.S. Publications 2 B.W. Kernighan, Dennis M.Ritchie The C

Programming Language

PHI/Pearson Education

3 J.A. Jones & K. Harrow C Programming and Data Structures

Dreamtech Press

: 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)

COMPUTER ORGANIZATION MCA10217 w.e.f : 2017 - 2018 I MCA I 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 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

DETAILED SYLLABUS

Unit1

(12Hrs)

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

(12Hrs)

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

Author Title Publisher

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 and

Organization 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,DecimalA

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

TEXTBOOKS

Autho Title Publisher

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



India)

DISCRETE MATHEMATICAL

STRUCTURE

MCA10317

w.e.f : 2017 - 2018

I MCA

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

DETAILED SYLLABUS

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



India)

OPERATING SYSTEM MCA10417 w.e.f : 2017 - 2018 I MCA I 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

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:

AUTHOR TITLE PUBLISHER

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



India)

ACCOUNTING AND FINANCIAL

MANAGMENT

MCA10517

w.e.f : 2017 - 2018

I MCA

I 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 define bookkeeping and accounting

To explain the general purposes and functions of accounting

To explain the differences between management and financial accounting

To describe the main elements of financial accounting information – assets, liabilities, revenue

and expenses

To identify the main financial statements and their purposes.

COURSE OUTCOMES:

The student would be able to understand the basic concepts of accounting.

The student would be able to prepare a profit and loss account statement.

The student would be able to handle Financial problems and able to take proper decision .

DETAILED SYLLABUS

Unit -1

(12Hrs)

Accounting Concepts , Double Entry Systems, Journal-Ledger-Trail Balance ,Final Accounts

Unit-2

(12Hrs)

Cost Classification and analysis ,Marginal Costing, Budget-Budgetary Control

Unit-3

(12Hrs)

Standard Costing ,Finance Fucntion,Financial Decision Making

Unit-4

(12Hrs)

Financial Analysis

Unit-5

(12Hrs)

Working Capital Management

TEXT BOOKS


1 K. Rajeswararao and G Prasad Accounting and Finacne Jai Bharath Publishers ,2002

REFERENCE BOOOKS

Author Title Publishe

1 Vanherne& James

C,JohnM.Wechowiez JR

Fundamenetals of Financial Management

PHI,2002

2 Horngern, SundemEllictt Introduction to Financial Accounting

Pearson Education

3 Paresh Shah Basic Financial Accounting for Management

Oxford Higher Education(2008)

: 0866-2565679



India)

Soft Skills & Communication Skills MCA10817 w.e.f : 2017 - 2018 I MCA I 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

2 3 0 50 0

CAREER OBJECTIVES:

The objectives of the Skills Soft Training Workbook are to give each student a realistic

perspective of work and work expectations

To help formulate problem solving skills, to guide students in making appropriate and

responsible decisions, to create a desire to fulfil individual goals

To educate students about unproductive thinking, self-defeating emotional impulses, and self-

defeating behaviours.

LEARNING OUTCOMES:

Learning to keep going when things don‘t go according to plan, coping with the unfamiliar,

managing disappointment and dealing with conflict

learning to connect and work with others to achieve a set task

assessing the requirements of a task, identifying the strengths within the team, utilising the

diverse skills of the group to achieve the set objective, awareness of risk/safety

demonstrating clear briefing and listening skills, not being afraid to ask for help and support

when necessary

DETAILED SYLLABUS

UNIT-I

(9Hrs)

Meaning of Communication skills and Soft skills, Inter-Intra personal skills, Leadership

skills, Decision making, Negotiation skills, Problem solving skills, Team building

skills.

UNIT-II

(9Hrs)

Listening & Speaking skills, Writing oral presentations, Types of listening,

Conversations, Tips on how to reduce stage fear.

UNIT-III

(9Hrs)

Goal planning, creating individual action plans, Article writing, Hoe to give seminars

and organise seminars.

UNIT-IV

(9Hrs)

Team building & Team work, Emotional Intelligence and Emotional quotients, Self-

awareness and personal growing.

UNIT-V

(9Hrs)

Social and corporate etiquettes, over view of Interview, Self introduction at various

levels and Mock interviews, CV preparation, GD.

REFERENCE:

1.Chaturvedi&Chaturvedi (2006), Business Communication, Pearson Education.

2. Meenakshi Raman Prakash Singh, Business Communication, Oxford University Press.

3.Lesikar. Pettitt, Sixth edition, Business Communication (2003), Richard D. Irwin ING, USA.

4. C. S. Rayudu, Communication, Himalayan Publishing House Pvt.Ltd.

5. M. Ashraf Rizvi, Effective Technical Communication, MC graw Hill.

6. Priyadarshinipatnaik, Group Discussion and Interview skills, Cambridge University Press.

7. M. Ashraf Rizvi, Effective Technical Communication, MC graw Hill.

INTERNAL EVALUATION 5 COMPONENTS

(1). Test (10 marks).

(2). Quiz in soft skills (10 marks). (3). Role

Play On (10 marks).

(4). Group Discussion (10 marks). (5).

Assignment (10 marks).

: 0866-2565679



India)

COMPUTER NETWORKS MCA20117 w.e.f : 2017 - 2018 I MCA 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 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: 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 – Internet works. 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.

Physical Layer: Guided Transmission Media: Magnetic Media – Twisted Pair – Coaxial Cable – Fiber

Optics. Data Link Layer: Data Link Layer Design Issues: Services Provided to the Network Layer –

Framing – Error Control – Flow Control. Error Detection and Correction: Error correcting Codes –

Error Detecting Codes. Elementary Data Link Protocols: An unrestricted 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. Example

Data Link Protocols: HDLC–The Data Link Layer in the Internet. (Total hours: 12)

Unit2:The Medium Access Control Sub layer: Ethernet: Ethernet Cabling – Manchester Encoding –

The Ethernet MAC sublayer Protocol – The Binary Exponential Backoff Algorithm – Ethernet

Performance – Switched Ethernet – Fast Ethernet – Gigabit Ethernet – IEEE 802.2: Logical Link

Control – Retrospective on Ethernet. Wireless Lans: The 802.11 Protocol Stack – The 802.11 Physical

Layer – The 802.11 MAC sublayer Protocol – The 802.11 Frame Structure. Bluetooth: Bluetooth

Architecture – Bluetooth Applications –The Bluetooth Protocol Stack. Data Link Layer Switching:

Bridges from 802.x to 802.y – Local Internet working –Spanning Tree Bridges – Remote Bridges –

Repeaters, Hubs, Bridges, Switches, Routers and Gateways –Virtual LANs. (Total hours: 12)

Unit3: 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 VectorRouting–Link

State Routing–Hierarchical Routing –Broadcast Routing–Multicast Routing–Routing for Mobile Hosts.

Internet Working:How Networks Differ–How Networks can be connected–Concatenated Virtual

Circuits–Connectionless Internet working –Tunnelling–Internet work Routing–Fragmentation.The

NetworkLayerintheInternet:TheIPProtocol–IPaddress–InternetControlProtocols–OSPF–

TheInternetGatewayRoutingProtocol– BGP–The Exterio Gateway Routing Protocol. (Total hours: 12)


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)

Unit4: 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–Crash

Recovery. The Internet Transport Protocols: UDP Introduction toUDP–RemoteProcedureCall–

TheRealTimeTransportProtocol.TheInternetTransport 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 Transmission Policy–TCP

congestion Control–TCP Timer Management–Wireless TCP and UDP–Transactional TCP. .

(Total hours: 12)

Unit5: The Application Layer:DNS:TheDomainNameSystem:TheDNSNameSpace–

ResourceRecords–NameServers.ElectronicMail:Architectureand Services–The User Agent–Message

Formats– Message Transfer–Final Delivery. The World Wide Web: Architecture Overview–Static

Web Documents– DynamicWebDocuments–HTTP–TheHyperTextTransferProtocol–

PerformanceEnhancements–The WirelessWeb.Multimedia:IntroductiontoDigitalAudio–

AudioCompression–StreamingAudio– InternetRadio–VoiceOverIP–IntroductiontoVideo–

VideoCompression–VideoonDemand. . (Total hours: 12)

TEXTBOOKS


1 Andrew S.

Tanenbaum Computer Networks Fourth Edition, PHI

REFERENCE BOOKS

: 0866-2565679



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

NIRF 92nd Rank (All

India)

OOPS THROUGH JAVA MCA20219 w.e.f : 2019 - 2020 I MCA 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: Gain knowledge about basic Java language syntax and semantics to write Java programs and

use concepts such as variables, conditional and iterative execution methods etc.

Understand the fundamentals of object-oriented programming in Java, including defining

classes, objects, invoking methods etc and exception handling mechanisms.

Understand the principles of inheritance, packages and interfaces

LEARNING OUTCOMES:

Understand the principles of OOP

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

DETAILED SYLLABUS

Unit I :Introduction to OOPs: 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, StringBuffer Class

Unit II: Classes and Objects-Object Creation, Initializing the instance variables, access 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 III: Abstract Classes, Interfaces and Packages:

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

UnitIV:Exception handling and Threads: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 V : Streams and files: Stream, Creating File using FileOutputStream, Reading Data from a File

using FileInputStream, Creating File using FileWriter, Reading a File using FileReader, 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..

Textbooks

A

uthor

Titl

e

Publisher

1 R Nageswararao

JAVA8 Core Java Black Book. An Integrated

approach :

2 Dietal, Dietal Java: How to

Program

8/e PHI

Reference books


1

Venkateswarlu,EV Prasad, S.

Chand

Learn Object Oriented Programming

using Java

2 Dr K SomaSundaram Programming in Java2 JAICO

Publishing house

3 P. Radha Krishna Object Oriented Programming through

Java

University Press

: 0866-2565679



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

Rank (All India)

DATABASEMANAGEMENTSYSTEMS

MCS20317 w.e.f : 2017 -

2018

I MCA

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

6 4 3 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:

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

2. The student develops an ability to write Queries in Database languages and design database

Using SQL

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

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

5. Understand the issues in transaction processing and implement them to

maintain data reliability and integrity.

DETAILED SYLLABUS

Unit1: Databases and Database Users: Introduction, Characteristics of the Database Approach, Actors on

the Scene, Workers behind the scene, Advantages of the using the DBMS Approach. Database System

Concepts and Architecture: Data Models, Schemas and Instances, Three Schema architecture and Data

Independence, Database Languages and Interfaces, Centralized and Client/Server Architecture for

DBMS,ClassificationofDatabaseManagementSystems.DataModellingUsingtheERModel: Conceptual Data

models, Entity Types, Entity Sets ,Attributes and Keys, Relationship types, Relationship sets, roles and

structural Constraints, Weak Entity types, Relationship Types of Degree Higher than Two, Refining the ER

Design for the COMPANY Database The Enhanced Entity-Relationship Model: Subclasses, Super classes

and Inheritance, Specialization and Generalization, Constraints and Characteristics of Specialization and

Generalization Hierarchies, Modeling of Union Types using Categories, An Example University ERR

Schema, Design Choices and Formal Definitions. (Total hours: 12)

Unit2: 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. The Relational Algebra and Relational Calculus: Unary Relational

Operations: SELECT and PROJECT, Relational Algebra Operations from set Theory, Binary Relational

Operations: JOIN and DIVISION, AdditionalRelationalOperations.SQL-

99:SchemaDefinition,Constraints,QueriesandViews: SQL Data Definitions and Data Types, Specifying

Constraints in SQL, Schema Change Statements on SQL, Basic Queries in SQL, More Complex SQL

Queries, INSERT, DELETE and UPDATE statements in SQL, Triggers and Views.

(Total hours: 12)

Unit3: Functional Dependencies and Normalization for Relational Databases: Informal Design

Guidelines for Relation Schemas, Functional dependencies, Normal Forms Based in Primary Keys, General

Definitions of Second and Third Normal Forms, Boyce-Codd Normal Form. Relational Database Design

Algorithms and Further Dependencies: Properties of Relational Decompositions, Algorithms for

Relational Database Schema Design, Multivalued Dependencies and Fourth Normal Form, Join

Dependencies and Fifth Normal Form, Inclusion Dependencies ,Other Dependencies and Normal Forms.

(Total hours: 12) Unit4: Disk Storage ,Basic File Structure sand Hashing :Introduction, Secondary Storage Devices,

Buffering of Blocks, Placing file Records on Disk, Operations on Files, Files of Unordered Records, Files of

Ordered Records, Hashing Techniques, Other Primary File

Organizations,ParallelizingDiskAccessusingRAIDTechnology.Indexing Structures for Files: Types of

Single-Level Ordered Indexes ,Multilevel Indexes ,Dynamic Multilevel indexes Using B- Trees and B+Trees,

Indexes on Multiple Keys, Other Types of Indexes. (Total hours: 12)

Unit5: 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. Concurrency

Control Techniques: Two Phase Locking Techniques for Concurrency Control, Concurrency Control

Based on Timestamp Ordering, Multiversion Concurrency control techniques, Validation concurrency

control Techniques, Granularity of Data Items and multiple Granularity Locking. (Total hours: 12)

TEXT BOOKS:


1 RamezElmasri, ShamkantB. Navathe,

Fundamentals of Database Systems

FifthEdition,PearsonEducati on(2007)

REFERENCE BOOKS:


1 Peter Rob,Carlos Coronel DataBase Systems Design

Implementation and Management Eight Editon Thomson(2008)

2 C.J.Date,A.KannanS.Swamynanathan An Intorduction to Data Base Systems VII Edition Pearson

: 0866-2565679



India)

PROBABILITY & STATISTICS MCA20418 w.e.f : 2018 - 2019 I MCA 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

4 4 0 30 70

COURSE OBJECTIVES:

To revise fundamental concepts and techniques in probability.

To introduce new techniques for identifying probability distributions.

To develop the skills for applying the probability and statistical techniques in computer

science.

COURSE OUTCOMES:

The student would be able to understand the basic probability axioms and rules and the

moments of discrete and continuous random variables as well as be familiar with common named

discrete and continuous random variables.

The student develops an ability to design and conduct experiments, as well as to analyse and

interpret data

The student can calculate probabilities, and derive the marginal and conditional distributions

of bivariate random variables.

DETAILED SYLLABUS

UNIT-I

(12Hrs)

Introduction to Statistics: Concepts of Primary and Secondary data. Methods of collection

and editing of primary data, Secondary data.Designing a questionnaire and a schedule.

Measures of Central Tendency - Mean, Median, Mode,Geometric Mean and Harmonic Mean.

UNIT-II

(12Hrs)

Measures of dispersion: Range, Quartile Deviation, Mean Deviation and Standard

Deviation. Descriptive Statistics -Central and Non-Central moments and their

interrelationship. Sheppard's correction for moments. Skewness and kurtosis.

UNIT-III

(12Hrs)

Correlation: meaning, definition and types of correlation. Measures: scatter diagram method,

Karl Pearson correlation coefficient, spearman rank correlation coefficient. Probable error and

coefficient of determination. Regression analysis: meaning, definition, regression lines,

equations and properties

UNIT-IV

(12Hrs)

Large sample test: test of significance for mean, difference of means, test of significance for

standard deviation, tests on single proportion and two proportions. Small sample test: t-test

for single mean, difference of means and paired t-test.

UNIT-V

(12Hrs)

Time series analysis: meaning, definition, components of time series. Moving averages

method, least square method for estimating trend values.

TEXT BOOKS:

AUTHOR TITLE PUBLISHER 1 S C Gupta & VK Kapoor

1. Fundamentals of

Mathematical

statistics

sultan Chand & Sons, New Delhi.

REFERENCE BOOKS:

AUTHOR TITLE PUBLISHER 1 S C Gupta & VK Kapoor

Fundamentals of Appliedstatistics sultan Chand & Sons, New Delhi.

2 Goon Gupta & Das Gupta Outlines of statistics Vol II _

3 Hogg & Craig.

Introduction to mathematical statistics _

: 0866-2565679


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

e- COMMERCE MCA20517 w.e.f : 2017 - 2018 I MCA 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

4 4 0 30 70

OBJECTIVES: To make the students familiar with different types of electronic payment systems.

To understand the role of supply chain management in e-commerce. To make the students familiar with inter and intra organizational

commerce.

To develop an understanding of information search and retrieval.

LEARNING OUTCOMES: The student would be able to demonstrate an understanding of the foundations and importance

of E-commerce and understanding of retailing in E-commerce by:

o Analysing branding and pricing strategies,

o Using and determining the effectiveness of market research

o Assessing the effects of disintermediation.

The student could analyse the impact of E-commerce on business models and strategy

The student would be able to describe Internet trading relationships including Business to

Consumer, Business-to-Business, Intra-organizational.

DETAILED SYLLABUS

Unit1

(12Hrs)

Emergence of e-Commerce–Traditional vs. E-Commerce - Internet and World WideWeb-

Business Models for e-Commerce-B2C, B2B, C2C & C2B, Merits and Limitations

Unit2

(12Hrs)

Intranet, Extranet, & Internet, Internet Backbone in India, ISP and services in India, OSI Model,

Standards & Overview of TCP/IP, Internet Security, e-commerce & Internet.

Unit3

(12Hrs)

E-Marketing- Traditional Marketing, Online Marketing- Advantages of onlineMarketing -

Advertisements in E-commerce- various means of advertising- advertisement strategies

Unit4

(12Hrs)

CRM-Traditional methods-Technology support-E-CRM-Customer Life Cycle- CRMCapabilities

and Customer Life Cycle-Data Mining in CRM - e-Supply Chain- Old ways of Managing supply

and information flow-new ways of managing supply chain- several ways to reduce inventory-

Real time benefits of e-Supply Chain.

Unit5

(12Hrs)

E-Commerce Payment Systems-Electronic Payments with Protocols-Securityschemes-Electronic

Fund Transfer and Debit Cards-E-Cash, Properties of E-Cash-E-Cash in Action- Operational

Risk and E-Cash-Legal issues- E-Cheque- Risk and E-Payments Systems-Cashless Economy

TEXT BOOKS:

AUTHOR TITLE PUBLISHER 1 Effraim Turban, Joe Lee,

David Kind-H Michael Chung E-Commerce, A Management Perspective

Mc. GrawHill(Schaum‘s Outlines)

2 P.T. Joseph,S.J Ecommerce an Indian Perspective

PHI 3rd

REFERENCE BOOKS:

AUTHOR TITLE PUBLISHER 1 Pandey US &ShuklaEr.S., E-Commerce & M- Commerce

Technology S.Chand& Company New Delhi.

2 Jonathan Reynolds E-Business A Management Perspective

Oxford University Press.

: 0866-2565679



PYTHON PROGRAMMING MCA30119 w.e.f : 2019 - 2020 II MCA 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

OBJECTIVES:

To understand and be able to use the basic programming principles such as data types, variable, conditionals,

loops, recursion and function calls.

To learn how to use basic data structures such as List, Dictionary and be able to manipulate text files and

images.

To understand the process and will acquire skills necessary to effectively attempt a programming problem and

implement it with a specific programming language – Python.

COURSE OUTCOMES:

At the end of this course, the students will be able to

Gain knowledge about the basic concepts of python programming.

Solve the basic design problems using object and classes.

Understand the principles of File operation

Obtain knowledge about Lists, Dictionarys,Tuples

DETAILED SYLLABUS

UNIT - I Introduction: History of Python – Getting Started with Python – Programming Style –

Writing a Simple Program – Reading Input from the Console – Identifiers – Variables,

Assignment Statements, and Expressions Numeric Data Types and Operators – Type

Conversions and Rounding–Introduction – Boolean Types, Values, and Expressions– if

Statements – Two-Way if-else Statements – Nested if and Multi-Way if-elif-else Statements

– Logical Operators – Conditional Expressions – Operator Precedence and Associativity

UNIT - II Arrays in Python: Creating an Array, Types of Arrays, Attributes of an Array

Strings and Characters, Python functions: Defining a Function – Calling a Function –

Functions with/without Return Values – Positional and Keyword Arguments –Passing

Arguments by Reference Values, lambda expressions generators,modules,packages,

UNIT-III Classes and objects: Introduction to Object – Oriented Programming – Basic principles of

Object – Oriented Programming in Python – Classes and Objects, Inheritance and

Polymorphism, Abstract classes and Interfaces

UNIT-IV Files: Files, Exception Handling and Network Programming: Introduction –Text Input

and Output – File Dialogs –Exception Handling – Raising Exceptions – Processing

Exceptions Using Exception Objects – Defining Custom Exception Classes

UNIT-V Lists and Tuples, Dictionaries, Threads: Creating lists, aliasing and cloning in lists, sorting

list elements, nested lists, Creating tuples, nested tuples, inserting, deleting, modifying

elements in tuple. Dictionary methods, loops with dictionary,coverting lists in to dictionary

and passing dictionary’s as functions, Single and multi-tasking in Threads, creating threads in

python, thread synchronization, daemon threads.

TEXT BOOKS:

1. Core Python Black book Dream Tech Publishers Dr R. Nageswara Rao

2. Mark Lutz, “Learning Python, Powerful OOPs”, O’Reilly, 2011.

3. Guttag, John, “Introduction to Computation and Programming Using Python”, MIT Press, 2013

REFERENCES:

1. Jennifer Campbell, Paul Gries, Jason montajo, Greg Wilson, “Practical Programming

An Introduction To Computer Science Using Python” The Pragmatic Bookshelf ,

2009.

2. Wesley J Chun “Core Python Applications Programming”, Prentice Hall, 2012.

: 0866-2565679



CRYPTOGRAPHY &

NETWORK SECURITY

MCA30217

w.e.f : 2017 - 2018

II MCA

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 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)


Kothapeta, Vijayawada – 520 001.

: 0866-2565679

UGC : CPE NAAC – ‘A’ Grade ISO 9001 : 2008 NIRF 92nd Rank (All India)

WEB TECHNOLOGY

MCA30319

w.e.f : 2019 - 2020

II MCA

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


Kothapeta, Vijayawada – 520 001.

: 0866-2565679

UGC : CPE NAAC – ‘A’ Grade ISO 9001 : 2008 NIRF 92nd Rank (All India)

SOFTWARE ENGINEERING

MCA30417

w.e.f : 2017 - 2018

II MCA

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 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:

(12Hrs)

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:

(12Hrs)

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:

(12Hrs)

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:

(12Hrs)

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:

(12Hrs)

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, Pankaj Jalote, 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.

7. Software Engineering Foundations, Yingux Wang, Auerbach Publications, 2008.

: 0866-2565679



OPERATION RESEARCH

MCA30517

w.e.f : 2017 - 2018

II MCA

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

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

Unit -1:

(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

Unit – 2:

(12Hrs)

Graphical method and simplex method and its applications, duality and sensitive analysis,

duality in linear Programming

Unit – 3:

(12Hrs)

Transportation problem: Introduction, methods for finding initial solution, optimal solution,

MODI method, assignment problem

Unit – 4:

(12Hrs)

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

principle, graphical method, Decision making theory and its applications.

Unit – 5:

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

: 0866-2565679


MODEL QUESTION PAPER (w.e.f: 2019 – 20)

I MCA : I Semester

MCA10119: C & DATA STRUCTURES

Time : Three Hours Max Marks:

70

Answer ALL Questions

All Questions carry equal marks ( 5 X 14 = 70)

UNIT - I

1. What are the various operators in C.Explain with examples.

OR

2. Discuss various control flow statements in C with examples.

UNIT - II

3. Explain about storage classes in C.

OR

4. What is Array? Discuss about one dimensional and two dimensional arrays.

UNIT - III

5. What is pointers? Discuss about Address Arithmetic.

OR

6. What is Structure? Discuss about Structures with in Structures.

UNIT - IV

7. What is Data Structure? Discuss about it's classification and operations.

OR

8. What is Linked List ? Discuss about single linked list and it’s operations.

UNIT - V

9. What is Stack? Discuss it’s operations and representation of stack.

OR

10.Discuss about Graph Traversal –

a). BFS

b). DFS



I MCA : I Semester

MCA10217: COMPUTER ORGANIZATION


70



UNIT - I 1. a. Explain the operation of 4×1 multiplexer with logic diagram and truth table.

b. Simplify F together with its don’t care condition d in

i. sum of products form ii. Products of sums form

F(A,B,C,D)=∑(0,1,2,8,9,12,13)

d(A,B,C,D)= ∑(10,11,14,15)

or

c. Discuss the operation of SR flip flop with logic diagram

d. Explain about fixed point and floating point data representation

UNIT - II

2. a. What is register? Explain register transfer using block diagram and Timing diagram.

b. Explain the memory reference instruction

or

c. Draw the block diagram of an ALU and explain the operations performed by it

d. What is an interruput? Explain the interrupt cycle with diagram

UNIT - III

3. a.Describe the organization of Microprogrammed control with block diagram

b.Explain about instruction format

or

c. Explain about different types of addressing modes

d.Explain about control memory in detail

UNIT - IV

4. a.What is BCD adder? Explain with block diagram

b.Explain about Booth’s multiplication algorithm

or

c. With a flow chart explain Hardware algorithm

d. Explain about Floating point arithmetic operations

UNIT - V

5. a. What is an input-output interface? What is the difference between isolated i/o and Memory-mapped I/O

b. Write a note on memory-hierarchy

or

c. What is Asynchronous data transfer?

d. What is locality of reference? Discuss various organizations of cache memory



I MCA : I Semester

MCA10317: DISCRETE MATHEMATICAL STRUCTURES


70



UNIT - I

1. a) Explain Tautology and show that a→(b→c), d→(b∧¬c), a∧b are inconsistent .

(or)

b) Show that P(QR) and (PQ)R are logically equivalent. Test the validity of the following

argument: Some intelligent boys are lazy. Ravi is an intelligent boy. : Ravi is lazy.

UNIT II 2. a) State Euclidean Algorithm. Find the GCD of 414 and 662 using the Euclidean algorithm

(or)

b) How many solutions does the equation x1+x2+x3 =11 have, where x1>=1, x2>=2, and x3>=3?

UNIT III

3. a) Draw the Hasse diagram for the partial ordering {(A,B)|A ⊆B} on the power setP(S), where S={a,b,c}.

(or)

b) Find the solution of recurrence relation an=6an-1-11an-2+6an-3 with the initial condition a0=2,a1=5,a2=15.

UNIT IV

4. a) Prove that, a connected multi graph has an Euler circuit if and only if each of its vertices has even degree.

(or)

b) Explain Isomorphism and verify whether the following is Isomorphic or not

UNIT V

5. a) Explain Prims algorithm for finding minimum spanning tree

(or)

b) Use k maps to minimize the SOP expansion Xyz1+xy

1z

1+x

1yz+x

1y

1z

1



I MCA : I Semester

MCA10417: OPERATING SYSTEMS


70



UNIT - I

1. a) What is an Operating System? Explain Operating Structure? [7m]

b) Explain About IPC? [7m]

(Or)

c) Explain The Following Concepts?

(i) Process Management? [5m]

(ii) Memory Management? [5m]

(iii)Storage Management? [4m]

UNIT II 2. a) What are the Scheduling Criteria ? Describe the Different Types of CPU Scheduling Algorithms .

Write their Advantages and Disadvantages? [14m]

(Or)

b) What is Critical Section Problem? What are The Conditions? Give a Complete

Solution Which for Readers-Writes Problem? [7m]

c) Explain The Concept Of Semaphores. Write The Solution For Readers –Writers Problem? [7m]

UNIT III

3. a) Define a Dead Lock? What are Methods for Handling Dead Locks? [14m]

(Or)

b) What is Paging? Explain About Page Replacement Algorithm ? [7m]

c) Explain the Concepts of The Following [7m]

(i) Swapping (ii) Contiguous Memory Allocation.

UNIT IV

4. a) what are Different Access Methods in O.S, Explain Them? [14m]

(Or)

b) Describe File Allocation Methods in O.S [14m]

UNIT V

5. a) What is a Mass Storage? And Elaborate Mass Storage Structure? [7m]

b) Write about Disk Structure? [7m]

(Or)

c) Briefly Explain About RAID Structure in O.S? [14m]


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

MODEL QUESTION PAPER (w.e.f: 2017 – 18) I MCA : I Semester

MCA10517: ACCOUNTING AND FINANCIAL MANAGEMENT Time : Three Hours Max Marks:

70



UNIT – I 1. a) Define ‘GAAP’. Explain the concepts and conventions of accounting.

(or)

b) Draft the profit and loss a/c and Balance Sheet with imaginary figures.

UNIT – II 2. a) Define cost. Explain about various types of costs which are used in decision making.

(or)

b) What do you understand by Budgeting? Explain about different types of budgets that

management of a big industrial concern would normally prepare.

UNIT – III 3. a) Define the term standard costing. Explain with reasons why an industrial concern should

introduce standard costing system?

(or)

b) Define finance function. Explain the process of financial decision making.

UNIT – IV 4. a) What is financial analysis? Explain the different techniques available for financial analysis.

(or)

b) With the help of following ratios and further information complete the trading, P&L a/c

and

Balance sheet of XYZ ltd.

Gross profit ratio - 20% Net profit ratio - 15% Sales/inventory ratio - 6

Fixed assets/total current assets - 2/2 Fixed assets/total capital - 3/2 Inventory -

Rs.3,00,000

Capital/outside liabilities - 2/4 Fixed assets - Rs.20,00,000

Trading and Profit & Loss a/c

To Cost of sales ----- By Sales -----

To Gross profit c/d -----

To Expenses ----- By Gross Profit b/d -----

To Net profit -----

Balance Sheet

Liabilities Amount Assets Amount

Capital ----- Fixed Assets -----

Current Assets

Add: Net profit ----- Stock -----

Other current assets -----

UNIT – V 5. a) What is working capital? Discuss the factors that can be considered while estimating

working capital requirements of a business firm.

(or)

b) What is inventory management? Discuss in detail the objectives of inventory management.


C&DS LAB

MCA10619

w.e.f 2019-2020

I MCA

I Semester

1. Write a c program to find roots of quadratic equation.

2. Write a c program to perform array operations.

3. Write a c program to implement string operations without using string handling

functions.

4. Write a c program to find whether two strings are anagram or not

5. Write a c program to find whether two strings are palindrome or not

6. Write a c program to perform matrix multiplication

7. Write a c program to perform matrix addition

8. Write a c program to perform transpose of a given matrix

9. Write a c program to perform singly linked list operations

10. Write a c program to perform doubly linked list operations

11. Write a c program to convert infix expression to postfix expression.

12. Write a c program to evaluate postfix expression

13. Write a c program to perform queue operations using arrays

14. Write a c program to perform queue operations using linked list

15. Write a c program to perform stack operations using linked list

16. Write a c program to perform stack operations using arrays

17. Write a c program to implement binary tree operations

18. Write a c program to implement traversing of binary trees

19. Write a c program to implement BFS.

20. Write a c program to implement DFS.

21. Write a c program to search an element in an array using linear search.

22. Write a c program to search an element in an array using binary search

23. Write a c program to sort elements using bubble sort.

24. Write a c program to sort elements using quick sort.

25. Write a c program to sort elements using mergesort

1.Write a program to count the number of characters in a given string.

2.Write a program to find whether the given year is leap year or not?

3. Write a program to check whether a given number is even or odd.

4. Write a program to find factorial of a given number.

5. Write a program to print a string in the reverse order.

6. Write a program to count the number of vowels in a given string.

7. Write a program to check whether a given string is palindrome or not.

8. write a menu driven shell script to implement the following UNIX commands.

9. Write a shell script to create two directories and store five files in one directory using the

related commands and to transfer all the files to another directory.

10. write a shell script to accept a file name as input and display whether it exits or not. If it exists,

then give the details of its attributes like access permission ,its size etc.

OS LAB

MCA10717

w.e.f 2017-2018

IMCA

I Semester



I MCA : II Semester

MCA20117: COMPUTER NETWORKS


70



UNIT-I

1) a) Explain different sliding window Protocols

b) Explain in detail about error detecting codes

(OR)

c) Explain about different types of guided transmission media

d) Explain about data link layer design issues.

UNIT-II

2) a) Explain in detail about Binary Exponential Back off algorithm.

b) Explain the following.

i) Blue tooth ii) Routers and gateways iii) switches iv) Bridges

(OR)

c) Write about Bluetooth applications

d) What is Ethernet? Explain various IEEE 802.11 MAC sub layer Protocol

UNIT-III

3) a) Explain various services provided by the network layer to the transport layer.

b) Write short notes on BGP

(OR)

c) Explain in detail about following routing algorithms.

i) Flooding ii) Link state routing ii) Optimality Principle

UNIT-IV

4) a) Briefly explain the transport layer services and primitives.

(OR)

b) Explain in detail about UDP?

UNIT- V

5) a) Explain the architecture and services of E-mail.

b) Explain about message formats in E-mail

(OR)

c) Explain about

i) Video compression ii) Internet Radio ii) Static web documents.



I MCA : II Semester

MCA20219: OOPS THROUGH JAVA

Time : Three Hours Maximum:5*14=70 marks


All Questions carry equal marks

1. a. Difference between POP & OOP(7M)

b. Explain control statements in Java(7M)

or

c. Define Array. Write a Java Program to sort the array elements.(10M)

d. Difference between String Class and StringBuffer Class.(4M)

2. a. What are static methods? Give an example of static method?(7M)

b. Define polymorphism? Explain types of polymorphism(7M)

or

c. Define Inheritance and explain types of inheritance with an example(14m)

3. a. Give an example of Multiple Inheritance(14M)

or

b. Define package and create a package(10m)

c. Write a Java Program to import the above user defined package(4M)

4.a. Explain the importance of Exception handling mechanism with an example(14M)

or

b. Explain Thread Life Cycle with an example(14M)

5.a. Explain Applet Life Cycle.(10M)

b. Differences between Applet and Stand alone applications(4m)

or

c. Explain zipping and Un Zipping in java(14M)



I MCA : II Semester

MCA20317 : DATABASE MANAGEMENT SYSTEMS


70



UNIT-I 1 .a) Write Advantages of using the Database Approach.

b) Explain Three Schema Architecture with neat diagram and Data Independence.

OR

c) Explain Entity, types of Attributes and Keys relationship with an ER-diagram

d) Explain Specialization and Generalization with Examples

UNIT-II

2. a) Explain about Relational Model Constraints and Relational Database Schemas.

b) Write about Relational Algebra Operations.

OR

c) Write about Attribute Data Types and Domains in SQL.

d) Explain JOIN Operations.

UNIT-III 3. a) What is Functional Dependency ? Explain the Informal Design Guidelines.

b) What is Normalization? Explain 1NF and 2NF.

OR

c) Define and BCNF. How BCNF in difference from3NF?

d) Explain properties of Relational Decompositions.

UNIT-IV

4. a) Explain Hashing Techniques in File Organization.

b) Write about Operations on Files.

OR

c) Write types of Single level Ordered Indexes.

d) Explain about B+ Trees

UNIT-V 5. a) Write the Desirable Properties of Transactions.

b) Explain about serializability.

OR

c) What is Concurrency Control? Explain Two Phase Locking Techniques.

d) Explain Validation Concurrency Control Techniques.



I MCA : II Semester

MCA20418:PROBABILITY & STATISTICS


70



Model paper

Answer all the questions. 5 X 14 = 70M

1. a) Explain various methods of collecting data OR

b) Write the merits and demerit of arithmetic mean

c) Calculate median and mode for the following data

2. a)Explain merits and demerits of standard deviation b) Calculate mean deviation for the following data

Mark 10 13 16 19 22 25

f 8 17 23 27 21 15

OR

c) Explain merits and demerits of quartile deviation

d) Calculate coefficient of variation for the following data

3. a) Definecorrelation and explain various types of correlation

b) Calculate the two regression lines for the following data

Height 4.9 5.2 5.8 5.6 6.1 5.2

weight 61 72 74 77 81 70

OR

c) Explain various, measures of correlation coefficient

d) Calculate SRCC for the following data

X 68 72 74 63 79 84 61

Y 71 74 72 77 82 84 80

3. a) Explain procedure of Z – test for single mean

C.I 0-10 10-20 20-30 30-40 40-50 50-60 60-70 70-80 80-90

F 8 13 19 17 12 10 8 5 2

C.I 0-5 5-10 10-15 15-20 20-25 25-30 30-35

F 7 12 17 19 22 16 10

b) A die is thrown 9000 times and a throw of 3 or 4 is observed 3240 times. Show that the die cannot be

regarded as an unbiased one.

OR

c) Explain the procedure of t-test for paired means

d) A random sample of 16 values from a normal population showed a mean of 41.5 inches and the sum

of squares of deviations from this mean is equal to 135 square inches. Show that the assumption of a

mean of 43.5 inches for the population is not reasonable.

4. a) Explain various components of time series

OR

b) Fit a straight line trend to the following data by the method least squares.

Year 1996 1997 1998 1999 2000 2001 2002 2003 2004

Profit 12.6 14.8 18.6 14.8 16.6 21.2 18 17.4 15.8



I MCA : II Semester

MCA20517: e-COMMERCE


70



UNIT-I

1a) Explain briefly Advantages and Disadvantages of E-commerce?

(Or)

b) Discuss various Business models based on relationship of transaction?

UNIT-II

2a) Explain briefly various Technologies of World Wide Web (WWW)?

(Or)

b) Discuss website goals and objectives?

UNIT-III

3a) Explain Advantages of online marketing?

(Or)

b) Discuss various means of Advertising?

UNIT-IV

4a) Explain seven ways to reduce inventory?

(Or)

b) Explain Technology support E-CRM Tool kit?

UNIT-V

5a) Explain various security schemes in electronic payment system?

(Or)

b) what are the risks of e-payment systems and how to overcome such risks?

LAB CYCLE-1

1. Write a Java Program to find biggest among three numbers using terenary operator

2. Write a Java Program to print Pascal Triangle

3. Write a Java Program to print lower and upper triangles of a given matrix

4. Write a java program to sort given numbers using bubble sort.

5. Write a java program to Search an element in an array using binary search.

LAB CYCLE-2

1. Write a program to implement string methods.

2. Write a program to check whether two strings anagram or not.(Eg:Weak, Wake=anagram, bat,rat=not an

anagram)

3. Write a program to check whether the given string is palindrome or not.

4. Write a program to sort the given strings.

5. Write a program to find biggest and smallest number in a given array.

LAB CYCLE-3

1. Write a program to implement method overloading.

2. Write a program to implement constructor overloading.

3. Write a program to implement single inheritance.

4. Write a program to implement static methods in java.

5. Write a program to demonstrate array of objects

LAB CYCLE-4

1. Write a java program to demonstrate abstract methods.

2. Write a java program to implement multiple inheritance

3. Write a java program to implement method overriding.

4. Write a java program to create Shapes package.

5. Write a java program to access the Shapes package.

OOPS LAB

MCS20619

w.e.f 2019-2020

IMCA

II Semester

LAB CYCLE-5

1. Write a program to demonstrate Arithmetic Exception.

2. Write a program to demonstrate ArrayOutOfBounds Exception

3. Write a program to implement userdefined exception

4. Write a program to create a file

5. Write a program to read contents from the file

6. Write a program to copy one file into another file.

7. Write a Program for Compression and Decompression of a file.

LAB CYCLE-6

1. Write a program to create threads on single object.

2. Write a program to create threads on multiple objects.

3. Write a program to synchronize threads.

4. Write a program for Producer and Consumer Problem.

5. Write a program to create sample applet.

6. Write a program to insert data into database.

7. Write a program to retrieve data from the database.

DBMSLAB

MCA20719

w.e.f 2019-2020

I MCA

II Semester

Cycle-I: Aim: Marketing company wishes to computerize their operations by using following tables.

Table Name: Client- Master Description: Used to store client information

Column Name Data Type Size Attribute

CLIENT_ NO

Varchar2

6

Primary key and first letter must start with ‘C’

NAME Varchar2 20 Not null

ADDRESS 1 Varchar2 30

ADDRESS S Varchar2 30

CITY Varchar2 15

PINCODE Varchar2 8

STATE Varchar2 15

BAL_DUE Number 10,2

Table Name: Product_ Master Description: Used to store product information

Column Name Data Type Size Attribute

PRODUCT _NO

Varchar2

6

Primary key and first letter must start with ‘P’

DESCRIPTION Varchar2 15 Not null

PROFIT _PERCENT Number 4,2 Not null

UNIT _MEASUE Varchar2 10

QTY_ ON_ HAND Number 8

REORDER_ LVL Number 8

SELL _PRICE Number 8, 2 Not null, cannot be 0

COST _PRICE Number 8,2 Not null, cannot be 0

Table Name: Salesman_master Description: Used to store salesman information working for the company.

Column Name

Data Type

Size

Attribute

SALESMAN_ NO

Varchar2

6

Primary key and first letter must start with ‘S’

SALESMAN _NAME Varchar2 20 Not null

ADDRESS1 Varchar2 30

ADDRESS2 Varchar2 30

CITY Varchar2 20

PINCODE Number 8

STATE Vachar2 20

SAL_AMT Number 8,2 Not null, cannot be 0

TGT_TO_GET Number 6,2 Not null, cannot be 0 YTD _SALES Number 6,2 Not null

REMARKS Varchar2 20

Table Name: SALES-ORDER Description: Used to store client’s orders

Column Name

Data Type

Size

Attribute

ORDER_ NO

Varchar2

6

Primary key and first letter must start with ‘S’

CLIENT _NO Varchar2 6 Foreign Key

ORDER _DATE Date

DELY _ADDRESS Varchar2 25

SALESMAN_ NO Varchar2 6 Foreign Key

DELY _TYPE Char 1 Delivery: part(p)/ full(f) and default ‘F’

BILL_ YN Char 1

DELY_ DATE Date Can’t be less than order date ORDER _STATUS

Varchar2

10

Values (“In Process”, “ Fulfilled”, “Back Order”, “Cancelled.

Table Name: SALES_ORDER_DETAILS Description: Used to store client’s order with details of each product ordered.

Column Name

Data Type

Size

Attribute

ORDER _NO

Varchar2

6

Primary key references SALES_ORDER table

PRODUCT_ NO Varchar2 6 Foreign Key references SALES_ORDER_table

QTY_ ORDERED Number 8

QTY_ DISP Number 8

PRODUCT _RATE Number 10,2 Foreign Key

Solve the following queries by using above tables.

1. Retrieve the list of names, city and the state of all the clients. 2. List all the clients who are located in ‘Mumbai’ or ‘Bangalore’. 3. List the various products available from the product_master table. 4. Find the names of sales man who have a salary equal to Rs.3000. 5. List the names of all clients having ‘a’ as the second letter in their names. 6. List all clients whose Bal due is greater than value 1000. 7. List the clients who stay in a city whose first letter is ‘M’. 8. List all information from sales-order table for orders placed in the month of July.

9. List the products whose selling price is greater than 1000 and less than or equal to 3000. 10. Find the products whose selling price is greater than 1000 and also find the new selling

price as original selling price 0.50. 11. Find the products in the sorted order of their description. 12. Find the products with description as ‘540HDD’ and ‘Pen drive’. 13. Count the total number of orders. 14. Print the description and total qty sold for each product. 15. Calculate the average qty sold for each client that has a maximum order value of 15,000. 16. Find all the products whose quantity on hand is less than reorder level. 17. List the order number and day on which clients placed their order. 18. Find out the products and their quantities that will have to deliver in the current month. 19. Find the names of clients who have placed orders worth of 10000 or more. 20. Find the client names who have placed orders before the month of June,2008.

Cycle-II Aim: A manufacturing company deals with various parts and various suppliers supply these parts. It consists of three tables to record its entire information. Those are as follows.

Supplier (Supplier_No, Sname, City, status) Part( Part_no, pname, color, weight, city, cost) Shipment (supplier_No, Part_no, city) JX( project_no, project_name, city) SPJX (Supplier_no, part_no, project_no, city)

1. Get supplier numbers and status for suppliers in Chennai with status > 20. 2. Get project names for projects supplied by supplier S. 3. Get colors of parts supplied by supplier S1. 4. Get part numbers for parts supplied to any project in Mumbai. 5. Find the id’s of suppliers who supply a red or pink parts. 6. Find the pnames of parts supplied by London supplier and by no one else. 7. Get the names of the parts supplied by the supplier ‘Mart’ and ‘Miller’. 8. Get supplier names for suppliers who do not supply part P2. 9. Get all parirs of supplier numbers such that the suppliers concerned are “colocated”. 10. Get suppliers names for the suppliers who supply at least one red part.

Cycle –III Employee Database

Aim: An enterprise wishes to maintain a database to automate its operations. Enterprise divided into a certain departments and each department consists of employees. The following two tables describes the automation schemas.

Emp(Empno, Ename, Job, Mgr, Hiredate, Sal, Comm, Deptno) Dept(Deptno, Dname, Loc)

1. List the details of employees who have joined before the end of September’ 81. 2. List the name of the employee and designation of the employee, who does not report to

anybody. 3. List the name, salary and PF amount of all the employees (PF is calculated as 10% of

salary) 4. List the names of employees who are more than 2 years old in the organization. 5. Determine the number of employees, who are taking commission. 6. Update the employee salary by 20% , whose experience is greater than 12 years. 7. Determine the department does not contain any employees. 8. Create a view, which contains employee name and their manager names working in

sales department. 9. Determine the employees, whose total salary is like the minimum salary of any

department. 10. List the department numbers and number of employees in each department. 11. Determine the employees, whose total salary is like the minimum salary of any

department. 12. List average salary for all departments employing more than five people. 13. Determine the names of employees, who take highest salary in their departments. 14. Determine the names of employees, who earn more than their managers. 15. Display ename, dname, even if no employee belongs to that department ( use outer join)

Cycle- IV An Airline system would like to keep track their information by using the following relations.

FLIGHTS( fl_no: integer, from: string, to: string, distance: integer, price: integer) AIRCRAFT(aid: integer, aname: string, cruising_range: integer) CERTIFIED(eid: integer, aid: integer) Employees( eid: integer, ename: string, salary: real)

Note that the employees relation describes pilots and other kinds of employees as well; every pilot is certified for aircraft and only pilots are certified to fly. Resolve the following queries.

1. Find the names of pilots whose salary is less than the price of the cheapest route from

Newyork to Chicago. 2. For each pilot who is certified for more than 2 aircraft, find the eid’s and the maximum

cruising range of the aircraft that he or she certified for. 3. For all aircraft with cruising range over 1,500 miles, find the name of the aircraft and the

average salary of all pilots certified for this aircraft. 4. Find the aid’s of all aircraft than can be used from chicaga to LosAngels. 5. Find the name of the pilots certified from some Boeing aircraft. 6. Print the enames of pilots who can operate planes with cruising range greater than

3,500 miles, but are not certified by Boeing aircraft. 7. Find the eid’s of employees who are certified for exactly 2 aircrafts.

8. Find the total amount paid to employees as salaries. 9. Find the aid’s of all than can be used on non-stop flights from Chennai to Dubai. 10. Find the eid’s of employee who make second highest salary.

PL/SQL PROGRAMS

1. Write a PL/SQL program to check the given number is strong or not. 2. Write a PL/SQL program to check the given string is palindrome or not. 3. Write a PL/SQL program to swap two numbers without using third variable. 4. Writ a PL/SQL program to generate multiplication tables for 2, 4, 6. 5. Write a PL/SQL program to check the given number is Amstrong or not. 6. Write a PL/SQL code to find the factorial of any number. 7. Write a PL/SQL program to display sum of even numbers and sum of odd numbers in the

given range. 8. Write a PL/SQL program to check the given number is palindrome or not. 9. The HRD manager has decide to raise the employee salary by 15% write a PL/SQL block to

accept the employee number and update the salary of that employee. Display appropriate message based on the existence of the record in Emp table.

10. Write a PL/SQL program to display to 10 rows in Emp table based on their job and salary.

11. Write a PL/SQL program to raise the employee salary by 10% for department number 30 people and also maintain the raised details in the raise table.

Name Null? Type

TEL_NO NOT NULL NUMBER(6) CNAME VARCHAR2(20) CITY PR_READ

VARCHAR2(10) NUMBER(5)

12. Write a procedure to update the salary of Employee, who are not getting commission by 10%. 13. Write a PL/SQL program to prepare an electricity bill by using following table.

Table used: Elect

Name Null? Type MNNO NOT NULL NUMBER(3) CNAME VARCHAR2(20) CUR_READ NUMBER(5) PREV_READ NUMBER(5) NO_ UNITS NUMBER(5) AMOUNT NUMBER(8,2) SER_ TAX NUMBER(8,2) NET_AMT NUMBER(9,2)

14. Write a PL/SQL program to prepare an telephone bill by using following table and print the

monthly bills for each customer. Table used: Phone

CUR_READ NUMBER(5) NET_AMT

NUMBER(5) TOT-AMT NUMBER(8,2)

15. Write a PL/SQL program to raise the employee salary by 10 %, who are completed their 25 years of service and store the details at appropriate tables (Define the Retair_ Emp_Table)

16. Write a PL/SQL program to evaluate the grade of a student with following conditions: For pass: all marks > 40 For I class: Total % > 59 For II Class: Total % between >40 and < 60 For III class: total % = 40 And also maintain the details in abstract table. 1. Table Std

Name Null? Type NO NOT NULL NUMBER NAME VARCHAR2(10) INTNO NUMBER CLASS NOT NULL VARCHAR2(10) M1 NUMBER M2 NUMBER M3 NUMBER M4 NUMBER M5 NUMBER

2. Table Abstract

Name Null? Type STDNO NUMBER STDNAME VARCHAR2(10) CLASS VARCHAR2(10) MONTH VARCHAR2(10) INTNO (INTEGER NUMBER) NUMBER TOT NUMBER GRADE VARCHAR2(10) PERCENT NUMBER DAT_ENTER DATE

KAKARAPARTI BHAVANARAYANA PG COLLEGE (AUTONOMOUS)

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

PYTHON PROGRAMMING

MCA 30119


Time : Three Hours Max Marks: 70



1. A) Explain types of operators in python.

(or)

B) Explain Control statements in python?

2. A) Explain Functions in python?

(or)

B) Explain the concept of arrays in python.

3. A) Explain the inheritance concept in python?

(or)

B) Explain the concept of polymorphism in python.

4. A) Explain Exception handling in python?

(or)

B) Explain concept of Files in python?

5. A) Explain aliasing and cloning of lists in python.

(Or)

B) Explain Dictionary methods in python.



II MCA : III Semester

CRYPTOGRAPHY AND NETWORK SECURITY

MCA30217

Time: 3 hrs Total Marks: 70m

Answer all questions

1. A) Write about Security attacks, Security Services in CNS?

(Or)

B) Briefly Explain about DES in CNS?

2. A) Analyze RSA Algorithm and Diffie Hellman Key exange in CNS?

(Or)

B) Explain about Substitution Techniques in CNS?

3. A) Explain DSS approach and DDS Algorithm?

(Or)

B) Illustrate Kerberos and its versions?

4. A) write about pretty good privacy, S/MIME?

(Or)

B) Illustrate IP Security (IP Structure, AH Structure) in CNS?

5. A) Elaborate SSL Architecture in Web Security?

(Or)

B) Explain about Firewalls in CNS?




WEB TECHNOLOGY

MCA30319

ANSWER THE FOLLOWING QUESTIONS

Time:3 hrs Total Marks :70m

5*14=70M

1. A) Explain Basic Web concepts and Internet Protocols and Applications.

(or)

B) Explain Forms, Frameset Tag with example?

2. A) Explain the types of CSS?

(or)

B) Explain Control Statements in java Script.

3. A) Explain Servlet Life Cycle?

(or)

B) Explain JSTL.

4. A) Explain Control Statements in PHP?

(or)

B) Explain the types of operators in PHP?

5. A) Explain the modules of Angular JS?

(or)

B) Explain AngularJS Controllers.




SOFTWARE ENGINEERING

MCA30417

Time:3 hrs Total Marks :70m

UNIT - I

1. a)What is Software? Discuss about evolving the role of the Software.

OR

b)What is process model? Discuss about Waterfall model with its advantages and disadvantages.

UNIT - II

2. a)Discuss about functional and non-functional requirements for development of Software.

OR

b)Discuss about requirements engineering process.

UNIT - III 3. a)What is Design? Discuss about the concepts of Design.

OR

b)Discuss about Software Architecture?

UNIT - IV 4. a)What is Testing? Discuss about testing strategies for conventional software.

OR

b)What are the various metrics for Software Quality? Discuss.

UNIT - V

5. a)Discuss about ISO 9000 Quality standards.

OR

b)Discuss about the Formal technical reviews.




Operations Research

MCA30517

Answer the following questions

1 a)Define Operation Research? Write the Aim and Scope of Operation Research.

(or)

(b) What is OR? What are the applications of OR.

2 a) Explain the procedure of Simplex Algorithm.

(or)

(b) Solve the following LPP by Simplex method.

Maximize Z= 3x1+2x2

Subject to constraints 2x1+x2 2

3x1+4x2 12 and x1, x2 0.

3 (a)Using Vogels method find IBFS of the transportation.

Problem where cost matrix is given below.

A B C D Availability

E

F

G

11

16

21

13

18

24

17

14

13

14

10

10

250

300

400

OR

(b) Requirement: Solve the following Assignment Problem

Machines

Jobs

4 (a) Solve the following game by using Graphical method.

Player B

B1 B2 B3 B4

player A A1 1 0 3 2

A2 2 1 0 -2

or

(b) Explain two person zero sum game, pure strategy, mixed strategy.

5 (a) State the objectives of CPM and write algorithm on it.

. Or

(b) Write the Rules to construct Net Work diagram.

1 2 3 4 5

1

2

3

4

5

9

48

41

74

36

22

78

28

42

11

58

72

91

27

57

11

50

37

49

22

19

63

45

39

25

1. Write a python program to demonstrate Operators?

2. Write a python program to demonstrate Conditional statements?

3. Write a python program to demonstrate Two dimensional Array?

4. Write a python program to demonstrate Functions with passing arguments by reference?

5. Write a python program to demonstrate lambda Expressions?

6. Write a python program to demonstrate Object oriented Programming?

7. Write a python program to demonstrate Inheritance?

8. Write a python program to demonstrate Polymorphism?

9. Write a python program to demonstrate abstract Classes?

10. Write a python program to demonstrate Interfaces?

11. Write a python program to demonstrate Exception Handling?

12. Write a python program to demonstrate Files concept?

13. Write a python program to demonstrate Lists?

14. Write a python program to demonstrate Dictionary Methods?

15. Write a python program to demonstrate Multithreading concept?

16. Write a python program to demonstrate Tuples?

PYTHON

PROGRAMMING

LAB

MCA30619

w.e.f 2019-2020

IIMCA

III Semester

1. Demonstrate Anchor tag and Img tag in html?

2. Demonstrate frames and Frame set tag?

3. Write a servlet program interaction with JDBC?

4. Write a servlet Program to implements Cookies.

5. Write a Servlet Program for Session handling?

6. Write JSP program to create a login form for a user?

7. Write a JSP program to validate the user and perform MVC Architecture?

8. Write a PHP Program for Control Statements.

9. Write a PHP Program for Looping Statements.

10. Write a Angular JS Program for its Controllers.

WEB

TECHNOLOGY

LAB

MCA30719

w.e.f 2019-2020

IIMCA

III Semester

SKPVV Hindu High Schools Committee) Vijayawada - KBN ...

Documents

Transcript of SKPVV Hindu High Schools Committee) Vijayawada - KBN ...