mu scheme semester iv - medicaps.ac.in iv sem scheme and syllabus.…java basics: what is java,...

Medi-Caps University, Indore

Scheme of MCA

Semester IV

(w. e. f. 2018-19)

Open Electives (OE – II)

S.

No.

Course

Code Course Name

Periods Per

Week

Credits L T P

1 OE00045 Advanced DBMS 3 0 0 3

2 OE00046 Software Testing 3 0 0 3

Semester IV

Sr.

No.

Course

Code Course Name

Periods Per Week Credits

L T P

1 CA5CO18 Advanced Programming 3 0 4 5

2 CA5EL05 Design and Analysis of Algorithms 4 0 0 4

3 CA5EL07 Artificial Intelligence 4 0 0 4

4

CA5EL06 /

CA5EL12

Mobile Communication /

Cyber Security 4 0 0 4

5 OE - II Open Elective – II 3 0 0 3

6 CA5CO19 Project Lab 0 0 4 2

7 CA5MC04

Personality Development & Quantitative

Aptitude 3 0 0 0

Total 21 0 8 22

Course Code Course Name Hours per Week Total

L T P Hrs. Credits

CA5CO18 Advanced Programming 3 0 4 7 5

Course Objectives:

1. To understand fundamentals of java programming.

2. To understand fundamentals of object-oriented programming in Java.

3. To understand GUI programming and database connectivity in java .

4. Website development according to user requirements.

Prerequisites : NIL

Co-requisites : NIL

Curriculum:

Unit-I

Java Basics: What is Java, First program in Java, compilation and execution, data types, concept

of variable, operators in java, operator precedence, type conversion and casting, automatic type

promotion in expressions, control statements, arrays, strings.

Object Oriented Programming: Defining a class, Declaring objects, constructor and its types, this

keyword, constructor overloading, Encapsulation, Inheritance, polymorphism, compile and run

time polymorphism, final modifier, abstract class and interface, method overriding, packages,

Object class, type wrappers.

Unit-II

Exception Handling: Definition of exception, Basic idea of exception handling; The try, catch

and throw; throws; finally; Programmers-Defined exception.

Threads: Basic concept of process and thread, Basic concept of multitasking and multithreading,

Creating thread with the thread class and runnable interface, The lifecycle of a thread, thread

methods, thread priority.

Unit-III

AWT and Swings: Graphical User interface Components - JFrame, JPanel, JLabel, JButton;

Package javax.swing, different layouts.

The Java Event Handling Model: Event- Handling Process, The Delegation Model of Event

Handling, Event Classes, Event Sources, Event Listeners, Adapter Classes, Anonymous class

UNIT-IV

Database basics: JDBC drivers and architecture, Connecting with the database, read, edit and

delete to the database.

Overview of Java Servlets, Basic servlet examples, Additional servlet examples (showing

cookies, session handling), Servlet Interaction techniques: Calling Servlets from Servlets,

Response redirection, Request dispatching.

Unit-V

Overview of JSP, Components of JSP, HTML tags, JSP directives, Declarations, Scriptlets,

Comments, Expressions, Accessing implicit object, JSP interactions: invoking a JSP by URL,

calling a servlet from JSP, calling a JSP from Servlet, invoking a JSP from JSP.

Case Studies:

Not Applicable.

List of Practical

1. Find addition, subtraction, multiplication and division of two numbers

2. Swap two numbers without and with using temporary variable

3. Find max and min of two numbers

4. Find max and min of three numbers

5. Find sum of n natural numbers

6. Find factorial of a number

7. Find a number is prime or not

8. Find a number is Armstrong or not

9. Find sum of digits of a number

10. Reverse a number

11. Find a number is palindrome or not.

12. Print Fibonacci series upto n

13. Print prime series upto n.

14. Copy one string into another

15. Concat two strings

16. Find length of a string

17. Convert a string to lowercase and uppercase

18. Search an element from an array

19. Find max or min element from an array

20. Sort an array

21. Find addition, subtraction, multiplication of two matrices

22. Find addition, subtraction, multiplication and division of two numbers using case switch.

23. Convert one data type to another using wrapper classes

24. Make a class box and find volume of box

25. Make a class student having member variables roll_no and name and member functions

getData() and putData() to take the data from user and print on the output screen

26. Make a class Complex has two member variables real and imag of float type. Make

suitable member functions to add, subtract and multiply two Complex objects.

27. Make a class Float1 having one member variable of type float. Make suitable member

functions to add, subtract and multiply two Float1 objects.

28. Make a class Matrix having three member variables two dimension array, row and

column. Make suitable member functions and constructors to add, subtract and multiply

two Matrix objects.

29. Make a class Employee having member variables name and salary and member

functions getData() and putData() to take the data from user and print on the output

screen

30. Count number of objects using concept of static

31. Find area of circle, rectangle and triangle using method overloading

32. Make a class box having three member variables width, height and depth with constructor

overloading and parameterized constructor .

33. Write a program having base class Shape having two member variables width and height,

two derived classes rectangle and triangle write suitable member functions to calculate

area in rectangle and triangle class

34. Apply method overriding on class Figure having member variables dim1,dim2,

constructor and area() member function , extends two classes Rectangle and Triangle

from Figure write constructor and area() function in Rectangle and Triangle class, apply

dynamic method dispatch.

35. Write a program on multilevel inheritance.

36. Write a program on method overriding

37. Write a program using super

38. Write a program explaining the concept of how constructors are called in inheritance.

39. Write a interface Ishape having functions getArea() and getPerimeter() . Write a class

circle implements that interface

40. Write a program to handle the divide by zero exception using exception handling

41. Write a program using swing controls to copy one textField to another

42. Write a program using swing controls to concat two textfield into third

43. Write a program using swing controls to find factorial of a number and a number is prime

or not

44. Make a small application in swings for student record management using database

connectivity with mysql

45. Make a small web application of shop management using JSP using database


46. Make a small web application of library using JSP and Servlet using database


Project:

Not Applicable.

Course Outcomes:

A. Recognize programming concepts in java

B. Understand object-oriented concepts in java

C. Connection to the database

D. Create desktop application in java

E. Create websites in J2EE.

Text Books:

1. Schildt, JAVA : The Complete Reference, TMH.

2. Joel Murach, Murach’s, Java Servlets and JSP, Murach publication.

Reference Books:

1. Kogent Solution Inc ,“Java 6 Programming Black Book “, dreamTech Pub

2. Bryan Basham, Kathy Sierra & Bert Bates, Head First Servlets & JSP, O'Reilly

3. H. M.Deitel, P.J. Deitel, S.E. Santry, Advanced Java 2 Platform HOW TO PROGRAM,

Prentice Hall.

Web Source:

1. http://www.learnjavaonline.org/

2. https://www.tutorialspoint.com/java/

3. https://www.programiz.com/java-programming

4. https://www.guru99.com/java-tutorial.html

5. https://www.javatpoint.com/java-tutorial

Open Learning Source:

1. http://nptel.ac.in/courses/106106147/

2. https://www.lynda.com/

3. https://alison.com/courses

4. https://www.edx.org/learn/java

Syllabus


L T P Hrs. Credits

CA5EL05 Design and Analysis of

Algorithms 4 0 0 4 4

Course Objectives:

1. To understand the concepts of Algorithms and complexities.

2. To build the logics according to given problems.

3. To learn how to devise an algorithm using various techniques.

4. To learn various complexity classes and various real life applications.

5. To understand the solution and application of network related problems.

Prerequisites : Data Structures

Co-requisites : Nil

Curriculum:

Unit-I Introduction to Algorithms

Introduction to algorithms, algorithm specification, time space complexities, asymptotic

notations, average and worst case analysis.

Graph searching and Traversal: Overview, Graph Representations, Breadth First Search and

Traversal ,Depth First Search and Traversal.

Unit-II Divide and conquer & Greedy Approach

Divide and conquer: Overview of divide and conquer algorithms. Examples; Binary search,

finding the maximum and minimum, merge sort, quick Sort, strassen's matrix multiplication.

Substitution, Master ‘s method for solving recurrence relations.

Greedy Method: Overview of the greedy paradigm. Applications: minimum cost spanning tree,

Knapsack problem, Single source shortest paths.

Unit-III Dynamic Programming

Dynamic programming: Overview of dynamic programming, difference between dynamic

Programming and divide and conquer, difference between dynamic programming and Greedy

Method. Applications: all pairs shortest paths, single source shortest paths (general weights), 0/1

Knapsack problem, Matrix chain multiplication, longest common subsequence.

Unit-IV Back tracking and Branch& Bound

Back tracking: Overview, 8 queen problem and Knapsack problem.

Branch and bound: FIFO, LIFO and LC branch and bound. Applications: 0/1 Knapsack problem,

Traveling Salesman Problem.

Unit-V Complexity Classes

NP-Hard and NP-Complete Problems: Basic Concepts, COOK's Theorem, NP-HARD graph

Problems: Clique Decision Problem.

String matching algorithms: Knuth – Morris Pratt algorithm, Boyer-Moore algorithm.

PRAM algorithms. Algebraic algorithms, set algorithms

Case Studies:

Not Applicable.

List of Practicals:

Not Applicable.

Project:

Not Applicable.

Course Outcomes:

A. Students should be able to demonstrate how the worst-case time complexity of an

algorithm is defined; compare the efficiency of algorithms using asymptotic complexity

B. Students will improve their logic building ability..

C. Students will be able to solve problems which are algorithm based by using various

Design techniques.

D. Students will be able to know various complexity classes and research areas related to

algorithms.

E. Design efficient algorithms using standard algorithm design techniques

Text Books:

1. Horowitz, S. Sahni, and S. Rajsekaran, “Fundamentals of Computer Algorithms,”

Galgotia Publication

Reference Books:

1. Ullman, Analysis and Design of Algorithm, TMH

2. Goodman, Introduction to the Design & Analysis of Algorithms, McGraw-Hill

3. Sara Basse, A. V. Gelder, Computer Algorithms, Addison Wesley

4. T. H. Cormen, Leiserson ,Rivest and Stein, Introduction of Computer algorithm, PHI

Web Source:

1. http://www.facweb.iitkgp.ernet.in/~sourav/daa.html

2. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html


1. http://nptel.ac.in/courses/106101060/

2. http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorith

ms

Syllabus


L T P Hrs. Credits

CA5EL07 Artificial Intelligence 4 0 0 4 4

Course Objectives:

1. To have the basic knowledge of how to design and implement AI systems.

2. To know how to use AI planning technology for projects in different application

domains.

3. To study multidisciplinary requirements of problem solving.

4. To learn various types of algorithms useful in Artificial Intelligence (AI).

5. To convey the ideas in AI research and programming language related to emerging

technology.

Prerequisites: Nil

Co-requisites: Nil

Curriculum:

Unit-I Introduction

Introduction: Introduction to Artificial Intelligence, Foundations and History of Artificial

Intelligence, AI Technique, Applications of Artificial Intelligence. Introduction to LISP

programming: Syntax and numeric functions, Basic list manipulation functions, predicates and

conditionals, input output and local variables, iteration and recursion, property lists and arrays.

Unit-II Introduction to Search

Introduction to Search: Searching for solutions, uniformed search strategies, informed search

strategies, Local search algorithms. State space search: Production systems. Problem

Characteristics, Heuristic search - Hill climbing, Steepest Ascent Hill Climbing, best first search,

OR Graphs, A* Algorithm, Problem Reduction, AND-OR Graphs, AO* Algorithm, Constraint

Satisfaction Problems, Cryptarithmetic Problems.

Unit-III Knowledge Representation

Knowledge Representation & Reasoning: Approaches to Knowledge Representation, Types of

Knowledge, Propositional logic, Theory of first order logic, Inference in First Order Predicate

Logic, Forward & Backward chaining. Horn's Clauses, Skolemization, Resolution, Unification

Algorithm, Semantic Networks, Scripts, Conceptual Dependency.

Unit-IV Game Playing and Planning

Game playing: Minimax search procedure, adding alpha, beta cut-off’s, Additional Refinements

– Waiting for Quiescence, Secondary Search, Using Book Moves, Alternatives to Minimax,

Iterative deepening.

Planning: Overview: An example domain - the block word, component of planning systems,

goal stack planning, Non Linear Planning

Unit-V Expert Systems

Expert Systems: Introduction to expert system and benefits and application of expert systems,

Capabilities of expert systems, Components of expert systems, Limitations of Expert Systems,

Expert system shells, knowledge acquisition. Need and justification for expert systems. Case

studies: MYCIN, RI. Learning: Concept of learning, rote learning, learning by induction,

explanation based learning.

Case Studies: Student can do by assignments.

List of Practicals:

Not Appicable.

Project:

Not Applicable

Course Outcomes:

A. Gain a historical perspective of AI and its foundations. Become familiar with LISP

programming. To write simple to intermediate programs and an ability to understand

code written..

B. Understand the strengths and limitations of various state-space search algorithms and

choose the appropriate algorithms for a problem. Become familiar with basic principles

of AI toward problem solving, inference, perception, knowledge representation, and

learning.

C. Apply knowledge representation techniques and problem solving strategies to common

AI applications.

D. To have a basic proficiency in a traditional AI language including an other topics such as

minimax, resolution, planning etc.

E. To have an understanding of the basic issues of knowledge representation, learning and

heuristic search, as well as an understanding of Expert systems.

Text Books:

1. Elaine Rich and Kevin Knight, Artificial Intelligence, Tata Mcgraw-hill Education.

2. Dan W. Patterson, Artificial Intelligence and Expert Systems, Prentice Hall of India.

3. Clocksin & C. S. Melish, Programming in PROLOG, Narosa Publishing House.

4. Nils J. Nilson, Principles of Artificial Intelligence, Narosa Publishing House.

Reference Books:

1. Stuart Russell, Peter Norvig, Artificial Intelligence – A Modern Approach, Pearson

Education

2. E.Charniak and D McDermott, Introduction to Artificial Intelligence, Pearson Education

3. Sasikumar, M., Ramani, S., Rule Based Expert System, Narosa Publishing House.

Syllabus


L T P Hrs. Credits

CA5EL06 Mobile Communication 4 0 0 4 4

Course Objectives:

1. To understand the fundamentals of Mobile Communication Systems.

2. To understand the system architecture and protocol architecture of GSM, GPRS and 3G.

3. To understand the concept of IEEE 802.11 Standards , Protocols for

WLAN.MACA,MACAW.

4. To understand the Concept and working of Bluetooth technology and Wireless in Local

Loop(WLL) architecture. Products.

Prerequisites: Nil

Co-requisites: Nil

Curriculum:

Unit-I Introduction.

Overview of OSI Model: Significance of layered Model, PDUs, SDUs, IDUs, Higher layer

Protocols. Switching and Components. Introduction, Applications, history of wired & wireless

Communication systems. Radio Transmission: frequencies, signal propagation, antenna, types of

modulation, FHSS, DSSS. Multiple Access technology for Wireless Communication: FDMA,

TDMA, CDMA, SDMA Cellular System: Introduction, types.

Unit-II

Mobile Data Communication: Cellular Telephony, Structure, Fading, Small scale fading, Multi-

path Fading, Hand off Management, Switching and authentication, MTSO interconnections,

frequency hopping, frequency reuse. Circuit Switched Data Services & Packet Switched Data

Services on Cellular Networks, Personal Communication Systems (PCS) Architecture, Digital

Enhanced Cordless Telecommunications (DECT,) Personal Access Comm. System (PACS).

Unit-III

Digital Cellular Systems and Standards: GSM System overview, Architecture, GSM Protocol

Model, GSM Mobility Management, SMS security aspects. Broadcast System overview. General

Packet Radio Service (GPRS) Architecture, GPRS Network, Interfaces and Procedures (2.5 G),

3G Mobile Services: UMTS and International Mobile Telecommunications (IMT-2000), W-C

DMA and CDMA 2000,Quality of service in 3G.

Unit-IV

WLAN : Components and working of Wireless LAN, Transmission Media for WLAN,

Infrastructure & types of WLAN, IEEE 802.11 Standards, Protocols for

WLAN,MACA,MACAW, Infrared technology. Wireless Application Protocol (WAP) model,

architecture, Gateway, WAP protocols and WML

Unit-V

Introduction to Bluetooth technology. Wireless in Local Loop (WLL) architecture, products.

Satellite as a switch, Components of VSAT system, VSAT topologies, access schemes.

Case Studies:

Student can do by assignment.

List of Practicals:

Not Appicable.

Project:

Not Applicale

Course Outcomes:

A. At the end of course Students will be able to understand the concept and terminology of

mobile communication.

B. After the completion of coursestudent will understand the concept of frequency reuse,

channel allocation. Concept of Fading.

C. After the completion of course student will understand the system architecture and

protocol model of GSM and GPRS. .

D. After the completion of course student will understand the Working of IEEE802.11.also

understand the concept of some MAC protocol .

E. After the completion of course student will understand, learn the concept and working of

Bluetooth technology

Text Books:

1. Jochen Schiller, Mobile Communication, Pearson Education.

2. Yi –Bing Lin and Imrich Chlamtac, Wireless and Mobile Network Architectures, Wiley

India.

3. Raj Pandaya, Mobile and Personal Communication System & Services.

Reference Books:

1. Uwe Hansmann, Lothar Merk, Principles of Mobile Computing, Wiley India.

2. Roger L. Freeman, Telecom Transmission handbook, John Wiley & Sons Inc. New York.

3. Lee, Mobile Cellular Telecom, Mc Graw Hill.

4. Raj Kamal, Mobile Computing, Oxford university Press.

Syllabus


L T P Hrs. Credits

CA5EL12 Cyber Security 4 0 0 4 4

Course Objectives:

1. To understand the fundamentals of Cyber Security Systems.

2. To understand the fundamentals of Security Attacks.

3. To understand the conceptCyber Frauds.

4. To understand the concept Cyber Forensic.

5. To understand the concept of Cyber laws & Regulatory Compliances.

Prerequisites: Nil

Co-requisites: Nil

Curriculum:

Unit-I

Internet and Internet Governance, Security threats, Source of Security threats, Consequences of

threats, E-Mail threats, Web Threats, Intruders, Insider threats, Network threats.

Unit-II

Introduction to Cyber Crime : Concept and Techniques, Channels of Cyber Crimes, Cyber Crime

methods, Computer Insecurity, Computer Hackers.

Unit-III

Fraud Management : Computer Fraud protection, Incidents of Cyber Crime: Cyber Crime

Reporting, Cyber Crime Investigation, Cyber Crime Management, Cyber Crime risk

Management.

Unit-IV

Computer Forensics : Introduction to computer forensics, Use of computer forensics in law

enforcement, Computer forensics services, Computer forensics methodology.

Unit-V

Cyber laws & Regulatory Compliances: Cyber law in India , Information technology act – 2000,

Electronic Transactions issues, Human traits, Regulatory compliances.

Case Studies:

Student can do by assignment.

List of Practicals:

Not Appicable.

Project:

Not Applicale

Course Outcomes:

A. At the end of course Students will be able to understand the concept and terminology of

Cyber Security.

B. After the completion of coursestudent will understand the concept of Malware,

Phising,Technical Attacks, Vulnerability exploitation.

C. After the completion of course student will understand the Cyber Fraud technology.

D. After the completion of course student will understand the concept of Computer forensic

E. After the completion of course student will understand Cyber laws & Regulatory

Compliances

Text Books:

1. P W Singer and Allen Friedman, “Cyber Security and Cyber War”.

2. Cyber Crime and Fraud Management, IIBF.

Reference Books:

1. K. Kumar, Cyber laws: Intellectual property & e-commerce, security

2. John R. Vacca, Computer forensics: Computer crime scene Investigation

Web Source:

1. http://www.iibf.org.in/TrgPrgITSecurity_PreventCyberCrime.asp

2. Open Learning Source:

3. http://www.njconsumeraffairs.gov/News/Brochures/Cyber-Security-Handbook.pdf


L T P Hrs. Credits

OE00045 Advanced Database

Management System 3 0 0 3 3

Course Objective 1. To understand the basic concepts and terminology related to DBMS and Relational

Database Design

2. To the design and implement Parallel and Distributed Databases.

3. To understand advanced DBMS techniques to construct tables and write effective

queries, forms, and reports.

Prerequisites : Concepts of database.

Co-requisites : Nil

Curriculum:

Unit-I

Database Concepts: File System v/s Database System, Users of Database System, Data

Independence, DBMS system architecture

Entity-Relationship (ER) Model:Entity Types, Entity Sets, Attributes & Keys, Relationships,

Roles and Structural Constraints, E-R Diagrams, Reduction of an E-R Diagram to Tables

Extended Entity-Relationship (EER) Model: Generalization, Specialization and Aggregation,

Unit-II

Normalization: The Purpose of Normalization, How Normalization Supports Database Design,

Data Redundancy and Anomalies, Functional Dependencies, Characteristics of Functional

Dependencies, The Process of Normalization, First Normal Form (1NF), Second Normal Form

(2NF), Third Normal Form (3NF), Boyce—Codd Normal Form (BCNF), Fourth Normal Form

(4NF), Multi-Valued Dependency, Fifth Normal Form (5NF), Lossless-Join Dependency.

Unit-III

Query Evaluation and Optimization

The System Catalog, Information in the Catalog, Introduction to Operator Evaluation, Three

Common Techniques, Access Paths, Algorithms for Relational Operations, Selection, Projection,

Join, Other Operations, Introduction to Query Optimization, Query Evaluation Plans, Multi-

operator Queries: Pipelined Evaluation, The Iterator Interface.

Unit-IV

Parallel and Distributed Databases

Architectures for Parallel Databases, Parallel Query Evaluation, Parallelizing Individual

Operations, Bulk Loading and Scanning, Sorting, Joins.

Distributed Databases: Types of Distributed Databases, Distributed DBMS Architectures, Client-

Server Systems, Collaborating Server Systems, Middleware Systems, Storing Data in a

Distributed DBMS, Fragmentation, Replication.

Unit-V

Object Relational Database Systems: Introduction, Database Design for an ORDBMS, New

Challenges in Implementing an ORDBMS, OODBMS, Comparing RDBMS with OODBMS and

ORDBMS.

Enhanced Data Models for Advanced Applications: An overview of Active Databases, Temporal

database, Spatial Databases, Deductive Databases, Mobile Database, Multimedia Databases.

Database Design Case Study: Online Retail Shopping, Airline Reservation System etc.

Outcome A. Exposure for students to write complex queries including full outer joins, self-join, sub

queries, and set theoretic queries.

B. Knowhow of the file organization, Query Optimization, Transaction management, and

database administration techniques

List of Practicals:

Not Applicable.

Project:

Not Applicable.

Text Books 1. R. Ramakrishnan, J. Gehrke, Database Management Systems, McGraw Hill,

2. Silberschatz, H. Korth, S. Sudarshan, Database system concepts, McGraw Hill,.

3. Elmarsi R, & Navathe S B, Fundamental of Database System, Pearson Education, Reference Books

1. F. R. Mcfadden, J. Hoffer and M. Prescott, Modern Database Management, Addison Wesley.

2. B.C. Desai, An introduction to Database systems, BPB.

3. Raghurama Krishnan, Database Systems, TMH

Syllabus


L T P Hrs. Credits

OE00046 Software Testing 3 0 0 3 3

Course Objectives:

1. To study the fundamental concepts of software testing which includes objectives,

process, criteria, strategies, and methods.

2. To discuss various software testing types and levels of testing like black and white box

testing along with levels unit test, integration, regression, and system testing.

3. It also helps to learn the types of bugs, testing levels with which the student can very well

identify a bug and correct as when it happens.

4. It provides knowledge on transaction flow testing and data flow testing techniques so

that the flow of the program is tested as well.

5. To learn the domain testing, path testing and logic based testing to explore the testing

process easier.

6. To expose the advanced software testing topics, such as object-oriented software testing

methods, and component-based software testing issues, challenges, and solutions.

7. To gain software testing experience by applying software testing knowledge and

methods to practice-oriented software testing projects.

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

software testing projects

9. To enable the students to use the knowledge for practical cases.

Prerequisites :

1. Proper knowledge on software engineering and their concepts .

2. Enough knowledge on object oriented modeling and techniques.

3. Knowing the different types and levels of software testing process.

4. Good programming skills and debugging skills.

Co-requisites : NIL

Curriculum:

Unit I

Introduction to Testing: Introduction to Software Testing, Objectives of Software Testing, role

of the tester, need of testing, what are defects, software defects and Quality, Concept of software

lifecycle and testing role.

Unit II

Software Testing Methods Used in Industry: White Box testing And Black Box Testing.

Functional Testing (Black Box) Equivalence partitioning, Effect graphing, Syntax testing

Structural Testing (White Box) Coverage testing, Statement coverage, Branch & decision

coverage, Path coverage Domain Testing Non functional testing techniques: Localization,

Internationalization Testing Black box vs. White Box

Unit III

An introduction or familiarization of various popular testing types: Regression Testing, Ad

Hoc Testing, Smoke Testing, Sanity Testing, Usability Testing, Exploratory Testing,

Compatibility Testing, Installation Testing, Non Functional Testing such as Load Testing, Stress

Testing, Volume Testing.

Software Testing Life Cycle: Overview of the stages of STLC: Test Planning, Test Design and

Test Execution.

Unit IV

Test Templates creation and use: Test Scenario template (what are they, how to write them,

why, when, etc.), Test case template, Test Plan, Defect Report, Status report.

Defect management: Defect Classification, Finding defects, Logging defects, Tracking and

managing defects and Defect life cycle.

Unit V

Test Management Tool: Test Management tool and why we need them, prerequisites to test

planning, understand the characteristics of the software being developed, Build the test plan and

write the test plan.

Automation Testing : Automated Testing, QTP (HP) Automated Process and Selenium open

Source.

List of Practicals:

Not Appicable.

Project:

Optional.

Course Outcomes:

A. Know the basic concepts of software testing and its essentials.

B. Able to identify the various bugs and correcting them after knowing the consequences of

the bug..

C. Use of program’s control flow as a structural model is the corner stone of testing.

D. Performing functional testing using control flow and transaction flow graphs..

E. Know the basic techniques for deriving test cases.

F. Follow an effective, step-by-step process for identifying needed areas of testing,

designing test conditions and building and executing test cases.

G. Able to test a domain or an application and identifying the nice and ugly domains.

H. Able to make a path expression and reduce them very well when needed.

I. Apply appropriate software testing tools, techniques and methods for even more effective

systems during both the test planning and test execution phases of a software

development project.

Text Books:

1. C Padmini, Andreas Spillner, Tilo Linz, Hans Schaefer, Software Testing Foundations,

Shoff Publishers and Distributors

2. D Srinivasan and R Gopalswamy, Software Testing: Principles and Practices Pearson

References:

1. Aditya P Mathur, Foundations of Software Testing, Pearson Education.

2. Robert V Binder, Testing Object Oriented Systems: models, patterns and tools, Addison

Wesley.

3. Roger S. Pressman, Software Engineering – A practitioner’s approach, McGraw Hill

4. G J Myers, The art of software testing, Wiley.

Web Source:

1. http://www.softwaretestinghelp.com

2. http://www.testingexcellence.com

3. http://www.guru99.com

4. http://weekendtesting.com

5. https://www.tutorialspoint.com


1. http://nptel.ac.in/course.php.

2. https://www.tutorialspoint.com

3. https://swayam.gov.in/course/3667-software-testing


L T P Hrs. Credits

CA5CO19 Project Lab 0 0 4 4 2

*Project development using advanced technology


L T P Hrs. Credits

CA5MC04 Personality Development &

Quantitative Aptitude 3 0 0 3 0

Course Objective:

1. To build the logics according to given problems.

2. To improve arithmetic, verbal ability.

3. To improve aptitude, problem solving skills.

Prerequisites: NIL

Co-requisites: NIL

Curriculum:

UNIT-I

Average, Problems on numbers and ages, Percentage, Profit and loss, Time and Work, Time and

distance, Problems on trains, Height and Distance

UNIT-II

Ratio and proportion, Pipes and Cisterns, Boats and streams, Simple interest, CompoundInterest,

Mixture, Area ,Clocks and Calendars, Geometry, Probability.

UNIT-III

Series, Coding and decoding, Blood Relations, Puzzle Test, Directions sense test, Mirror-Images,

Water-Images

Unit IV

Speaking skills:

GDs – do’s and dont’s, Effective Presentation Skills, Successful Interview techniques,

Leadership, Stress Management.

Unit V

Effective writing skills:

E mail communication, Summarizing and paraphrasing, Presentation and documentation of

collected data, Making effective PPTs, Writing a research paper.

Case Studies: Not Applicable.

List of Practicals: Not Applicable

Project: Not Applicable.

Course Outcomes:

A. It improves problem solving ability.

B. It improves soft skills necessary for a competent IT professional.

C. Help students in analytical jobs in knowledge based industry.

D. It improves ability of a person to learn computer Programming & Software.

Text Books:

1. R.S. Aggarwal, Quantitative Aptitude

2. R. S. Aggarwal, Verbal and Non Verbal Reasoning

3. Koneru Aruna, Professional Communcation. Mc Graw Hill,

Reference Books:

1. R C Sharma and Krishna Mohan, Business correspondence and report writing, New

Delhi: Tata Mc Graw Hill,

2. Rizvi Ashraf, Effective Technical Communication, Tata Mc Graw Hill.

mu scheme semester iv - medicaps.ac.in iv sem scheme and syllabus.…java basics: what is java,...

Documents