CS8392 Syllabus OBJECT ORIENTED PROGRAMMING

CS8392 Syllabus OBJECT ORIENTED PROGRAMMING Regulation 2017 Anna University free download. OBJECT ORIENTED PROGRAMMING Syllabus CS8392 pdf free download.

UNIT I INTRODUCTION TO OOP AND JAVA FUNDAMENTALS CS8392 Syllabus OBJECT ORIENTED PROGRAMMING

Object Oriented Programming – Abstraction – objects and classes – Encapsulation- Inheritance – Polymorphism- OOP in Java – Characteristics of Java – The Java Environment – Java Source File -Structure – Compilation. Fundamental Programming Structures in Java – Defining classes in Java – constructors, methods -access specifiers – static members -Comments, Data Types, Variables, Operators, Control Flow, Arrays , Packages – JavaDoc comments.

UNIT II INHERITANCE AND INTERFACES CS8392 Syllabus OBJECT ORIENTED PROGRAMMING

Inheritance – Super classes- sub classes –Protected members – constructors in sub classes- the Object class – abstract classes and methods- final methods and classes – Interfaces – defining an interface, implementing interface, differences between classes and interfaces and extending interfaces – Object cloning -inner classes, Array Lists – Strings

UNIT III EXCEPTION HANDLING AND I/O CS8392 Syllabus OBJECT ORIENTED PROGRAMMING

Exceptions – exception hierarchy – throwing and catching exceptions – built-in exceptions, creating own exceptions, Stack Trace Elements. Input / Output Basics – Streams – Byte streams and Character streams – Reading and Writing Console – Reading and Writing Files

UNIT IV MULTITHREADING AND GENERIC PROGRAMMING CS8392 Syllabus OBJECT ORIENTED PROGRAMMING

Differences between multi-threading and multitasking, thread life cycle, creating threads, synchronizing threads, Inter-thread communication, daemon threads, thread groups. Generic Programming – Generic classes – generic methods – Bounded Types – Restrictions and Limitations.

UNIT V EVENT DRIVEN PROGRAMMING CS8392 OBJECT ORIENTED PROGRAMMING Syllabus

Graphics programming – Frame – Components – working with 2D shapes – Using color, fonts, and images – Basics of event handling – event handlers – adapter classes – actions – mouse events – AWT event hierarchy – Introduction to Swing – layout management – Swing Components – Text Fields , Text Areas – Buttons- Check Boxes – Radio Buttons – Lists- choices- Scrollbars – Windows –Menus – Dialog Boxes.

Subject name	OBJECT ORIENTED PROGRAMMING
Semester	3
Subject Code	CS8392
Regulation	2017 regulation

CS8392 Syllabus OBJECT ORIENTED PROGRAMMING Click here to download

CS8392 Notes OBJECT ORIENTED PROGRAMMING

---

CS8392 Important Questions Object Oriented Programming

---

CS8392 Question Bank Object Oriented Programming

---

CS8392 Question Papers Object Oriented Programming

CS8391 Syllabus Data Structures

CS8391 Syllabus Data Structures Regulation 2017 Anna University free download. Data Structures Syllabus CS8391 pdf free download.

UNIT I LINEAR DATA STRUCTURES – LIST CS8391 Syllabus Data Structures

Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation ––singly linked lists- circularly linked lists- doubly-linked lists – applications of lists –Polynomial Manipulation – All operations (Insertion, Deletion, Merge, Traversal).

UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES CS8391 Syllabus Data Structures

Stack ADT – Operations – Applications – Evaluating arithmetic expressions- Conversion of Infix to postfix expression – Queue ADT – Operations – Circular Queue – Priority Queue – deQueue – applications of queues.

UNIT III NON LINEAR DATA STRUCTURES – TREES CS8391 Syllabus Data Structures

Tree ADT – tree traversals – Binary Tree ADT – expression trees – applications of trees – binary search tree ADT –Threaded Binary Trees- AVL Trees – B-Tree – B+ Tree – Heap – Applications of heap.

UNIT IV NON LINEAR DATA STRUCTURES – GRAPHS CS8391 Data Structures Syllabus

Definition – Representation of Graph – Types of graph – Breadth-first traversal – Depth-first traversal – Topological Sort – Bi-connectivity – Cut vertex – Euler circuits – Applications of graphs.

UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES CS8391 Data Structures Syllabus

Searching- Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion sort – Shell sort – Radix sort. Hashing- Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing.

Subject name	Data Structures
Semester	3
Subject Code	CS8391
Regulation	2017 regulation

CS8391 Syllabus Data Structures Click here to download

CS8391 Notes Data Structures

---

CS8391 Important Questions Data Structures

---

CS8391 Question Bank Data Structures

---

CS8391 Question Paper Data Structures

 

CS8351 Syllabus Digital Principles and System Design

CS8351 Syllabus Digital Principles and System Design Regulation 2017 Anna University free download. Digital Principles and System Design Syllabus CS8351 pdf free download.

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES CS8351 Syllabus Digital Principles and System Design

Number Systems – Arithmetic Operations – Binary Codes- Boolean Algebra and Logic Gates – Theorems and Properties of Boolean Algebra – Boolean Functions – Canonical and Standard Forms – Simplification of Boolean Functions using Karnaugh Map – Logic Gates – NAND and NOR Implementations.

UNIT II COMBINATIONAL LOGIC CS8351 Syllabus Digital Principles and System Desig

Combinational Circuits – Analysis and Design Procedures – Binary Adder-Subtractor – Decimal Adder – Binary Multiplier – Magnitude Comparator – Decoders – Encoders – Multiplexers – Introduction to HDL – HDL Models of Combinational circuits.

UNIT III SYNCHRONOUS SEQUENTIAL LOGIC CS8351 Syllabus Digital Principles and System Design

Sequential Circuits – Storage Elements: Latches , Flip-Flops – Analysis of Clocked Sequential Circuits – State Reduction and Assignment – Design Procedure – Registers and Counters – HDL Models of Sequential Circuits.

UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC CS8351 Syllabus Digital Principles and System Design

Analysis and Design of Asynchronous Sequential Circuits – Reduction of State and Flow Tables – Race-free State Assignment – Hazards.

UNIT V MEMORY AND PROGRAMMABLE LOGIC CS8351 Digital Principles and System Design Syllabus

RAM – Memory Decoding – Error Detection and Correction – ROM – Programmable Logic Array – Programmable Array Logic – Sequential Programmable Devices.

Subject name	Digital Principles and System Design
Semester	3
Subject Code	CS8351
Regulation	2017 regulation

CS8351 Syllabus Digital Principles and System Design Click here to download

CS8351 Notes Digital Principles and System Design

---

CS8351 Important Questions Digital Principles and System Design

---

CS8351 Question Bank Digital Principles and System Design

 

MA8351 Syllabus Discrete Mathematics

MA8351 Syllabus Discrete Mathematics Regulation 2017 Anna University free download. Discrete Mathematics Syllabus MA8351 pdf free download.

UNIT I LOGIC AND PROOFS MA8351 Syllabus Discrete Mathematics

Propositional logic – Propositional equivalences – Predicates and quantifiers – Nested quantifiers – Rules of inference – Introduction to proofs – Proof methods and strategy.

UNIT II COMBINATORICS MA8351 Syllabus Discrete Mathematics

Mathematical induction – Strong induction and well ordering – The basics of counting – The pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear recurrence relations – Generating functions – Inclusion and exclusion principle and its applications

UNIT III GRAPHS MA8351 Discrete Mathematics Syllabus

Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.

UNIT IV ALGEBRAIC STRUCTURES MA8351 Discrete Mathematics Syllabus

Algebraic systems – Semi groups and monoids – Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.

UNIT V LATTICES AND BOOLEAN ALGEBRA MA8351 Discrete Mathematics Syllabus

Partial ordering – Posets – Lattices as posets – Properties of lattices – Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.

Subject name	Discrete Mathematics
Semester	3
Subject Code	MA8351
Regulation	2017 regulation

MA8351 Syllabus Discrete Mathematics Click here to download

MA8351 Notes Discrete Mathematics

---

MA8351 Important Questions Discrete Mathematics

---

MA8351 Questions Bank Discrete Mathematics

 

 

EC8361 Syllabus Analog and Digital Circuits Laboratory

EC8361 Syllabus Analog and Digital Circuits Laboratory Regulation 2017 Anna University free download. Analog and Digital Circuits Laboratory Syllabus EC8361 pdf free download.

OBJECTIVES: EC8361 Syllabus Analog and Digital Circuits Laboratory

The student should be made to:

 Study the Frequency response of CE, CB and CC Amplifier

 Learn the frequency response of CS Amplifiers

 Study the Transfer characteristics of differential amplifier

 Perform experiment to obtain the bandwidth of single stage and multistage amplifiers

 Perform SPICE simulation of Electronic Circuits

 Design and implement the Combinational and sequential logic circuits

LIST OF ANALOG EXPERIMENTS: EC8361 Syllabus Analog and Digital Circuits Laboratory

1. Design of Regulated Power supplies

2. Frequency Response of CE, CB, CC and CS amplifiers

3. Darlington Amplifier

4. Differential Amplifiers – Transfer characteristics, CMRR Measurement

5. Cascode and Cascade amplifiers

6. Determination of bandwidth of single stage and multistage amplifiers

7. Analysis of BJT with Fixed bias and Voltage divider bias using Spice

8. Analysis of FET, MOSFET with fixed bias, self-bias and voltage divider bias using simulation software like Spice

9. Analysis of Cascode and Cascade amplifiers using Spice

10. Analysis of Frequency Response of BJT and FET using Spice

LIST OF DIGITAL EXPERIMENTS EC8361 Syllabus Analog and Digital Circuits Laboratory

1. Design and implementation of code converters using logic gates(i) BCD to excess-3 code and vice versa (ii) Binary to gray and vice-versa

2. Design and implementation of 4 bit binary Adder/ Subtractor and BCD adder using IC 7483

3. Design and implementation of Multiplexer and De-multiplexer using logic gates

4. Design and implementation of encoder and decoder using logic gates

5. Construction and verification of 4 bit ripple counter and Mod-10 / Mod-12 Ripple counters

6. Design and implementation of 3-bit synchronous up/down counter

OUTCOMES: EC8361 Syllabus Analog and Digital Circuits Laboratory

On completion of this laboratory course, the student should be able to:
 Design and Test rectifiers, filters and regulated power supplies.
 Design and Test BJT/JFET amplifiers.
 Differentiate cascode and cascade amplifiers.
 Analyze the limitation in bandwidth of single stage and multi stage amplifier
 Measure CMRR in differential amplifier
 Simulate and analyze amplifier circuits using PSpice.
 Design and Test the digital logic circuits.

LAB REQUIREMENTS FOR A BATCH OF 30 STUDENTS, 2 STUDENTS / EXPERIMENT: EC8361 Syllabus Analog and Digital Circuits Laboratory

EQUIPMENTS FOR ANALOG LAB

1 CRO/DSO (30MHz) – 15 Nos.

2 Signal Generator /Function Generators (3 MHz) – 15 Nos

3 Dual Regulated Power Supplies ( 0 – 30V) – 15 Nos.

4 Standalone desktop PCs with SPICE software – 15 Nos.

5 Transistor/FET (BJT-NPN-PNP and NMOS/PMOS) – 50 Nos

6 Components and Accessories: Resistors, Capacitors, Inductors, diodes, Zener Diodes, Bread Boards, Transformers.

7 SPICE Circuit Simulation Software: (any public domain or commercial software)

Subject name	Analog and Digital Circuits Laboratory
Semester	3
Subject Code	EC8361
Regulation	2017 regulation

EC8361 Syllabus Analog and Digital Circuits Laboratory Click here to download

EC8381 Syllabus Fundamentals of Data Structures in C Laboratory

 

 

EC8381 Syllabus Fundamentals of Data Structures in C Laboratory

EC8381 Syllabus Fundamentals of Data Structures in C Laboratory Regulation 2017 Anna University free download. Fundamentals of Data Structures in C Laboratory Syllabus EC8381 pdf free download.

OBJECTIVES: EC8381 Syllabus Fundamentals of Data Structures in C Laboratory

 To understand and implement basic data structures using C

 To apply linear and non-linear data structures in problem solving.

 To learn to implement functions and recursive functions by means of data structures

 To implement searching and sorting algorithms

LIST OF EXERCISES EC8381 Syllabus Fundamentals of Data Structures in C Laboratory

1. Basic C Programs – looping, data manipulations, arrays

2. Programs using strings – string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

6. Linked list implementation of stacks and queues

7. Application of Stacks and Queues

8. Implementation of Trees, Tree Traversals

9. Implementation of Binary Search trees

10. Implementation of Linear search and binary search

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

OUTCOMES: EC8381 Syllabus Fundamentals of Data Structures in C Laboratory

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

 Write basic and advanced programs in C

 Implement functions and recursive functions in C

 Implement data structures using C

 Choose appropriate sorting algorithm for an application and implement it in a modularized way

Subject name	Fundamentals of Data Structures in C Laboratory
Semester	3
Subject Code	EC8381
Regulation	2017 regulation

EC8381 Syllabus Fundamentals of Data Structures in C Laboratory Click here to download

EC8361 Syllabus Analog and Digital Circuits Laboratory