Design Patterns Regular Question Paper R15 Nov/Dec

Simple Stress and Strains, Strain Energy ,Shear Force and Bending Moment ,Flexural Stresses, Shear Stresses,Principal Stresses and Strains,Theories of Elastic Failure of Materials,Deflection of Beams.

History of Java,Java buzzwords,Data types,Variables,Simple java program,Scope and life time of variables,Operators, expressions, control statements,Type conversion and casting,Arrays,Classes and objects – concepts of classes, objects,Constructors, methods,Access control,This keyword,Garbage collection,Overloading methods and constructors,Parameter passing,Recursion,String handling.

Power Electronics For Nueral and Fuzzy Systems

This paper consists of the basic working, types, advantages, limitations, and applications of ANNs.

The Product,The Process,Project Management Concepts,Software Process and Project Metrics, Software Project Planning,Risk Analysis and Management,Project Scheduling and Tracking, Software Quality Assurance, Software Configuration Management, System Engineering,Analysis Concepts and Principles,Analysis Modeling,Design Concepts and Principles,Architectural Design,User Interface Design,Component-Level Design ,Software Testing Techniques,Software Testing Strategies,Technical Metrics for Software,Object-Oriented Concepts and Principles,Object-Oriented Analysis,Object-Oriented Design,Object-Oriented Testing,Technical Metrics for Object-Oriented Systems,Formal Methods,Cleanroom Software Engineering,Component-Based Software Engineering,Client/Server Software Engineering,Web Engineering,Reengineering,Computer-Aided Software Engineering,The Road Ahead.

WHAT IS AN ALGORITHM?,ALGORITHM SPECIFICATION,PERFORMANCE ANALYSIS,RANDOMIZED ALGORITHMS,REFERENCES AND READINGS,ELEMENTARY DATA STRUCTURES, STACKS AND QUEUES, TREES, DICTIONARIES, PRIORITY QUEUES, SETS AND DISJOINT SET UNION,DIVIDE-AND-CONQUER,GENERAL METHOD,BINARY SEARCH,FINDING THE MAXIMUM AND MINIMUM,MERGE SORT,QUICKSORT,SELECTION,STRASSEN'S MATRIX MULTIPLICATION,CONVEX HULL,THE GREEDY METHOD,THE GENERAL METHOD,KNAPSACK PROBLEM,TREE VERTEX SPLITTING,JOB SEQUENCING WITH DEADLINES,MINIMUM-COST SPANNING TREES,OPTIMAL STORAGE ON TAPES,OPTIMAL MERGE PATEERNS,SINGLE-SOURCE SHORTEST PATHS,DYNAMIC PROGRAMMING,THE GENERAL METHOD,MULTISTAGE GRAPHS,ALL PAIRS SHORTEST PATTIS,SINGLE-SOURCE SHORTEST PATHS,GENERAL WEIGHTS,OPTIMAL BINARY SEARCH TREES,STRING EDITING,0/ I-KNAPSACK,RELIABILITY DESIGN,THE TRAVELING SALESPERSON PROBLEM,FLOW SHOP SCHEDULING,BASIC TRAVERSAL AND SEARCH TECHNIQUES,TECHNIQUES FOR BINARY TREES,TECHNIQUES FOR GRAPHS,CONNECTED COMPONENTS AND SPANNING TREES,BICONNECTED COMPONENTS AND DFS,BACKTRACKING,THE GENERAL METHOD,THE 8-QUEENS PROBLEM,SUM OF SUBSETS,GRAPH COLORING,HAMILTONIAN CYCLES,KNAPSACK PROBLEM,BRANCH-AND-BOUND,THE METHOD,0/1 KNAPSACK PROBLEM,TRAVELING SALESPERSON (s),EFFICIENCY CONSIDERATIONS,EVALUATION AND INTERPOLATION,THE FAST FOURIER TRANSFORM,MODULAR ARITHMETIC,EVEN FASTER EVALUATION AND INTERPOLATION,LOWER BOUND THEORY,COMPARISON TREES,ORACLES AND ADVERSARY ARGUMENTS,LOWER BOUNDS THROUGH REDUCTIONS,NP-HARD AND NP-COMPLETE PROBLEMS,COOK'S THEOREM,NP-HARD GRAPH PROBLEMS,NP-HARD SCHEDULING PROBLEMS,NP-HARD CODE GENERATION PROBLEMS,SOME SIMPLIFIED NP-HARD PROBLEMS,APPROXIMATION ALGORITHMS,ABSOLUTE APPROXIMATIONS, GAPPROXIMATIONS,COMPUTING THE CONVEX HULL,LOWER BOUNDS,MESH ALGORITHMS,COMPUTATIONAL MODEL,PACKET ROUTING,FUNDAMENTAL LGORITHMS,SELECTION,MERGING,SORTING,GRAPH PROBLEMS, COMPUTING THE CONVEX HULL, HYPERCUBE ALGORITHMS, COMPUTATIONAL MODEL,PPR ROUTING,FUNDAMENTAL ALGORITHMS,SELECTION,MERGING,SORTING,GRAPH PROBLEMS.

Introduction, Network Models,Physical Layer and Media,Data and Signals,Digital Transmission,Analog Transmission,Bandwidth Utilization: Multiplexing and Spreading,Transmission Media,Switching,Using Telephone and Cable Networksfor Data Transmission,Data Link Layer,Error Detection and Correction,Data Link Control,Multiple Access,Wired LANs: Ethernet,Wireless LANs,Connecting LANs, Backbone Networks, and Virtual LANs,Wireless WANs: Cellular Telephone and Satellite Networks,SONETISDH,Virtual-Circuit Nenvorks: Frame Relay and ATM,Network Layer,Netvvork Layer: Logical Addressing,Netvvork Layer: Internet Protocol,Network Layer: Address Mapping, Error Reporting and Multicasting,Network Layer: Delivery, Forwarding, and Routing,Transport Layer,Process-to-Process Delivery: UDP, TCP, and SCTP,Congestion Control and Quality Science,Application Layer,Domain Name System,Remote Logging, Electronic Mail and File Transfer,WWW and HTTP,Network Management: SNMP,Multimedia,Security,Cryptography, Network Security,Security in the Internet: IPSec, SSLlTLS, PCp, VPN and Firewalls.

Mathematical Logic,Logical connectives with symbols, Conjunction, Disjunction, Conditional, Bi-Conditional,Converse,Contrapositive,Normal forms,Minterms, PDNF, PCNF, Predicate Caluclus, Rules of inference, Modulus tollens, Tautological equallences, Direct proof method,Set Theory,Venn diagram,Cartesian product, Realtion, Inverse relatiton, Properties of relations, Hasse diagram,Functions, ALgebraic structure,Monoid, Recidue modulo classes, Elementary Combinatorics, Binomial Theorem, Basics of counting, Permutations and Combinations, Principle of Inclusion and Exclusion,Recurence Relations, Srtring, Mathematical Induction, Recursion & its working rule, Linear recurence relations with constant coefficients, Graph Theory, Order, Incident and degree, K-Regular Map, Degree sequence, Directed Graphs, Matrix representation of graphs, Complement of a graph, Isomorphism on graphs, Euler's Formula, Eularian graphs, Euler circuit, Hamiltonian path & Graph, Rules for constructing hamiltonian path and cycles in a graph 'g', Tree Search ALgorithms, Minimal Spanning Tree, Krushkal's Algorithm, Prim's Algorithm, Tree Traversal Techniques, Graph Colouring, Chromatic numbers.

DLD, Minimization of Gate Level Functions, Combinational Circuit, Sequential Circuit, Memory.

Electronic Devices and Circuits Important questions as per unit wise

TRANSISTOR AND FET CHARACTERISTICS : Transistor Operation,Current components in a transistor,Transistor circuit configurations,Common – Base (CB) configurations,Current Amplification Factor,Common-Emitter (CE) configuration,Common – Collector (CC) Configuration,Characteristics of Common-Base Circuit,Early effect (or) Base – Width modulation,Punch Through (or) Reach Through,Transistor Parameters,Characteristics of Common-Emitter Circuit, Characteristics of common collector circuit,FIELD EFFECT TRANSISTOR : Construction of N-Channel JFET,Structure and Symbol of P-Channel JFET,Metal Oxide Semiconductor Field Effect Transistor (MOSFET).

EDC Numerical Problems for Dept of ECE

EDC Numerical Problems on Semiconductor for Dept of ECE

Breakdown Mechanisms in a diode : Avalanche Breakdown,Zener Breakdown,Temperature dependence of break down voltages,PN- Diode Applications,Equivalent circuit of Zener diode,Voltage Regulators,Load Regulation,Varactor Diode,Tunnel diode,The volt-ampere characteristic,Transformer,Rectifier,Half-Wave Rectifier,Problems from previous external question paper,,Full-Wave Rectifier,Bridge Rectifier,Filters,Capacitor Filter,L-Section Filter (or) LC Filter,Critical Inductance,CLC Filter.