#Advanced Data Structures and Algorithm #ADSA #ADS&A #Computer Organization #CO #Digital Electronics and Micro Processors #DE&MP #DEMP #Object Oriented Programing-JAVA #OOPJ #Descrete Mathematics #DMGT #DM> #ADS
- Advanced Data Structures & Algorithms
Unit 1: Introduction to Algorithms - Download PDF
Algorithms, Pseudocode for expressing algorithms, Performance Analysis-Space complexity, Time complexity, Asymptotic Notation- Big oh, Omega, Theta notation and Little oh notation, Polynomial Vs Exponential Algorithms, Average, Best and Worst Case Complexities, Analysing Recursive Programs.Unit 2: Trees Part-I - Download PDFBinary Search Trees: Definition and Operations, AVL Trees: Definition and Operations, Applications.B Trees: Definition and Operations.Unit 3: Trees Part-II - Download PDF
Red-Black Trees, Splay Trees, Applications.
Hash Tables: Introduction, Hash Structure, Hash functions, Linear Open Addressing, Chaining and Applications.Unit 4: Divide and conquer, Greedy method - Download PDFDivide and conquer: General method, applications-Binary search, Finding Maximum and minimum,
Quick sort, Merge sort, Strassen’s matrix multiplication.
Greedy method: General method, applications-Job sequencing with deadlines, knapsack problem, Minimum cost spanning trees, Single source shortest path problem.Unit 5: Dynamic Programming & Backtracking - Download PDFDynamic Programming: General method, applications- 0/1 knapsack problem, All pairs shortest path problem, Travelling salesperson problem, Reliability design.
Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.
Introduction to NP-Hard and NP-Complete problems: Basic Concepts.
Unit 1: Introduction to Algorithms - Download PDF
Algorithms, Pseudocode for expressing algorithms, Performance Analysis-Space complexity, Time complexity, Asymptotic Notation- Big oh, Omega, Theta notation and Little oh notation, Polynomial Vs Exponential Algorithms, Average, Best and Worst Case Complexities, Analysing Recursive Programs.Unit 2: Trees Part-I - Download PDFBinary Search Trees: Definition and Operations, AVL Trees: Definition and Operations, Applications.B Trees: Definition and Operations.Unit 3: Trees Part-II - Download PDF
Red-Black Trees, Splay Trees, Applications.
Hash Tables: Introduction, Hash Structure, Hash functions, Linear Open Addressing, Chaining and Applications.Unit 4: Divide and conquer, Greedy method - Download PDFDivide and conquer: General method, applications-Binary search, Finding Maximum and minimum,
Quick sort, Merge sort, Strassen’s matrix multiplication.
Greedy method: General method, applications-Job sequencing with deadlines, knapsack problem, Minimum cost spanning trees, Single source shortest path problem.Unit 5: Dynamic Programming & Backtracking - Download PDFDynamic Programming: General method, applications- 0/1 knapsack problem, All pairs shortest path problem, Travelling salesperson problem, Reliability design.
Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.
Introduction to NP-Hard and NP-Complete problems: Basic Concepts.
- Computer Organization
Unit 1: Basic Structure of Computer, Machine Instructions and Programs - Download PDFBasic Structure of Computer: Computer Types, Functional Units, Basic operational Concepts, Bus Structure, Software, Performance, Multiprocessors and Multicomputer. Machine Instructions and Programs: Numbers, Arithmetic Operations and Programs, Instructions and Instruction Sequencing, Addressing Modes, Basic Input/output Operations, Stacks and Queues, Subroutines, Additional Instructions.Unit 2: Arithmetic, Basic Processing - Download PDFArithmetic: Addition and Subtraction of Signed Numbers, Design of Fast Adders, Multiplication of Positive Numbers, Signed-operand Multiplication, Fast Multiplication, Integer Division, Floating-Point Numbers and Operations.Basic Processing Unit: Fundamental Concepts, Execution of a Complete Instruction, Multiple-Bus Organization, Hardwired Control, and Multi programmed Control.Unit 3: The Memory System - Download PDFThe Memory System: Basic Concepts, Semiconductor RAM Memories, Read-Only Memories, Speed, Size and Cost, Cache Memories, Performance Considerations, Virtual Memories, Memory Management Requirements, Secondary Storage.Unit 4: Input/Output Organization - Download PDFInput/Output Organization: Accessing I/O Devices, Interrupts, Processor Examples, Direct Memory Access, Buses, Interface Circuits, Standard I/O Interfaces.Unit 5: Pipelining, Large Computer Systems - Download PDFPipelining: Basic Concepts, Data Hazards, Instruction Hazards, Influence on Instruction Sets.Large Computer Systems: Forms of Parallel Processing, Array Processors, The Structure of General-Purpose multiprocessors, Interconnection Networks.
- Digital Electronics & Micro Processors
Unit 1: Number Systems & Code Conversion - Download PDFNumber Systems & Code conversion, Boolean Algebra & Logic Gates, Truth Tables, Universal Gates, Simplification of Boolean functions, SOP and POS methods – Simplification of Boolean functions using K-maps, Signed and Unsigned Binary Numbers.Unit 2: Combinational Circuits - Download PDFCombinational Logic Circuits: Adders &Subtractors, Multiplexers, Demultiplexers, Encoders,Decoders, Programmable Logic Devices.Unit 3: Sequential Circuits - Download PDFSequential Logic Circuits: RS, Clocked RS, D, JK, Master Slave JK, T Flip-Flops, Shift Registers, Types of Shift Registers, Counters, Ripple Counter, Synchronous Counters, Asynchronous Counters, Up-Down Counter.Unit 4: Microprocessors - I - Download PDF8085 microprocessor Review (brief details only), 8086 microprocessor, Functional Diagram, register organization 8086, Flag register of 8086 and its functions, Addressing modes of 8086, Pin diagram of 8086, Minimum mode & Maximum mode operation of 8086, Interrupts in 8086.Unit 5: Microprocessors - II - Download PDFInstruction set of 8086, Assembler directives, Procedures and Macros, Simple programs involving arithmetic, logical, branch instructions, Ascending, Descending and Block move programs, String Manipulation Instructions. Overview of 8051 microcontroller, Architecture, I/O ports and Memory organization, addressing modes and instruction set of 8051(Brief details only), Simple Programs.
- Object Oriented Programming-Java
Unit 1: Introduction - Download PDF
Introduction: Introduction to Object Oriented Programming, The History and Evolution of Java,
Introduction to Classes, Objects, Methods, Constructors, this keyword, Garbage Collection, Data Types, Variables, Type Conversion and Casting, Arrays, Operators, Control Statements, Method Overloading, Constructor Overloading, Parameter Passing, Recursion, String Class and String handling methods.
Unit 2: Inheritance, Packages, Interfaces - Download PDF
Inheritance: Basics, Using Super, Creating Multilevel hierarchy, Method overriding, Dynamic Method Dispatch, Using Abstract classes, Using final with inheritance, Object class,
Packages: Basics, Finding packages and CLASSPATH, Access Protection, Importing packages.
Interfaces: Definition, Implementing Interfaces, Extending Interfaces, Nested Interfaces, Applying Interfaces, Variables in Interfaces.
Unit 3: Exception handling, Stream based I/O - Download PDF
Exception handling - Fundamentals, Exception types, Uncaught exceptions, using try and catch, multiple catch clauses, nested try statements, throw, throws and finally, built-in exceptions, creating own exception subclasses.
Stream based I/O (java.io) – The Stream classes-Byte streams and Character streams, Reading console Input and Writing Console Output, File class, Reading and Writing Files, Random access file operations, The Console class, Serialization, Enumerations, Autoboxing, Generics.
Unit 4: Multithreading, The Collections Framework - Download PDF
Multithreading: The Java thread model, Creating threads, Thread priorities, Synchronizing threads, Interthread communication.
The Collections Framework (java.util): Collections overview, Collection Interfaces, The Collection classes- Array List, Linked List, Hash Set, Tree Set, Priority Queue, Array Deque. Hashtable, Properties, Stack, Vector, String Tokenizer, Bit Set, Date, Calendar, Random, Formatter, Scanner.
Unit 5: Applet, GUI Programming with Swings, Accessing Databases
with JDBC - Download PDF
Applet: Basics, Architecture, Applet Skeleton, requesting repainting, using the status window, passing parameters to applets GUI Programming with Swings – The origin and design philosophy of swing, components and containers, layout managers, event handling, using a push button, jtextfield, jlabel and image icon, the swing buttons, jtext field, jscrollpane, jlist, jcombobox, trees, jtable, An overview of jmenubar, jmenu and jmenuitem, creating a main menu, showmessagedialog, showconfirmdialog, showinputdialog, showoptiondialog, jdialog, create a modeless dialog.
Accessing Databases with JDBC: Types of Drivers, JDBC Architecture, JDBC classes and Interfaces, Basic steps in developing JDBC applications, Creating a new database and table with JDBC.
- Discrete Mathematics & Graph Theory
Unit 1: Mathematical Logic - Download PDFIntroduction, Statements and Notation, Connectives, Well-formed formulas, Tautology, Duality law, Equivalence, Implication, Normal Forms, Functionally complete set of connectives, Inference Theory of Statement Calculus, Predicate Calculus, Inference theory of Predicate Calculus.Unit 2: Set theory - Download PDFBasic Concepts of Set Theory, Relations and Ordering, The Principle of Inclusion-Exclusion, Pigeon hole principle and its application, Functions composition of functions, Inverse Functions, Recursive Functions, Lattices and its properties. Algebraic structures: Algebraic systems-Examples and General Properties, Semi groups and Monoids, groups, sub groups, homomorphism, Isomorphism.Unit 3: Elementary Combinatorics - Download PDFBasics of Counting, Combinations and Permutations, Enumeration of Combinations and Permutations, Enumerating Combinations and Permutations with Repetitions, Enumerating Permutations with Constrained Repetitions, Binomial Coefficients, The Binomial and Multinomial Theorems.Unit 4: Recurrence Relations - Download PDFGenerating Functions of Sequences, Calculating Coefficients of Generating Functions, Recurrence relations, Solving Recurrence Relations by Substitution and Generating functions, The Method of Characteristic roots, Solutions of Inhomogeneous Recurrence Relations.Unit 5: Graphs - Download PDFBasic Concepts, Isomorphism and Subgraphs, Trees and their Properties, Spanning Trees, Directed Trees, Binary Trees, Planar Graphs, Euler’s Formula, Multigraphs and Euler Circuits, Hamiltonian Graphs, Chromatic Numbers, The Four Color Problem.
Tags:
Advanced Data Structures & Algorithms
Computer Organization
Digital Electronics & Micro Processors
Discrete Mathematics & Graph Theory
Object Oriented Programming-Java
Web Application Development