Category: Syllabus

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

EC3352 Digital Systems Design

Post author By Mr. Padeepz
Post date August 27, 2022
No Comments on EC3352 Digital Systems Design

EC3352 Digital Systems Design Study Materials

Anna University – EC3352 Digital Systems Design Regulation 2021 Syllabus, Notes, Important Questions, Question Paper with Answers, Previous Year Question Paper.

UNIT I BASIC CONCEPTS EC3352 Digital Systems Design Syllabus

Review of number systems-representation-conversions, Review of Boolean algebra- theorems, sum of product and product of sum simplification, canonical forms min term and max term, Simplification of Boolean expressions-Karnaugh map, completely and incompletely specified functions, Implementation of Boolean expressions using universal gates ,Tabulation methods.

UNIT II COMBINATIONAL LOGIC CIRCUITS EC3352 Digital Systems Design Notes

Problem formulation and design of combinational circuits – Code-Converters, Half and Full Adders, Binary Parallel Adder – Carry look ahead Adder, BCD Adder, Magnitude Comparator, Decoder, Encoder, Priority Encoder, Mux/Demux, Case study: Digital trans-receiver / 8 bit Arithmetic and logic unit, Parity Generator/Checker, Seven Segment display decoder

UNIT III SYNCHRONOUS SEQUENTIAL CIRCUITS EC3352 Digital Systems Design Important Questions

Latches, Flip flops – SR, JK, T, D, Master/Slave FF, Triggering of FF, Analysis and design of clocked sequential circuits – Design – Moore/Mealy models, state minimization, state assignment,lock – out condition circuit implementation – Counters, Ripple Counters, Ring Counters, Shift registers, Universal Shift Register. Model Development: Designing of rolling display/real time clock

UNIT IV ASYNCHRONOUS SEQUENTIAL CIRCUITS EC3352 Digital Systems Design Question Bank

Stable and Unstable states, output specifications, cycles and races, state reduction, race free assignments, Hazards, Essential Hazards, Fundamental and Pulse mode sequential circuits, Design of Hazard free circuits.

UNIT V LOGIC FAMILIES AND PROGRAMMABLE LOGIC DEVICES EC3352 Digital Systems Design Question Paper

Logic families- Propagation Delay, Fan – In and Fan – Out – Noise Margin – RTL ,TTL,ECL, CMOS – Comparison of Logic families – Implementation of combinational logic/sequential logic design using standard ICs, PROM, PLA and PAL, basic memory, static ROM,PROM,EPROM,EEPROM EAPROM.

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXTBOOKS : EC3352 Digital Systems Design Regulation 2021

1. M. Morris Mano and Michael D. Ciletti, ‘Digital Design’, Pearson, 5th Edition, 2013.(Unit – I -V)

REFERENCES : EC3352 Digital Systems Design R21

1. Charles H. Roth, Jr, ‘Fundamentals of Logic Design’, Jaico Books, 4th Edition, 2002.
2. William I. Fletcher, “An Engineering Approach to Digital Design”, Prentice- Hall of India, 1980.
3. Floyd T.L., “Digital Fundamentals”, Charles E. Merril publishing company,1982.
4. John. F. Wakerly, “Digital Design Principles and Practices”, Pearson Education, 4 th Edition,2007.

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

EC3351 Control Systems

EC3351 Control Systems Study Materials

Anna University – EC3351 Control Systems Regulation 2021 Syllabus, Notes, Important Questions, Question Paper with Answers, Previous Year Question Paper.

UNIT I SYSTEMS COMPONENTS AND THEIR REPRESENTATION EC3351 Control Systems Syllabus

Control System: Terminology and Basic Structure-Feed forward and Feedback control theory-Electrical and Mechanical Transfer Function Models-Block diagram Models-Signal flow graphs models-DC and AC servo Systems-Synchronous -Multivariable control system

UNIT II TIME RESPONSE ANALYSIS EC3351 Control Systems Notes

Transient response-steady state response-Measures of performance of the standard first order and second order system-effect on an additional zero and an additional pole-steady error constant and system- type number-PID control-Analytical design for PD, PI,PID control systems

UNIT III FREQUENCY RESPONSE AND SYSTEM ANALYSIS EC3351 Control Systems Important Questions

Closed loop frequency response-Performance specification in frequency domain-Frequency response of standard second order system- Bode Plot – Polar Plot- Nyquist plots-Design of compensators using Bode plots-Cascade lead compensation-Cascade lag compensation-Cascade lag-lead compensation

UNIT IV CONCEPTS OF STABILITY ANALYSIS EC3351 Control Systems Question Bank

Concept of stability-Bounded – Input Bounded – Output stability-Routh stability criterion-Relative stability-Root locus concept-Guidelines for sketching root locus-Nyquist stability criterion.

UNIT V CONTROL SYSTEM ANALYSIS USING STATE VARIABLE METHODS EC3351 Control Systems Question Paper

State variable representation-Conversion of state variable models to transfer functions-Conversion of transfer functions to state variable models-Solution of state equations-Concepts of Controllability and Observability-Stability of linear systems-Equivalence between transfer function and state variable representations-State variable analysis of digital control system-Digital control design using state feedback

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOK: EC3351 Control Systems Notes

1. M.Gopal,“Control System – Principles and Design”, Tata McGraw Hill, 4th Edition, 2012.

REFERENCE: Control Systems Important Questions

1. J.Nagrath and M.Gopal, “Control System Engineering”, New Age International Publishers, 5th Edition, 2007.
2. K.Ogata, “Modern Control Engineering”, PHI, 5th Edition, 2012.
3. S.K.Bhattacharya, “Control System Engineering”, Pearson, 3rd Edition, 2013.
4. Benjamin.C.Kuo, “Automatic Control Systems”, Prentice Hall of India, 7th Edition,1995.

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

EC3353 Electronic Devices and Circuits

Post author By Mr. Padeepz
Post date August 27, 2022
No Comments on EC3353 Electronic Devices and Circuits

EC3353 Electronic Devices and Circuits Study Materials

Anna University – EC3353 Electronic Devices and Circuits Regulation 2021 Syllabus, Notes, Important Questions, Question Paper with Answers, Previous Year Question Paper.

UNIT I SEMICONDUCTOR DEVICES EC3353 Electronic Devices and Circuits Syllabus

PN junction diode, Zener diode, BJT, MOSFET, UJT –structure, operation and V-I characteristics, diffusion and transition capacitance – Rectifiers – Half Wave and Full Wave Rectifier, Zener as regulator

UNIT II AMPLIFIERS EC3353 Electronic Devices and Circuits Notes

Load line, operating point, biasing methods for BJT and MOSFET, BJT small signal model – Analysis of CE, CB, CC amplifiers- Gain and frequency response –MOSFET small signal model– Analysis of CS, CG and Source follower – Gain and frequency response- High frequency analysis.

UNIT III MULTISTAGE AMPLIFIERS AND DIFFERENTIAL AMPLIFIER EC3353 Electronic Devices and Circuits Important Questions

Cascode amplifier, Differential amplifier – Common mode and Difference mode analysis – MOSFET input stages – tuned amplifiers – Gain and frequency response – Neutralization methods.

UNIT IV FEEDBACK AMPLIFIERS AND OSCILLATORS EC3353 Electronic Devices and Circuits Question Bank

Advantages of negative feedback – Voltage / Current, Series , Shunt feedback Amplifiers – positive feedback–Condition for oscillations, phase shift – Wien bridge, Hartley, Colpitts and Crystal oscillators.

UNIT V POWER AMPLIFIERS AND DC/DC CONVERTERS EC3353 Electronic Devices and Circuits Question Paper

Power amplifiers- class A-Class B-Class AB-Class C-Power MOSFET-Temperature Effect- Class AB Power amplifier using MOSFET –DC/DC convertors – Buck, Boost, Buck-Boost analysis and design.

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOKS : EDC Regulation 2021

1. David A. Bell, “Electronic Devices and Circuits”, Oxford Higher Education press, 5 th Edition, 2010.
2. Robert L. Boylestad and Louis Nasheresky, “Electronic Devices and Circuit Theory”, 10th Edition, Pearson Education / PHI, 2008.
3. Adel .S. Sedra, Kenneth C. Smith, “Micro Electronic Circuits”, Oxford University Press, 7 th Edition, 2014.

REFERENCES : EC3353 Electronic Devices and Circuits

1. Donald.A. Neamen, “Electronic Circuit Analysis and Design”, Tata McGraw Hill, 3 rd Edition, 2010.
2. D.Schilling and C.Belove, “Electronic Circuits”, McGraw Hill, 3 rd Edition, 1989
3. Muhammad H.Rashid, “Power Electronics”, Pearson Education / PHI , 2004.

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

EC3354 Signals and Systems

Post author By Mr. Padeepz
Post date August 27, 2022
No Comments on EC3354 Signals and Systems

EC3354 Signals and Systems Study Materials

Anna University – EC3354 Signals and Systems Regulation 2021 Syllabus, Notes, Important Questions, Question Paper with Answers, Previous Year Question Paper.

UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS EC3354 Signals and Systems Syllabus

Standard signals- Step, Ramp, Pulse, Impulse, Real and complex exponentials and Sinusoids_Classification of signals – Continuous time (CT) and Discrete Time (DT) signals, Periodic & Aperiodic signals, Deterministic & Random signals, Energy & Power signals -Classification of systems- CT systems and DT systems- – Linear & Nonlinear, Time-variant& Time-invariant,Causal & Non-causal, Stable & Unstable.

UNIT II ANALYSIS OF CONTINUOUS TIME SIGNALS EC3354 Signals and Systems Notes

Fourier series for periodic signals – Fourier Transform – properties- Laplace Transforms and Properties

UNIT III LINEAR TIME INVARIANT CONTINUOUS TIME SYSTEMS EC3354 Signals and Systems Important Questions

Impulse response – convolution integrals- Differential Equation- Fourier and Laplace transforms in Analysis of CT systems – Systems connected in series / parallel.

UNIT IV ANALYSIS OF DISCRETE TIME SIGNALS EC3354 Signals and Systems Question Paper

Baseband signal Sampling–Fourier Transform of discrete time signals (DTFT)– Properties of DTFT – Z Transform & Properties

UNIT V LINEAR TIME INVARIANT-DISCRETE TIME SYSTEMS EC3354 Signals and Systems Question Bank

Impulse response–Difference equations-Convolution sum- Discrete Fourier Transform and Z Transform Analysis of Recursive & Non-Recursive systems-DT systems connected in series and parallel.

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOKS: Signals and Systems Regulation 2021

1. Oppenheim, Willsky and Hamid, “Signals and Systems”, 2nd Edition, Pearson Education, New Delhi, 2015.(Units I – V) 2. Simon Haykin, Barry Van Veen, “Signals and Systems”, 2nd Edition, Wiley, 2002

REFERENCES : Signals and Systems Regulation 2021

1. B. P. Lathi, “Principles of Linear Systems and Signals”, 2nd Edition, Oxford, 2009.
2. M. J. Roberts, “Signals and Systems Analysis using Transform methods and MATLAB”, McGraw- Hill Education, 2018.
3. John Alan Stuller, “An Introduction to Signals and Systems”, Thomson, 2007.

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

MA3355 Random Processes and Linear Algebra

Post author By Mr. Padeepz
Post date August 27, 2022
No Comments on MA3355 Random Processes and Linear Algebra

MA3355 Random Processes and Linear Algebra Study Materials

Anna University – MA3355 Random Processes and Linear Algebra Regulation 2021 Syllabus, Notes, Important Questions, Question Paper with Answers, Previous Year Question Paper.

UNIT – I PROBABILITY AND RANDOM VARIABLES MA3355 Random Processes and Linear Algebra Syllabus

Axioms of probability – Conditional probability – Baye’s theorem – Discrete and continuous random variables – Moments – Moment generating functions – Binomial, Poisson, Geometric, Uniform, Exponential and Normal distributions – Functions of a random variable.

UNIT – II TWO – DIMENSIONAL RANDOM VARIABLES MA3355 Random Processes and Linear Algebra Important Questions

Joint distributions – Marginal and conditional distributions – Covariance – Correlation and linear regression – Transformation of random variables – Central limit theorem (for independent and identically distributed random variables).

UNIT – III RANDOM PROCESSES MA3355 Random Processes and Linear Algebra Question Paper

Classification – Stationary process – Markov process – Poisson process – Discrete parameter
Markov chain – Chapman Kolmogorov equations (Statement only) – Limiting distributions .

UNIT – IV VECTOR SPACES MA3355 Random Processes and Linear Algebra Notes

Vector spaces – Subspaces – Linear combinations and linear system of equations – Linear independence and linear dependence – Bases and dimensions.

UNIT – V LINEAR TRANSFORMATION AND INNER PRODUCT SPACES MA3355 Random Processes and Linear Algebra Question Bank

Linear transformation – Null spaces and ranges – Dimension theorem – Matrix representation of a linear transformations – Inner product – Norms – Gram Schmidt orthogonalization process – Adjoint of linear operations – Least square approximation.

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXTBOOKS : MA3355 Random Processes and Linear Algebra Important Questions

1. Gross, D., Shortle, J.F, Thompson, J.M and Harris. C.M., “Fundamentals of Queueing Theory”, Wiley Student 4th Edition, 2014.
2. Ibe, O.C., “Fundamentals of Applied Probability and Random Processes”, Elsevier,1st Indian Reprint, 2007.
3. Friedberg. A.H., Insel. A.J. and Spence. L., “Linear Algebra”, Prentice Hall of India, New Delhi, 4th Edition, 2004.

REFERENCE BOOKS : MA3355 Random Processes and Linear Algebra Question Paper

1. Hsu, “Schaum’s Outline of Theory and Problems of Probability, Random Variables and Random Processes”, Tata McGraw Hill Edition, New Delhi, 2004. RPLA Notes
2. Trivedi, K.S., “Probability and Statistics with Reliability, Queueing and Computer Science Applications”, 2nd Edition, John Wiley and Sons, 2002.
3. Yates, R.D. and Goodman. D. J., “Probability and Stochastic Processes”, 2nd Edition, Wiley India Pvt. Ltd., Bangalore, 2012.
4. Kolman. B. Hill. D.R., “Introductory Linear Algebra”, Pearson Education, New Delhi, First Reprint, 2009.
5. Kumaresan. S., “Linear Algebra – A Geometric Approach”, Prentice – Hall of India, New Delhi, Reprint, 2010.
6. Strang. G., “Linear Algebra and its applications”, Thomson (Brooks/Cole), New Delhi, 2005.

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

CD3281 Data Structures and Algorithms Laboratory

Post author By Mr. Padeepz
Post date August 27, 2022
No Comments on CD3281 Data Structures and Algorithms Laboratory

CD3281 Data Structures and Algorithms Laboratory

Anna University – CD3281 Data Structures and Algorithms Laboratory Regulation 2021 Syllabus, Notes, Lab Manual Important Questions, Question Paper with Answers, Previous Year Question Paper.

LIST OF EXPERIMENTS: CD3281 Data Structures and Algorithms Laboratory

1. Implement simple ADTs as Python classes
2. Implement recursive algorithms in Python
3. Implement List ADT using Python arrays
4. Linked list implementations of List
5. Implementation of Stack and Queue ADTs
6. Applications of List, Stack and Queue ADTs
7. Implementation of sorting and searching algorithms
8. Implementation of Hash tables
9. Tree representation and traversal algorithms
10. Implementation of Binary Search Trees
11. Implementation of Heaps Lab Manual
12. Graph representation and Traversal algorithms
13. Implementation of single source shortest path algorithm
14. Implementation of minimum spanning tree algorithms

COURSE OUTCOMES: CD3281 Data Structures and Algorithms Laboratory

At the end of the course, the student should be able to:
CO1:Implement ADTs as Python classes
CO2:Design, implement, and analyse linear data structures, such as lists, queues, and stacks, according to the needs of different applications Lab Manual
CO3:Design, implement, and analyse efficient tree structures to meet requirements such as searching, indexing, and sorting
CO4:Model problems as graph problems and implement efficient graph algorithms to solve them

COURSE OBJECTIVES: CD3281 Data Structures and Algorithms Laboratory

 To implement ADTs in Python
 To design and implement linear data structures – lists, stacks, and queues
 To implement sorting, searching and hashing algorithms

Syllabus	Click Here
Notes	Click Here
Lab Manual	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOK: CD3281 Data Structures and Algorithms Laboratory

1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures & Algorithms in Python”, John Wiley & Sons Inc., 2013

REFERENCES: CD3281 Data Structures and Algorithms Laboratory

1. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons, 2011
2. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education, 1983. Lab Manual
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Introduction to Algorithms”, Second Edition, McGraw Hill, 2002.
4. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition, Pearson Education, 2014

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

CD3291 Data Structures and Algorithms

Post author By Mr. Padeepz
Post date August 27, 2022
No Comments on CD3291 Data Structures and Algorithms

CD3291 Data Structures and Algorithms Study Materials

Anna University – CD3291 Data Structures and Algorithms Regulation 2021 Syllabus, Notes, Important Questions, Question Paper with Answers, Previous Year Question Paper.

UNIT I ABSTRACT DATA TYPES CD3291 Data Structures and Algorithms Syllabus

Abstract Data Types (ADTs) – ADTs and classes – introduction to OOP – classes in Python – inheritance – namespaces – shallow and deep copying
Introduction to analysis of algorithms – asymptotic notations – divide & conquer – recursion – analyzing recursive algorithms

UNIT II LINEAR STRUCTURES CD3291 Data Structures and Algorithms Notes

List ADT – array-based implementations – linked list implementations – singly linked lists – circularly linked lists – doubly linked lists – Stack ADT – Queue ADT – double ended queues – applications

UNIT III SORTING AND SEARCHING CD3291 Data Structures and Algorithms Important Questions

Bubble sort – selection sort – insertion sort – merge sort – quick sort – analysis of sorting algorithms – linear search – binary search – hashing – hash functions – collision handling – load factors, rehashing, and efficiency

UNIT IV TREE STRUCTURES CD3291 Data Structures and Algorithms Question Paper

Tree ADT – Binary Tree ADT – tree traversals – binary search trees – AVL trees – heaps – multi-way search trees

UNIT V GRAPH STRUCTURES CD3291 Data Structures and Algorithms Question Bank

Graph ADT – representations of graph – graph traversals – DAG – topological ordering – greedy algorithms – dynamic programming – shortest paths – minimum spanning trees – introduction to complexity classes and intractability

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOK: CD3291 DSA Notes

1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures & Algorithms in Python”, An Indian Adaptation, John Wiley & Sons Inc., 2021

REFERENCES: CD3291 DSA Important Questions

1. Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python” Springer Edition 2015
2. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons, 2011
3. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Introduction to Algorithms”, Second Edition, McGraw Hill, 2002.
5. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition, Pearson Education, 2014

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

CS3361 Data Science Laboratory

Post author By Mr. Padeepz
Post date August 27, 2022
No Comments on CS3361 Data Science Laboratory

CS3361 Data Science Laboratory Study Materials

Anna University – CS3361 Data Science Laboratory Regulation 2021 Syllabus, Notes, Lab Manual Important Questions, Question Paper with Answers, Previous Year Question Paper.

COURSE OBJECTIVES: CS3361 Data Science Laboratory
 To understand the python libraries for data science
 To understand the basic Statistical and Probability measures for data science.
 To learn descriptive analytics on the benchmark data sets.
 To apply correlation and regression analytics on standard data sets.
 To present and interpret data using visualization packages in Python.

LIST OF EXPERIMENTS:
1. Download, install and explore the features of NumPy, SciPy, Jupyter, Statsmodels and Pandas packages.
2. Working with Numpy arrays
3. Working with Pandas data frames
4. Reading data from text files, Excel and the web and exploring various commands for doing descriptive analytics on the Iris data set. CS3361 Data Science Laboratory
5. Use the diabetes data set from UCI and Pima Indians Diabetes data set for performing the following:
a. Univariate analysis: Frequency, Mean, Median, Mode, Variance, Standard Deviation, Skewness and Kurtosis.
b. Bivariate analysis: Linear and logistic regression modeling
c. Multiple Regression analysis
d. Also compare the results of the above analysis for the two data sets.

6. Apply and explore various plotting functions on UCI data sets.
a. Normal curves
b. Density and contour plots
c. Correlation and scatter plots
d. Histograms CS3361 Data Science Laboratory Lab Manual
e. Three dimensional plotting
7. Visualizing Geographic Data with Basemap

Syllabus	Click Here
Notes	Click Here
Lab Manual	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

COURSE OUTCOMES: CS3361 Data Science Laboratory

At the end of this course, the students will be able to:
CO1: Make use of the python libraries for data science
CO2: Make use of the basic Statistical and Probability measures for data science. Lab Manual
CO3: Perform descriptive analytics on the benchmark data sets.
CO4: Perform correlation and regression analytics on standard data sets CS3361 Data Science Laboratory
CO5: Present and interpret data using visualization packages in Python.

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

CS3381 Object Oriented Programming Laboratory

Post author By Mr. Padeepz
Post date August 27, 2022
No Comments on CS3381 Object Oriented Programming Laboratory

CS3381 Object Oriented Programming Laboratory

Anna University – CS3381 Object Oriented Programming Laboratory Regulation 2021 Syllabus, Notes, Lab Manual Important Questions, Question Paper with Answers, Previous Year Question Paper.

COURSE OBJECTIVES: CS3381 Object Oriented Programming Laboratory

 To build software development skills using java programming for real-world applications.
 To understand and apply the concepts of classes, packages, interfaces, inheritance, exception handling and file processing.
 To develop applications using generic programming and event handling

LIST OF EXPERIMENTS: CS3381 Object Oriented Programming Laboratory

1. Solve problems by using sequential search, binary search, and quadratic sorting algorithms (selection, insertion)
2. Develop stack and queue data structures using classes and objects.
3. Develop a java application with an Employee class with Emp_name, Emp_id, Address, Mail_id, Mobile_no as members. Inherit the classes, Programmer, Assistant Professor, Associate Professor and Professor from employee class. Add Basic Pay (BP) as the member of all the inherited classes with 97% of BP as DA, 10 % of BP as HRA, 12% of
BP as PF, 0.1% of BP for staff club funds. Generate pay slips for the employees with their gross and net salary.
4. Write a Java Program to create an abstract class named Shape that contains two integers and an empty method named printArea(). Provide three classes named Rectangle, Triangle and Circle such that each one of the classes extends the class Shape. Each one of the classes contains only the method printArea( ) that prints the area of the given shape.
5. Solve the above problem using an interface.
6. Implement exception handling and creation of user defined exceptions. CS3381 Object Oriented Programming Laboratory Lab Manual

7. Write a java program that implements a multi-threaded application that has three threads. First thread generates a random integer every 1 second and if the value is even, the second thread computes the square of the number and prints. If the value is odd, the third thread will print the value of the cube of the number.
8. Write a program to perform file operations.
9. Develop applications to demonstrate the features of generics classes. CS3381 Object Oriented Programming Laboratory Lab Manual
10. Develop applications using JavaFX controls, layouts and menus.
11. Develop a mini project for any application using Java concepts.
Lab Requirements: for a batch of 30 students
Operating Systems: Linux / Windows
Front End Tools: Eclipse IDE / Netbeans IDE

Syllabus	Click Here
Notes	Click Here
Lab Manual	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

COURSE OUTCOMES: CS3381 Object Oriented Programming Laboratory

On completion of this course, the students will be able to
CO1 : Design and develop java programs using object oriented programming concepts
CO2 : Develop simple applications using object oriented concepts such as package, exceptions
CO3: Implement multithreading, and generics concepts
CO4 : Create GUIs and event driven programming applications for real world problems
CO5: Implement and deploy web applications using Java