Friday, February 26, 2016

Wednesday, February 24, 2016

MCA-108 Object Oriented Programming Using C++: Syllabus and Lecture Notes PDF

MCA-108 Object Oriented Programming Using C++: Syllabus and Lecture Notes PDF
Would like to download Syllabus and Lecture Notes of MCA-108 Object Oriented Programming Using C++  for your MCA course under Anna University ? Here is the solution to you. You can get here syllabus as well as lecture notes in PDF format.

Anna University Chennai
Department of Master of Computer Applications (MCA)
Second Semester
MCA-108 Object Oriented Programming Using C++
Syllabus and Lecture Notes

Syllabus of MCA-108 Object Oriented Programming Using C++ 

MCA-108 Object Oriented Programming using C++ L-T-P: 3-1-0
Prerequisite: Basic knowledge of object oriented programming.

UNIT I: (10 Hours)
Introduction to object oriented programming, user defined types, polymorphism, and encapsulation. Getting started with C++ - syntax, data-type, variables, strings, functions, exceptions and statements, namespaces and exceptions operators. Flow control, functions, recursion. Arrays and pointers, structures.

UNIT II: (10 Hours)
Abstraction Mechanisms: Classes, private, public, constructors, destructors, member functions, static members, references etc. class hierarchy, derived classes. Inheritance: simple inheritance, polymorphism, object slicing, base initialization, virtual functions.

UNIT III: (12 Hours)
Prototypes, linkages, operator overloading, ambiguity, friends, member operators, operator function, I/o operators etc. Memory management: new, delete, object copying, copy constructors, assignment operator, this Input/Output. 
Exception handling: Exceptions and derived classes function exception declarations, Unexpected exceptions.
Exceptions when handling exceptions, resource capture and release etc.

UNIT – IV: (8 Hours)
Templates and Standard Template library: template classes declaration, template functions, namespaces, string, iterators, hashes, iostreams and other type.
Design using C++ design and development, design and programming, role of classes.

Text Book:
1. E. Balaguruswamy, Object-Oriented Programming in C++. 4 ed, Tata McGraw-Hill.
2. Ashok N. Kamthane, Object-Oriented Programming with ANSI & Turbo C++, Pearson Education.

Reference Books:
1. Herbert Schildt, The Complete Reference C++. 4 ed, Tata McGraw-Hill.
2. Bjarne Stroustrup, Programming: Principles and Practice Using C++. 4 ed, AddisonWesley.

Course Outcomes:
1. Familiar to map real world problems into the Programming language using objects.
2. Can solve the problems in systematic way using class and method paradigms.
3. Efficiently implement linear, nonlinear data structures and various searching and  sorting techniques.
4. Efficiently implement Exception handling techniques.

Download Lecture Notes of MCA-108 Object Oriented Programming Using C++

Have a look at the contents included in this lecture notes below. You can download it in PDF style from the link provided after the list of topics here.
1. INTRODUCTION
1.1 Features
1.2 Advantages
1.3 Uses of OOP
2. INPUT AND OUTPUT IN C++
2.1 pre-defined streams
2.2 stream classes
2.3 Typecasting
3. C++ DECLARATION
3.1 Parts of C++ program
3.2 Token
3.3 Data types in C++
3.3.1 Basic data types
3.3.2 Derived data type
3.3.3 User defined data type
3.3.4 Void data type
3.4 Operators in C++
4. FUNCTIONS IN C++
4.1 Passing Arguments
a) Call by value(pass by value)
b) Call by address(pass by address)
c) Call by reference(pass by reference)
4.2 Default Arguments
4.3 Inline functions
4.4 Function overloading
4.5 Library function
4.6 Const Argument
5. CLASSES & OBJECTS
5.1 Introduction
5.2 Declaring objects
5.3 Defining member function
5.4 Declaring member function outside the class
5.5 Static member variable
5.6 Static member function
5.7 Static object
5.8 Object as function arguments
5.8.1 pass-by value
5.8.2 pass-by reference
5.8.3 pass by address
5.9 Friend function
5.10 Friend classes
5.11 Constant member function
www.Vidyarthiplus.com
www.vidyarthiplus.com
5.12 Recursive member function
5.13 Member function & non-member function
5.14 Overloading member function
5.15 Overloading main() function
5.16 Indirect recursion
6. CONSTRUCTOR AND DESTRUCTOR
6.1 Constructor with Arguments
6.2 Constructor overloading
6.3Constructor with default Argument
6.5 Copy Constructor
6.6Const Object
6.7 Destructor
6.8 Qualifier & Nested classes
6.9 Anonymous object
6.10 Private Constructor and Destructor
6.11 main() as constructor & destructor
6.12 Local vs Global Object
7. INHERITANCE
7.1 Types of Inheritance
 7.1.1 Single Inheritance
 7.1.2 Multiple Inheritance
 7.1.3 Hierarchical Inheritance
 7.1.4 Multilevel Inheritance
 7.1.5 Hybrid Inheritance
 7.1.6Multipath Inheritance
7.2 Container class
7.3 Abstract class
7.4 Common constructor
7.5Pointer & Inheritance
 7.6 Overloading Member function
8. OPERATOR OVERLOADING
8.1 Introduction
8.2 Overloading Unary operator
8.3 Overloading binary operator using friend function
8.4 Overloading increment & decrement operator
8.5 Overloading special operator
8.6 Overloading function call operator
8.7 Overloading class member access operator
8.8 Overloading comma operator
8.9 Overloading stream operator
8.10 Overloading extraction & insertion operator
9. POINTERS AND ARRAY
9.1 Void pointer
9.2 Wild pointer
www.Vidyarthiplus.com
www.vidyarthiplus.com
9.3 Class pointer
9.4 Pointer to derived & base classes
9.5 Binding , polymorphism
9.6 Virtual function
9.7 Pure virtual function
9.8 Object slicing
9.9 VTABLE & VPTR
9.10 New & delete operator
9.11 Dynamic object
9.12 heap
9.13 Virtual destructor
10.EXCEPTION HANDLING
10.1 Introduction
10.2 Exception handling mechanism
10.3 Multiple catch statements
10.4 Catching multiple exception
10.5 Rethrowing an exception
10.6 Specifying exception
10.7 Exceptions in constructor & destructors
10.8 Controlling uncaught exception
10.8.1 Terminate function
10.8.2 Set-terminate function
10.9 Exception & inheritance
11.TEMPLATES
11.1 Introduction
11.2 Need Of Template
11.3 Normal Function Template
11.4 Member Template Function
11.5 Working Of Function Templates:
11.6 Overloading Of Template Functions :
11.7 Exception Handling With Class Template:
11.8 Class Templates With Overloaded Operators :
11.9 Class Template And Inheritance:
11.10 Difference Between Templates And Macros:
11.11 Guidelines For Templates
12.NAMESPACES
12.1 namespace Scope:
12.2 namespace Declaration:
12.3 Accessing elements of a name space:
12.4 Nested namespace:
12.5 Anonymous namespaces:
12.6 Function In namespace:
12.7 Classes in namespace:
12.8 namespace Alias:
www.Vidyarthiplus.com
www.vidyarthiplus.com
12.9 explicit Keyword :
12.10 mutable keyword:
12.11 Manipulating Strings:
12.12 Manipulating String Objects:
12.13 Relational Operator:
12.14 Accessing Characters In String:
13.STANDARD TEMPLATE LIBRARY(STL)
13.1 Component of STL
 13.1.1 Containers
 13.1.2 Algorithm
 13.1.3 Iterator
13.2 Types of containers
 13.2.1 Sequence Containers
 13.2.2 Associative Container
 13.2.3 Derived Container
13.3 Algorithm
13.4 Iterator 

Download Link of MCA-108 Object Oriented Programming Using C++ Lecture Notes: https://goo.gl/jksL4z

MCA-209 Analysis and Design of Algorithm- Syllabus and Lecture Notes

MCA-209 Analysis and Design of Algorithm- Syllabus and Lecture Notes
Are you doing MCA under Anna University ? Want to download Syllabus and Lecture notes of MCA-209 Analysis and Design of Algorithm ? You can get them here.

Syllabus of MCA-209 Analysis and Design of Algorithm

MCA-209 Analysis and Design of Algorithm L-T-P: 3-1-0
Prerequisite: Familiarity with Discrete Mathematical Structures, and Data Structures.

UNIT I: (10 Hours)
Algorithms and Complexity: Asymptotic notations, orders, worst-case and average-case, amortized complexity.
Basic Techniques: divide & conquer, dynamic programming, greedy method, backtracking.

UNIT II: (10 Hours)
Branch and bound, randomization.
Data Structures: heaps, search trees, union-find problems.
Applications: sorting & searching, combinatorial problems.

UNIT III: (10 Hours)
Optimization problems, computational geometric problems, string matching. Graph Algorithms: BFS and DFS, connected components.

UNIT IV: (10 Hours)
Spanning trees, shortest paths, MAX-flow.
NP- completeness, Approximation algorithms.

Text Book:
1. Introduction to Algorithms, 2/e ,T.H.Cormen,C.E.Leiserson, R.L.Rivest and C.Stein, PHI Pvt. Ltd. / Pearson Education

Reference Books:
1. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and R.Tomassia, John Wiley and sons.
2. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam, Galgotia Publications Pvt. Ltd.

Course outcomes:
1. To be able to analyze correctness and the running time of the basic algorithms for those classic problems in various domains and to be able to apply the algorithms and design techniques for advanced data structures.
2. To be able to analyze the complexities of various problems in different domains. And to be able to demonstrate how the algorithms are used in different problem domains.
3. To be able to design efficient algorithms using standard algorithm design techniques and demonstrate a number of standard algorithms for problems in fundamental areas in computer science and engineering such as sorting, searching and problems involving graphs.


Download Lecture Notes of MCA-209 Analysis and Design of Algorithm

The lecture notes are given in word format. You can download it here under, The following contents have been included in this lecture notes...

Module I
Algorithms and Complexity…………………………………………………………..3
Basic Techniques……………………………………………………………………..8
Module II
Branch and bound………………………………………………………..………….14
Data Structures………………………………………………………………………18
Sorting & Searching………………………………………………………….……...26
Module III
Optimization problems………………………………………………………………28
Computational geometric problems…………………………………………………28
String matching...........................................................................................................33
Graph Algorithms……………………………………………………………………37
Module IV
Spanning trees……………………………………………………………………….43
Max-flow……………………………………………………………….…………….46
NP – completeness……………...................................................................................48

Download Link for Lecture Notes of MCA-209 Analysis and Design of Algorithm: https://goo.gl/JeGv5S

Monday, November 30, 2015

CS6304 Analog and Digital Communication Lecture Notes

CS6304 Analog and Digital Communication Lecture Notes
Looking for Lecture Notes of CS6304 Analog and Digital Communication ? You can download it here under. Read details below and make a download of lecture notes of CS6304 Analog and Digital Communication. The subject belongs to 3rd Semester B.E CSE in AU Chennai Regulation 2013.

Anna University Chennai
B.E B.Tech Computer Science and Engineering
Third Semester
CS6304 Analog and Digital Communication
Lecture Notes - SVCET Edition
Unit IV

CS6304 / Analog and Digital Communication
UNIT IV - SOURCE AND ERROR CONTROL CODING
PART A
1. What is the use of error control coding?
The main use of error control coding is to reduce the overall probability of error, which is also known as channel coding.
2. What is the difference between systematic code and non-systematic code?
In the systematic block code the message bits appears at the beginning of the codeword. That is the message bits appears first and then the check bits are transmitted. In non systematic block code it is not possible to identify the message bits and check bits. They are mixed in block.

3. What is a Repetition code?
A single message bit is encoded in to a block of ‘n’ identical bits producing a (n, 1) block code. There are only two code words in the code. They are all zeros and ones.The code is called repetition code since many redundant check bits are transmitted along with a single message bit.
4. What is forward acting error correction method?
The method of controlling errors at the receiver through attempts to correct noise-induced errors is called forward acting error correction method.
5. What is error detection?
The decoder accepts the received sequence and checks whether it matches a valid message sequence. If not, the decoder discards the received sequence and notifies the transmitter (over the reverse channel from the receiver to the transmitter) that errors have occurred and the received message must be retransmitted. This method of error control is called error detection
6. Define linear block code?
If each of the 2k code words can be expressed as linear combination of ‘k’ linearly independent code vectors then the code is called linear block code. A code is linear if sum of any two code vectors produces another code vector
7. Give the properties of syndrome in linear block code.
The syndrome depends only on the error patterns and not on the transmitted code word. All error patterns that differ by a code word have the same syndrome

Download Full Paper at : CS6304 Analog and Digital Communication Lecture Notes ( Unit IV )

BA7034 Industrial Relations and Labour Welfare MBA Lecturer Notes

BA7034 Industrial Relations and Labour Welfare MBA Lecturer Notes
Looking for Lecture Notes of BA7034 Industrial Relations and Labour Welfare ? You can download it in PDF format below. This subject is in 3rd Semester MBA course under Anna University Regulation 2013.

Anna University Chennai
Master of Business Administration
Third Semester
BA7034 Industrial Relations and Labour Welfare
Lecture Notes
Regulation: 2013

Download Link : BA7034 Industrial Relations and Labour Welfare MBA Lecturer Notes

Syllabus:
BA7034 Industrial Relations and Labour welfare 3
BA7034 INDUSTRIAL RELATIONS AND LABOUR WELFARE LT P C
UNIT I INDUSTRIAL RELATIONS 7
Concepts – Importance – Industrial Relations problems in the Public Sector – Growth of Trade Unions – Codes of conduct.
UNIT II INDUSTRIAL CONFLICTS 12
Disputes – Impact – Causes – Strikes – Prevention – Industrial Peace – Government Machinery – Conciliation – Arbitration – Adjudication.
UNIT III LABOUR WELFARE 8
Concept – Objectives – Scope – Need – Voluntary Welfare Measures –Statutory Welfare Measures – Labour – Welfare Funds – Education and Training Schemes.
UNIT IV INDUSTRIAL SAFETY 9
Causes of Accidents – Prevention – Safety Provisions – Industrial Health and Hygiene – Importance – Problems – Occupational Hazards – Diseases – Psychological problems – Counseling – Statutory Provisions.
UNIT V WELFARE OF SPECIAL CATEGORIES OF LABOUR 9
Child Labour – Female Labour – Contract Labour – Construction Labour – Agricultural Labour – Differently abled Labour –BPO & KPO Labour - Social Assistance – Social Security – Implications.

TOTAL: 45 PERIODS
TEXT BOOKS
1. Mamoria C.B. and Sathish Mamoria, Dynamics of Industrial Relations, Himalaya Publishing
House, New Delhi, 2007.
2. Arun Monappa, Ranjeet Nambudiri, Patturaja Selvaraj. Industrial relations & Labour Laws. TataMcGraw Hill. 2012
1. Ratna Sen, Industrial Relations in India, Shifting Paradigms, Macmillan India Ltd., NewDelhi, 2007.
2. C.S.Venkata Ratnam, Globalisation and Labour Management Relations, Response Books,2007.
3. Srivastava, Industrial Relations and Labour laws,
4. P.R.N Sinha, Indu Bala Sinha, Seema Priyardarshini Shekhar. Industrial Relations, Trade Unions and Labour Legislation. Pearson. 2004



Monday, November 23, 2015

EE6403 Discrete Time Systems and Signal Processing BE EEE Lecture Notes 2015

EE6403 Discrete Time Systems and Signal Processing BE EEE Lecture Notes 2015
Are you looking for EE6403 Discrete Time Systems and Signal Processing Lecture Notes 2015 ? You can here download the lecture notes of EE6403 Discrete Time Systems and Signal Processing for preparing Anna University Chennai examinations. It is B.E EEE 4th Semester subject in Regulation 2013 of AU Chennai.

Anna University Chennai
Department of B.E Electrical and Electronics Engineering
Fourth Semester
EE6403 Discrete Time Systems and Signal Processing
(Regulation 2013)
Study Materials : Lecture Notes

Download Link : EE6403 Discrete Time Systems and Signal Processing BE EEE Lecture Notes 2015


Sunday, September 27, 2015

EE2253, IC6501 Control System Subject Notes and Question Papers Download

EE2253, IC6501 Control System Subject Notes and Question Papers Download
EE2253/IC6501 Control System Subject Notes, Important Topics and Syllabus Contents are provided below. The university question papers you can search through search box provided.

Total Units:
UNIT-1 SYSTEM AND THEIR REPRESENTATION
UNIT-2 TIME RESPONSE
UNIT-3 FREQUENCY RESPONSE
UNIT-4 STABILITY OF CONTROL SYSTEM
UNIT-5 COMPENSATOR DESIGN

UNIT-1
SYSTEM AND THEIR REPRESENTATION
Transfer function
Plant
Process
System
Control system
Classification of control system
1. Depends upon the structure
2. Depends upon the mathematical model
3. Depends upon the response time variant
4. Depends upon the hardware components
5. Depends upon the data type
6. Depends upon method of control used
7. Depends upon number of variable
Open loop
Closed loop system
Workflow for a closed loop system
Comparision of open and closed loop system
Modelling of system
Types
1. State phase model
2. Transfer function
3. Impulse response method
Transfer function
Properties of transfer function
Poles of the function
Zeros of the function
Characteristics equation of the function
Order of the system
Electrical analogy of the mechanical system
Force balance equation of the 3 elements translation system
Dash pot
Mechanical rotational system
Problems
Force current analogy
Rotational system
Torque-voltage analogy
Electrical system
Block diagram representation
Properties of block diagram
Signal flow graph
Transfer function of a armature controller
Mason’s gain formula
Synchros
Synchro transmitter
Advantages
Disadvantages
DC servomotor
Permanent magnet motor
Electromagnetic field motor
1. Armature controlled
2. Field controlled
Armature controlled Dc servomotor
AC servomotor

UNIT-2
TIME RESPONSE
Transient
Steady state
Closed loop transfer function
Time response of the control system
Test signal or input signal
Step signal
Ramp signal
Parabolic signal
Impulse signal
Order of the system
Type of the system
Time domain specification
Types number of control system
Steady state error
Static error constant
Generalized error coefficient
P, PI and PIO modes of feedback control error compensation
Effects of PI controller
Effects of proportional derivative controller
Effects of PIO controller

UNIT-3
FREQUENCY RESPONSE
Advantages of frequency response method
Graphical methods
Bode plot
Nyquist plot
Nichol’s chart
Frequency response
Frequency domain specification
1. Resonant peak
2. Resonant frequency
3. Bandwidth
4. Cut off rate
5. Gain margin
6. Phase margin
Corner frequency
Bode plot
Problems based on bode plot
Block diagram reduction techniques
Nichol’s chart

UNIT-4
STABILITY OF CONTROL SYSTEM
Stability
BIBO stability
Routh Hurwitz criterion
Problems
Root locus
Problems on root locus
Nyquist criterion

UNIT-5
COMPENSATOR DESIGN
Time domain
Steady state error constant
Compensator
Types
1. Series compensation
2. Parallel compensation
Electrical compensator
1. Lag compensator
2. Led compensator
3. Lag led compensator

Search Everything Here