1. Compilers Principles, techniques and Tools Aho, Ullman, Ravisethi, Pearson Education

(1)

LESSON PLAN

Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2017-18 Semester : III SEM

Subject : MCA301:COMPILER DESIGN

SYLLABUS

UNIT-I

Overview of Compilation:

Phases of Compilation – Lexical Analysis , pass and Phases of translation, interpretation, bootstrapping, data structures in compilation – LEX lexical analyzer generator

UNIT-II

Context Free grammars:

Context free grammars, derivation, parse trees, ambiguity grammars Top down parsing:

Top down parsing – Backtracking, LL(1), recursive descent parsing, Predictive parsing, Preprocessing steps required for predictive parsing.

UNIT-III

Bottom up parsing :

Shift Reduce parsing , LR and LALR parsing, Error recovery in parsing, handling ambiguous grammar, YACC – automatic parser generator.

UNIT-IV

Semantic analysis :

Syntax directed translation, S-attributed and L-attributed grammars, type checker, intermediate code – abstract syntax tree, polish notation and three address codes, translation of simple statements and control flow statements Runtime Storage:

Storage organization, storage allocation strategies scope access to now local names, parameters, language facilities for dynamics storage allocation.

UNIT-V

Code optimization:

Consideration for Optimization, Scope of Optimization, local optimization, loop optimization, frequency reduction, folding DAG representation.

Code generation:

Machine dependent code generation, object code forms, generic code generation algorithm, Register allocation and assignment. Using DAG representation of Block.

TEXT BOOK

1. Compilers Principles, techniques and Tools Aho, Ullman, Ravisethi, Pearson Education REFERENCE BOOKS

1. Modern Compiler construction in C, Andrew W.Appel Cambridge University Press.

2. Compiler Construction, LOUDEN, Thomson

(2)

1. Pre-requisites:

MCA201:-Automata Theory and Formal languages 2. Course Educational Objectives (CEOs):



To introduce the major concept areas of language translation and compiler design.

 To enrich the knowledge in various phases of compiler ant its use, code optimization

techniques, machine code generation, and use of symbol table.



To extend the knowledge of parser by parsing LL parser and LR parser.



To provide practical

programming skills necessary for constructing a compiler.

3. Course Outcomes (COs): At the end of the course, the student will be able to:

CO1:

Apply the knowledge of LEX tool & YACC tool to develop a scanner & parser.

CO2: Execute top down parsing on context free grammars using LL(1),recursive descent and predictive parsers.

CO3: Conduct bottom up parsing on context free grammars using LR parsers.

CO4: Design and conduct experiments for Intermediate Code Generation in compiler.

CO5: Design the new code optimization techniques to improve the performance of a program in terms of speed and space.

4. Course Articulation Matrix:

Course Code

COs Programme Outcomes

1 2 3 4 5

CO1 1 2 3

CO2 1 3 1

CO3 1 2 1

CO4 1 3

CO5 2 2 3

1= Slight(low) 2=Moderate(Medium) 3=Substantial(High)

(3)

Course Delivery Plan:

S.NO TOPIC TO BE COVERED NO OF CLASSSES

Actual Date

Delivery Method As per the

Schedule Expected Date UNIT-I

1 Introduction to compiler

design course 02 27/06/17 01

29/06/17

2 Types of language processors 01 30/06/17 01

3 Types of compilers 01 01/07/17 01

4 Compiler phases 02 04/07/17 01

06/07/17

5 Problems 01 07/07/17 01

6 Tutorial-1 01 11/07/17 03

7 Purpose of symbol table and

Lexical analyzer 01 13/07/17 01

8 Input buffering scheme 01 14/07/17 01

9 LEX and YACC 02 15/07/17 01

18/07/17 10 Basic approaches to build

Lexical analyzer 01 20/07/17 01

Number of Classes: 13

UNIT-II 11 Common programming errors

and error recovery strategies 01 21/07/17 01

12 Top down and bottom up

parsing 01 22/07/17 01

13 CFG and ambiguity in CFG 02 25/07/17 01

27/07/17

14 Tutorial-2 01 28/07/17 03

15 Removing ambiguity and left

recursion from CFG 01 29/07/17 01

16 Removing non determinism

from grammars 01 02/08/17 01

17 Classification of parsers 01 04/08/17 01

18 LL(1) parser-first and follow

construction 01 05/08/17 01

19 LL(1) parser-parsing table

construction 01 08/08/17 01

20 Recursive descent parser 01 10/08/17 01

21 Predictive parser 01 11/08/17 01

(4)

Number of Classes: 13 UNIT-III

22 Shift Reduce parsing 02 14/08/17 01

22/08/17

23 Types of LR parsers 01 24/08/17 01

24 LR(0) and LR(1) parsers 02 26/08/17 01

29/08/17

25 SLR(1) parsers 01 31/08/17 01

26 LALR(1) parsers 01 01/09/17 01

27 Identifying the type of LR

grammar 01 05/09/17 01

28 Operational precedence

parsers 01 07/09/17 01

29 Tutorial-3 01 08/09/17 03

UNIT-IV

30 Syntax directed translation 02 12/09/17 01

14/09/17

31 Abstract parse trees 01 15/09/17 01

32 Syntax directed grammar

conversions 01 16/09/17 01

33 Synthesized and inherited

attributes 01 19/09/17 01

34 Three address codes 02 21/09/17 01

22/09/17

35 Storage organization 01 23/09/17 01

36 Storage allocation 01 26/09/17 01

37 Tutorial-4 01 26/09/17 03

(5)

UNIT-V

38 Code optimization techniques 02 27/09/17 01

03/10/17

39 Construction of DAG 01 05/10/17 01

40 Basic blocks 01 06/10/17 01

41 Design issues of code

generator 01 07/10/17 01

42 Flow graphs 01 10/10/17 01

44 Basic block optimization

techniques 02 12/10/17 01

13/10/17

45 Tutorial-5 01 16/10/17 03

Content beyond syllabus:

46 Latest compilers for languages 01 19/10/17 02

47 Compilers of C and JAVA 01 20/10/17 02

Total Number of Classes: 57

Delivery Methods (DM):

1. Chalk & Talk 2. ICT Tools 3. Tutorial

4. Assignment/Test/Quiz 5. Laboratory/ Filed Visit 6. Web based learning

Course Instructor

Course Coordinator

HOD Signature

Name of the

Faculty I.RAJENDRA

KUMAR I.RAJENDRA

KUMAR

(6)

LESSON PLAN

Subject : MCA302:COMPUTER NETWORKS

MCA302 – COMPUTER NETWORKS

Lecture : 4 Periods/week Internal Marks : 40

External Marks : 60

Credits : 3 External Examination : 3 Hrs.

SYLLABUS

UNIT - I

Introduction to Computer Networks:

Uses of Computer Networks, Network Hardware: LAN, MAN, WAN, Bridges, Repeaters,

Gateways, Network Software: Protocol hierarchies, Design issues, Types of services, Reference

models: OSI, TCP/IP, ATM

Physical Layer:

Guided Transmission Media

UNIT - II

Data Link Layer:

Design issues of Data Link Layer, Error Correction and Detection, Elementary Data Link

Protocols: Unrestricted Simplex Protocol, Stop and Wait, Simplex Protocol for noisy channel,

Sliding Window Protocol,

Go back N, Selective Repeat, and HDLC

Medium Access Control sub layer (MAC):

Multiple Access Protocols, Ethernet-802.3, Wireless LAN, Bluetooth

UNIT - III

Network Layer:

Design Issues of Network Layer, Routing Algorithms: Optimality, Shortest path, Flooding,

Distance Vector Routing, Hierarchical Routing, and Routing for Mobile Hosts.

Congestion Control Techniques:

Leaky Bucket, Token Bucket. Congestion Prevention Techniques: Traffic Shaping, Choke

Packet, Load Shedding, Jitter Control.

UNIT - IV

Transport Layer:

Services of Transport Layer, Elements of Transport Protocols:UDP and TCP, Service Model,

Protocol segment Header, Connection Establishment, Connection Release, TCP Connection

Management.

(7)

UNIT - V

Application Layer:

DNS: Domain Name System, Electronic Mail (SMTP): Architecture, User Agent, Message

Format, Message Transfer, Delivery, FTP, The World Wide Web (HTTP), Introduction to

Storage Area Networks(SAN), Peer-to-Peer Networks

Text Book:

Andrew S. Tanenbaum “Computer Networks” Fourth Edition, Pearson Education-2006.

Reference Books:

1.

Behrouz A.Frouzon “Data Communications and Networks” Tata Mac Graw Hill

Publication, 200

2.

William Stallings “Data and Computer Communication “Sixth Edition, Pearson

Education Asia, 2008.

3.

Larry L.Peterson and Bruce S.Davie “Computer Networks” A system approach Third

Edition, Kaufmann Publisher, 2011.

4.

Michel A. Gallo, William M.Hancock “Computer Communication and Networking

Technologies”, Thomson Publication, 2001.

5.

William Ashay, “Understanding Data Communications and Networks”, 3

^nd

Edition,

Vikas Publishing House, 2008.

(8)

NO Pre-requisites

2. Course Educational Objectives (CEOs):

 To build an understanding for the Layered network architectures OSI, TCP/IP and ATM.

 To enrich the knowledge in Data link layer fundamental such as error detection,

correction, flow control techniques and multiple access control techniques.

 To enrich the knowledge in internetworking principles and how the Internet protocols,

routing algorithms operate.

 To extend the knowledge of Transport layer services, connections, and protocols such as

TCP and UDP.

 To assist in implementation of Application layer protocols.

CO1:

Enumerate the layers of the OSI model, TCP/IP and ATM.

CO2:

Analyze MAC layer protocols and multiple access control techniques.

CO3:

Implement routing and congestion control algorithms.

CO4:

Analyze TCP and UDP protocols.

CO5:

Design applications using Application layer protocols.

Course

Code COs Programme Outcomes

1 2 3 4 5

CO1 1 3

CO2 2 1

CO3 3 2

CO4 1 2

CO5 3 1

(9)

Course Delivery Plan:

S.NO TOPIC TO BE COVERED NO OF CLASSSES Actual

Date Delivery Method As per the

1 Uses of Computer Networks 01 27-06-2017 01

2 Types of Networks: LAN,

WAN,MAN 01 29-06-2017 01

3 Network Topologies 01 30-06-2017 01

4 Protocol Hierarchies 01 03-07-2017 01

5 Design Issues for the Layers 01 04-07-2017 01

6 Service Primitives, Services 01 06-07-2017 01

7 OSI Reference Model 01 07-07-2017 01

8 TCP/IP Reference Model 01 10-07-2017 01

9 ATM Reference Model 01 11-07-2017 01

10 Physical Layer: Guided and Unguided Transmission Medium

01 13-07-2017 01

11 Tutorial-1 01 14-07-2017 03

UNIT-II 12 Design Issues of Data link

layer: services 01 18-07-2017 01

13 Error Correcting Codes, Error

Detecting codes 01 20-07-2017 01

14 Framing, Error control 01 21-07-2017 01

15 Elementary Data link protocols: An Unrestricted Simplex protocol, A Simplex Stop-and-Wait Protocol

01 24-07-2017 01

16 Tutorial-II 01 25-07-2017 03

17 A Simplex Protocol for a Noisy

Channel 01 27-07-2017 01

18 Sliding window protocols 01 03-08-2017 01

19 HDLC 01 07-08-2017 01

20 Introduction to MAC and its protocols, Collision Free Protocols

01 08-08-2017 01

21 Ethernet 802.3,Wireless LAN,

Bluetooth 01 09-08-2017 01

UNIT-III 22 Network Layer Routing

Algorithms: shortest path 01 11-08-2017 01

23 Flooding ,Flow based distance

vector routing, 01 14-08-2017 01

24 Link state Routing 01 21-08-2017 01

25 Hierarchical Routing 01 22-08-2017 01

(10)

26 Broadcasting, Multi Cast,

Routing for Mobile Hosts. 01 24-08-2017 01

27 Congestion control

Techniques: leaky Bucket 01 28-08-2017 01

28 Token Bucket 01 29-08-2017 01

29 Congestion control

algorithms: General principals 01 31-08-2017 01

30 Congestion prevention policies: traffic shaping, Choke Packet

01 01-09-2017

31 Congestion prevention

policies: Load shedding, Jitter Control

01 04-09-2017 01

32 Tutorial-III 01 05-09-2017 03

UNIT-IV 33 Transport Layer: Services of

Transport layer 01 07-09-2017 01

34 Elements of transport

Protocols 01 08-09-2017 02

35 Flow control, Buffering,

Multiplexing, Crash Recovery 01 11-09-2017 02

36 UDP 01 12-09-2017 02

37 TCP, Segment format 01 14-09-2017 02

38 TCP Connection

Establishment, 01 15-09-2017 01

39 TCP Connection Release 01 18-09-2017

40 TCP Congestion Control 01 19-09-2017 01

41 Tutorial-IV 01 21-09-2017 03

UNIT-V 42 Application Layer

Introduction 01 22-09-2017 02

43 Domain Name System 01 25-09-2017 02

44 Electronic Mail (SMTP) 01 26-09-2017 02

45 File transfer Protocol FTP 01 03-10-2017 02

46 World Wide Web (HTTP) 01 05-10-2017 02

47 POP3 , IMAP 01 06-10-2017 02

48 Peer-to-peer Network 01 09-10-2017 02

49 Storage Area Network 01 12-10-2017 02

50 Tutorial-V 01 13-10-2017 03

51 Revision 01 16-10-2017

52 Data center and high- performance networking.

01 18-10-2017 02

53 Network virtualization. 01 20-10-2017 02

(11)

Course

Instructor Course

Coordinator Module

Coordinator HOD Signature

Name of the

Faculty K.PHANEENDRA I.RAJENDRA

KUMAR I.RAJENDRA

KUMAR

(12)

(13)

LESSON PLAN

Department:Master of Computer Application Program : MCA Course : MCA Academic Year: 2017-18 Semester : V SEM

Subject : MCA303:Design and Analysis of Algorithms

SYLLABUS UNIT – I

Introduction: Algorithm, Pseudo code for expressing algorithms, Performance Analysis: Space

complexity, Time complexity, Asymptotic Notation: Big Oh notation, Omega notation, Theta notation.

Divide and Conquer: General method, Applications, Binary search, Quick sort, Merge sort, Stassen’s matrix multiplication.

UNIT – II

Greedy Method: General method, Applications: Job sequencing with deadlines, knapsack problem, Minimum cost spanning trees, Single source shortest path problem, Optimal storage on tapes.

Basic Search and traversal Techniques: AND/OR graphs, Bi-connected components, Depth-first search, Breadth - first Search.

UNIT – III

Dynamic Programming: General method, Applications: Matrix chain multiplication, Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Travelling sales man problem, Reliability Design.

UNIT - IV

Backtracking: General method, Applications: n-queens problem, sum of subsets problem, graph colouring, Hamiltonian cycles.

UNIT - V

Branch and Bound: General method, Applications - Travelling sales person problem,0/1 knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution.

NP-Hard and NP-Complete problems: Basic concepts, Non deterministic algorithms, NP - Hard and NP Complete classes, Cook’s theorem.

Text Book: Ellis Horowitz, SatrajSahni and Rajasekharam, “Fundamentals of Computer Algorithms”, Galgotia publications pvt. Ltd.

Reference Books:

(14)

1. M.T.Goodrich and R.Tomassia, “Algorithm Design: Foundations, Analysis and Internet examples”, John wiley and sons.

2. C.E.Leiserson&T.H.Cormen, “Introduction to Algorithms”, second edition.

3. Aho, Ullman and Hopcroft “Design and Analysis of algorithms”, Pearsoneducation.

1. Pre- requisite:

C-Programming.

2. Course Educational Objectives: In this course student will learn about

 The importance of studying the complexity of a given algorithm.

 Various algorithmic design techniques.

 Data structures and/or algorithmic design techniques in solving new problems including recursion, divide-and-conquer, greedy algorithms, and dynamic programming.

 Fundamental computing algorithms: sorting, searching, and graph algorithms.

 The basic computability concepts and the complexity classes P, NP, and NP-Complete.

 Some techniques for solving hard problems.

3. Course Outcomes: At the end of this course student will be able to

CO1: Differentiate the lower and upper bounds of various problems and their importance in deciding the optimality of an algorithm.

CO2:Differentiate between various algorithms for sorting (e.g., insertion, merge, quick-sort, and heap sort), searching (e.g., linear and binary search), and selection (e.g., min, max) and when to use them.

CO3:Implement the techniques used for designing fundamental graph theory algorithms (e.g., breathfirst and depth-first algorithms) and apply them to solve other related problems (e.g., single source shortest path as in Dijkstra’s and Bellman-Ford algorithm, multiple source shortest path as in Floyd’s Algorithm, minimum spanning trees as in Prim’s and Kruskal’s algorithms)

CO4:Apply backtracking and branch and bound techniques to deal with some hard problems.

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

(15)

Course

1 2 3 4 5

CO1 3 3 1

CO2 2 1 1 1

CO3 3 3 1 3

CO4 1 2 2 3

CO5 1 2 2 2 1

Course Delivery Plan:

Date

Delivery Method As per

the Schedule

Taken

UNIT-I

1 Introduction, Algorithm defn,properties 1 04/07/17 ₁

2

Diff areas to study abt Algorithms, Pseudo code conventions.

1 05/07/17

1 3

Performance Analysis, Time complexity &

Space complexity

2 06/07/17

1,3

4

Asymptotic notations, Introduction to Divide and Conquer

1 07/07/17

1

5 Binary search, Binary search analysis 1 11/07/17 _1,3

6 Quick sort, Quick sort analysis 2 12/07/17 _1,3,4

7 Merge sort Analysis 1 13/07/17 ₁

8 Strassens matrix multiplication 2 14/07/17 _1,3,4

9 Tutorial-1 1 15/07/17 ₄

Number of Classes:12

UNIT-II 10

Greedy Method introduction,General

method 1 18/07/17 ¹

(16)

11 Job sequencing with dead lines

2 19/07/17 ^1,3,4

12 Single source shortest path problem 1 20/07/17 ^1,3

13 Optimal storage on tapes

1 21/07/17 ¹

14 Knapsack problem and problems

1 25/07/17 ^1,3

15 Minimum cost spanning trees

2 26/07/17 ^1,3,4

16 Basic search and Traversal Techniques

1 27/07/17 ¹

17 Biconnected components

2 28/07/17 ^1,3

18 DFS,BFS

2 01/08/17 ^1,3

19 Tutorial-2

1 02/08/17 ⁴

S.NO TOPIC TO BE COVERED NO OF CLASSES

Date

Delivery Method As per

the Schedule

Taken

UNIT-III 20 Dynamic programming

1 16/08/17 ¹

21 Matrix chain multiplication

2 17/08/17 ^1,3,4

22 Optimal Binary search tree

2 18/08/17 ^1,3,4

23 0/1 knapsack problem

2 22/08/17 ^1,3,4

24 All pairs shortest path problem

2 23/08/17 ^1,3,4

25 Travelling sales person problem

1 24/08/17 ^1,3,4

26 Reliability Design

1 29/08/17 ^1,3,4

27 Tutorial

1 30/08/17 ⁴

UNIT-IV

28

Introduction to back tracking,

General method 3

01/09/17 ¹

29 Sst for queen, sum of subsets

1 12/09/17 ^1,3,4

30 N-queens problem

1 13/09/17 ¹

31 Sum of sub sets problem

2 14/09/17 ¹

32 Graph coloring

2 15/09/17 ^1,3,4

33 Hamiltonian cycles

1 16/09/17 ¹

34 Tutorial

1 20/09/17 ⁴

(17)

UNIT-V 35 Introduction to Branch and Bound

1 3/10/17 ¹

36 Travelling sales person problem

2 4/10/17 ^1,3

37 0/1 Knapsack

1 5/10/17 ^1,3

38 LCBB 1 6/10/17 ^1,3

39 FIFOBB 1 12/10/17 ^1,3

40

Introduction to

NPHARD&NPCOMPLETE 1 13/10/17 ¹

41

Example problems On non

deterministic algorithms 2 14/10/17 ^1,3

42

Basic concepts, NP-hard class, NP –

complete class 1 17/10/17 ¹

43 Cooks theorem

3 18/10/17 ¹

44 Tutorial

1 19/10/17 ⁴

Number of Classes:13 Content Beyond Syllabus

45 Decrease and Counter 1 20//10/17

46 Transform and Counter 1 20//10/17

Total Number of Classes:62 Delivery Methods (DM):

1. Chalk & Talk 2. ICT Tools 3. Tutorial 4. Assignment/Test/Quiz 5. Laboratory/ Filed Visit 6. Web based learning

Course

Name of the Faculty R.Vijaya R.Vijaya I.Rajendra

Kumar

(18)

LESSON PLAN

Subject : MCA304:OOPS THROUGH JAVA

SYLLABUS UNIT - I

Features of OOPS:

OOPS concepts, Introduction to Java, History of Java, Features of Java,Java Virtual Machine, Garbage collection , Why Java is important for Internet?, Programming concepts of basic Java, Identifiers and Keywords, Data types in Java, Java coding conventions, Expressions in Java, Control structures, Decision making statements ,Arrays.

UNIT - II

Objects and Classes:

Object fundamentals, Pass by value, Pass by reference, Overloading, Overriding,

Constructors, Finalization, Subclasses(Inheritance), this, super, final with inheritance, Dynamic method dispatch, Scope rules, Static data, Static methods, Static blocks, class modifiers , String Handling, Command line arguments, Abstract Classes,

Interfaces, Inner classes, Packages, Package access, Importing packages and classes, User define packages, Class-path.

UNIT – III

Exception Handling:

Types of Exceptions, try, catch, finally, throw keywords, Handling User defined Exceptions.

Multithreading:

processes and threads, Thread states, Thread life cycle, Creating threads, Interrupting threads, Thread priorities, Synchronizing threads, Inter thread communication,

Thread groups, Daemon threads.

JAVA I/O:

Files and Streams, Stream classes, Reader-Writer classes, Utilities, Serialization and Deserialization.

UNIT – IV Applets:

Types of Applets, Applet life cycle, Graphics, Parameter Passing AWT:

Abstract Window Toolkit, Components and Graphics, Containers, Frames and Panels, Layout Managers, Border Layout, Flow Layout, Grid Layout, Card Layout, Event delegation model, Event sources and Event handlers, Event categories, Event Listeners, Adapters classes, Anonymous classes.

UNIT – V Swings:

Introduction, Handling Swing Controls like Icons, Buttons, Textboxes, Combo Boxes, Tabbed Panes, Scroll Panes, JTree, JTable, Differences between AWT Controls & Swing Controls, developing home page using Applets & Swings.

Java.util:

(19)

Java.util package: Vector, Array List, Hash map, Hash table, StringTokenizer, and Date class..

Text Book:

Herbert Schildt,” The Complete Reference Java J2SE”, 7th Edition, TMH, New Delhi,2009.

Reference Books:

1. Cay Horstmann, John Wiley and Sons, “Big Java 2nd Edition”, John Wiley and Sons, Pearson Edu,2006.

2. H.M.Dietel and P.J.Dietel,” Java How to Program” , Sixth Edition, Pearson Education/PHI,2007.

3. Cay.S.Horstmann and Gary Cornell, “Core Java 2, Vol 1, Fundamentals, Seventh Edition, Pearson Education,2011.

4. R.Krishna Murthy-“Java and Internet Programming”

5. Somasundaram, Jaico, “Java.

6. Y.Daniel Liang, “Introduction to Java programming”, Pearson,2012.

 C , C++ Programming

 Need to know basics of programming language, data types and using loops instructions

 Basic need of Java for quick learning and understanding is Knowledge of basic programming like C/C++

 Understand the concepts and features of object oriented programming

 Knowledge about basic Java language syntax and semantics to write Java programs and

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

 Examine key aspects of java Standard API library such as util, io, applets, swings, GUI

based controls.

 Learn java's inheritance, exception handling mechanism, multithreading, packages and

interfaces.

 Develop skills in internet programming using applets and swings

.

 Apply object oriented programming features and concepts for solving given problem.

 Use java standard API library to write complex programs.

 Implement object oriented programming concepts using java

 Develop interactive programs using applet components

 Design interactive programs using swing components

Course Code

1 2 3 4 5

CO1 3 3 2

CO2 3 3 2 2

CO3 3 2 2

CO4 1 3 2 2 1

(20)

CO5 3 2 3 2 1= Slight(low) 2=Moderate(Medium) 3=Substantial(High)

Course Delivery Plan:

S.NO

TOPIC TO BE COVERED NO OF CLASSSES Actual Date Delivery Method As per the

Schedule

Expected Date UNIT-I(Features of OOPS)

1 Types of Programming Languages 1 27-06-2017 1

2 OOPS concepts 2 29-06-2017 1,4

3 Introduction to Java, History of Java

1 01-07-2017 1

4 Features of Java 2 04-07-2017 1,4

5 Java Virtual Machine, Garbage collection, Why Java is important for Internet, Programming concepts of basic java

1 07-07-2017 1

6 Identifiers and Keywords, Data types in Java

1 11-07-2017 1,4

7 Java coding conventions, Expressions in Java, Control structures

4 13-07-2017 1,3

8 Decision making statements Tutorial-1

2 18-07-2017 1,3

9 Jumping Statements, Switch Statement

2 21-07-2017 1,3

11 Arrays Introduction and types Tutorial-2

2 22-07-2017 1,3

UNIT-II (Objects and Classes)

14 String Class 2 25-07-2017 1,4

15 String Buffer class 1 27-07-2017 1,4

16 Data types and null values

Object fundamentals, Pass by value

1 28-07-2017 1

17 Method Overloading and Method Overriding

1 29-07-2017 1

18 Constructor rules and types Constructor overloading

1 01-08-2017 1,4

19 Finalization, this keyword 1 02-08-2017 1

20 Super keyword, Tutorial-3 1 03-08-2017 1,3

21 Subclasses(Inheritance), and types 1 04-08-2017 1 22 Static data, Static methods, Static

blocks, class modifiers

2 05-08-2017 1,4

23 Command line arguments, Abstract Classes

1 08-08-2017 1

24 Interfaces, Inner classes, Tutorial-4 1 09-08-2017 1,3 25 Packages, Package access,

Importing packages and classes

1 10-08-2017 1

(21)

26 User defined packages, Class-path. 1 11-08-2017 1 27 final with inheritance, Dynamic

method dispatch, Call by reference

1 12-08-2017 1,4

16-08-2017 to 22-08-2017 Mid-1 Examinations

UNIT-III (Exception handling, Multi Threading and I/O Package) 28 Types of Exceptions, try, catch,

finally, throw keywords

1 24-08-2017 1,4

29 Handling User defined Exceptions 1 29-08-2017 1 30 Nested Try Statement and multiple

catch blocks

1 30-08-2017 1

31 processes and threads, Thread states, Thread life cycle

1 01-09-2017 1,4

32 Creating threads, Interrupting threads, Thread priorities,

Synchronizing threads, Tutorial- 5

2 05-09-2017 1,3

33 Inter thread communication, Thread groups, Daemon threads

2 12-09-2017 1,4

34 Files and Streams, Stream classes, Reader-Writer classes

1 14-09-2017 1

35 Utilities, Serialization and Deserialization, Tutorial- 6

1 15-09-2017 1

UNIT-IV (Applets, AWT Components) 36 Applet definition and Types of

Applets,

1 16-09-2017 1

37 Applet life cycle 2 19-09-2017 1,4

38 Parameter Passing to an Applet 1 22-09-2017 1,3

39 Graphics class, Tutorial- 7 1 23-09-2017 1

40 Event delegation model, Event sources and Event handlers, Event categories, Event Listeners

1 26-09-2017 1

41 AWT Components, Tutorial- 8 3 27-09-2017 1,3

42 Layout Managers 2 03-10-2017 1,4

43 Adapters classes, Anonymous classes

1 06-10-2017 1

UNIT-V (Swing Components and Util Package)

44 Introduction to swings 1 07-10-2017 1

45 Swing Components, Tutorial- 9 3 10-10-2017 1,4

46 Di ffer en ces between AWT Controls & Swing Controls, developing home page using Applets & Swings.

2 14-10-2017 1,3

47 Ta bbed Pan es, Scr oll Pan es 1 17-10-2017 1,3 48 Java.util package topics

Tutorial-10

3 19-10-2017 1,4

Content beyond syllabus 49 Jumping Statements, Switch

Statement

2 21-07-2017 1

50 String Class Programs 1 25-07-2017 1,4

51 String Buffer class 1 27-07-2017 1,3

52 Data types and null values Scope rules and blocks

1 28-07-2017 1

53 Deadlock of Threads 1 30-08-2017 1

54 Interview Topics related to all the topics

3 During The

classes

1

(22)

23-10-2017 to 28-10-2017 Mid-2 Examinations Delivery Methods (DM):

Course Instructor Course Coordinator

Module Coordinator

Name of the Faculty

P.Ashok Reddy P.Ashok Reddy P.Ashok Reddy

Mr.I.Rajendra Kumar

(23)

LESSON PLAN

Department: Master of Computer Application Program: MCA

Course: MCA Academic Year: 2017-18 Semester:III SEM

Subject: MCA305:Software Engineering

MCA305 – Software Engineering

Lecture : 4 Periods/week Internal Marks : 40 External Marks : 60 Credits : 3 External Examination : 3 Hrs.

SYLLABUS

UNIT - I

Introduction to Software Engineering:

The evolving role of software, Changing Nature of Software,Software myths A Generic view of process:

Software engineering- A layered technology, a process framework, The Capability Maturity Model Integration (CMMI)

Process models:

The waterfall model, Incremental process models, Evolutionary process models, the Unified process

Software Requirements:

Functional and non-functional requirements, user requirements, system requirements, Interface specification, the software requirements document.

UNIT - II

Requirement engineering process:

Feasibility studies, requirements elicitation and analysis, requirements validation, requirements management

Design Engineering:

Design process and Design quality,Design Concepts, the design models Creating and architectural design:

Software architecture, data design,architectural styles and patterns, architectural design UNIT - III

Object-Oriented Design:

Objects and Object classes, An Object-Oriented design process,Design Evolution.

Performing User Interface design:

Golden rules,User interface analysis and design,Interface analysis,Interface design steps, Design evaluation.

UNIT - IV

Testing strategies:

A strategic approach to software testing, test strategies for conventional software, Black-Box and White-Box testing, validation testing, system testing, the art of Debugging

Product metrics:

Software Quality, Metrics for Analysis model, Metrics for design model, Metrics for source code, Metrics for testing, Metrics for maintenance.

Metrics for Process and Products:

Software Measurement, Metrics for software quality.

(24)

UNIT - V

Risk management:

Reactive vs Proactive Risk strategies, software risks, Risk identification, Risk projection, Risk refinement, RMMM,RMMM Plan.

Quality Management:

Quality concepts, Software quality assurance, Software Reviews, Formal technical reviews, Statistical Software quality assurance, Software reliability, the ISO 9000 quality standards.

TEXT BOOK:

1.Roger S.Pressman, “Software Engineering, A Practioner’s Approach”, 6^thedition. McGraw-Hill International Edition,2005

REFERENCES:

1. Somervelli,”Software Engineering”,7^th edition,pearson education20009 2. K.K.Agarwal & Yogesh Singh, “ Software Engineering”, new age international publishers,2008.

3.james F. Peters, Witold Pedrycz”, Software Engineering an engineering approach”, john wiley,2007.

4. Waman S Jawadekar, “ Software Engineering principles and practice-MGH.

1.Data structures, Mathematics, Fundamentals of Computers, Software Principles.

1. Knowledge of basic SW engineering methods and practices, and their appropriate application.

2. Describe software engineering layered technology and Process frame work.

3. A general understanding of software process models such as the waterfall and evolutionary models.

4. Understanding of software requirements and the SRS documents.

5. Understanding of the role of project management including planning, scheduling, risk management, etc.

6. Describe data models, object models, context models and behavioral models.

7. Understanding of different software architectural styles.

8. Understanding of approaches to verification and validation including static analysis, and reviews.

09. Understanding of software testing approaches such as unit testing and integration testing.

10. Describe software measurement and software risks.

(25)

CO1: The Ability to apply software engineering principles and techniques.

CO2:The ability to analyze, design, verify, validate, implement, apply, and maintain software systems.

CO3: The ability to work in one or more significant application domains.

CO4: The Ability to apply for various testing techniques.

CO5:The ability to manage the development of software systems.

4. PROGRAMME OUTCOMES(PO’S)

At the end of the programme the students are able to:

1. Apply knowledge of mathematics, computer science and management in practice.

2. Identify, critically analyze, formulate and develop computer applications.

3. Select modern computing tools and techniques and use them with dexterity.

4. Design a computing system to meet desired needs within realistic constraints such as

safety, security and applicability.

5. Function professionally with ethical responsibility as an individual as well as in

multidisciplinary teams with positive attitude.

Program Outcomes(PO’S)

1 2 3 4 5

CO1 3 2 1

CO2 3 3 2 1

CO3 1 2 3

CO4 1 2 1

CO5 1 2 3

1= Slight(low) 2=Moderate(Medium) 3=Substantial(High)

(26)

Course Delivery Plan

Actual Date

1 Introduction to software engg 01 27-06-2017 1

2 Role of software,nature of

software 01 29-06-2017 1

3 Software myths,layered

technology 01 03-07-2017 1

4 Process framework,CMMI 01 04-07-2017 1

5 Process models,waterfall model 01 06-07-2017 1

6 Incremental models,prototype

model,spiral model 01 05-07-2017 1

7 Unified process 01 10-07-2017 1

8 Functional and non-functional

requirements 01 11-07-2017 1

9 User,system,interface,SRS 01 13-07-2017 1,2

10 Assignment 01 14-07-2017 4

11 Tutorial-1 01 17-07-2017 3

UNIT-II 12 Requirements engineering

process,Feasibility studies 01 18-07-2017 1

13 elicitation ,analysis 01 20-07-2017 1

14 Validation,management 01 21-07-2017 1

15 Design engineering 01 24-07-2017 1

16 design process 01 25-07-2017 1

17 design quality 01 27-07-2017 1

18 Design model 01 28-07-2017 1

19 Design concepts 01 31-07-2017 1

20 Software architecture 01 01-08-2017 1

21 Data design 01 03-08-2017 1

22 Architectural styles 01 04-08-2017 1

23 Architectural patterns 01 07-08-2017 1

24 Architectural design 01 08-08-2017 1,2

25 Tutorial-2 01 10-08-2017 3

26 Assignment 01 11-08-2017 4

I-MID EXAM 17-08-2017

I-MID EXAM 18-08-2017

(27)

S.NO TOPIC TO BE COVERED NO OF CLASSES Actual Date

Schedule Expected Date UNIT-III

27 Object-oriented design 01 21-08-2017 1

28 Objects and object classes 01 22-08-2017 1

29 Object-oriented design process 01 24-08-2017 1

30 Design evolution 01 28-08-2017 1

31 User interface design 01 29-08-2017 1

32 Golden rules 01 31-08-2017 1

33 User interface analysis and

design 01 01-09-2017 1

34 Interface analysis 01 04-09-2017 1

35 Interface design steps 01 05-09-2017 1

36 Design evaluation 01 07-09-2017 1

37 Assignment 01 08-09-2017 4

38 Tutorial-3 01 11-09-2017 3

UNIT-IV

39 Testing strategies 01 12-09-2017 1

40 Software testing, conventional

software 01 14-09-2017 1

41 Black-Box & White-Box testing 01 15-09-2017 1

42 Validation,system,debugging 01 18-09-2017 1

43 Software quality,metrics for

AM,DM 01 19-09-2017 1

44 Source code,testing,maintenance 01 21-09-2017 1

45 Software measurement 01 25-09-2017 1

46 Metrics for software quality 01 26-09-2017 1

47 Assignment 01 28-09-2017 1,4

48 Tutorial-4 01 29-09-2017 3

UNIT-V 49 Reactive vs proactive risk

strategies 01 03-10-2017 1

50 Software risks,risk identification 01 05-10-2017 1

51 ^Riskprojection,refinement,RMMM,plan 01 06-10-2017 1

52 Quality concepts,quality

assurance 01 09-10-2017 1

53 Reviews,FRR,SSQA 01 12-10-2017 1

54 Software reliability 01 13-10-2017 1

55 ISO 9000 quality standards 01 16-10-2017 1

56 Tutorial-5 01 17-10-2017 3

57 Assignment 01 19-10-2017 1,4

II-MID EXAM 23-10-2017

Content Beyond Syllabus 58 Usability and usability-

engineering 20-10-2017 1,2

59 User-oriented usability testing 21-10-2017 1,2

Total Number of Classes:61

(28)

Course

Name of the Faculty L.NARENDRA L.Narendra

(29)

LESSON PLAN

Subject : MCA306:Unix Network Programming

SYLLABUS

(30)

(31)

Basic knowledge of C programming language.

In the first half of the course we will introduce students to standard programming and software development tools in the UNIX environment. This includes a detailed look at using the UNIX shell command line, and shell scripting.

In the second half of the course the student will apply these tools and techniques for IPC and to develop simple client/server applications using the standard UNIX network programming tools and protocols.

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

 Identify and use UNIX utilities to create and manage simple file processing operations, organize directory structures with appropriate security

 Develop shell scripts to perform more complex tasks.

 Learn APIs for Inter process communication using pipes, message queues, semaphores and shared memory.

 To be able to design and build an IPC applications over the unix operating system

 Design client / server applications using UNIX socket system calls (socket, bind, listen, connect etc.).

CO 1 : Describe the architecture and features of UNIX Operating System and distinguish it from other Operating System and Learn various command utilities in UNIX.

CO 2 : Demonstrate UNIX commands and system calls for file handling and process control .

CO 3 : Analyze a given problem and Apply requisite facets of SHELL programming in order to devise a SHELL script to solve the problem

CO 4 : Implement inter process communication applications using pipes, FIFO’s, messages queues, semaphores and shared memory.

CO 5 : Design and Develop client/server applications using socket system calls and remote procedure call.

Course Code

1 2 3 4 5

CO1 3

CO2 3

CO3 3

CO4 3 1 3

CO5 3 2 3

(32)

Course Delivery Plan:

S.NO TOPIC TO BE COVERED NO OF CLASSSES Actual

Date Delivery Method As per the

1 Introduction to UNIX

operating system, history 01 27/06/17 01

2 UNIX file system 01 28/06/17 01

3 Features of UNIX OS 01 29/06/17 01

4 Vi editor 01 30/06/17 01

5 File handling utilities 01 01/07/17 01

6 Security by file permissions 01 04/07/17 01

7 Process , Disk utilities 01 06/07/17 01

8 Networking commands 01 07/07/17 01

9 Text processing utilities 01 08/07/17 01

10 Back up utilities 01 11/07/17 01

11 tail, head, cut, paste, join, tee

commands 01 13/07/17 01

12 sort, uniq, nl, grep, egrep,

fgrep commands 01 14/07/17 01

13 comm, cmp, diff, tr, find,

umask, who, w commands 01 15/07/17 01

14 Tutorial – 1 01 18/07/17 03

15 Introduction to shell

programming 01 20/07/17 01

16 Shell responsibilities 01 21/07/17 01

17 Building own command

library 01 22/07/17 01

UNIT-II

18 Pipes and input redirection 01 25/07/17 01

19 Output redirection and here

documents 01 27/07/17 01

20 Shell meta characters 01 28/07/17 01

21 Shell variables, environments

variables 01 29/07/17 01

22 Types of shells 01 01/08/17 01

23 If Control and example scripts 01 03/08/17 02

24 Case control and example

scripts 01 04/08/17 02

25 While control and example

scripts 01 05/08/17 02

26 Until control and example

scripts 01 08/08/17 02

27 For control and example

scripts 01 10/08/17 02

28 Break and example scripts 01 11/08/17 02

29 Unix files and directories,

devices 01 17/08/17 01

30 Unix system calls and library 01 18/08/17 01

(33)

functions

31 Open, create, read, write,

close system calls 01 19/08/17 01

32 lseek and file I/O using

system calls 01 22/08/17 01

33 Examples of files using

standard I/O 01 24/08/17 02

34 Tutorial - 2 25/08/17 03

35 stat, fstat, lstat system calls 01 26/08/17 01

36 Umask, dup, dup2 system

calls 01 29/08/17 01

UNIT-III 37 Formatted I/O and example

programs 01 31/08/17 01

38 Streams and file descriptors 01 01/09/17 01

39 Directory related system calls 01 02/09/17 01

40 Chmod, chown, unlink, link,

symlink, mkdir, chdir, getcwd 01 05/09/17 01

41 Tutorial -3 01 07/09/17 03

Unix process, process

structure 01 08/09/17 01

42 Starting new process, waiting

for a process 01 09/09/17 01

43 Zombie process, process

control 01 12/09/17 01

44 Process identifiers, process

management 01 14/09/17 01

UNIT-IV

45 Pipes 01 15/09/17 01

46 FIFOs 01 19/09/17 01

47 Semaphores 01 21/09/17 01

48 Message queues 01 22/09/17 01

49 Shared memory 01 23/09/17 01

50 Tutorial -4 01 26/09/17 03

UNIT-V

51 Berkeley sockets 01 03/10/17 01

52 Socket system calls for

connection oriented protocol 01 05/10/17 01

53 Socket system call for

connection less protocol 01 06/10/17 01

54 Client / server example 01 07/10/17 02

55 Tutorial-5 01 12/10/17 03

56 Sun RPC 01 13/10/17 01

58 LINUX operating System

Introduction 01 22/10/17 01

59 Unix administration demo 01 21/10/17 02

(34)

Course Instructor Course Coordinator

Module Coordinator

Name of the

Faculty M.Hema Latha Mrs R.Vijaya I.RAJENDRA

KUMAR

(35)

LESSON PLAN

Subject : MCA352:OOPS THROUGH JAVA LAB SYLLABUS

1) Write a Java program to find the roots of a quadratic equation?

2) Write a Java program to generate first n Fibonacci numbers?

3) a) Write a Java program to reverse the given number?

b) Write a Java program to check whether given number is Prime or not?

4) Write a Java program to check whether given number is Palindrome or not?

5) Write a Java program to check whether given number is Armstrong or not?

6) Write a Java program to find factorial of the given number using recursions?

7) Write a Java program to find min and max number of given array?

8) Write a Java program to search an element by using linear search and binary search?

9) Write a Java program to sort the elements of an Array?

10) Write a Java program to perform Matrix Multiplication?

11) Write a Java program using constructors

12) Write a Java program for constructor Overloading.

13) Write a Java program using inheritance?

14) Write a Java program to implement Method over Loading and Method over riding?

15) Write a Java program by using this and super key word.

16) Write a Java program by using final variables and final methods.

17) Write a Java program to implement dynamic method dispatch.

18) Write a Java program using abstract class?

19) Write a Java program to implement Multiple Inheritance (Interface)?

20) Write a Java program on demonstration of packages?

21) Write a Java program illustrating string handling functions

22) a) Write a Java program to check whether given string is palindrome (or) not. ? b) Write a Java program to sort the set of strings in sorting order?

c) Write a Java program to find sum of the numbers using String Tokenizer?

23) Write a Java program by using length () and capacity () Methods of String Buffer?

24) Write a Java program to find the sum of the numbers by using command line arguments?

25) (a) Write a Java program by using Exception handling Mechanism including Finally block?

(b) Write a Java program to Handle User Defined Exceptions?

26) (a) Write a Java program to create Multithreads?

(b) Write a Java program on Thread Synchronization

27) Write a Java program to implement Inter thread communication?

28) (a) Write a sample Applet program to Display Message?

(b) Write an Applet program using Graphics?

(c). Write an Applet program to pass parameters to Applet.

29) Write a Java program to create user login by using AWT components?

30) Write a Java program to implement border layout.

31) (a) Write an applet program to handle Mouse Events?

(b) Write an applet program to handle Key Events using adapter Class?

32) Write a Java program by using StringTokenizer class.

(36)

Course Description:

This lab course is introduced to understand the basic concepts of Java, Class syntax, data types, flow of control, classes, methods, objects, arrays, exception handling, recursion, and graphical user interfaces (GUIs). Writing and testing applets for potential inclusion in web pages. Understanding how to access enterprise data bases from the application programs.

 C++ Programming

 Need to know basics of programming language, data types and using loops instructions

 Basic need of Java for quick learning and understanding is Knowledge of basic programming like C/C++

 Provide an overview of Object Oriented Programming concepts using Java.

 Understand the concepts and features of object oriented programming

 Write java programs to solve mathematics, science and engineering problems.

 Use java jdk environment to create, debug, compile and run java programs

 Knowledge about basic Java language syntax and semantics to write Java programs and use concepts such as variables, conditional and iterative execution methods etc.

 Examine key aspects of java Standard API library such as util, io, applets, swings, GUI based controls.

 Learn java's inheritance, exception handling mechanism, multithreading, packages and interfaces.

 Understand fundamentals of object-oriented programming in Java, including defining classes, invoking methods, using class libraries, etc.

 Be able to use the Java SDK environment to create, debug and run simple Java programs.

 Understand Java's event handling model.

 Apply object oriented programming features and concepts for solving given problem.

 Use java standard API library to write complex programs and implement object oriented programming concepts using java.

 The students will be able to demonstrate programs on basic constructs like if- else, control structures, array, and strings, exceptions, multithreading and applets.

 Propose the use of certain technologies by implementing them in the Java programming language to solve the given problem (synthesis) and solve problems using java collection framework and I/O classes.

 Develop interactive programs using applet and swing components.

(37)

Course

1 2 3 4 5

CO1 2 3 3

CO2 3 2 2

CO3 3 2 3

CO4 2 2 3

CO5 3 3 2

Course Delivery Plan:

Notification of Cycles

Week 1: Expected Date of Conduction: 17-07-2017 Date of Conduction: 17-07- 2017

1) Write a Java program to find the roots of a quadratic equation?

2) Write a Java program to generate first n Fibonacci numbers?

3) a) Write a Java program to reverse the given number?

b) Write a Java program to check whether given number is Prime or not?

1) Write a Java program to check whether given number is Palindrome or not?

2) Write a Java program to check whether given number is Armstrong or not?

3) Write a Java program to find factorial of the given number using recursions?

4) Write a Java program to find min and max number of given array?

1) Write a Java program to search an element by using linear search and binary search?

2) Write a Java program to sort the elements of an Array?

3) Write a Java program to perform Matrix Multiplication?

4) Write a Java program to illustrate String Handling Functions.

5) a) Write a Java program to check whether given string is palindrome (or) not. ? b) Write a Java program to sort the set of strings in sorting order?

6) Write a Java program by using length () and capacity () Methods of String Buffer?

1) Write a Java program using constructors

2) Write a Java program for constructor overloading.

(38)

3) Write a Java program using inheritance?

4) Write a Java program to implement Method over Loading and Method over riding?

1) Write a Java program by using this and super key word.

2) Write a Java program by using final variables and final methods.

3) Write a Java program to implement dynamic method dispatch.

4) Write a Java program using abstract class?

5) Write a Java program to implement Multiple Inheritance (Interface)?

1) Write a Java program on demonstration of packages?

2) Write a Java program to find the sum of the numbers by using command line arguments?

1(a) Write a Java program by using Exception handling Mechanism including Finally block?

(b) Write a Java program to Handle User Defined Exceptions?

26) (a) Write a Java program to create Multithreads?

(b) Write a Java program on Thread Synchronization

27) Write a Java program to implement Inter thread communication?

Week 8: Expected Date of Conduction: 25-09-2017 Date of Conduction: 25- 09-2017

1) (a) . Write a sample Applet program to Display Message?

(b). Write an Applet program using Graphics?

(c). Write an Applet program to pass parameters to Applet.

2) (a). Write a Java program to create user login by using AWT components?

3) Write a Java program to implement Border Layout.

Week 9: Expected Date of Conduction: 16-10-2017 Date of Conduction: 16- 10-2017

1) (a) Write an applet program to handle Mouse Events?

(b) Write an applet program to handle Key Events using adapter Class?

2) Write a Java program by using String Tokenizer Class.

List of Additional Programs

1.Write a Java Program using nested statement

2. Construct a Java Program using AWT Components a) TextField

(39)

b)TextArea

3.Write an AWT Program for a)List b) Menu 4. Write an applet program to handle Key Events 5. Write a java program using swing components a) JTabbedPane

b) JTree

6. Write a Java Program using a) ArrayList

b) Vector

Course Instructor Course

Name of the Faculty

P.Ashok Reddy P.Ashok Reddy P.Ashok Reddy

Mr.I.Rajendra Kumar

(40)

LESSON PLAN

Subject : MCA352:Unix Network Programming Lab

SYLLABUS

(41)

(42)

knowledge of C Programming.

2. Course Educational Objectives (CEOs): In this course student will learn about

 Various utilities and filters in Unix Operating System

 Programming in networking environment

 Various operating system functionalities including process management, file management, networking etc.

 Shell programming

 Inter process communication

 Network programming through sockets

CO 1 : Utilize various utilities in Unix operating system

CO 2 : Implement various OS functionalities using system calls CO 3 : Implement Inter Process Communication.

CO 4 : Implement network programming using sockets CO 5 : Implement Remote Procedure call

Course

Code Cos Programme Outcomes

1 2 3 4 5

CO1 3

CO2 3

CO3 3

CO4 3 1 3

CO5 3 2 3

Course Delivery Plan:

S.No Date

(Tentative) Topics to be covered

1 28/06/2017 Unix commands practice session

2 5/07/2017 Vi Editor Practice