LESSON PLAN M C A Program : Course : Academic Year : 2016

UNIT-I

Fundamentals of accounting:

Meaning, Nature and Scope of Accounting. Double entry system of accounting. User of accounting

information.

Accounting Process:

Basic books of accounts-Journals, Ledger and subsidiary books. Preparation of trial balance, final

accounts, company final accounts.

UNIT-II

Basic of financial management:

Meaning and scope of financial management. Role of financial manager in modern organisation.

Objectives of financial management:

Time value of money, overview capitalisation and under capitalisation, financial accounting Vs

financial management Vs cost accounting.

UNIT-III

Overview of cost accounting and marginal costing:

Meaning, nature, scope and importance of cost accounting, basic cost concepts, cost sheet.

Absorption costing Vs marginal costing, cost-volume-profit analysis, break-even point, significance

and limitation of C-V-P analysis, simple problems on marginal costing and C-V-p analysis.

UNIT-IV

Budgetary control and standard costing:

Meaning and features of budgetary control-preparation of various types of budgets fixed and

flexible budgets ( production, sales, cash and master budgets) zero based budgeting.

Standard costing:

Meaning and features of standard costing- standard costing Vs budgetary control. Variance

analysis- material, labour, overhead and sales variances- simple problems.

UNIT-V

Accounting packages and computerized accounting:

LESSON PLAN

Department: Master of Computer Application Program : MCA Course : MCA Academic Year : 2016-17 Semester : I SEM

Subject : MCA101 – ACCOUNTING AND FINANCIAL MANAGEMENT

Computerization of accounts- accounting packages- tally & wings- documents used for data

collection,. Files management, master files transaction files- processing of different files and output

obtained.

Pre-requisite:

Students should have a good knowledge in Accounting and Financial Management concept.

Course Educational Objectives(CEOs):

To make students familiar with :

Principles of Financial Accounting like Journal, Ledger, Trial balance and final Accounts.

The Financial Management and Financial sources for an organization.

The basic concept of Cost Accounting, Cost Sheet and profit-Volume-Ratio.

The bottom line of budgetary control and various budgetary control techniques.

The Computerized Accounting and Accounting packages.

Course Outcomes(COs)

By the completion of the course, the students are able to:

CO1: Understand the Accounting principles and skill to solve Accounting problems.

CO2: Understand about the Financial Management and business techniques to raise funds.

CO3: Gain knowledge in Cost Accounting and fixing MRP for their product.

CO4: Handle the organization problems and sources and applications of funds.

CO5: Understand the importance of computerized Accounting in modern world.

S.No Teaching Learning Process (TLP) Delivery Methods

(DM)

Assessment Methods

(AM)

1 Explaining concept with case study Chalk & Talk Assignments

2 Explaining application before theory Ppt Quiz

3 Solving problems Group discussions Tutorials

4 Designing of experiments Industrial visit Surprise Tests

5 Problems on environmental,

economics, health & safety Field work Mid Exams

6 Problems on professional & ethics Case studies Model Exam

7 Seminar Mini Projects QAs

8 Self study Design / Exercises

Detailed Lesson Plan

S.NO

TOPIC TO BE COVERED Date

TLP DM AM Tentative Actual

UNIT –I:

1 Introduction to Subject 09-08-2016 2 1

1,3,5,7

2 Introduction 10-08-2016 2 1

3 Accounting: meaning and scope 11-08-2016 2 1

4 Double entry system of accounting 24-08-2016 2 1

5 User of accounting information 25-08-2016 2 1

6 Basic books of accounts 26-08-2016 2 1,8

7 Journals-problems 27-08-2016 2 1,8

8 Journals-problems 30-08-2016 2 1,8

9 Journals-problems 31-08-2016 2 1

10 Ledger-problems 01-09-2016 2 1

11 Ledger-problems 02-09-2016 2 1

12 Ledger-problems 03-09-2016 2 1,8

13 Subsidiary books-problems 06-09-2016 2 1

Subsidiary books-problems 07-09-2016 2 1

Subsidiary books-problems 08-09-2016 2 1

Trial balance-problems 09-09-2016 2 1

14 Trial balance-problems 10-09-2016 2 1

15 Trial balance-problems 13-09-2016 2 1

Trial balance-problems 14-09-2016 2 1

16 Final accounts-problems 15-09-2016 2 1

Final accounts-problems 16-09-2016 2 1




20 Tutorial 22-09-2016 2 1

UNIT –II:

Financial management-meaning and scope 23-09-2016 2 1

1,3,5,7

Role of finance manager in organization 24-09-2016 2 1,8

Objectives of financial management 27-09-2016 2 1,8

Time value of money 28-09-2016 2 1,8

Over and under capitalization 29-09-2016 2 1

Over and under capitalization 30-09-2016 2 1

Financial accounting/ financial management 01-10-2016 2 1

Financial accounting/ financial management 04-10-2016 2 1

Cost accounting 05-10-2016 2 1

Cost accounting 06-10-2016 2 1

Tutorial 07-10-2016 2 1,8

Unit –III

Cost accounting and marginal costing-intro 08-10-2016 2 1

1,3,5,7

I-MID EXAM

17-10-2016 TO 19-10-2016

Meaning , nature, scope 20-10-2016 2 1

Importance of cost accounting 21-10-2016 2 1,8

Basic cost concepts, cost sheet-problems

22-10-2016 2 1

Basic cost concepts, cost sheet-problems

25-10-2016 2 1

cost sheet-problems 26-10-2016 2 1

Absorption costing Vs marginal 27-10-2016 2 1,8

Cost-volume-profit analysis 28-10-2016 2 1

Break - even point 29-10-2016 2 1

Significance and limitation of CVP 01-11-2016 2 1

Tutorial 02-11-2016 2 1

UNIT –IV:

Budgetary control and standard costing-intro

03-11-2016

2 1

Meaning, features of budgetary control 04-11-2016 2 1

features of budgetary control 05-11-2016 2 1

Types –fixed and flexible budgets 06-11-2016 2 1

Production, sales, -problems 08-11-2016 2 1

Cash and master –problems 09-11-2016 2 1

Cash and master –problems 10-11-2016 2 Zero budget- problems 11-11-2016 2 1

Standard costing-meaning and features 12-11-2016 2 1

Standard costing-meaning and features 15-11-2016 2

Std costing Vs budgetary control 16-11-2016 2 1

1,3,5,7

Std costing Vs budgetary control 17-11-2016 2

Variance analysis- material-problems 18-11-2016 2

1

Variance analysis- material-problems 19-11-2016 2

Labour-problems 22-11-2016 2 1

Labour-problems 23-11-2016 2

Over- head and sales variance-problems 24-11-2016 2

3

Over- head and sales variance-problems 25-11-2016 2

Over- head and sales variance- 26-11-2016 2

problems

UNIT –V:

Accounting principles- intro

29-11-2016 2

1 1,3,5,7

GAAP 30-11-2016 2 1

GAAP 01-12-2016 2 1

Concepts of accounting 02-12-2016 2 1

Concepts of accounting 03-12-2016 2 1

Conventions of accounting 06-12-2016 2 1

Conventions of accounting 07-12-2016 2 1

Accounting std issued by ICAI 08-12-2016 2 1

Accounting std issued by ICAI 09-12-2016 2 1

Computerization of accounts 10-12-2016 2 1

Tally and wings 14-12-2016 2 1

documentation and output 15-12-2016 2 1

Tutorial

16-12-2016

1

MID-II

Instructor Course

Coordinator

Module Coordinator HOD

Name R.Jeyalakshmi I.Rajendra Kumar

Sign with Date

SYLLABUS

UNIT – I

Introduction to Digital Computer:

Number system - Binary, Octal, HEXA and their inter-conversion, 1’s and 2’s

complement,

Boolean Algebra and Logic Gates, De-Morgan’s Theorem, Duality Theorem, K-Maps,

Binary Addition, Binary Subtraction, Addition/Subtraction of Numbers in 1’s

Complement Notation, addition/Subtraction of Numbers in Two’s Complement Notation,

Fixed and floating point representation of numbers.

UNIT – II

Combinational and Sequential circuits:

Half Adder, Full Adder, Binary Adder and Subtracter, Decoder / Encoder, Multiplexer /

De-multiplexer,

Sequential Circuits: Flip Flops - SR, D, JK, Master – Slave and Edge Triggered, Shift

Registers.

Introduction to Counters: Synchronous and Asynchronous counters .

UNIT - III

Memory System:

Memory Hierarchy, Primary Memory – DRAM, SDRAM, DDR, RDRAM. ROM, PROM,

EPROM, EEPROM, Concepts of Auxiliary, Associative, Cache and Virtual Memory

UNIT- IV

CPU Organization:

CPU Building Blocks, CPU Registers and BUS Characteristics, Addressing Modes,

Instruction and Execution Interrupt cycle, Pipelining, Arithmetic Pipelining ,RISC

Pipelining, Instruction Pipelining, Micro programmed control - control memory, address

sequence, micro program example.

LESSON PLAN


Subject : MCA102 – DIGITAL LOGIC AND COMPUTER SYSTEM ORGANIZATION

UNIT – V

Input- Output Organization:

IO interface, Modes of Transfer, Asynchronous Data Transfer, Interrupts, Direct Memory

Access, Input Output Processor

Text BOOK:

MORRIS MANO, “Computer System Architecture”, Pearson Education, 3rd edition, 2002

Reference Books:

1. THOMAS C BARTEE, “Digital Computer Fundamentals”, TMH, 6th edition. 2. Linda Null and Julia Lobur,” The Essentials of Computer Organization and

Architecture”, 2nd edition,2003. 3. William Stallings,” Computer Organization and Architecture”, 7th edition,

Pearson.2006

4. Rajaraman, Radhakrishnan, “Digital Logic and Computer Organization”, PHI, 2009.

5. Pal Chaudhuri, “Computer Organization & Design”, PHI, 2rd edition ,1999.

1. Pre-requisites:

Basic knowledge of Computer Fundamentals.

Boolean algebra and Number System Fundamental

2. Course Educational Objectives

In this course, the students will learn about

Binary number system representations

Basic concepts and elements of computer systems

Design various combinational and sequential circuits

Various CPU building blocks, the concepts of Pipelining, micro program

control unit and modes of transfer.

3. Course Outcomes

Upon completion of this course, students will be able to:

CO1: To understand the Minimization of Boolean expressions using algebraic

method and K-Maps.

CO2: Design and analyze simple combinational and synchronous sequential logic

circuits.

CO3: To understand and study the hierarchical memory system including Main

Memory, Cache Memory, Associative Memory and Virtual memories.

CO4: To understand the concepts of CPU building blocks, Organization of Micro

Program Control Unit, Parallel Processing, RISC and CSIC Architectures.

CO5: To Understand different ways of communicating with I/O devices and

standard I/O interfaces.

4. Course Articulation Matrix:

Course Code

COs Programme Outcomes

1 2 3 4 5

CO1 3 2 1 2

CO2 2 3 2 1

CO3 2 2 1 1

CO4 2 2 1

CO5 1 1 2 2

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

Detailed Lesson Plan

S.No Name Of The Topic NO OF CLASSSES Date

DM As per

the Schedule

Expected date

1 Introduction to Digital Computers

1 24-08-2016 1

2 Boolean algebra 1 25-08-2016 1

3 Postulates and theorems 1 26-08-2016 1

4 Logic gates 1 26-08-2016 1

5 Demorgan’s theorems, Duality 1 29-08-2016 1

6 Canonical Forms 1 30-08-2016 1

7 Minimization Boolean functions

1 31-08-2016 1

8 Minimization Boolean functions

1 01-09-2016 1

9 Introduction to K-maps 1 02-09-2016 1

10 Introduction to K-maps 1 02-09-2016 1

11 Numbers systems 1 06-08-2016 1

12 Tutorial-1 1 07-092016 3

13 Complements 1 08-09-2016 1

14 Data Representation

1 09-09-2016 1

Fixed point Representation 1 09-09-2016 1

Floating point Representation 1 12-09-2016 1

Addition and subtraction of fixed point numbers

1 13-09-2016 1

Multiplication and Division of fixed point numbers

1 14-09-2016 1

Addition and subtraction of floating point numbers

1 15-09-2016 1

Multiplication and Division of floating point numbers

16-09-2016 1

Advanced Topics: Universal Gates NAND and NOT

16-09-2016 1

Tutorial-2 19-09-2016 3

Assignment-1 20-09-2016 4

UNIT-II

18 Half-Adder, Adders 21-09-2016 2

19 Full-Adder 22-09-2016 2

20 Binary-Adder, Binary Increment

23-09-2016 2

21 Binary Adder-Subtractor 23-09-2016 2

22 Decoder/ Encoder 26-09-2016 1

23 Multiplexer/De-multiplexer 27-09-2016 1,2

24 Introduction of Flip flops: SR, JK,

28-09-2016 1

25 D, T, Master-Slave and Edge Triggered flip flops

29-09-2016 1

26 Introduction to counters 30-09-2016 1

Synchronous and Asynchronous counters

30-09-2016 1

Advance Topic: Half-Adder Implementation using NAND and NOR gates.

03-10-2016 1,2

Tutorial-3 04-10-2016 3


UNIT-III

38 Introduction to memory 06-10-2016 1

39 Memory Hierarchy 07-10-2016 2

40 Primary Memory 07-10-2016 1

41 ROM and RAM variants 13-10-2016 1

42 Auxiliary Memory, Associative Memory

14-10-2016 1

43 I-MID EXAMS 17-10-2016

44 I-MID EXAMS 18-10-2016

45 I-MID EXAMS 19-10-2016

Discussion of I-mid question paper

20-10-2016 1

Virtual Memory 21-10-2016 2

Cache Memory 21-10-2016 2

Advanced Topic,Assignment-3 24-10-2016 4

Tutorial -4 24-10-2016 3

UNIT-IV

U CPU building blocks 25-10-2016 1

CPU registers 26-10-2016 2

Stack organization 27-10-2016 1

BUS characteristics 28-10-2016 1

Instruction formats, types of instructions

28-10-2016 1

Instruction cycle 31-10-2016 1

Addressing modes 01-11-2016 1

Parallel processing 02-11-2016 1

46 Introduction to pipelining 03-11-2016 1

47 Arithmetic pipelining 04-11-2016 1

48 Instruction pipelining 07-11-2016 1

RISC & CISC 08-11-2016 1

RISC pipelining 09-11-2016 1

Microprogrammed control unit-control memory

10-11-2016 1

Address sequencing 11-11-2016 1

Micro-Program example 14-11-2016 1


Tutorial-5 16-11-2016 3

UNIT-V

49 Introduction to Input-Output organization

17-11-2016 1

50 IO interface 18-11-2016 2

51 Modes of transfer 18-11-2016 1

52 Asynchronous Data Transfer 21-11-2016 2

53 Asynchronous Data Transfer 22-11-2016 2

54 Interrupt Handing 23-11-2016 2

55 Parallel Priority Interrupt 24-11-2016 2

56 DMA 25-11-2016 1

57 Input-Output processor 25-11-2016 1

58 Flynn’s classification of computer

28-11-2016 1

59 Slip Test 29-11-2016 4

60 Assignment-5 30-11-2016 4

61 Revision 01-12-2016 1

62 Revision 05-12-2016 1

63 Revision 06-12-2016 1

Tutorial-6 07-12-2016 3

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

G RAJENDRA

K.PHANEENDRA K.PHANEENDRA I. RAJENDRA KUMAR

Slip test 08-12-2016 4

Revision 09-12-2016 1

Revision 13-12-2016 1

Revision 14-12-2016 1

Revision 15-12-2016 1

II-MID EXAMS 19-12-2016



LESSON PLAN

Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2016-17 Semester : I SEM FACULTY : M.HEMALATHA Subject : MCA 103 : Discrete Structures and Graph Theory

1. Pre-requisites:

Basic knowledge of Mathematics.

2. Course Educational Objectives (CEOs):

On completion of this course, the student will improve develop logical thinking and will be able to explain

and apply the basic methods of discrete mathematics in Computer Science. They will be able to use these

methods in subsequent courses in the design and analysis of algorithms, computability theory, software

engineering, and computer systems.

In particular, students will be able to

Be skillful in expressing mathematical properties formally via the formal language of propositional logic and predicate logic.

Learn the Properties of sets, relations and functions, pigeonhole principle and use them to solve real world problems.

Be able to apply basic counting techniques to solve combinatorial problems Acquire ability to describe computer programs (e.g. recursive functions) in a formal mathematical

manner like recurrence relations, and generating functions. Learn properties of Basic structures like graphs and trees. How to simplify and solve path problems using graph algorithms.

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

CO 1 : Construct simple mathematical proofs and possess the ability to verify them and Develop logical and Creative thinking to solve problems. CO 2 : Manipulate and specify basic mathematical objects such as sets, functions, and relations and will also be able to verify simple mathematical properties that these objects possess. CO 3 : Analyze and model computational processes using analytic and combinatorial methods, Recurrence relations and generating functions. CO 4 : Reason mathematically about basic data types and structures such as numbers, sets, graphs, and trees used in computer algorithms and systems. CO 5 : Apply different algorithms and tools on graphs and trees to visualize and simplify path problems. 4. Course Articulation Matrix:

Course Code


1 2 3 4 5

CO1 2 3 1

CO2 3 3 3

CO3 2 1

CO4 1 1

CO5 3 3 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 Statements and Notations 1 08-08-2016 1 2 Connectives 1 10-08-2016 1

3 Well Formed Formulas 1 24-08-2016 1 4 Truth Tables 1 26-08-2016 1 5 Equivalences 1 26-08-2016 1 6 implications 1 27-08-2016 1 7 Normal Forms Disjunctive Normal Form 1 27-08-2016 1 8 Normal Forms Conjunctive normal Form 1 29-08-2016 1 9 Principal Conjunctive Normal Form 1 31-08-2016 1 10 Principal Disjunctive Normal Form 1 02-09-2016 1 11 Rules of inference 1 02-09-2016 1 12 Consistency of Premises 1 03-09-2016 1 13 indirect method of proof 1 0-09-2016 1 14 Predicates 1 07-09-2016 1 15 Statement Functions 1 09-09-2016 1 16 Variables and quantifiers 1 09-09-2016 1 17 predicate Formulas 1 14-09-2016 1 18 free and bound Variables 1 16-09-2016 1 19 Universe of Disclosure 1 16-09-2016 1 20 inference theory of predicate calculus 1 17-09-2016 1 21 Tutorial-1 1 17-09-2016 3 22 Class Test -1 1 19-09-2016 4 23 Revision of unit-I 1 21-09-2016 4 24 Revision of unit-I 1 23-09-2016 4 Number of Classes:

24

25 Introduction to sets 1 23-09-2016 1 26 Operations on Sets 1 24-09-2016 1 27 Operations on Sets 1 24-09-2016 1 28 Venn Diagrams 1 26-09-2016 1 29 set identies , principle of specification 1 28-09-2016 1 30 cartesian products 1 30-09-2016 1 31 Relations 1 30-09-2016 1 32 properties of binary relations 1 01-10-2016 1 33 Equivalence relations 1 01-10-2016 1 34 compatibility relations 1 03-10-2016 1 35 partial ordering 1 05-10-2016 1 36 Hasse Diagram 1 07-10-2016 1 37 Functions introduction 1 07-10-2016 1 38 compisition of functions 1 14-10-2016 1 39 inverse function 1 14-10-2016 1 40 Recursive functions 1 15-10-2016 1 41 Applications of pigeonhole principle , Applications 1 15-10-2016 1 42 Tutorial - 2 1 21-10-2016 3 43 Class Test-2 1 21-10-2016 4

44 Rivision of unit-II 1 22-10-2016 4

Number of Classes:

20

UNIT-III

45 basics of counting 1 22-10-2016 1 46 basics of counting 1 24-10-2016 1 47 combinations 1 26-10-2016 1 48 permutations 1 28-10-2016 1

49 Combinations and permutations examples 1 28-10-2016 1 50 binomial coefficients 1 29-10-2016 1 51 Binominal Theorems 1 29-10-2016 1 52 Multinomial Theorems 1 31-10-2016 1 53 Principle of inclusion and exclusion 1 02-11-2016 1 54 generating functions 1 04-11-2016 1 55 calculating coefficient of Generating functions 1 04-11-2016 1 56 recurrence relations 1 05-11-2016 1 57 solving recurrence relations by substitution 1 05-11-2016 1 58 solving recurrence relations by Characteristic roots 1 07-11-2016 1 59 solve recurrence relations by Generating functions 1 09-11-2016 1 60 solving non homogeneous recurrence relations 1 11-11-2016 1 61 solving non homogeneous recurrence relations 1 11-11-2016 1 62 Tutorial-3 1 16-11-2016 3 63 Class Test - 3 1 18-11-2016 4

Number of Classes: 19

UNIT-IV

64 Graph Theory Basic Concepts 1 18-11-2016 1 65 Graph Theory Basic Concepts 1 19-11-2016 1 66 Representation of Graphs 1 19-11-2016 1 67 BFS 1 21-11-2016 1 68 DFS 1 23-11-2016 1 69 Isomorphism 1 25-11-2016 1 70 sub graphs 1 25-11-2016 1 71 multi graphs, planar graphs 1 26-11-2016 1 72 Eular circuits 1 26-11-2016 1 73 Eular formula 1 28-11-2016 1

74 Hamiltonian Graphs 1 30-11-2016 1

75 chromatic numbers 1 02-12-2016 1

76 Tutorial - 4 1 02-12-2016 3

77 Class Test - 4 1 03-12-2016 4


UNIT-V

78 single source shortest path problems 1 03-12-2016 1 79 single source shortest path Dijkstras algorithm 1 05-12-2016 1 80 All pairs shortest path problems 1 07-12-2016 1 81 All pairs shortest path Floyd's algorithm 1 09-12-2016 1 82 Transitive closer Warshall's Algorithm 1 09-12-2016 1 83 spanning trees 1 12-12-2016 1

84 minimum spanning tree kruskal's algorithm 1 14-12-2016 1 85 minimum spanning tree Prims algorithm 1 16-12-2016 1

86 Example Problems on minimum Spanning trees 1 16-12-2016 1

87 Tutorial-5 1 17-12-2016 3

88 class Test-5 1 17-12-2016 4


Content beyond syllabus:

89 Parallel Concepts in Graph Theory 1 22-11-2016 2

90 Mathematical induction 1 06-12-2016 2

Total Number of Classes: 90

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

Dr A. Rami Reddy

I.RAJENDRA KUMAR

LESSON PLAN

Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2016-17 Semester : I SEM

Subject : MCA 104 : English Language for Communication

Course Educational Objectives

In this course, the students will learn

English with emphasis on LSRW skills.

The standard vocabulary along with the meaning and usage of the words.

The concepts of effective writing with special focus on drafting reports, e-mails, letters,

resume etc.

The concepts of process, channels, and barriers of effective communication ( verbal and

non-verbal)

The concepts of process and requisites of good Listening and Reading skills.

The concepts of soft skills such as team work, professional etiquettes, leadership strategies,

interpersonal and networking skills.

Course Outcomes

After the completion of this course, prospective engineers will have the ability to

Read, write and aptly understand what ever is written and spoken in English.

Speak fluently with acceptable pronunciation and write with appropriate words, spellings,

grammar and syntax

Manage the situation and negotiate business with good English communication.

Think and analyze the situations and make good presentations of their work and decisions.

prepare oneself to face interviews and also to participate in group discussions

Syllabus:

Pre requisite: Knowledge of grammar and its usage, sentence structures, a little vocabulary,

readiness English speaking, good group behavior

UNIT – I

Communicative Grammar: Tense forms, Subject - Verb Agreement, Question Tags,

Spotting the errors, Active and Passive voice, Direct & Indirect speech.

Vocabulary: One-Word Substitutes, Formation of Words, Using Words as Different Parts of

Speech, Idioms and phrases, Words often confused.

UNIT - II

Communication – Process, Methods and Channels of Communication, Non Verbal

Communication – Body Language, Barriers to Effective Communication.

UNIT - III

Listening-process & requisites of good listening, Reading skills- process & requisites

UNIT - IV

Features of Effective Writing-7 Cs- Letter writing, e-mail drafting, Resume Writing, Report

writing, Synopsis and Statement of purpose.

UNIT - V

Soft Skills-Significance and Components, Interpersonal Skills, Professional Etiquettes,

Empathy, Leadership development strategies - Team work- concept and exercises - Cross

cultural communication - Networking skills.

REFERENCES:

1. John Seely, “ Oxford Guide to Effective Writing and Speaking”, Oxford University Press,

New Delhi, 2005.

2. Murphy, “ English Grammar”, Cambridge University Press, New Delhi, 2009.

3. Rizvi Ashraf M, “Effective Technical Communication”, Tata McGraw Hill, New

Delhi,2008.

4.Ramesh & Ramesh, “ Ace of Soft skills”, Pearson Education, New Delhi, 2009.

5. Raman and Sharma, “ Technical communication” , Oxford University Press.

6. K. Alex, “Soft skills: know yourself & know the world”, S.Chand.

Sl. No.

No. of

Lecture

Hours

Date Planned Topics Unit Topics

Covered

Remarks

1 1 27-08-16 Introductory Period

2 1 27-08-16 Tense forms I

3 1 29-08-16 Tense forms I

4 1 30-08-16 Subject – verb agreement I

5 1 31-08-16 Subject – verb agreement I

6 1 03-09-16 Question Tags I

7 1 03-09-16 Spotting the Errors I

8 1 03-09-16 Tutorial – Spotting the Errors I

9 1 03-09-16 Active Voice – Passive Voice I

10 1 06-09-16 Voice Change I

11 1 07-09-16 Direct & Indirect speech I

12 1 10-09-16 Direct & Indirect speech I

13 1 10-09-16 Tutorial – Voice & Reported speech I

14 1 13-09-16 One word substitutes I

Course Cos POs

1 2 3 4 5

MCA 104

CO1 1

CO2 1

CO3 1

CO4 1

CO5 1

1= Slight (Low) 2= Moderate (Medium) 3. Substantial (High)

15 1 14-09-16 Formation of Words I

16 1 17-09-16 Using words as different parts of speech I

17 1 17-09-16 Idioms and phrases I

18 1 19-09-16 Words often confused I

19 1 20-09-16 Words often confused I

20 1 21-09-16 Tutorial – Vocabulary I

21 1 24-09-16 Communication – Process II

22 1 24-09-16 Communication – Process II

23 1 26-09-16 Methods & Channels of Communication II

24 1 27-09-16 Non-Verbal Communication II



27 1 01-10-16 Body Language II



30 1 05-10-16 Barriers to Effective communication II

31 1 08-10-16 Barriers to Effective communication II

32 1 08-10-16 Tutorial-Body Language II

I-MID EXAM(From 17-09-2016 to 19-09-2016)

33 1 15-10-16 Listening Skills III

34 1 15-10-16 Listening process III

35 1 17-10-16 Requisites of good listening III

36 1 18-10-16 Reading skills III

37 1 19-10-16 Process & requisites III

38 1 22-10-16 Tutorial – Listening & Reading Skills III

39 1 22-10-16 Features of Effective Writing IV

40 1 24-10-16 7 Cs of Communication IV

41 1 25-10-16 7 Cs of Communication IV

42 1 26-10-16 Letter – writing IV

43 1 29-10-16 Letter – writing IV

44 1 29-10-16 E-mail drafting IV

45 1 31-10-16 E-mail drafting IV

46 1 01-11-16 Resume-writing IV

47 1 02-11-16 Resume-writing IV

48 1 05-11-16 Report-writing IV

49 1 05-11-16 Report-writing IV

50 1 07-11-16 Synopsis IV

51 1 08-11-16 Synopsis IV

52 1 09-11-16 Statement of purpose IV

53 1 12-11-16 Statement of purpose IV

54 1 12-11-16 Tutorial – Writing skills IV

55 1 14-11-16 Soft skills-significance and components V

56 1 15-11-16 Interpersonal Skills V

57 1 16-11-16 Professional Etiquettes V



60 1 21-11-16 Empathy V

61 1 22-11-16 Empathy V

62 1 23-11-16 Empathy V

63 1 26-11-16 Leadership development strategies V



66 1 29-11-16 Team work-concept V

67 1 30-11-16 Team work-exercises V





72 1 07-12-16 Cross cultural communication V

73 1 10-12-16 Cross cultural communication V

74 1 10-12-16 Networking skills V

75 1 12-12-16 Networking skills V

76 1 14-12-16 Tutorial V

77 1 17-12-16 Revision V

78 1 17-12-16 Revision V

II MID EXAMS

(From 19-12-2016 to 21-12-2016)

Instructor Course

Coordinator

Module

Coordinator

HOD

Name K. Sridevi Dr.B.Samrajya

Lakshmi

Dr.B.Samrajya

Lakshmi

Dr.A.Rami Reddy

Sign with Date

LESSON PLAN

Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2016-17 Semester : I SEM Subject : MCA105: INTRODUCTION TO COMPUTER SYSTEMS AND PROGRAMMING

SYLLABUS

UNIT - I

Introduction to Computers: History and Generations of Computers, Primary and Secondary memory, Input-output

devices, ALU, Processor, Applications of computers.

C-Basics:

Algorithm / pseudo code, Flowcharts, Program development steps, Structure of C program, Identifiers, Basic data types

, Constants, variables, types of operators, expressions, precedence and order of evaluation, type conversions, conditional

expressions.

UNIT - II

Control structures: If, If-Else and switch statements, Loops- while, do-while and for statements, break, continue and goto, Programming

examples.

Arrays:

Introduction, Single-dimensional Arrays : Declaration of a Single-dimensional Array, Usage of Single-dimensional

Array, Memory Representation of Single-dimensional Array , Operations on a Single-dimensional Array, Array of

Arrays (Multi-dimensional Arrays) , Advantages and Limitations of Arrays

Strings and Character Arrays: Introduction, Strings, Character Arrays, Reading Strings from the Keyboard, Printing

Strings on the Screen, String Library Functions, Array of strings.

UNIT - III

Functions:

Introduction, Functions, Classification of Functions - Based Upon who Develops the Function, Based Upon the Number

of Arguments a Function Accepts. Storage Classes- auto, register, static, extern. C Pre-Processor: Translators, Phases

of Translation, Preprocessor Directive Handling.

Pointers:

Operations on Pointers , void pointer , Null Pointer, Relationship Between Arrays and Pointers, Array of Pointers,

Pointer to a Pointer , Pointer to an Array, Array of Character Pointers, Command Line Arguments, Dynamic Memory

Allocation.

UNIT - IV

Structures, Unions, Enumerations and Bit-fields:

Introduction, Structure definition, Structure declaration , Operations on Structures ,Pointers to Structures, Array of

Structures, Structures within a Structure (Nested Structures) Functions and Structures, type def and Structures, Unions,

Practical Application of Unions, Enumerations ,Bit-Fields

UNIT – V

Files:

Introduction, Files, Streams, I/O Using Streams :Opening a Stream, Closing Streams Character Input , Character

Output, File Position Indicator , End of File and Errors, Line Input , Line Output , Formatted Input, Formatted Output,

Block Input , Block Output, Stream Buffering and Flushing the Streams, File Type, Files and Command Line

Arguments

.Text Book:

1. Ajay Mittal, “Programming in C: A Practical Approach” , First Edition , Person Education, 2010

Reference Books:

1. Reema Thareja “Programming in C”, First Edition, Oxford Publications,2011.

2. Pradip Dey, Manas Ghosh “Programming in C”, First Edition, Oxford Publications.

3. Brian W. Kernighan, Dennis M. Ritchie“ The C Programming Language”, 2nd Edition, PHI/Pearson

Education, 1988

4. B.A. Forouzan and R.F. Gilberg Computer science, “A structured programming approach using C”, Third

edition, Thomson

http://www.amazon.com/s/ref=ntt_athr_dp_sr_2?_encoding=UTF8&field-author=Dennis%20M.%20Ritchie&search-alias=books&sort=relevancerank

Course Education Objectives:

The main objective of this course is students will learn about writing algorithms, drawing flow

charts and implementing the problems using „C‟ constructs. Students will also learn the

Fundamental concepts of C Programming like Data types, Operators, Conditional Statements,

Control structures, Arrays, Functions, Pointers, Structures & Unions and Files concepts

Student has to learn about the mentioned concepts and get benefited in these areas in practical

environment.

To make students familiar with:

Writing algorithms, flowcharts to implement operations involved in different Problems.

To handling arrays, Know the limitations of static memory allocation, various operations on

strings, importance of dynamic memory allocation.

The functions used for dynamic memory allocation, storage classes of variables, sending

input through command line, modularization, and pointer concept.

Manipulating Records, linked list introduction, applications of unions.

The advantages of permanent storage, various operations on files and format the output.

Course Outcomes:

At the end of this course student will be able to

CO1: Write the algorithm and Draw the flow charts, Understand the basic terminology used in

computer programming, Write, compile and debugging programs in C language.

CO2: Use different data types in a c program, Design programs involving control structures and

functions.

CO3: Explain the difference between call by value and call by reference, understand the

dynamic memory management.

CO4: Get the complete information about structures and unions.

CO5: Usage of the files and operations on files. Get the programming skills on all the concepts, To

cover the topics in interview orientation, Students are confident about the topics in the way of

campus placements, Able to do the Mini projects on files and other functional areas.

Pre requisite:

Knowledge about various components in computer

Algorithm writing Flowchart drawing skills and

Problem solving skills.


Course Code


1 2 3 4 5

CO1 3 2 3

CO2 2 3 2 3

CO3 2 3 3 2

CO4 2 3 1 3

CO5 2 3 3 1



S.

No

Expected

Date

Date of

Delivery

Topics to be covered No.of

Hrs

Teaching

Method/Aid

1 24-08-2016 Unit-1

Introduction to Computers/

Classification of Languages/

Classification of Computers/

Basic concepts in computers

3 1

2 25-08-2016 Algorithm/pseudo code and examples 2 1

3 26-08-2016 Flow chart and examples 2 1

4 27-08-2016 Program development steps 1 1

5 31-08-2016 Introduction to C,Structure of c

program

1 1

6 01-09-2016 Identifiers, variables and constants 1 1

7 02-09-2016 Simple C Programs 1 1

8 02-09-2016 Basic data types and sizes 1 1

9 03-09-2016 Arithmetic, relational and logical

operators

1 1

10 03-09-2016 Tutorial hour 1 3

11 07-09-2016 Increment and decrement, assignment

and conditional operators

1 1

12 07-09-2016 Bitwise operators 1 1

13 08-09-2016 Typeconversions,conditional

expressions, Precedence and order of

evaluation

1 1

14 09-09-2016 Input and output statements, statements

and blocks

1 1

15 10-09-2016 Decision making with if ,simple if 1 1

16 14-09-2016 If else and nested if else statements 1 1

17 14-09-2016 Tutorial hour 1 3

18 15-09-2016 Else if ladder, switch statement 1 1

19 17-09-2016 Loops:while,dowhile 3 1

20 21-09-2016 For statements, break statement 2 1

21 23-09-2016 Continue, goto and labels 1 1

22 28-09-2016 Switch Statement Programming

examples &Tutorial hour

1 1,3

23 29-09-2016 Arrays Advantages and Drawbacks

Accessing elements, storing elements

1

1

24 30-09-2016 Unit-2

Types of Arrays and 1DA

1 1

25 30-09-2016 1DA examples and Tutorial hour 2 1,3

26 01-10-2016 Two- dimensional arrays and

examples

2 1

27 04-10-2016 Multi dimensional arrays,

applications of arrays and

Tutorial hour

1 1,3

28 05-10-2016 Character Arrays(Strings)

creation,declaration,reading,

writing with strings

1 1

29 07-10-2016 Arithmetic Operations on

charecters,String Handling

Functions

3 1

30 14-10-2016 Functions Introduction and

basics

1 1

31 17-10-2016 Types of functions 2 1

32 19-10-2016 Types of functions& Parameter

passing techniques

1 1

33 21-10-2016 Parameter passing techniques 1 1

34 24-10-2016 Recursive Functions, Functions

with Arrays

2 1

35 26-10-2016 Storage

classes:extern,auto,register and

static

2 1

36 28-10-2016 Scope rules, block structure, user

defined functions, Standard

library functions

2 1

37 31-10-2016 Header files preprocessors and

example programs and Revision

2 1

38 01-11-2016 Unit-3

Pointers:concepts,initialization

of pointer variables

1 1

39 02-11-2016 Pointers and function arguments 1 1

40 04-11-2016 Address arithmetic, character

pointers and functions

1 1

41 05-11-2016 Character pointers and functions,

pointers to pointers

1 1

42 08-11-2016 Preprocessor Directives and

Macros

1 1

43 10-11-2016 Tutorial hour 1 3

44 11-11-2016 Pointers and arrays 1 1

45 15-11-2016 Dynamic memory management

functions

2 1

46 16-11-2016 Command line arguments, void

pointer

1 1

47 17-11-2016 Sample example programs 1 1

48 18-11-2016 Tutorial hour and Revision 1 3


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

P.ASHOK

REDDY

P.ASHOK

REDDY

P.ASHOK

REDDY

I.RAJENDRA KUMAR

49 19-11-2016 Unit-4

Derived Types: Structures

Introduction

1 1

50 22-11-2016 Structures: Creation,declaration 2 1

51 24-11-2016 Initialization of structure

variables

1 1

52 27-11-2016 Nested structures 1 1

53 28-11-2016 Arrays of structures, Tutorial

hour

1 1,3

54 29-11-2016 Structures and functions 2 1

55 31-11-2016 Pointers to structures

Self referential structures, unions

2 1

56 02-12-2016 Typedef,bitfields and sample

prgms

Tutorial hour

2 1,3

57 06-12-2016 Unit-5

Concept of file,text and binary

files

1 1

58 07-12-2016 Streams 1 1

59 08-12-2016 Standard i/o operations 1 1

60 09-12-2016 Formatted i/o operations 1 1

61 09-12-2016 Tutorial hour 1 3

62 13-12-2016 File i/o operations 2 1

63 14-12-2016 Error handling and sample

programs

2 1

64 16-12-2016 Command Line arguments 1 1

65 17-12-2016 Content Beyond Syllabus and

Revision

1 1

TOTAL NO OF HOURS 87

19-12-2016 to 21-12-2016 MID-II

SYLLABUS

UNIT – I : PROBABILITY

Probability Theory: Sample space, Events & Probability, axioms of Probability. addtion law of

probability ,conditional probability, Multiplication theorem and Baye‟s theorem.

UNIT – II: PROBAILITY DISTRIBUTIONS

Random variables and distributions : Discrete and continuous Random variables, Mathematical

Expectation. Discrete and continuous probability distributions- Binomial, Poisson, Normal

Distributions and its applications.

UNIT - III : SAMPLING DISTRIBUTION AND ESTIMATION

Sampling distribution: Populations and samples - Sampling distributions of mean (known and

unknown) proportions, sums and differences.

Estimation – point estimation, interval estimation, Bayesian estimation.

UNIT – IV: TESTS OF HYPOTHESIS

Testing of hypothesis: Null and alternative hypothesis, one-tail and two-tail tests, tests of

Hypothesis concerning means, Tests of Hypothesis concerning proportions, F-test for variances ,

chi-squre test for goodness of fit and independence of attributes.

UNIT – V : CORRELATION AND CURVE FITTING

Correlation and Regression: Simple bivariate correlation coefficient, rank correltion and Linear

regression, regression lines.

Non Linear regression: Least square fit , fitting of straight line, polynomial and Exponential curve.

TEXT BOOK

1. S.C.Gupta & V.K.Kapoor “Fundamentals of Mathematical statistics” Sultan chand and sons,

New Delhi. 11th

edition,2002.

REFERENCES

1. Jay L.Devore “Probability and Statistics for engineering and the sciences.” Cengage

Learning india, 8th edition,2012.

2. Murray R.Spiegel “Probability and Statistics” Schaum;s outline series, ,Mc Graw Hill, 4th

edition.

3. T.K.V. Iyengar “Probability & Statistics for MCA ”. S. Chand & company, New Delhi, 2009

edition.

4. Miller and Freund‟s “Probability and Statistics for Engineers” Prentice Hall of

India,NewDelhi, 8th

edition,2011.

LESSON PLAN


Subject : MCA106 – PROBABILITY & STATISTICAL APPLICATIONS

1. Pre-requisites: None

2.Course Educaitonal Objectives:

The main objectives of this course are

To revise elementary concepts and techniques encountered in probability.

To introduce new techniques for carrying out probability calculations and identifying

probability distributions.

To motivate the use of statistical inference in practical data analysis

To study elementary concepts and techniques in statistical methodology.

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

science.

3.Course outcomes:

After the completion of course, the students will be able to

Predict various probabilistic situations based on various laws of probability like additive,

multiplicative laws.

Distinguish among the criteria of selection and application of Binomial, Poisson, Normal

and Gamma distributions.

Estimate the point and interval estimators of mean, variance and proportion for the given

Sample data.

Apply various sample tests like Z-test, t-test, F-test and χ2 -test for decision making

regarding the population based on sample data.

Estimate the level of correlation, the linear relationship for the given bivariate data and

the best fit curve of the given data by the method of least squares.


Course Code


1 2 3 4 5

CO1 3 2 1

CO2 3 2 1

CO3 3 2 1

CO4 3 2 1

CO5 3 2 1



S. No.

Topics to be covered Number of Classes

Tentative Date

Actual Date

Delivery Method

Unit-1

1 Introduction class 1 24-08-16 DM1

2 Probability theory: Introduction 1 25-08-16 DM1

3 sample space and events 1 26-08-16 DM1

4 Simple examples 1 27-08-16 DM1

5 Axioms of probability, simple theorems 1 29-08-16 DM1

6 Simple theorems and examples 1 30-08-16 DM1

7 Addition theorem, examples 1 31-08-16 DM1

8 problems 1 01-09-16 DM1

9 problems 1 02-09-16 DM1

10 Conditional probability, 1 03-09-16 DM1

11 Multiplication theorem 1 06-09-16 DM1

12 Independent events, theorems 1 07-09-16 DM1

13 Problems on multiplication theorem 1 08-09-16 DM1

14 Problems 1 09-09-16 DM1

15 Problems on independent events 1 11-09-16 DM1

16 Problems 1 13-09-16 DM1

17 Baye‟s theorem 1 14-09-16 DM1

18 Problems on Baye‟s theorem 1 15-09-16 DM1

19 Problems 1 16-09-16 DM1

20 Tutorial class 1 17-09-16 DM1,3 Number of classes 20

Unit-II

21 Random variables: Introduction 1 19-09-16 DM1

22 Discrete & continuous r.v‟s , Distribution

function 1

20-09-16 DM1

23 Mathematical Expections, Problems 1 21-09-16 DM1

24 Problems on pmf 1 22-09-16 DM1

25 Problems on pmf 1 23-09-16 DM1

26 Problems on pdf 1 24-09-16 DM1

27 Problems on pdf 1 26-09-16 DM1

28 Binomial distribution- Mean, variance 1 27-09-16 DM1

29 Problems on binomial distribution 1 28-09-16 DM1

30 Problems on binomial distribution 1 29-09-16 DM1

31 Fitting of Binomial distribution 1 30-09-16 DM1

32 Poisson distribution-Mean, variance 1 01-10-16 DM1

33 Problems on poisson distribution 1 03-10-16 DM1

34 Problems on poisson distribution 1 04-10-16 DM1

35 Fitting of poisson distribution 1 05-10-16 DM1

36 Normal distribution- Properties 1 06-10-16 DM1

37 Problems on normal distribution 1 07-10-16 DM1

38 Problems on normal distribution 1 08-10-16 DM1

39 Problems 1 13-10-16 DM1

40 Problems 1 14-10-16 DM1


42 I mid exams 17-10-16

43 I mid exams 18-10-16

44 I mid exams 19-10-16

Unit-III

45 Population, sample,parameter,statistic,

s.d 1

20-10-16 DM1

46 Problems of sampling distributions 1 21-10-16 DM1

47 Problems 1 22-10-16 DM1

48 problems 1 24-10-16 DM1

49 Central limit theorem and applications 1 25-10-16 DM1

50 Problems on central limit theorem 1 26-10-16 DM1

51 Sampling distribution of sums and

differences 1

27-10-16 DM1

52 problems 1 28-10-16 DM1

53 Point and interval estimation 1 29-10-16 DM1

54 Interval estimation for mean, proportion 1 31-10-16 DM1

55 Problems on interval estimation (lagre

samples) 1

01-11-16 DM1

56 Problems on interval estimation (small

samples) 1

02-11-16 DM1

57 Bayesian Estimation , problems 1 03-11-16 DM1


Unit-IV

59 Testing of hypothesis, introduction 1 05-11-16 DM1

60 Large sample tests, Z-test for single

mean 1

08-11-16 DM1

61 Problems 1 09-11-16 DM1

62 Z-test for difference of means 1 10-11-16 DM1

63 Problems 1 11-11-16 DM1

64 Z-test for single proportion 1 12-11-16 DM1

65 Z-test for difference of proportions 1 15-11-16 DM1

66 problems 1 16-11-16 DM1

67 t-test for single mean 1 17-11-16 DM1

68 t-test for difference of means 1 18-11-16 DM1

69 problems 1 19-11-16 DM1

70 Paired t-test 1 22-11-16 DM1

71 Problems 1 23-11-16 DM1

72 F-test for variances 1 24-11-16 DM1

73 Chi-square test for goodness of fit 1 25-11-16 DM1

74 Chi-square test for independence of

attributes 1

26-11-16 DM1

75 problems 1 29-11-16 DM1


Unit-V

77 Correlation and regression, introduction 1 01-12-16 DM1

78 Problems on correlation coefficient 1 02-12-16 DM1

79 Problems on change of origin method 1 03-12-16 DM1

80 Regression lines, problems 1 06-12-16 DM1

81 Problems 1 07-12-16 DM1

82 problems 1 08-12-16 DM1

83 Rank correlation 1 09-12-16 DM1

84 Problems on rank correlation 1 10-12-16 DM1

85 Curve fitting- stright line, parabola 1 13-12-16 DM1

86 Power curve, exponential and other

curves. 1

15-12-16 DM1

87 problems 1 16-12-16 DM1


Content beyond syllabus:

89 Applications of sampling tests 1

90 Correlation for bivariate frequency data 1

Total no. of classes 90


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

Name M.RAMI REDDY

M.RAMI REDDY

Signature

LESSON PLAN

Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2016-17 Semester : I SEM

Subject : MCA151 : C – PROGRAMMING LAB

LIST OF EXPERIMENTS

Cycle-1:

1) Student is expected to observe various components of computer physically

and assembling and dissembling of components.

2) Write programs in C Language:

a. To Exercise preliminary data types

b. To illustrate the usage of various Operators

c. To illustrate the order of evaluation of expressions

Cycle-2:

Write programs in C Language

a) To check whether the given year is leap year (or) not

b) To convert given two digit number into words using switch statement

c) To illustrate the usage of „goto‟ statement

d) To find smallest& biggest number from the given set of 4 numbers using „if‟ statement.

e) To calculate the student grade in the examination – assume suitable constraints.

f) To prepare electricity bill for the consumed units – assume suitable constraints.

g) To find roots of Quadratic Equation.

Cycle-3:


a) To display first N natural numbers

b) To find whether the given number is Armstrong (or) not

c) To find reverse of the given number and to check whether it is palindrome (or) not.

d) To find whether given number is strong number (or) not.

e) To check whether a given number is Prime (or) not

f) To display prime numbers with in the given range(Nesting of Loops).

g)To display the following formats (Nesting of Loops)

i) 1 ii) 5 4 3 2

1 2 4 3 2 1

1 2 3 3 2 1

1 2 3 4 2 1

1 2 3 4 5 1

Cycle -4:


a) To Find the sum and average of given numbers using Arrays.

b) To display elements of array in reverse order

c) To search whether the given element is in the array (or) not

using linear search & binary search.

d) Addition, subtraction and multiplication of Matrices

e) Transpose of given matrix

f) To illustrate the use of any 5 string handling functions.

g) To accept line of text and find the number of characters, number of

vowels and number of blank spaces in it.

h) To find whether the given string is palindrome (or) not.

Cycle -5:


a) To find factorial of a given number using functions.

b) To swap two numbers using functions.

c) To find GCD of two numbers using recursion

d) To solve Towers of Honai problem.

e) To illustrate the use of external & static storage classes.

Cycle-6 :


a) Illustrating pointer declaration, initialization and Pointer arithmetic.

b) To illustrate call by reference.

c) To find sum of the elements of the array using functions.

d) To illustrate the usage of command line arguments.

e) To illustrate the usage of dynamic memory management functions.

Cycle-7:


a) To process the student records. Assume suitable fields for student structures

(Different kinds of initialization of structure variables are to be exercised)

b) To read records of 10 employees and find their average salary

(exercise array of structures & Nested structures concepts ).

c) To handle a structure variable using pointers and implement

self - referential structure

d) To exercise i) unions ii) bit fields iii) enum

Cycle -8 :


a) Accessing content from files and writing content in to it.

(Exercise different file operation modes)

b) Accessing structured data using files.

c) Copy the contents of one file into another

(Exercise different file operation modes)

c) Exercise random access files operations

Course Education Objectives:

Student has to learn about the mentioned concepts and get benefited in these areas in

practical environment.

To make students familiar with:

Writing algorithms to implement operations involved in different Problems.

To handling arrays, Know the limitations of static memory allocation, various operations on

strings, importance of dynamic memory allocation.

The functions used for dynamic memory allocation, storage classes of variables, sending

input through command line, modularization, and pointer concept.

Manipulating Records, linked list introduction, applications of unions.

The advantages of permanent storage, various operations on files and format the output.

Course Outcomes (COs): By the completion of the course, the students are able to:

CO1: Write the algorithm and Draw the flow charts, Understand the basic terminology used in

computer programming, Write, compile and debugging programs in C language.

CO2: Use different data types in a c program, Design programs involving control structures and

functions.

CO3: Explain the difference between call by value and call by reference, understand the

dynamic memory management.

CO4: Get the complete information about structures and unions.

CO5: Usage of the files and operations on files. Get the programming skills on all the concepts,

To cover the topics in interview orientation, Students are confident about the topics in

the way of campus placements, Able to do the Mini projects on files and other functional

areas.

Articulation Matrix

Course Code


1 2 3 4 5

CO1 2 2 3 2

CO2 3 3 2

CO3 3 2 3

CO4 2 3 2 3

CO5 3 3 2 1


Notification of Lab Cycles

S.No Name of the

Experiments

Date of Conduction

(Expected)

Actual Date of

Conduction

1 Basics Hand Outs 30-08-2016

2 Dos Commands 01-09-2016

3 Basic Programs on C 06-09-2016

4 Cycle 1 13-09-2016

5 Cycle 1

Cycle 2

22-09-2016

6 Cycle 2 29-09-2016

7 Cycle 3 06-10-2016

8 Cycle 3 18-10-2016

9 Cycle 4 27-10-2016

10 Cycle 4 03-11-2016

11 Cycle 5 15-11-2016

12 Cycle 6 24-11-2016

13 Cycle 6 29-11-2016

14 Cycle 7 01-12-2016

15 Cycle 7 08-12-2016

16 Cycle 8 Revision of

Experiments

13-12-2016

17 Lab Internal Exam 15-12-2016

Course

Instructor Course Coordinator

Module Coordinator

HOD

Signature

Name of the

Faculty

P.ASHOK

REDDY

P.ASHOK

REDDY

P.ASHOK REDDY I.RAJENDRA

KUMAR

SYLLABUS EXERCISE 1

Using Logic Gates:- AND, OR, NOT , NOR, XOR, NAND, XNOR, Buffer EXERCISE 2

Boolean Algebra: Theorems and logical Gates, verification of truth tables for some given expressions EXERCISE 3

Realization of Boolean expressions; Using (i) AND – OR-NOT Gates (ii) NAND Gates (iii) NOR Gates EXERCISE 4

Latches Flip – Flops : RS, JK,T,D, Master –Slave FF, Edge – Triggered Flip – Flops EXERCISE 5

Registers: All types of Shift Register s and Adder, Subtractor, Divider, Negator, Comparator EXERCISE 6

Counters: Binary Counter, Synchronous Binary Counter, Synchronous Up/Down counter EXERCISE 7 Asynchronous Binary Counter, Ripple Counter, Decade Counter, Up/Down Counter EXERCISE 8

Modulo Counter: Modulo - 5, Modulo – 10 EXERCISE 9

Adders / Sub tractors: Half Adder, Full Adder, 1 ‘s and 2’s complement addition EXERCISE 10

Multiplexers/ Data Selector: 2- input and 8- input, Demultiplexers , Logic Function Generator EXERCISE 11

Decoders and Encoders EXERCISE 12 BCD adders and Comparators EXERCISE 13

Code Converters : Decimal –to-Binary, Binary – to – Decimal, Decimal – to- Hexa Decimal, BCD- to –Decimal, Binary – to- gray, gray- to –Binary EXERCISE 14

RAM, ROM, PROM, EPROM – Testing Memory Chips REFERENCES

1. Digital Fundamentals, Floyd & Jain, Pearson, 2005. 2. Digital Logic and Computer Organization, Rajaraman, Radhakrishnan, PHI, 2006

1. Pre-requisites:

Basic knowledge of Computer Fundamentals.

Boolean algebra and Number System Fundamentals

2. Course Educational Objectives (CEOs):

This includes the study of conversions among different number systems, construction of

combinational and sequential circuits.

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

CO1: To understand the functionality and working various Logic Gates and Universal Gates.

LESSON PLAN

Department: Master of Computer Application Program : MCA Course : MCA Academic Year: 2016-17 Semester : I SEM Subject : MCA152 – DIGITAL LOGIC AND COMPUTER SYSTEMS ORGANIZATION LAB

CO2: Ability to construct circuit diagrams and verify various Boolean Algebra rules and theorems. CO3: Realize of Boolean Expressions and Logic gates using Universal Gates. CO4: To construct various circuits for implementation of Arithmetic Operations. CO5: To implement sequential circuits such as Flip-flops, Registers, Counters and Modulo Counters. CO6: To implement combinational circuits such as Multiplexer, Demultiplexer, Encoder and Decoder and simulated circuits using gates. 4. Course Articulation Matrix:

Course Code


1 2 3 4 5

CO1 3 3 2 1

CO2 3 3 2 1

CO3 3 2 2 1

CO4 3 2 1 1

CO5 3 2 1 1

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

LIST OF EXPERIMENTS

S.No Name of the Experiments Date of Lab Schedule

Actual date

DM

1 Using Logic Gates:- AND, OR, NOT, XOR, XNOR, Buffer, NAND and NOR

29-08-2016

2

2

Boolean Algebra: Theorems and logical Gates, verification of truth tables for some given expressions

29-08-2016

2

3

Realization of Logic Gates using Universal Gates NAND and NOR Realization of NAND using NOR & NOR Using NAND

12-09-2016

2

4

Realization of Boolean expressions Using (i) AND – OR-NOT Gates (ii) NAND gates (iii) NOR gates

12-09-2016 2

5 Adders / Sub tractors: Half Adder, Full Adder, 1 ‘s and 2’s complement addition

19-09-2016 2

6 Additional Lab Experiments Half-Adder Implementation Using NAND and NOR gates

26-09-2016

2

7 26-09-2016 2

Decoders and Encoders

8 Additional Lab Experiments Construct 3X8 decoder with two 2x4 decoders

03-10-2016 2

9

Multiplexers/ Data Selector: 2- input and 8- input, Demultiplexers , Logic Function Generator

24-10-2016 2

10

Registers: All types of Shift Registers and Adder, Subtractor, Divider, Negator, Comparator

31-10-2016 2

11 Latches Flip – Flops : RS, JK,T,D, Master –Slave FF, Edge – Triggered Flip – Flops

07-11-2016 2

12 BCD adders and Comparators

11-11-2016

2

13 Modulo Counter: Modulo-5, Modulo – 10

21-11-2016 1

14 Additional: Lab Experiments: Modulo Counter : Modulo-6, Modulo-12

21-11-2016 2

15 Counters: Binary Counter, Synchronous Binary Counter, Synchronous Up/Down counter

28-11-2016 2

16 Asynchronous Binary Counter, Ripple Counter, Decade Counter, Up/Down Counter

28-11-2016 2

17

Code Converters : Decimal –to-Binary, Binary – to – Decimal, Decimal – to- Hexa Decimal.. etc

05-12-2016 2

18 RAM, ROM, PROM, EPROM – Testing Memory Chips

12-12-2016

2

19 Revision 12-12-2016 2


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

G RAJENDRA

K.PHANEENDRA K.PHANEENDRA I. RAJENDRA KUMAR

Documents

LESSON PLAN M C A Program : Course : Academic Year : 2016