ANNA UNIVERSITY NOTES: June 2010

PART A-(10*2=20MARKS)

1.What is cavitation?
2.What is sonogram?
3.What are different methods of achieving population inversion?
4.Distinguish between homo junction and hetero-junction semiconductor lasers.
5.A signal of 100 mW is injected into fiber. The out coming signal from the other end is 40 mW.
Find the loss in dB?
6.What is meant by splicing in fiber optics?
7.Calculate the equivalent wavelength of electrons moving with velocity of 3*10^7 m/s.
8.What is Compton effect?Write an expression for the Compton wavelength.
9.For a cubic crystal draw the planes with Miller indies(110) and(001).
10.What are Frenkly Schhottky imperfections?

PART-B--(5*16=80)MARKS

11.(a)(i)Explain how ultrasonic can be produced by using magnetostriction method.(12)
(ii)Write any four applications of ultrasonic waves (4)
(or)
(b)In ultrasonic NDT what are the three different scan displays in common use? Explain (10+6)

12.(a)For atomic transitions, derive Einstein relations and hence deduce the expression for the ratio of spontaneous emission rate to the stimulated emission rate.
(or)
(b)What is holography?Describe the construction and reconstruction methods of a hologram.(4+6+6)

13.(a)(i)How are fibers classified?Explain the classification in detail.(8)
(ii)Explain double crucible method of fiber manufacturing.(8)
(or)
(b)(i)Explain the construction and working of displacement and temperature
fiber optic sensors (5+5)
(ii)Explain the construction and working of fiber-optic medical endoscope.(6)

14.(a)(i)Write a note on black body radiation.
(ii)Derive Planck's law radiation.
(or)
(b)(i)What is the principle of electron microscopy? Compare it wroth optical microscope. (4)
(ii)With schematic diagram explain the construction and working of scanning electron
microscope. (12)

15.(a)(i)Explain the terms:atomic radius, coordination number and packing factor.(6)
(ii)Show that the packing factor for Face Centered Cubic and Hexagonal Closed Packed stuctures are equal . (10)
(or)
(b)(i)What are Miller in dices?Explain. (4)
(ii)Derive an expression for the inter planar spacing for(hkl) planes of a cubic
structure.(10)
(iii)Calculate the inter planar for the spacing for(101) plane in a simple cubic crystal whose lattice constant is 0.42nm. (2)

PRINCIPLES OF MANAGEMENT - UN IVERSITY QUESTION PAPER

ANNA UNIVERSITY – COIMBATORE
B.E.\B.TECH.DEGREE-EXAMINATION-DECEMBER 2009
FIFTH SEMESTER-ELECTRONICS & COMMUNICATION ENGG.
PRINCIPLES OF MANAGEMENT

PART A-(2*20=40)
1. What are the streams related to Neo-classical theory.
2. What is a system.
3. Who are all the major contributors to contingency approach of management.
4. What are the functions of management.
5. What are two views on strategy.
6. What are various types of plans based on time.
7. Define policy.
8. What is meant by good alternative.
9. What is meant by formal organization.
10. What are the benefits of staff authority.
11. What is meant by delegation of authority.
12. Define staffing.
13. Define leadership.
14. Define creativity.
15. What is meant by job enrichment.
16. What are the barriers of communication.
17. State few control techniques.
18. What are the types of managerial control.
19. Define productivity.
20. Define budget.

PART B-(5*12=60)

21. A) Explain the challenges that are faced by the management. (4)
B) Describe Henry Fayol’s principles of Management. (8)
22. A) Explain the various steps involved in planning. (8)
B) Explain the elements of most effective MBO systems.
23. A) Explain the common problems and difficulties faced in decision making process. (6)
B) Describe the four approaches of selection process. (6)
24. A) Describe the basis for departmentation. (8)
B) Explain the significance of selection process (4)
25. A) Explain the significance of staffing function. (6)
B) Describe various style of leadership. (6)
26. A) Explain the role of Non-Financial incentives in Motivation (8)
B) What are the advantages of job enrichment.
27. A) What are the characteristics features of controlling. Explain. (4)
B) Explain the process f communication.
28. A) Explain the essential elements of control system (4)
B) Describe the essential requirements for good control system. (8).

DIGITAL SIGNAL PROCESSING - UNIVERSITY QUESTION PAPER

ANNA UNIVERSITY – COIMBATORE
B.E.\B.TECH.DEGREE-EXAMINATION-DECEMBER 2009
FIFTH SEMESTER-ELECTRONICS & COMMUNICATION ENGG.
DIGITAL SIGNAL PROCESSING

PART A-(2*20=40)
1. Define twiddle factor of FFT.
2. The first five DFT coefficients of a sequence x(n) are X(0)=20, X(1)=5+j2, X(2)=0, X(3)=0.2+j0.4, X(4)=0. Determine the remaining DFT coefficients.
3. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64-point sequence.
4. What is zero padding. What are its uses.
5. What are the desirable and undesirable features of FIR filters.
6. What is the necessary and sufficient condition for linear phase characteristics in FIR filter.
7. Define Gibb’s phenomenon.
8. Draw the direct form I structure for the second order system function
H(z)= b0+b1z-1+b2z-2
1+a1z-1+a2z-2
9. Find the digital filter transfer function H(z) by using impulse invariant method.
for the analog transfer function H(s)=1/(S+2).
10. Give any two properties of Butterworth filter.
11. What is warping effect. What is the effect on magnitude and phase responses.
12. Mention any two procedures for digitizing the transfer function of an analog filter.
13. What are the quantization errors due to finite word length registers in digital filters.
14. What is overflow oscillations. What are the methods to prevent it.
15. Define a Deadband of a filter.
16. The filter coefficient H=-0.673 is represented by sign magnitude fixed point arithmetic. If the word length is 6 bits, compute the quantization error due to truncation.
17. What are the addressing modes of TMS320C50.
18. What is the advantage of Harvard architecture of TMS320 series.
19. What is the different buses of TMS320C50.
20. What are the arithmetic instructions of C50.

PART B-(5*12=60)

21. A) Find the 8 point DFT of the given sequence x(n)={0,1,2,3,4,5,6,7} using Dif radix-2 FFT algorithm. (8)
B) Perform the circular convolution of the following two sequences using matrix method. X1(n)={2,1,2,1} , X2(n)={1,2,3,4} (4)

22. A) Design an idea Hilbert transformer having frequency response
H(ej?)=j for -p=?=0.
= - j for 0=?=p. Using rectangular window for N=11. (8)
B) Realize the following system function using minimum number of multipliers (4)
H(z)=1+1z-1+1z-2+1z-3+1z-4+z-5
3 4 4 3
23. Design a digital Butter-worth filter satisfying the constraints. 0.707=¦H(ej?)¦= for 0=?= p/2.
¦H(ej?)¦=0.2 for 3p/4=?= p.
With T=1 sec using bi-linear transformation.
24. A) The input to the system y(n)=0.999y(n-1)+x(n) is applied to an ADC. What is the power produced by the quantization noise at the output of the filter if the input is quantized to (i) 8 bits (ii) 16 bits. (8)
B) Compare fixed point and floating point arithmetic. (4)
25. A) With a neat block diagram explain in detail the architecture of TMS320C50. (8)
B) Write short notes on pipelining. (4)
26. Design a high pass filter with Hamming window with a cut-off frequency of 1.2 radians/sec and N=9.
27. Consider the transfer function H(z)=H1(z) where H1(z)=1/(1-a1z-1) and H2(z)=1/(1-a2z-1). Assume a1=0.5 and a2=0.6 and find the output round off noise power.
28. A) Calculate the DFT of the sequence X(n) = {1,1,-2,-2}. (6)
B) Find the output y(n) of a filter whose impulse response is h(n)= {1,1,1} and input signal x(n)= {3,-1,0,1,3,2,0,1,2,1} using overlap save method.

CONTROL SYSTEMS - UNIVERSITY QUESTION PAPER

ANNA UNIVERSITY – COIMBATORE
B.E.\B.TECH.DEGREE-EXAMINATION-DECEMBER 2009
FIFTH SEMESTER-ELECTRONICS & COMMUNICATION ENGG.
CONTROL SYSTEMS

PART A-(2*20=40)
1. What is the use of mason’s gain formula.
2. Give two examples for open loop and closed loop systems.
3. What do you meant by analogous systems.
4. What are the frequency domain specifications.
5. What are the advantages and disadvantages of feedback control systems.
6. How can we classify second order system based on damping ratio.
7. Define gain margin.
8. Define resonant frequency.
9. State Routh stability criterion.
10. Define Nyquist stability criterion.
11. What are the difference between state space analysis and Transfer function analysis.
12. What are root loci.
13. What is servomechanism.
14. What are the different types of controller.
15. What is synchro.
16. Name the test signals used in control systems.
17. What is polar plot.
18. Give examples for frequency response plot.
19. Write down state mode and output model of state space systems.
20. What do you mean by decomposition of transfer function.

PART B-(5*12=60)

21. A) A unity feedback system has an open loop transfer function G(s)=k/s(s+10). If the damping ratio is 0.5 determine (i) the value of k, (ii) peak overshoot, (iii) time to peak overshoot, (iv) settling time. (8) B) For a unity feedback whose G(s)=1/s(s+1) the input signal is r(t)= 4+6t+2t3. Find the generalized error coefficients. (4)
22. For the given block diagram find corresponding signal flow graph and evaluate closed loop transfer function relating to output and input.
23. Determine the value of k for a unity feedback control system have open loop transfer function G(s)H(s)=k/s(s+2)(s+4) such that (i)gain margin =20db (ii) phase margin =600.
24. Investigate the F(s) for stability using RH criterion (i) F(s) =s4+ks2+(k+1)s+2 (ii) F(s)=s4+s3+3s2+s+6 (iii) F(s)=s5+s4+2s3+2s2+6s+6
25. Obtain the state space model of the system with transfer function C(s)=s2+3s+2
in phase Variable form. R(s) s2+7s+12
26. A system characterized by the following state equation
Find (i) Transfer function of the system (ii) State transition matrix.
27. Sketch the root locus for the system with characteristic equation 1+G(s)H(s)=K(s+2)(s+3)
(s+1)(s-1)
28. Find transfer function of field controlled DC servo motor.

ELECTRONIC CIRCUITS - UNIVERSITY QUESTION PAPER

ANNA UNIVERSITY – CHENNAI
B.E.\B.TECH.DEGREE-EXAMINATION-DECEMBER 2009
THIRD SEMESTER-ELECTRONICS &COMMUNICATIONS ENGG.
ELECTRONIC CIRCUITS-I

PART A-(2*10=20)
1. Define stability factor.
2. Draw the fixed bias single stage transistor circuit.
3. Define CMRR.
4. Draw the small signal equivalent circuit of FET.
5. Two amplifiers having gain 20db and 40db are cascaded. Find the overall gain in db.
6. Define bandwidth.
7. What is theoretical maximum conversion efficiency of class A power amplifier.
8. What is distortion in power amplifiers.
9. Draw the full wave bridge rectifier circuit.
10. What are the advantages of SMPS over conventional regulators.

PART B-(5*16=80)

11. A) (i) For the transistor circuit in fig. find the Q-point. Vcc=15v, B=100, VBE=0.7V

(ii) Calculate the stability factor for a fixed bias circuit.
B) Discuss the various techniques of stabilization of Q-point in a transistor.

12. A) For the CC transistor amplifier circuit, find the expressions for input impedance and voltage gain. Assume suitable model for transistor. (Or)
B) (i) Discuss the working of a basic emitter coupled differential amplifier circuit (8)
(ii) Compare CB, CE and CC amplifiers. (8)

13. A) (i) Discuss the frequency response of multistage amplifiers. Calculate the overall upper and lower cutoff frequencies. (10)
(ii) Discuss the terms rise time and sag. (6) (Or)
B) Discuss the high frequency equivalent circuit of FET and hence derive gain bandwidth product for any one configuration.
14. A) (i) Derive the theoretical max conversion efficiency of class B power amplifier. (10)

(ii) Write short notes on power MOSFET amplifier. (6) (Or)
B) Describe the distortion in power amplifier and the methods to eliminate the same.

15. A) Explain the circuit of voltage regulator and also discuss the short circuit protection mechanism. (Or)
B) (i) Explain the power control method using SCR.
(ii) Design zener regulator for following specification Vin=8v to 12v; Vo=10v, RL=10kO. Assume that zener diode is ideal.

VLSI DESIGN - UNIVERSITY QUESTION PAPER

B.E/B.Tech Degree Examination,November/December 2009.
Seventh Semester
Electronics and Communication Engineering
EC 1401-VLSI DESIGN
(Common to B.E.(Part-Time) Sixth Semester Regulation 2005)
(Regulation 2004)

Part A-(10*2=20 marks)
1.What are the different MOS layers?
2.What are the two types of layout design rules?
3.Define rise time and fall time.
4.What is a pull down device?
5.What are the difference between task and function?
6.What is the difference between === and == ?
7.What is CBIC ?
8.Draw an assert high switch condition if input = 0 and input =1.
9.What do you mean by DFT?
10.Draw the boundary scan input logic diagram.

Part B - (5*16=80 marks)

11.a) Discuss the steps involved in IC fabrication process.(16)
Or
b) Describe n-well process in detail.(16)

12.a)i)Explain the DC characteristics of CMOS inverter with neat sketch.(8)
ii)Explain channel length modulation and body effect.(8)
Or
b)i)Explain the different regions of operation in a MOS transistor.(10)
ii)Write a note on MOS models.(6)

13.a)Explain in detail any five operators used in HDL .(16)
Or
b)i)Write the verilog code for 4 bit ripple carry full adder.(10)
ii)Give the structural description for priority encoder using verilog.(6)

14.a)Explain in detail the sequence of steps to design an ASIC.(16)
Or
b)Describe in detail the chip with programmable logic structures.(16)

15.a)Explain in detail Scan Based Test Techniques.(16)
Or
b)Discuss the three main design strategies for testability.(16)

Tuesday, June 22, 2010

Software Engineering - Notes

Software Engineering Syllabus Book

ROGER PRESSMAN (SIXTH EDITION)

DOWNLOAD

PART-1

PART-2

PART-3

Computer Graphics - Notes

COMPUTER GRAPHICS - SYLLABUS BOOK

DOWNLOAD

WEB PROGRAMMING - Notes

Syllabus Books

Unit 1 and Unit 2: Download

Unit 3,4 and 5: Download

Monday, June 21, 2010

Web Programming Lab - Syllabus

MC9238 WEB PROGRAMMING LAB
L T P C
0 0 3 2
1. Studying internet connection procedures
2. Sending and receiving mails from one or more email clients
3. Video Conferencing demonstration
4. Downloading and installing softwares (Example: Java) and setting up path and class path
5. Using FTP
6. Creation of web site with forms, frames, links, tables etc with any web page editors and using images and audio files as part of web pages
7. Writing Java programs by making use of class, interface, package, etc for the
following
# Different types of inheritance study
# Uses of ‘this’ keyword
# Polymorphism
# Creation of user specific packages
# Creation of jar files and using them
# User specific exception handling
8. Writing window based GUI applications using frames and applets such as
Calculator application, Fahrenheit to Centigrade conversion etc
9. Application of threads examples
10. Reading and writing text files
11. Reading image files and manipulating them with image related classes and methods
12. writing an RMI application to access a remote method
13. Writing a Servlet program with database connectivity for a web based application such as students result status checking, PNR number enquiry etc
14. Creation and usage of Java bean

Microprocessors Lab - Syllabus

MC9238 MICROPROCESSOR LAB
L T P C
0 0 3 2
1. Study of BIOS and DOS function calls for keyboard & Display interfacing
2. Assembly Language Programming with 8086 to perform the following operation
a. Arithmetic & Logical Operation
b. String Manipulation Operation
c. File Manipulation Operation
d. Terminate and Stay Resident (TSR) Program
3. Using Assembly Language with C/C++
4. Perform the following interfacing concepts with a microprocessor chip
a. Traffic signal controller using 8255 PPI
b. Stepper Motor controller using 8255 PPI
c. ADC/DAC interface
d. Waveform generation using 8253/8254 Timers
e. DC Motor Speed Controller
f. Keyboard/Display Controller using 8279

REFERENCES:
1. IBM PC Assembly Language and Programming by peter Abel, fifth edition
2. Advanced Microprocessors & peripherals A K Ray & K M Bhurchandi, Second
Edition, Tata McGraw-Hill

Graphics Lab - Syllabus

MC9237 GRAPHICS LAB
L T P C
0 0 3 2
1. TWO DIMENSIONAL TRANSFORMATIONS:
Creation of two dimensional objects and applying simple transformations like Translation, Scaling, Rotation and applying Composite transformations.
2. THREE DIMENSIONAL TRANSFORMATIONS:
Creation of simple three dimensional objects like cube, cone and cylinder and applying simple transformations like Translation, Scaling, Rotation and applying Composite transformations.
3. VISIBLE SURFACE DETECTION:
Finding out visible surfaces and removal of hidden surfaces in simple objects using object space and image space algorithms.
4. IMAGE EDITING:
Image enhancement, Image transformation from color to gray scale and vice versa, Image manipulation and Image optimization for web - Usage of editing tools, layers, filters, special effects and color modes. Creation of simple Gif animated images with textual illustrations.

Web Programming - Syllabus

MC9235 WEB PROGRAMMING
L T P C
3 0 0 3
UNIT I BASIC INTERNET CONCEPTS 8
Connecting to the Internet – Domain Name System - Exchanging E-mail – Sending and Receiving Files - Fighting Spam, Sorting Mail and avoiding e-mail viruses – Chatting and Conferencing on the Internet – Online Chatting - Messaging – Usenet Newsgroup – Internet Relay chat (IRC) – Instant Messaging - Voice and Video Conferencing.
UNIT II WORLD WIDE WEB 8
Overview – Web Security, Privacy, and site-blocking – Audio and Video on the web – Creating and Maintaining the Web – Web site creation concepts – Web Page Editors – Optimizing Web Graphics – Web Audio Files – Forms, Interactivity, and Database- Driven Web sites – File Transfer and downloading – FTP – Peer to Peer – Downloading and Installing software.
UNIT III JAVA FUNDAMENTALS 8
Java features – Java Platform – Java Fundamentals – Expressions, Operators, and Control Structures – Classes, Packages and Interfaces – Exception Handling.
UNIT IV PACKAGES 12
AWT package – Layouts – Containers – Event Package – Event Model – Painting – Garbage Collection - Multithreading – Language Packages.
UNIT V ADVANCED JAVA PROGRAMMING 9
Utility Packages – Input Output Packages – Inner Classes – Java Database Connectivity - Servlets - RMI – Java Beans.

Total No. of Periods : 45

TEXT BOOK
1. Margaret Levine Young, “Internet and WWW”, 2nd Edition, Tata McGraw Hill, 2002.
(Unit 1 & 2)
2. Herbert Schildt, The Complete Reference – Java 2 , 4th Edition, Tata McGraw
Hill, 2001. (Unit 3, 4 & 5)
REFERENCES
1. Keyur shah, “Gateway to Java Programmer Sun Certification”, Tata Mc Graw Hill
2002.
2. Deitel & Deitel, Java How to Program, Prentice Hall 1999.

Computer Graphics - Syllabus

MC9234 COMPUTER GRAPHICS
L T P C
3 0 0 3
UNIT I BASIC CONCEPTS 9
2D Transformations – Clipping – Window – View Prot Mapping – Graphical User Interfaces and Interactive Input Methods – Picture Construction Techniques – Virtual Reality Environment.
UNIT II 3D GRAPHICS 9
3D Transformation – 3D Viewing – Visible Surface Detection – Back Face Detection – Depth Buffer Method – Scan Line Method.
UNIT III VISUAL COMMUNICATION 9
Creative Process – Digital Imaging Technology – Still Image – Digital Imaging – Using Images in Multimedia – Images on Web – Color Models.
UNIT IV PRESENTATION 9
General Design Issues – Architectural Issues – Information Characteristics for Presentation – Presentation function – Presentation Design Knowledge – Effective Human Computer Interaction.
UNIT V INTERACTIVE 3D ILLUSTRATED WITH IMAGES AND TEXT 9
Generating Illustrated Documents – Consistency of Rendered Images and their Textual Labels – Architecture – Zoom Techniques for Illustration Purpose – Interactive handling of Images and Text – Figure Captions for Anatomical Illustrations.

TOTAL = 45

REFERENCES:
1. Donald Hearn and M. Pauline Baker, “Computer Graphics in C Version”, Second
Edition, Pearson Education.
2. Raf Steinmetz and Klara Nahrstedt, “Multimedia: Computing, Communication
and applications”, Pearson Education.
3. John Villamil Casanova and Leony Fernandez-Elias, “ Multimedia Graphics”,
Prentice Hall India.
4. Thomas Strothotte, “Computer Visualization-Graphics Abstraction and
Interactivity”, Springer Verlag, Berlin

Software Engineering - Syllabus

MC9233 SOFTWARE ENGINEERING
L T P C
3 0 0 3
UNIT I INTRODUCTION 9
Software Engineering paradigms – Waterfall Life cycle model – Spiral Model – Prototype Model – fourth Generation Techniques – Planning – Cost Estimation – Organization Structure – Software Project Scheduling, – Risk analysis and management – Requirements and Specification – Rapid Prototyping.
UNIT II SOFTWARE DESIGN 9
Abstraction – Modularity – Software Architecture – Cohesion – Coupling – Various Design Concepts and notations – Real time and Distributed System Design – Documentation – Dataflow Oriented design – Jackson System development – Designing for reuse – Programming standards.
UNIT III SOFTWARE METRICS 9
Scope – Classification of metrics – Measuring Process and Product attributes – Direct and Indirect measures – Reliability – Software Quality Assurance – Standards.
UNIT IV SOFTWARE TESTING AND MAINTENANCE 9
Software Testing Fundamentals – Software testing strategies – Black Box Testing – White Box Testing – System Testing – Testing Tools – Test Case Management – Software Maintenance Organization – Maintenance Report – Types of Maintenance.
UNIT V SOFTWARE CONFIGURATION MANAGEMENT (SCM) & CASE
TOOLS 9
Need for SCM – Version Control – SCM process – Software Configuration Items – Taxonomy – Case Repository – Features.

TOTAL = 45

REFERENCES:
1. Roger S. Pressman, “Software Engineering: A Practitioner Approach”, Sixth
edition, McGrawHill, 2005. Part-1, Part-2, Part-3
2. I. Sommerville, “Software Engineering”, Sixth Edition, Addison Wesley-Longman,
2004.
3. Pankaj Jalote, “An Integrated approach to Software Engineering”, Second
Edition, Springer Verlag, 1997.

Microprocessors - Syllabus

MC9232 MICROPROCESSORS AND ITS APPLICATIONS
L T P C
3 0 0 3

UNIT I THE 8086 PROCESSOR - SOFTWARE ASPECTS 11
Evolution of Microprocessors - 8086 architecture – Addressing modes- Instruction set and assembler directives – Assembly language programming – Interrupts and interrupt service routines.

UNIT II 8086 SYSTEM DESIGN 10
8086 signals description – Basic configurations - System bus timing –System design using 8086 – Minimum mode /Maximum modes 8086 system and timings.

UNIT III INTERFACING CONCEPTS 10
Memory Interfacing and I/O interfacing - Parallel communication interface – Serial communication interface – Timer – Keyboard /display controller – Interrupt controller – DMA controller – Programming and applications.

UNIT IV ADVANCED PROCESSORS 7
Intel 80286 – Internal Architectural – Register Organization – Internal Block Diagram – Modes of operation – Real Address Mode – Protected Virtual Address mode – Privilege – Protection - Architectural features and Register Organization of i386, i486 and Pentium processors.

UNIT V BUILDING SYSTEMS 7
Bus Concepts – Bus Standards –The Peripheral Component Interconnect (PCI) Bus – Universal Serial Bus (USB) – Platform Architectures.

Total = 45
REFERENCES:

1. A. K. Ray & K. M. Bhurchandi, “Advanced Microprocessors and peripherals-
Architectures, Programming and Interfacing”, TMH, 2002 reprint.
2. Barry B. Brey, “The Intel Microprocessors, 8086/8088, 80186/80188, 80286,
80386, 80486, Pentium, PentiumPro Processor, PentiumII, PentiumIII,
PentiumIV, Architecture, Programming & Interfacing”, 6th Edition, Pearson
Education/PHI, 2002.
3. Yu-cheng Liu, Glenn A. Gibson, “Microcomputer systems: The 8086/8088 Family
architecture, Programming and Design”, PHI 2003.
4. Peter Abel, “IBM PC Assembly language and programming”, Prentice Hall of
India Pvt. Ltd.
5. Websites of latest processors.

Computer Networks - Syllabus

MC9231 COMPUTER NETWORKS
L T P C
3 0 0 3
UNIT I INTRODUCTION 9
Communication model – Data communications networking – Data transmission concepts and terminology – Transmission media – Data encoding – Data link control.

UNIT II NETWORK FUNDAMENTALS 9
Protocol architecture – Protocols – OSI – TCP/IP – LAN architecture – Topologies – MAC – Ethernet, Fast ethernet, Token ring, FDDI, Wireless LANS – Bridges.

UNIT III NETWORK LAYER 9
Network layer – Switching concepts – Circuit switching networks – Packet switching – Routing – Congestion control – X.25 – Internetworking concepts and X.25 architectural models – IP – Unreliable connectionless delivery – Datagrams – Routing IP datagrams – ICMP.

UNIT IV TRANSPORT LAYER 9
Transport layer – Reliable delivery service – Congestion control – Connection establishment – Flow control – Transmission control protocol – User datagram protocol.

UNIT V APPLICATIONS 9
Applications – Sessions and presentation aspects – DNS, Telnet – rlogin, – FTP –
SMTP – WWW – Security – SNMP.

TOTAL = 45

REFERENCES:
4. Larry L. Peterson & Bruce S. Davie, “Computer Networks – A systems
Approach”, Second Edition, Harcourt Asia / Morgan Kaufmann, 2000.
5. William Stallings, “Data and Computer Communications”, Fifth Edition, PHI,
1997.

Database Management System - Lab - Syllabus

MC9218 DBMS LAB
L T P C
0 0 3 2
1. Creation of base tables and views.
2. Data Manipulation
INSERT, DELETE and UPDATE in tables
SELECT, Sub Queries and JOIN
3. Data Control Commands
4. High level language extensions – PL/SQL. Or Transact SQL
5. Use of Cursors, Procedures and Functions
6. Embedded SQL or Database Connectivity.
7. Oracle or SQL Server Triggers.
8. Working with Forms, Menus and Reports.
9. Front-end tools – Visual Basic/Developer 2000

Problem Solving and Programming - Lab - Syllabus

MC9217 PROGRAMMING AND DATA STRUCTURES LAB
L T P C
0 0 3 2
1. Stack and Queue
2. Binary tree Traversals
3. Merge Sort
4. DFS and BFS
5. Warshall’s Algorithm
6. Dijkstra’s Algorithm
7. Huffman’s Algorithm
8. Insertion Sort

Accounting and Financial Management - Syllabus

MC9215 ACCOUNTING AND FINANCIAL MANAGEMENT
L T P C
3 1 0 4
UNIT I FINANCIAL ACCOUNTING 9
Meaning and Scope of Accounting-Principles-Concepts-Conventions-Accounting Standards-Final Accounts-Trail Balance-Trading Account-Profit and Loss Account- Balance Sheet-Accounting Ratio Analysis-Funds Flow Analysis-Cash Flow Analysis

UNIT II ACCOUNTING 9
Meaning-Objectives-Elements of Cost-Cost Sheet-Marginal Costing and Cost Volume Profit Analysis-Break Even Analysis-Applications-Limitations-Standard Costing and Variance Analysis-Material-Labor-Overhead-Sales-Profit Variances

UNIT III BUDGETS AND BUDGETING CONTROL 9
Budgets and Budgetary Control-Meaning-Types-Sales Budget-Production Budget-Cost of Production Budget-Flexible Budgeting-Cash Budget-Master Budget-Zero Base Budgeting-Computerized Accounting

UNIT IV INVESTMENT DECISION AND COST OF CAPITAL 9
Objectives and Functions of Financial Management-Risk-Return Relationship-Time Value of Money Concepts-Capital Budgeting-Methods of Appraisal-Cost of Capital Factors Affecting Cost of Capital-Computation for Each Source of Finance and Weighted Average Cost of Capital

UNIT V FINANCING DECISION AND WORKING CAPITAL MANAGEMENT 9
Capital Structure-Factors Affecting Capital Structure-Dividend Policy-Types of Dividend Policy-Concepts of Working Capital-Working Capital Policies-Factors affecting Working Capital-Estimation of Working Capital Requirements

L 45 T 15 Total: 60

TEXTBOOK
1. S.N.Maheswari, “Financial and Management Accounting”, Sultan Chand & Sons,
2003
2. I.M.Pandey, ”Financial Management”, Vikas Publications, 4th Reprint, 2002
REFERENCES
1. S.P.Iyengar, “Cost and Management Accounting”, Sultan Chand & Co,
2. I.M.Pandey, “Elements of Management Accounting” Vikas Publishing House,
19993

Data Structures - Syllabus

MC9214 DATA STRUCTURES
L T P C
3 1 0 4

UNIT I DATA STRUCTURES 9
Introduction – Arrays – Structures – Stack: Definition and examples, Representing Stacks - Queues and lists: Queue and its Representation, lists – Applications of Stack, Queue and Linked Lists.

UNIT II TREES 9
Binary Trees – Operations on binary trees - Binary Tree Representations – node representation, internal and external nodes, implicit array representation – Binary tree Traversals - Huffman Algorithm – Representing Lists as Binary Trees

UNIT III SORTING AND SEARCHING 9
General Background – Exchange sorts – Selection and Tree Sorting – Insertion Sorts – Merge and Radix Sorts – Basic Search Techniques – Tree Searching – General Search Trees – Hashing.

UNIT IV GRAPHS AND THEIR APPLICATIONS 9
Graphs – An application of graphs – Representation – transitive closure - Warshall’s algorithm – Shortest path algorithm - a flow Problem – Dijkstra’s algorithm – An application of scheduling - Linked representation of Graphs – Graph Traversals

UNIT V STORAGE MANAGEMENT 9
General Lists: Operations, linked list representation, using lists, Freeing list nodes - Automatic list Management: Reference count method, Garbage Collection, Algorithms, Collection and compaction
L 45 T 15 Total: 60

TEXTBOOK
1. Tanaenbaum A.S.,Langram Y. Augestein M.J “ Data Structures using C”
Pearson Education , 2004

REFERENCES
1. Robert Kruse & Clovis L. Tondo “ Data Structures and Program Design in
C”,Prentice Hall , 2nd edition.,1991.
2. Weiss “Data Structures and Algorithm Analysis in C ” ,Addison Wesley , Second
Edition, 1997.

Database Management System - Syllabus

MC9213 DATABASE MANAGEMENT SYSTEMS
L T P C
3 0 0 3
UNIT I INTRODUCTION 9
Historical perspective - Files versus database systems - Architecture - E-R model - Security and Integrity - Data models.

UNIT II RELATIONAL MODEL 9
The relation - Keys - Constraints - Relational algebra and Calculus - Queries - Programming and triggers

UNIT III DATA STORAGE 9
Disks and Files - file organizations - Indexing - Tree structured indexing - Hash Based indexing

UNIT IV QUERY EVALUATION AND DATABASE DESIGN 9
External sorting - Query evaluation - Query optimization - Schema refinement and normalization - Physical database design and tuning - Security

UNIT V TRANSACTION MANAGEMENT 9
Transaction concepts - Concurrency control - Crash recovery - Decision support - Case studies

TOTAL = 45
REFERENCES:

1. Raghu RamaKrishnan and Johannes Gehrke, “Database Management Systems”, McGraw Hill International Editions, 2000.
2. C. J. Date, “An Introduction to Database Systems”, Seventh Edition, Addison Wesley, 1997.
3. Abraham Silberschatz, Henry. F. Korth and S. Sudharshan, “Database system Concepts”, Third Edition, Tata McGraw Hill, 1997.

Problem Solving and Programming - Syllabus

MC9212 PROBLEM SOLVING AND PROGRAMMING
L T P C
3 0 0 3

UNIT I INTRODUCTION TO PROGRAMMING 9
Introduction to computing – building blocks for simple programs – problem to program – Decision structures – loop structures – problem analysis – programming style – documentation and testing.

UNIT II PROGRAMMING PARADIGMS 9
Procedural – functional – recursive – rule-based – structured programming.

UNIT III PROBLEM SOLVING TECHNIQUES 9
Programming life cycle phases – problem solving – implementation – maintenance – pseudo code representation – flow charts - algorithms – algorithmic efficiency – complexity of algorithms.

UNIT IV C PROGRAMMING FUNDAMENTALS 9
Structured program development – Data types – operators – expressions – control flow – arrays and pointers – functions – Input – output statements – storage classes.

UNIT V ADVANCED FEATURES 9
Strings - Recursion – structures – unions – bit manipulations – enumerations – file processing – fundamental data structures.

TOTAL = 45

REFERENCES:
1. Kernigan Brian W., and Dennis M. Ritchie, “The C Programming Language”,
Seconde Edition, Prentice Hall, 1988.
2. Deitel and Deitel, “C How to program”, Prentice Hall, 1994.
3. Cormen, Leiserson, Rivest, Stein “Introduction to algorithms”, McGraw Hill
publishers, 2002.

COMPUTER ORGANISATION - SYLLABUS

MC9211 COMPUTER ORGANIZATION
L T P C
3 0 0 3

UNIT I DIGITAL FUNDAMENTALS 8
Number Systems and Conversions – Boolean Algebra and Simplification – Minimization of Boolean Functions – Karnaugh Map, Logic Gates – NAND – NOR Implementation.

UNIT II COMBINATIONAL AND SEQUENTIAL CIRCUITS 10
Design of Combinational Circuits – Adder / Subtracter – Encoder – Decoder – MUX / DEMUX – Comparators, Flip Flops – Triggering – Master – Slave Flip Flop – State Diagram and Minimization – Counters – Registers.

UNIT III BASIC STRUCTURE OF COMPUTERS 9
Functional units – Basic operational concepts – Bus structures – Performance and Metrics – Instruction and instruction sequencing – Hardware – Software Interface – Addressing modes – Instructions – Sets – RISC and CISC – ALU design – Fixed point and Floating point operation.

UNIT IV PROCESSOR DESIGN 9
Processor basics – CPU Organization – Data path design – Control design – Basic concepts – Hard wired control – Micro programmed control – Pipeline control – Hazards – Super scalar operation.

UNIT V MEMORY AND I/O SYSTEM 9
Memory technology – Memory systems – Virtual memory – Caches – Design methods – Associative memories – Input/Output system – Programmed I/O – DMA and Interrupts – I/O Devices and Interfaces.

TOTAL = 45

TEXT BOOKS:

1. Morris Mano, “Digital Design”, Prentice Hall of India, 1997.
2. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, Firth Edition, “Computer
Organization”, Tata McGraw Hill, 2002.

REFERENCES:

1. Charles H. Roth, Jr., “Fundamentals of Logic Design”, Jaico Publishing House,
Mumbai, Fourth Edition, 1992.
2. William Stallings, “Computer Organization and Architecture – Designing for
Performance”, Sixth Edition, Pearson Education, 2003.
3. David A. Patterson and John L. Hennessy, “Computer Organization and Design:
The Hardware/Software interface”, Second Edition, Morgan Kaufmann, 2002.
4. John P. Hayes, “Computer Architecture and Organization”, Thrid Edition, Tata
McGraw Hill, 1998.

Help Us

HELP US!!!

Kindly send your Engineering Notes (UG or PG) to annauniversitynotes@gmail.com Your Notes will be displayed here with your name and your college name within 24 hours.

UPLOAD YOUR NOTES HERE PLEASE

TANCET 2010 RESULTS

TNEA 2010 RANK ENQUIRY

Friday, June 25, 2010

Tuesday, June 22, 2010

Monday, June 21, 2010

Kindly send your Engineering Notes (UG or PG) to
annauniversitynotes@gmail.com
Your Notes will be displayed here with your name and your college name within 24 hours.