lesson plan master of computer application program
Post on 15-Feb-2022
5 Views
Preview:
TRANSCRIPT
LESSON PLAN
Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2015-16 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
1. Pre-requisites:
MCA201:-Automata Theory and Formal languages
2. Course Educational Objectives (CEOs):
In this course student will learn about:
Finite Automation Model
Differences between deterministic and non deterministic finite automation
Conversion of Finite Automata into Regular Expressions.
Context Free Grammars and Normal Forms.
Designing of Turning Machine
3. Course Outcomes (COs): At the end of the course, the student will be able to:
CO1: Differentiate deterministic and non deterministic Finite automation.
CO2: Convert Finite Automata to Regular Expressions.
CO3:Construct parse trees for context free grammars.
CO4:Demonstrate Push Down Automata
CO5:Design Turning Machine
4. Course Articulation Matrix:
Course Code
COs Programme Outcomes
1 2 3 4 5
CO1 3 1
CO2 2 2 3
CO3 1 2
CO4 1 2 1
CO5 2 2 2 3
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
1 Introduction to compiler design course
02 27/06/15 01
29/06/15
2 Types of language processors 01 30/06/15 01 3 Types of compilers 01 01/07/15 01 4 Compiler phases 02 04/07/15 01
06/07/15
5 Problems 01 07/07/15 01
6 Tutorial-1 01 11/07/15 03
7 Purpose of symbol table and Lexical analyzer
01 13/07/15 01
8 Input buffering scheme 01 14/07/15 01
9 LEX and YACC 02 15/07/15 02
18/07/15
10 Basic approaches to build Lexical analyzer
01 20/07/15 01
Number of Classes: 13
UNIT-II
11 Common programming errors and error recovery strategies
01 21/07/15 01
12 Top down and bottom up parsing
01 22/07/15 01
13 CFG and ambiguity in CFG 02 25/07/15 01
27/07/15
14 Tutorial-2 01 28/07/15 03
15 Removing ambiguity and left recursion from CFG
01 29/07/15 01
16 Removing non determinism from grammars
01 02/08/15 01
17 Classification of parsers 01 04/08/15 01
18 LL(1) parser-first and follow construction
01 05/08/15 02
19 LL(1) parser-parsing table construction
01 08/08/15 02
20 Recursive descent parser 01 10/08/15 01
21 Predictive parser 01 11/08/15 01
Number of Classes: 13
UNIT-III
22 Shift Reduce parsing 02 14/08/15 01
22/08/15
23 Types of LR parsers 01 24/08/15 01
24 LR(0) and LR(1) parsers 01 25/08/15 02
25 SLR(1) parsers 01 31/08/15 01
26 LALR(1) parsers 01 01/09/15 01
27 Identifying the type of LR grammar
01 05/09/15 01
28 Operational precedence parsers
01 07/09/15 01
29 Tutorial-3 01 08/09/15 03
Number of Classes: 09
UNIT-IV
30 Syntax directed translation 02 12/09/15 01
14/09/15
31 Abstract parse trees 01 15/09/15 01
32 Syntax directed grammar conversions
01 16/09/15 01
33 Synthesized and inherited attributes
01 19/09/15 01
34 Three address codes 02 21/09/15 02
22/09/15
35 Storage organization 01 23/09/15 01
36 Storage allocation 01 26/09/15 01
37 Tutorial-4 01 26/09/15 03
Number of Classes: 10
UNIT-V
38 Code optimization techniques 01 27/09/15 01
39 Construction of DAG 01 28/09/15 01
40 Basic blocks 01 29/09/15 01
41 Design issues of code generator
01 03/10/15 01
42 Flow graphs 01 05/10/15 02
44 Basic block optimization techniques
02 06/10/15 01
07/10/15
45 Tutorial-5 01 08/10/15 03
Number of Classes: 08
Content beyond syllabus:
46 Latest compilers for languages 01 09/10/15 02
47 Compilers of C and JAVA 01 10/10/15 02
Total Number of Classes: 55
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
Module Coordinator
HOD
Signature
Name of the Faculty
N.SREERAM I.RAJENDRA KUMAR
K.PHANEENDRA
I.RAJENDRA KUMAR
LESSON PLAN
Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2015-16 Semester : III SEM Subject : MCA302:COMPUTER NETWORKS
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.
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”, 3nd
Edition,
Vikas Publishing House, 2008.
1. Pre-requisites:
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.
3. Course Outcomes (COs): At the end of the course, the student will be able to:
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.
4. Course Articulation Matrix:
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
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
1 Uses of Computer Networks 01 19-08-2015 01
2 Types of Networks: LAN,
WAN,MAN
01
20-08-2015
01
3 Topologies 01 24-08-2015 01
4 Protocol Hierarchies 01 25-08-2015 01
5 Design Issues for the Layers 01 26-08-2015 01
6 Service Primitives, Services 01 27-08-2015 01
7 OSI Reference Model 01 31-08-2015 01
8 TCP/IP Reference Model 01 01-09-2015 01
9 ATM Reference Model 01 02-09-2015 01
10 Physical Layer: Guided
Transmission Medium
01
03-09-2015
01
11 Un Guided Transmission
Medium
01
07-09-2015
01
12 Un Guided Transmission
Medium
01 08-09-2015 01
13 Tutorial-1 01 09-09-2015 03
Number of Classes: 13
UNIT-II
14 Design Issues of Data link layer:
services
01
10-09-2015
01
15 Error Correcting Codes, Error
Detecting codes
01 14-09-2015 01
16 Framing, Error control 01 15-09-2015 01
17 Elementary Data link protocols:
An Unrestricted Simplex
protocol, A Simplex Stop-and-
Wait Protocol
01 16-09-2015 01
18 Tutorial-II 01 21-09-2015 03
19 A Simplex Protocol for a Noisy
Channel
01 22-09-2015 01
20 Sliding window protocols 01 23-09-2015 01
21 Go back-n, selective repeat 01 24-09-2015 01
22 HDLC 01 28-09-2015 01
23 Introduction to MAC and its
protocols
01 29-09-2015 01
24 Collision Free Protocols 01 30-09-2015 01
25 Ethernet 802.3,Wireless LAN,
Bluetooth
01
01-10-2015
01
Number of Classes: 12
UNIT-III
26 Network Layer Routing
Algorithms: shortest path
01 12-10-2015 01
27 flooding ,Flow based distance
vector routing,
01 13-10-2015 01
28 Advanced Topic-I 01 14-10-2015 01
29 Link state routing 01 15-10-2015 01
30 Hierarchical Routing 01 26-10-2015 01
31 Broadcasting, Multi Cast,
Routing for Mobile Hosts.
01 27-10-2015 01
32 Congestion control Techniques:
leaky Bucket
01 28-10-2015 01
33 Token Bucket 01 29-10-2015 01
34 Congestion control algorithms:
General principals Congestion
prevention policies: traffic
shaping, Choke Packet
01 02-11-2015 01
35 Congestion prevention policies:
Load shedding, Jitter Control
01 03-11-2015 01
36 Tutorial-III 01 04-11-2015 03
Number of Classes: 11
UNIT-IV
37 Transport Layer: Services of
Transport layer
01
05-11-2015
01
38 Elements of transport Protocols 01 09-11-2015 02
39 Flow control, Buffering 01 10-11-2015 02
40 Multiplexing , Crash recovery 01 11-11-2015 02
41 UDP 01 12-11-2015 02
42 TCP Segment format 01 16-11-2015 02
43 TCP Connection Establishment 01 17-11-2015 02
44 TCP Connection Release 01 18-11-2015 02
45 TCP Congestion Control 01 19-11-2015 02
46 Tutorial-IV 01 23-11-2015 03
Number of Classes: 10
UNIT-V
47 Application Layer Introduction 01 24-11-2015 02
48 Domain Name System 01 25-11-2015 02
49 Electronic Mail (SMTP) 01 26-11-2015 02
51 File transfer Protocol FTP 01 30-11-2015 02
52 World Wide Web (HTTP) 01 01-12-2015 02
53 POP3 , IMAP 01 02-12-2015 02
54 Advanced Topic-II 01 03-12-2015 02
55 Peer-to-peer Network 01 07-12-2015 02
56 Peer-to-peer Network 01 08-12-2015 02
57 Storage Area Network 01 09-12-2015 02
58 Tutorial- V 01 10-12-2015 03
59 Revision 01 14-12-2015 01
60 Revision 01 15-12-2015 01
61 Revision 01 16-12-2015 01
Number of Classes: 14
Content beyond syllabus:
1 Data center and high-
performance networking.
01 14-10-2015 02
2 Network virtualization.
01 03-12-2015 02
Total Number of Classes: 61
Delivery Methods (DM):
1. Chalk & Talk 2. ICT Tools 3. Tutorial 4. Assignment/Test/Quiz 5. Laboratory/ Filed Visit 6. Web based learning
Instructor Course
Coordinator
Module
Coordinator
HOD
Name K. Phaneendra K. Phaneendra K. Phaneendra I Rajendra Kumar
Sign with Date
LESSON PLAN
Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2015-16 Semester : III 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, Satraj Sahni and Rajasekharam, “Fundamentals of Computer Algorithms”, Galgotia publications pvt. Ltd.
Reference Books:
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”, Pearson education.
1. Pre- requisite:
Students should have a good knowledge in C Programming Language
2. Course Educational Objectives:
1. To explain the fundamental concepts of various algorithm design techniques.
2. To make the students familiar to conduct performance evaluation of algorithms.
3. To expertise the students with the various existing algorithm design techniques.
4. To motivate the students to design a new algorithms for various problems.
5. To introduce the concepts of NP-Hard problems.
3. Course Outcomes: After completion of the course students are able to:
CO1: Able to discuss different computational models for example divide and conquer, order notation (), various
Complexity measures to analyze the performance of different algorithms.
CO2: Understand the difference between the lower and upper bounds of various problems and their
Importance in deciding the optimality of an algorithm.
CO3: Able to analyze various techniques for efficient algorithm design (divide and conquer, greedy, and
Dynamic programming algorithms) and able to apply them while designing algorithms.
CO4: Apply backtracking and branch and bound techniques to deal with some hard problems.
CO5: Able to know the concepts of tractable and intractable problems, classes of P,NP,NP-HARD and
NP-Complete problems.
4. Course Articulation Matrix:
Course Code
COs Programme Outcomes
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
1= Slight(low) 2=Moderate(Medium) 3=Substantial(High)
Course Delivery Plan:
S.NO
TOPIC TO BE COVERED
NO OF CLASSSES
Date
Delivery Method As per
the Schedule
Taken
UNIT-I
1 Introduction, Algorithm defn, properties 1 19/08/2015
1
2
Diff areas to study abt Algorithms,
Pseudo code conventions.
1 20/08/2015
1
3
Performance Analysis, Time complexity &
Space complexity
2 21/08/2015
1,3
4
Asymptotic notations, Introduction to
Divide and Conquer
1 24/08/2015
1
5 Binary search, Binary search analysis 1 24/08/2015
1,3
6 Quick sort, Quick sort analysis 2 26/08/2015
1,3,4
7 Merge sort Analysis 1 27/08/2015
1
8 Strassens matrix multiplication 2 28/08/2015
1,3,4
9 Tutorial-1 1 31/08/2015
4
Number of Classes:12
UNIT-II
10
Greedy Method introduction, General
method 1 7/09/2015 1
11 Job sequencing with dead lines
2 9/9/2015 1,3,4
12 Single source shortest path problem 1 10/09/2015 1,3
13 Optimal storage on tapes
1 11/09/2015 1
14 Knapsack problem and problems
1 14/09/2015 1,3
15 Minimum cost spanning trees
2 14/09/2015 1,3,4
16 Basic search and Traversal Techniques
1 16/09/2015 1
17 Biconnected components
2 17/09/2015 1,3
18 DFS,BFS
2 18/09/2015 1,3
19 Tutorial-2
1 21/9/2015 4
Number of Classes:14
NO OF CLASSES Date Delivery
S.NO TOPIC TO BE COVERED As per the
Schedule
Taken Method
UNIT-III
20 Dynamic programming
1 12/10/2015 1
21 Matrix chain multiplication
2 12/10/2015 1,3,4
22 Optimal Binary search tree
2 14/10/2015 1,3,4
23 0/1 knapsack problem
2 15/10/2015 1,3,4
24 All pairs shortest path problem
2 16/10/2015 1,3,4
25 Travelling sales person problem
1 26/10/2015 1,3,4
26 Reliability Design
1 26/10/2015 1,3,4
27 Tutorial
1 28/10/2015 4
Number of Classes:12 29/10/2015
UNIT-IV 30/10/2015
28
Introduction to back tracking,
General method 3
2/11/2015 1
29 Sst for queen, sum of subsets
1 4/11/2015 1,3,4
30 N-queens problem
1 6/11/2015 1
31 Sum of sub sets problem
2 9/11/2015 1
32 Graph coloring
2 11/11/2015 1,3,4
33 Hamiltonian cycles
1 12/11/2015 1
34 Tutorial
1 13/11/2015 4
Number of Classes:11
UNIT-V
35 Introduction to Branch and Bound
1 23/11/2015 1
36 Travelling sales person problem
2 25/11/2015 1,3
37 0/1 Knapsack
1 27/11/2015 1,3
38 LCBB 1 30/11/2015 1,3
39 FIFOBB 1 30/11/2015 1,3
40 Introduction to NPHARD&NPCOMPLETE 1 1/12/2015 1
41
Example problems On non deterministic
algorithms 2 3/12/2015 1,3
42
Basic concepts, NP-hard class, NP –
complete class 1 4/12/2015 1
43 Cooks theorem
3 7/12/2015 1
44 Tutorial
1 9/12/2015 4
Number of Classes:13
Content Beyond Syllabus
45 Decrease and Counter 1 16/12/2015 1
46 Transform and Counter 1 17/12/2015 1
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 Instructor Course Coordinator
Module Coordinator
HOD
Signature
Name of the Faculty R.Vijaya R.Vijaya I.Rajendra Kumar
I.Rajendra Kumar
LESSON PLAN
Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2015-16 Semester : III SEM 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: 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.
1. Pre-requisites: Students should have a basic knowledge in computer.
2. Course Educational Objectives (CEOs):
In this course student will learn about The OOP s concepts. Object oriented Programming Window based applications using AWT and swing components Multi-threading concepts
3.Course Outcomes (COs):
At the end of the course, the student will be able to: CO1: Mini projects after completion of Applets, AWT and SWING Components CO2: Students are get benefited in subject in practical and industry orientation manner CO3: Students are confident in java programming CO4: Students feel confident all areas of java CO5: get confident on all aspects of the subject
4. Course Articulation Matrix:
Course Code
COs Programme Outcomes
PO1 PO2 PO3 PO4 PO5
CO1 3 3 2
CO2 3 3 2 2
CO3 3 2 2
CO4 1 3 2 2 1
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
01 Paradigm of Programming
Languages
01 17-08-2015 01
02 Principles of OOP 01 18-08-2015 01
03 Principles of OOP 01 20-08-2015 01
04 Benefits of OOP ,Diff Between C and
C++
01 21-08-2015 01
05 Introduction to Java, History of Java 01 22-08-2015 01
06 Java is important to Internet 01 24-08-2015 01
07 JDK Environment, Java Virtual
Machine
01 25-08-2015 01
08 Java Features 01 27-08-2015 01
09 Programming concepts of Basic
Java, Identifiers, Keywords
01 28-08-2015 01
10 Data types in Java 01 29-08-2015 01
11 Tutorial 01 31-08-2015 03
12 Java coding conventions,
Expressions in Java
01 01-09-2015 01
13 Control Structures 01 03-09-2015 01
14 Arrays 01 04-09-2015 01
15 Assignment 01 07-09-2015 04
Number of Classes: 15
UNIT-II
16 Objects and Classes, Object
Fundamentals, Pass byValue
01 08-09-2015 01
17 Over loading 01 10-09-2015 01
18 Over riding, Pass by reference 01 11-09-2015 01
19 Constructors 01 14-09-2015 01
20 Constructor Overloading, 01 15-09-2015 01
21 Finalization, Sub Classes, This
keyword
01 18-09-2015 01
22 super keywords, inheritance 01 19-09-2015 01
23 Dynamic method Dispatch, Scope
rules
01 21-09-2015 01
24 Static data methods,static blocks,
Class modifiers
01 22-09-2015 01
25 Tutorial 01 24-09-2015 03
26 String Handling Functions 01 26-09-2015 01
27 String Buffer Functions,Diff between
String and StringBufer
01 28-09-2015 01
28 Command line arguments, Abstract
classes
01 29-09-2015 01
29 Inter faces, Inner classes, Packages,
Package access, Importing packages
and classes, User defined Packages,
Accessing
01 01-10-2015 01
30 Understanding CLASS PATH 01 03-10-2015 01
31 Assignment 01 03-10-2015 04
Number of Classes: 16
I MID Exams
UNIT-III
32 Exception handling, Types of
Exceptions
01 12-10-2015 01
33 Try ,throw, throws, catch 01 13-10-2015 01
34 finally Keywords 01 15-10-2015 04
35 Handling user defined exceptions 01 16-10-2015 01
36 Handling user defined exceptions 01 17-10-2015 01
37 Multithreading:Process And
Threads
01 26-10-2015 01
38 Thread States 01 27-10-2015 01
39 Difference between multi process
and multi thread
01 29-10-2015 01
40 Thread lifecycle ,creating threads 01 30-10-2015 01
41 synchronizing thread 01 31-10-2015 01
42 Interrupting and priorities of
threads
01 02-11-2015 01
43 Tutorial 01 03-11-2015 03
44 Daemon thread, Thread groups,Inter
thread communication
01 05-11-2015 01
45 JAVA I/O:Files and Streams
,Stream classes
01 06-11-2015 01
46 Reader writer classes, 01 07-11-2015 01
47 file class Tests and utilities 01 09-11-2015 01
48 Serialization and de-serialization 01 10-11-2015 01
49 Assignment 01 12-11-2015 04
Number of Classes: 18
UNIT-IV
50 Applets:Types of Applets, Life cycle
of Applet
01 13-11-2015 01
51 Graphics and Parameter Passing 01 16-11-2015 01
52 Difference between Application and
Applets
01 17-11-2015 01
53 Creating Applets,getCodeBase() and
getDocumentBase()
01 19-11-2015 01
54 AWT, Components and Graphics 01 20-11-2015 01
55 Containers ,Frames and Panels 01 21-11-2015 01
56 Tutorial 01 23-11-2015 03
57 Layout Managers 01 24-11-2015 01
58 Event delegation Model 01 26-11-2015 01
59 Event sources and Handlers 01 27-11-2015 01
60 Mouse Events, Key Events 01 28-11-2015 02
61 Adapters,Anonymus inner classes 01 30-11-2015 02
62 Assignment 01 01-12-2015 04
Number of Classes: 13
UNIT-V
63
Introduction to swing controls,diff
b/w AWT & Swing
01 03-12-2015 01
64
Swing controls like text Boxes,
combo boxes
01 04-12-2015 01
65 Tabbed panes ,scroll panes 01 05-12-2015 01
66 Tutorial 01 07-12-2015 03
67
JTrees and JTable,Developing Home
page using AWT&Swing
01 08-12-2015 01
68 Java.util classes 01 10-12-2015 01
69 interfaces, hash table 01 11-12-2015 01
70 vector&array list 01 14-12-2015 01
71 StringTokenizer 01 15-12-2015 01
72 Date class 01 17-12-2015 01
73 Assignment 01 18-12-2015 04
74 REVISION 01 19-12-2015 01
Number of Classes: 12
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
Module Coordinator
HOD
Signature
Name of the Faculty S.SIVA RAMA KRISHNA
P Ashok Reddy P Ashok Reddy I.RAJENDRA KUMAR
LESSON PLAN
Department: Master of Computer Application Program: MCA Course: MCA Academic Year: 2015-16 Semester:III SEM Subject: MCA305:Software Engineering
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. 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”, 6th edition. McGraw-Hill International Edition,2005 REFERENCES: 1. Somervelli,”Software Engineering”,7th 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. Pre-requisites:
1.Data structures, Mathematics, Fundamentals of Computers, Software Principles.
2. Course Educational Objectives (CEOs):
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.
3. Course Outcomes (COs): At the end of the course, the student will be able to:
CO1: Apply software engineering principles and techniques.
CO2: Analyze, design, verify, validate, implement, apply, and maintain software systems.
CO3: Able to work in one or more significant application domains.
CO4: Apply for various testing techniques.
CO5: 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.
4. Course Articulation Matrix:
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 2
CO5 3 2 1 2 1
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
1 Introduction to Software Engineering
01 17-08-2015 1
2 Evolving role of Software, Changing nature of Software
01 20-08-2015
1
3 Software Myths 01 21-08-2015
1
4 Software Engineering-A Layered Technology
01 24-08-2015
1
5 Process framework 01 27-08-2015 1
6 Capability and Maturity Model 01 28-08-2015
1
Integration(CMMI)
7 Process models: Waterfall model 01 29-08-2015
1
8 Incremental Process models 01 31-08-2015 1
9 Evolutionary process models 01 03-09-2015 1
10 Unified process 01 04-09-2015
1
11 Functional and Non functional requirements
01 05-09-2015
1,2
12 User requirements, System requirements
01 07-09-2015
1
13 Assignment 01 10-09-2015
4
14 Tutorial-1 01 11-09-2015
3
Number of Classes:14
UNIT-II
15
Requirements validation, Requirements management.
01
14-09-2015
1
16 Design Engineering: Design process and Design quality,
01 18-09-2015
1
17 Design concepts, the design model. 01 19-09-2015 1
18 Creating an architectural design: software architecture, Data design
01 21-09-2015
1
19 Architectural styles and patterns, 01 25-09-2015 1
20 Architectural Design 01 26-09-2015 1,2
21 Assignment 01 28-09-2015 4
22 Tutorial-2 01 01-10-2015 3
Number of Classes:08
S.NO
TOPIC TO BE COVERED
NO OF CLASSES
Date
Delivery Method As per the
Schedule
Expected Date
UNIT-III
23 Object-Oriented Design: Objects and object classes
01 12-10-2015
1
24 An Object-Oriented design process 01 13-10-2015 1
25 Design evolution 01 15-10-2015 1
26 Performing User interface design: Golden rules
01 16-10-2015
1,2
27 User interface analysis and design, 01 17-10-2015 1
28 Interface analysis 01 26-10-2015 1
29 Assignment 01 29-10-2015 4
30 Tutorial-3 01 30-10-2015 3
Number of Classes:08
UNIT-IV
31
Testing strategies 01 02-11-2015
1
32 Software testing, conventional software
01 05-11-2015 1
33 Black-Box & White-Box testing 01 06-11-2015 1
34 Validation,system,debugging 01 07-11-2015 1
35 Software quality,metrics for AM,DM
01 09-11-2015 1
36 Source code,testing,maintenance 01 12-11-2015 1,2
37 Software measurement 01 13-11-2015 1
38 Metrics for software quality 01 16-11-2015 1
39 Metrics for source code 01 19-11-2015 1
40 Metrics for testing 01 20-11-2015 1
41 Metrics for maintenance 01 21-11-2015 1
42 Metrics for Process and Products: Software Measurement
01 23-11-2015
1
43 Assignment 01 26-11-2015 4
44 Tutorial-4 01 27-11-2015 3
Number of Classes:14
UNIT-V
45 Risk management: Reactive vs Proactive Risk strategies
01 28-11-2015
1
46 software risks 01 30-11-2015 1
47 Risk identification, Risk projection, Risk refinement
01 03-12-2015
1
48 RMMM, RMMM Plan. 01 04-12-2015 1
49 Quality Management: Quality 01 05-12-2015 1
concepts, Software quality assurance
50 Software Reviews, Formal technical reviews
01 07-12-2015
1
51 Statistical Software quality Assurance, Software reliability
01 10-12-2015
1,2
52 Tutorial-5 01 11-12-2015 3
53 Assignment 01 14-12-2015 4
Number of Classes:09
Content Beyond Syllabus
54 Advanced Topics 15-12-2015 1,2
55 Advanced Topics 16-12-2015 1,2
56 Advanced Topics 17-12-2015 1,2
57 Revision 18-12-2015 1,2
58 revision 19-12-2015 1,2
Total Number of Classes:58
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
Module Coordinator
HOD
Signature
Name of the Faculty I.Rajendra kumar
I.Rajendra kumar
I.Rajendra kumar
I.Rajendra kumar
LESSON PLAN
Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2015-16 Semester : III SEM Faculty Name : M.Hema Latha Subject : MCA306:Unix Network Programming
SYLLABUS
1. Pre-requisites:
Basic knowledge of C programming language.
2. Course Educational Objectives (CEOs):
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 simple and 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.).
3. Course Outcomes (COs): At the end of the course, the student will be able to:
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 : Design shell scripts for simple tasks. CO 3 : Demonstrate UNIX commands and system calls for file handling and process control . CO 4 : Implement inter process communication applications using pipes, FIFO’s, messages queues, semaphores and shared memory. CO 5 : Develop client/server applications using socket system calls and remote procedure call.
4. Course Articulation Matrix:
Course Code
COs Programme Outcomes
1 2 3 4 5
CO1 3
CO2 3
CO3 3
CO4 3 1 3
CO5 3 2 3
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
1 Introduction to Unix file system 01 8/17/2015 01
2 Features of Unix os 01 8/18/2015 01
3
vi editor
01 8/19/2015 01
4 01 8/20/2015 01
5 file handling utilities, 01 8/21/2015 01
6 security by file permissions 01 8/24/2015 01
7 process utilities, disk utilities 01 8/25/2015 01
8 networking commands, cp, mv, ln, rm 01 8/26/2015 01
9 unlink, mkdir, rmdir, du, df, mount, umount, find, unmask, ulimit, ps, who, w, finger, arp,
01
8/27/2015
01
10 ftp, telnet, rlogin 01 8/28/2015 01
11 text processing utilities and backup utilities(tar, cpio).
01
8/31/2015
01
12 cat, tail, head, sort, nl, uniq, grep, egrep, fgrep, cut, paste, join, tee, comm, cmp, diff, tr.
01
9/1/2015
01
13 grep, egrep, fgrep, cut, paste, join, tee, comm, cmp, diff, tr.
01
9/2/2015
01
14 Tutorial-1 01 9/3/2015 03
15 Problem solving approaches in Unix Introduction to Shell
01
9/4/2015
01
16 Types of shells, Shell Responsibilities 01 9/7/2015 01
17 Environment variables, Command library 01 9/8/2015 01
18 C programs, building own command library of programs
01
9/9/2015
01
19 Slip test on unit-1 01 9/10/2015 04
Number of Classes: 19
UNIT-II
20 Pipes, input redirections 01 9/11/2015 01
21 Output redirections, here documents 01 9/14/2015 01
22 shell as a programming language , Shell meta characters, shell variables, Environment Variables
01
9/15/2015
01
23 Control structures 02 9/16/2015 01 24 Shell script examples 01 9/18/2015 02 25 Unix file structure, directories, Files and devices 01 9/21/2015 01
26 System calls , Library Functions, low level file access 01 9/22/2015 02
27 Usage of open , create , read , write , close , lseek 01 9/23/2015 01
28 Stat, fstat, octl, umask 01 9/25/2015 01
29 Dup, dup2, standard IO 01 9/28/2015 01
30 Standard I/O 01 9/29/2015 01
31 Tutorial -2 01 9/30/2015 03
32 Slip Test on unit -II 01 10/1/2015 04
Number of Classes: 14
UNIT-III
33 Formatted I/O 01 10/12/2015 01
34 Streams and File Descriptors 01 10/13/2015 01
35 file and directorymaintenance (chmod, chown, unlink, link, symlink, mkdir, rmdir, chdir
01
10/14/2015
01
36 Directory handling system calls (opendir, readdir, closedir)
01
10/15/2015
01
37 Directory handling system calls (rewinddir, seekdir, telldir)
01
10/16/2015
01
38 What is process, process structure, 01 10/26/2015 01
39 starting new process, 01 10/27/2015 01
40 waiting for a process, 01 10/28/2015 01
41 zombie process, 01 10/29/2015 01
42 process control, process identifiers, system call interface for process management
01
10/30/2015
01
43 fork, vfork, exit, wait, waitpid, system 01 11/2/2015 01
44 Slip test on unit-3 01 11/3/2015 04
45 Tutorial - 3 01 11/4/2015 03
46 Formatted I/O 01 10/12/2015
Number of Classes: 14
UNIT-IV
47 Pipes 01 11/5/2015 01
48 Examples on IPC using pipes 01 11/6/2015 02
49 FIFOS 01 11/9/2015 01
50 Examples on IPC using FIFOS 01 11/10/2015 02
51 semaphores 01 11/12/2015 01
52 Unix system-V semaphores 01 11/13/2015 01
53 unix kernel support for semaphores, unix APIs for semaphores
01
11/16/2015
01
54 Message Queues 01 11/17/2015 01
55 unix API for Message Queues 01 11/18/2015 01
56 Message Queues-Unix system-V messages. 01 11/19/2015 01
57 unix kernel support for messages, unix APIs for messages
01
11/20/2015
01
58 Example Programs For IPC 01 11/23/2015 02
59 client/server example. 01 11/24/2015 02
60 Shared Memory-Unix system-V shared memory, 01 11/25/2015 01
61 unix kernel support for shared memory, 01 11/26/2015 01
62 unix APIs for shared memory, 01 11/27/2015 01
63 semaphore and shared memory example 01 11/30/2015 02
64 Tutorial-4 01 12/1/2015 03
65 Slip Test on Unit-IV 01 12/2/2015 04
Number of Classes: 19
UNIT-V
66 Sockets: Berkeley sockets, 01 12/3/2015 01
67 socket system calls for connection oriented 01 12/4/2015
protocol 68 Connection less protocol, 01 12/7/2015 01
69 example-client/server program. 01 12/8/2015 01
70 RPC 01 12/9/2015 02
71 Sun RPC 01 12/10/2015 02
72 Tutorial-5 01 12/11/2015 03
73 Slip test on unit-5 01 12/14/2015 04
74 Rivision 01 12/18/2015 04
Number of Classes: 09
Content beyond syllabus:
75 LINUX operating System Introduction 01 12/15/2015 01
76 Unix administration demo 01 12/16/2015 02
Total Number of Classes: 77
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 Module Coordinator
HOD
Signature
Name of the
Faculty
Mrs M.Hema Latha
Mrs M.Hema Latha
Mr K Phaneendra
Mr I Rajendra Kumar
LakireddyBalireddy College of Engineering College L.B.Reddy Nagar, Mylavaram , Krishna District, A.P
FRESHMAN ENGINEERING DEPARTMENT
LESSON PLAN
Subject : MCA 351 Communication Skills Lab Academic Year : 2015-16 Semester : III Date: 22.08.2015
To
19.12.2015
Year : II Section : MCA
Course Educational Objectives
In this course, the students will learn to
Gather ideas and information, to organize ideas relevantly and coherently.
Engage in debates.
Participate in group discussions, Face interviews.
Write project/research reports/technical reports/ formal letters.
Make oral presentations.
Transfer information from non-verbal to verbal texts and vice versa.
To take part in social and professional communication.
Course Outcomes
After the completion of this course, prospective engineers will have the ability to
Make power point presentations and oral presentations.
Articulate English with good pronunciation.
Face interviews and skillfully manage through group discussions
Negotiate skillfully for better placement.
Pre requisite: Active and Passive vocabulary, Reasonable knowledge of English language,
Reading habit, Readiness to learn and participate in activities and a little
computational skill.
The following course content is prescribed for the Communication and presentations Lab:
Oral Presentations – JAM
Functional English - starting a conversation – responding appropriately and relevantly –
using the right body language – role play in different situations.
Group Discussion – dynamics of group discussion, intervention, summarizing,
modulation of voice, body language, relevance, fluency and coherence.
Making power point presentations.
Interview Skills – concept and process, pre-interview planning, opening strategies,
answering strategies, practicing mock-interviews.
Resume’ writing – structure and presentation, planning, defining the career objective,
projecting ones strengths and skill-sets, summary, formats and styles, letter-writing.
Reading comprehension – reading for facts, guessing meanings from context, scanning,
skimming, inferring meaning, and critical reading.
Minimum Requirement:
The English Language Lab shall have two parts:
i. The Computer aided Language Lab for 60 students with 60 systems, one master
console, LAN facility and English language software for self- study by learners.
ii. The Communication Skills Lab with movable chairs and audio-visual aids with a P.A
System, a T. V., a digital stereo –audio & video system and camcorder etc.
System Requirement (Hardware component):
Computer network with LAN with minimum 60 multimedia systems with the following
specifications:
i. P – IV Processor
1. Speed – 2.8 GHZ
2. RAM – 512 MB Minimum
3. Hard Disk – 80 GB
ii. Headphones of High quality
Suggested Software:
Glob arena’s software
Young India’s Clarity software
Books Recommended:
1. Stephen Bailey , “Academic Writing- A Practical guide for students”, Rontledge Falmer,
London & New York, 2004.
2. Dr A Ramakrishna Rao, Dr G Natanam & Prof SA Sankaranarayanan, “English
Language Communication : A Reader cum Lab Manual, Anuradha Publications, Chennai
3. DELTA’s key to the Next Generation TOEFL Test: Advanced Skill Practice, New Age
International (P) Ltd., Publishers, New Delhi.
4. Books on TOEFL/GRE/GMAT/CAT by Barron’s/cup
5. IELTS series with CDs by Cambridge University Press.
Course Articulation Matrix:
S. No.
Tentative
Date
Topics to be covered Actual
Date
No. of Classes
1 22-08-2015 General Introduction 3
2 29-08-2015 JAM 3
3 05-09-2015 JAM 3
4 12-09-2015 Role play 3
5 19-09-2015 Role play 3
6 26-09-2015 Group Discussions 3
7 03-10-2015 Group Discussions 3
8 17-10-2015 Group Discussions 3
9 31-10-2015 PPT 3
Course Cos POs
1 2 3 4 5
MCA 351
CO1 1
CO2 1
CO3 1
CO4 1
CO5 1
1= Slight (Low) 2= Moderate (Medium) 3. Substantial (High)
10 07-11-2015 PPT 3
11 14-11-2015 Mock Interviews 3
12 21-11-2015 Mock Interviews 3
13 28-11-2015 Mock Interviews 3
14 05-12-2015 Resume Writing 3
15 12-12-2015 Resume Writing 3
16 19-12-2015 Reading Comprehension 3
Instructor Course
Coordinator
Module
Coordinator
HOD
Name K. Sridevi Dr.B.Samrajya
Lakshmi
Dr.B.Samrajya
Lakshmi
Dr.A.Rami Reddy
Sign with Date
LIST OF EXPERIMENTS
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 to illustrate 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?
LESSON PLAN
Department: Master of Computer Application Program : MCA
Course : MCA Academic Year: 2015-16
Semester : III SEM
Subject : MCA 352 – OOPS THROUGH JAVA LAB
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) (a). 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 String Tokenizer Class.
1.Pre-requisites: Students should have a basic knowledge in computer.
2. Course Educational Objectives (CEOs):
In this course student will learn about
The OOP s concepts. Object oriented Programming Window based applications using AWT and swing components
Multi-threading concepts
3.Course Outcomes (COs):
At the end of the course, the student will be able to:
CO1: Mini projects after completion of Applets, AWT and SWING Components
CO2: Students are get benefited in subject in practical and industry orientation
manner
CO3: Students are confident in java programming
CO4: Students feel confident all areas of java
CO5: get confident on all aspects of the subject
4. Course Articulation Matrix:
Course Code
COs Programme Outcomes
PO1 PO2 PO3 PO4 PO5
CO1 3 3 2
CO2 3 3 2 2
CO3 3 2 2
CO4 1 3 2 2 1
CO5 3 2 3 2
1= Slight(low) 2=Moderate(Medium) 3=Substantial(High)
Course Delivery Plan:
S No Program to be executed Expected
Date
Actual
Date
Cycle-I
1 JAVA Basics Hand Outs 18-08-2015
2 Basic Programs on JAVA 21-08-2015
3 Basic Programs on JAVA 25-08-2015
4 Write a Java program to find the roots of a quadratic
equation?
28-08-2015
5 Write a Java program to generate first n Fibonacci numbers? 01-09-2015
6 a) Write a Java program to reverse the given number? b)Write a Java program to check whether given number is Prime or not?
04-09-2015
7 a) Write a Java program to check whether given number is Palindrome or not? b) Write a Java program to check whether given number is Armstrong or not?
08-09-2015
8 Write a Java program to find factorial of the given number using recursions?
11-09-2015
Cycle-II
9 Write a Java program to find min and max number of
given array?
15-09-2015
10 Write a Java program to search an element by using
linear search and binary search?
18-09-2015
11 a) Write a Java program to sort the elements of an Array? b) Write a Java program to perform Matrix Multiplication?
22-09-2015
12 a)Write a Java program using constructors 29-09-2015
13 Write a Java program to constructor overloading. 06-10-2015
14 Write a Java program to implement Method over Loading and Method over riding?
09-10-2015
15 Write a Java program by using this and super key word. 13-10-2015
16 a)Write a Java program by using final variables and final methods. b)Write a Java program to implement dynamic method dispatch.
16-10-2015
Cycle-III
17 Write a Java program to illustrate String Handling Functions 27-10-2015
18 Write a Java program using inheritance? 30-10-2015
19 Write a Java program using abstract class? 03-11-2015
20 Write a Java program to implement Multiple Inheritance (Interface)?
06-11-2015
21 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?
10-11-2015
22 c) Write a Java program to find sum of the numbers using String Tokenizer?
13-11-2015
23 a)Write a Java program by using length () an capacity () Methods of String Buffer?
b)Write a Java program to find the sum of the numbers by using command line arguments?
17-11-2015
24 a) Write a Java program by using Exception handling Mechanism including Finally block? b) Write a Java program to Handle User Defined Exceptions?
20-11-2015
Cycle-IV
25 a) Write a Java program to create Multithreads? b) a Java program to implement Inter thread communication?
24-11-2015
26 a) Write a sample Applet program to Display Message? b) Write an Applet program using Graphics?
27-11-2015
27 Write an Applet program to pass parameters to Applet. 01-12-2015
28 Write a Java program to create user login by using AWT components?
04-12-2015
29 Write a Java program to implement Border Layout. 08-12-2015
30 a) Write an applet program to handle Mouse Events? b) Write an applet program to handle Key Events using adapter Class?
11-12-2015
31 Write a Java program by using String Tokenizer Class. 15-12-2015
32 Lab Internal 18-12-2015
Course
Instructor
Course
Coordinator
Module
Coordinator
HOD
Name S Siva Rama
Krishna
P Ashok
Reddy
P Ashok Reddy I Rajendra
Kumar
Signature
LESSON PLAN
Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2015-16 Semester : III SEM Faculty Name : M.Hema Latha Subject : MCA353:Unix Network Programming Lab
SYLLABUS
1. Pre-requisites:
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
3. Course Outcomes (COs): At the end of the course, the student will be able to:
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
4. Course Articulation Matrix:
Course Code
Cos Programme Outcomes
1 2 3 4 5
CO1 3
CO2 3
CO3 3
CO4 3 1 3
CO5 3 2 3
1= Slight(low) 2=Moderate(Medium) 3=Substantial(High)
Course Delivery Plan:
S.No
Date
(Tentative) Topics to be covered
1 19/08/2015 Unix commands practice session
2 20/08/2015 Unix commands practice session
3 26/08/2015 Unix Commands Practice session
4 27/08/2015 Vi Editor Practice
5 2/09/2015 Shell Script basics Examples practice
6 3/09/2015 Write a shell script to generate multiplication table?
Write a shell script that copies multiple files to a directory?
7 9/09/2015 Write a shell script that counts the number of lines and words present
in a given file?
Write a shell script that displays list of files in a given directory?
8 10/09/2015 Simple calculator
9 16/09/2015 Write a shell script to reverse the rows and columns of a matrix
10 23/09/2015 Write a c program that counts the number of blanks in text file Using
system calls
11 30/09/2015 Write a c program that counts the number of blanks in text file. Using
standard I/O
12 1/10/2015 Implement the ‘mv’ unix commands using system calls
13 14/10/2015 Implement the ‘ls’ unix commands using system calls
14 15/10/2015 Implement the ‘cat’ unix commands using system calls
15 28/10/2015 Write a program that takes one or more field/directory names as
command line input and reports the following information on the file:
a)file type b) number of links c)time of last access
d) read, write and execute permissions
16 29/10/2015 Write a c program that illustrates uses of mkdir, opendir, readdir,
closedir and rmdir APIs.
17 4/11/2015 Write a c program that illustrates how to execute two commands
concurrently in a command pipe?
18 5/11/2015 Write a c program that illustrates Two way communication with
bidirectional pipes
19 12/11/2015 Write a c program that illustrates Two way communication with
unidirectional pipes
20 18/11/2015 Write a c program that illustrates the creation of child process using
fork system call
21 19/11/2015 Write a c program that displays real time of the day for every 0 seconds.
22 25/11/2015 Write a c program that illustrates file locking using semaphores.
23 26/11/2015 Producer consumer problem using semaphores
24 2/12/2015 IPC using shared memory system calls
25 3/12/2015 IPC using message queue system calls
26 9/12/2015 Client server application using sockets
27 10/12/2015 Programs Beyond the syllabus
28 16/12/2015 Programs Beyond the syllabus
29 17/12/2015 Internal Lab Exam
Delivery Methods (DM): 1. Chalk & Talk 2. ICT Tools 3. Test 4. Laboratory
Course
Instructor Course Coordinator
Module Coordinator
HOD
Signature
Name of the Faculty
Mrs M.Hema Latha
Mrs M.Hema Latha
Mr K Phaneendra
Mr I Rajendra Kumar
top related