GE9161 Unix Programming Lab Syllabus

GE 9161 UNIX PROGRAMMING LAB L T P C
0 0 4 2
AIM:
The aim is to introduce working in UNIX environment.

OBJECTIVES:

•  To introduce the basic commands in UNIX.
•  To teach UNIX shell programming.
•  To introduce programming in C with UNIX system calls.

1. Basic Unix commands
2. Simple editors for file operations.
3. Filters-Grep, sed, awk
4. Simple shell programming.
5. Shell programming using complex control structures.
6. C Programs using file system related system calls.
7. C Programs using process related system calls.
8. Programs for inter process communication using pipes, FIFOs.
9. Programs using signals.
10. Programs using shared memory.

TOTAL: 60 PERIODS
TEXT BOOK
1. Brain W. Kernighan and Rob Pike, “The programming Environment”, PHI, 2002.

EC 9152 Circuit Anaylsis Syllabus download

EC 9152 CIRCUIT ANALYSIS L T P C
3 1 0 4

UNIT I DC CIRCUIT ANALYSIS 9
Basic Components and electric Circuits, Charge, current, Voltage and Power, Voltage
and Current Sources, Ohms Laws, Voltage and Current laws, Kirchoff’s Current Law,
Kirchoff’s voltage law, The single Node – Pair Circuit, series and Parallel Connected
Independent Sources, Resistors in Series and Parallel, voltage and current division,
Basic Nodal and Mesh analysis, Nodal analysis, Mesh analysis.

UNIT II NETWORK THEOREM AND DUALITY 8
Useful Circuit Analysis techniques, Linearity and superposition, Thevenin and Norton
Equivalent Circuits, Maximum Power Transfer, Delta-Wye Conversion. Duals, Dual
circuits.

UNIT III SINUSOIDAL STEADY STATE ANALYSIS 10
Sinusoidal Steady – State analysis , Characteristics of Sinusoids, The Complex Forcing
Function, The Phasor, Phasor relationship for R, L, and C, impedance and Admittance,
Nodal and Mesh Analysis, Phasor Diagrams, AC Circuit Power Analysis, Instantaneous
Power, Average Power, apparent Power and Power Factor, Complex Power.

UNIT IV TRANSIENTS AND RESONANCE IN RLC CIRCUITS 9
Basic RL and RC Circuits, The Source- Free RL Circuit, The Source-Free RC Circuit,
The Unit-Step Function, Driven RL Circuits, Driven RC Circuits, RLC Circuits, Frequency
Response, Parallel Resonance, Series Resonance, Quality Factor.

UNIT V COUPLED CIRCUITS AND TOPOLOGY 9
Magnetically Coupled Circuits, mutual Inductance, the Linear Transformer, the Ideal
Transformer, An introduction to Network Topology, Trees and General Nodal analysis,
Links and Loop analysis.

TOTAL : 45 + 15 = 60 PERIODS
TEXT BOOKS
1. William H.Kayt, Jr.Jack E. Kemmerly, Steven M.Durbin, “Engineering Circuit
Analysis”, Sixth Edition, Tata McGraw-Hill Edition, 2006.
2. David A Bell, “Electric Circuits”, PHI,2006

REFERENCES
1. Charles K. Alexander & Mathew N.O.Sadiku, “Fundamentals of Electric Circuits”,
Second Edition, McGraw- Hill 2003.
2. Sudhakar and Shyammohan S. Palli, Tata Mc Graw –Hill, Third Edition, 2007.
3. D.R.Cunningham, J.A.Stuller, “Basic Circuit Analysis”, Jaico Publishing House, 1996.
4. David E.Johnson, Johny R. Johnson, John L.Hilburn, “Electric Circuit Analysis”,
Second Edition, Prentice-Hall international Editions, 1997
5. K.V.V.Murthy, M.S.Kamath, “Basic Circuit Analysis”, Jaico Publishing House, 1999.
6. Norman Balabanian, “Electric Circuits”, International Edition,1994.

EC 9303 Signals and System Question bank download

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
QUESTION BANK
SUB.CODE :9303     SUB.NAME : SIGNALS AND SYSTEMS
YEAR : II SEMESTER : IV
UNIT I

REPRESENTATION OF SIGNALS
PART-A (2 Marks)

1. Define Signal.
2. Define system.
3. What are the major classifications of the signal?
4. Define discrete time signals and classify them.
5. Define continuous time signals and classify them.
6. Define discrete time unit step &unit impulse.
7. Define continuous time unit step and unit impulse.
8. Define unit ramp signal.
9. Define periodic signal and non-periodic signal.
10. Define even and odd signal ?
11. Define Energy and power signal.
12. Define unit pulse function.
13. Define continuous time complex exponential signal.
14. What is continuous time real exponential signal.
15. What is continuous time growing exponential signal?
16. State the BIBO criterion for stability.
17. Find whether the signal given by x (n) = 5cos (6 _n) is periodic
18. Write down the exponential form of the Fourier series representation of a
Periodic signal?
19. Write down the trigonometric form of the fourier series representation of a
periodic signal?
20. Write short notes on dirichlets conditions for fourier series.
21. State Time Shifting property in relation to fourier series.
22. State parseval’s theorem for continuous time periodic signals.

PART – B

1. (a) For the systems represented by the following functions. Determine whether
every system is (1) stable (2) Causal (3) linear (4) Shift invariant (4)
(i) T[x(n)]= ex(n)
(ii) T[x(n)]=ax(n)+6
2. Determine whether the following systems are static or Dynamic, Linear or Nonlinear,Shift variant or Invarient, Causal or Non-causal, Stable or unstable. (4)
(i) y(t) = x(t+10) + x2(t)
(ii) dy(t)/dt + 10 y(t) = x(t)
3. Explain about the properties of continuous time fourier series. (8)
4. Find the fourier coefficients of the given signal. (4)
x(t) = 1+ sin 2_ot + 2 cos 2_ot + cos (3_ot + _/3)
5. Determine the Fourier series coefficient of exponential representation of x(t)
x(t) = 1, ItI (8)
0, T1< ItI < T/ 2
6. Find the exponential series of the following signal. (8)
7. Find which of the following signal are energy or power signals. (8)
a) x(t)=e-3t u(t) b) x(t) = ej(2t+_/4) c) x(n)= cos(_/4n)
8. Explain the properties of Discrete time fourier serier (8)
9. Find the cosine fourier series of an half wave rectified sine function. (8)
10. Explain the classification of signals with examples. (8)

UNIT II ANALYSIS OF CONTINUOUS TIME SIGNALS AND SYSTEMS

PART-A (2 Marks)
1. Define continuous time system.
2. Define Fourier transform pair.
3. Write short notes on dirichlets conditions for fourier transform.
4. Explain how aperiodic signals can be represented by fourier transform.
5. State convolution property in relation to fourier transform.
6. State parseval’s relation for continuous time fourier transform.
7. What is the use of Laplace transform?
8. What are the types of laplace transform?
9. Define Bilateral and unilateral laplace transform.
10. Define inverse laplace transform.
11. State the linearity property for laplace transform.
12. State the time shifting property for laplace transform.
13. Region of convergence of the laplace transform.
14. What is pole zero plot.
15. State initial value theorem and final value theorem for laplace transform.
16. State Convolution property.
17. Define a causal system.
18. What is meant by linear system?
19. Define time invariant system.
20. Define stable system?
21. Define memory and memoryless system.
22. Define invertible system.
23. What is superposition property?
24. Find the fourier transform of x(t)=cos(_0t)

PART – B
1. Determine the inverse laplace of the following functions. (6)
1) 1/s(s+1) 2) 3s2 +8s+6 (s+2)(s2+2s+1)
2. Explain about the classifications of continuous time system. (8)
3. A system is described by the differential equation. (10) d2y(t)/dt2+3dy(t)/dt+2y(t)=dx(t)/dt if y(0) =2;dy(0)/dt = 1 and x(t)=e-t u(t) Use laplace transform to determine the response of the system to a unit step input applied at t=0.
4. Obtain the transfer function of the system when y(t) = e-t-2 e-2t+ e-3t and x(t)= e-0.5t (8) 5. a) Discuss the condition on stability of an LTI system based on Laplace domain representation. (3)
b) Bring the equivalence between Laplace transform and Fourier transform.(5)
6. Explain the properties of laplace transform (8)
7. Find the impulse and step response of the following systems H(s) = 10/s2+6s+10 (6)
8.For the transfer function H(s) = s+10/ s2+3s+2 find the response due to input x(t) = sin2(t) u(t) (6)
9. Find the fourier transform of triangular pulse (10) x(t) = _(t/m) ={1-2|t|/m |t| 0 otherwise
10. The input and output of a causal LTI system are related by the differential equation. (10)
d2y(t)/dt2+6dy(t)/dt+8y(t)=2x(t) i) Find the impulse response of the system. ii) What is the
response of this system if x(t) = t e-2t u(t) 11. Consider a causal LTI system with frequency
response. (10) H(j_) = 1/ j_ +2 For a particular input x(t) this system is y(t)= e-2t u(t) - e-3t u(t)


UNIT III SAMPLING THEOREM AND Z - TRANSFORMS

PART-A (2 Marks)
1. Why CT signals are represented by samples.
2. What is meant by sampling.
3. State Sampling theorem.
4. What is meant by aliasing.
5. What are the effects aliasing.
6. How the aliasing process is eliminated.
7. Define Nyquist rate.and Nyquist interval.
8. Define sampling of band pass signals.
9. Define Z transform.
10. What are the two types of Z transform?
11. Define unilateral Z transform.
13. What is region of Convergence.
14. What are the Properties of ROC.
15. What is the time shifting property of Z transform.
16. What is the differentiation property in Z domain.
17. State convolution property of Z transform.
18. State the methods to find inverse Z transform.
19. State multiplication property in relation to Z transform.
20. State parseval’s relation for Z transform.
21. What is the relationship between Z transform and fourier transform.
22. What is meant by step response of the DT system.

PART – B
1.State and prove the sampling theorem. Also explain how reconstruction of original signal is done from sampled signal (16)
2. Find the Z – transform of the signal (8) (i)x(n)= nan u(n) (ii)x(n)= an cos(_0) u(n)
3. Determine the inverse z transform of the following function x(z)=1/(1+z-1) (1-z-1 )2 ROC : |Z>1|
4. Explain the properties of z-transform (8)
5. Find the z-transform of x(z)= 1+2z-1 / 1- 2z-1 + z-2 if x(n) is anticausal using long
division method. (8)
6. find the inverse z-transform of x(z)= 1+3z-1 / 1+ 3z-1 + 2z-2 using residue method(8)
7. Give the relationship between z-transform and fourier transform. (8)

UNIT IV DISCRETE TIME SYSTEMS

PART-A (2 Marks)

1. Define Transfer function of the DT system.
2. Define impulse response of a DT system.
3. State the significance of difference equations.
4. Write the differece equation for Discrete time system.
5. Define frequency response of the DT system.
6. What is the condition for stable system.
7. What are the blocks used for block diagram representation.
8. State the significance of block diagram representation.
9. What are the properties of convolution?
10. State theCommutative properties of convolution?
11. State the Associative properties of convolution
12. State Distributive properties of convolution
13. Define causal system.
14. What is the impulse response of the system y(t)=x(t-t0).
15. What is the condition for causality if H(z) is given.
16. What is the condition for stability if H(z) is given.
17. Check whether the system is causal or not ,the H(z) is given by (z3 + z)/(z+1).
18. Check whether the system is stable or not ,the H(z) is given by (z/z-a).,|a|<1.
19. Determine the transfer function for the sys tem described by the difference
equation y(n)- y(n-1) = x(n)- x(n-2).
20. How the discrete time system is represented.

PART – B

1. Give the properties of convolution (6)
2. Determine the step response of the difference equation, y(n)-(1/9)y(n-2)=x(n-1)
with y(-1)=1 and y(-2)=0 (8)
3. Find the impulse response and step response.
Y(n)-3/4y(n-1) +1/8 y(n-2) = x(n) (8)
4. Find the output y(n) of a linear time invariant discrete time system specified by the
equation. (16)
Y(n)-3/2y(n-1) +1/2 y(n-2) = 2x(n) +3/2 x(n-1) when initial conditions are y(-1)
=0,y(-2) = 1 and input x(n)=(1/4)n u(n)
5. Determine the Nyquist sampling rate and Nyquist sampling intervals for
sinc(200_t) + 3sinc2(120_t) (6)
6. Find the frequency response of the following causal system.
Y(n)=1/2x(n)+x(n-1)+1/2 x(n-2) (4)
7. Determine inverse Discrete Time Fourier Transform of
X(k)={1,0,1,0} (8)
8. Give the summary of elementary blocks used to represent discrete (4)
time systems.

UNIT V SYSTEM WITH FINITE AND INFINITE DURATION IMPULSE RESPONSE

PART-A (2 Marks)

1. What is meant by FIR system.
2. What is meant by IIR system.
3. What is recursive system?
4. What is Non recursive system?
5. What is the difference between recursive and non recursive system
6. Define realization structure.
7. What are the different types of structure realization.
8. What is natural response?
9. What is zero input Response?
10. What is forced response?
11. What is complete response?
12. Give the direct form I structure.
13. Give the direct form II structure..
14. How the Cascade realization structure obtained.
15. Give the parallel for Realization structure.
16. What is transformed structure representation?

PART – B
1..a) Determine the transposed structure for the system given by difference equation
y(n)=(1/2)y(n-1)-(1/4)y(n-2)+x(n)+x(n-1) (16)
b) Realize H(s)=s(s+2)/(s+1)(s+3)(s+4) in cascade form
2. A difference equation of a discrete time system is given below:
y(n)-3/4 y(n-1) +1/8 y(n-1) = x(n) +1/2 x(n-1)
draw direct form I and direct form II. (6)
3. Realize the following structure in direct form II and direct form I
H(s) = s+1/s2 + 3s+5 (10)
4. Determine the recursive and nonrecursive system (16)
5. Determine the parallel form realization of the discrete time system is
y(n) -1/4y(n-1) -1/8 y(n-2) = x(n) +3x(n-1)+2x(n-2) (10)

Interview questions in Core java

Question: What is transient variable?

Answer: Transient variable can't be serialize. For example if a variable is declared as transient in a Serializable class and the class is written to an ObjectStream, the value of the variable can't be written to the stream instead when the class is retrieved from the ObjectStream the value of the variable becomes null
.


Question: Name the containers which uses Border Layout as their default layout?
Answer: Containers which uses Border Layout as their default are: window, Frame and Dialog classes.

Question: What do you understand by Synchronization?
Answer: Synchronization is a process of controlling the access of shared resources by the multiple threads in such a manner that only one thread can access one resource at a time. In non synchronized multithreaded application, it is possible for one thread to modify a shared object while another thread is in the process of using or updating the object's value. Synchronization prevents such type of data corruption.
E.g. Synchronizing a function:
public synchronized void Method1 () {
// Appropriate method-related code.
}
E.g. Synchronizing a block of code inside a function:
public myFunction (){
synchronized (this) {
// Synchronized code here.
}
}

Question: What is Collection API?
Answer: The Collection API is a set of classes and interfaces that support operation on collections of objects. These classes and interfaces are more flexible, more powerful, and more regular than the vectors, arrays, and hashtables if effectively replaces.
Example of classes: HashSet, HashMap, ArrayList, LinkedList, TreeSet and TreeMap.
Example of interfaces: Collection, Set, List and Map.

Question: Is Iterator a Class or Interface? What is its use?
Answer: Iterator is an interface which is used to step through the elements of a Collection.

Question: What is similarities/difference between an Abstract class and Interface?
Answer: Differences are as follows:

Interfaces provide a form of multiple inheritance. A class can extend only one other class.
Interfaces are limited to public methods and constants with no implementation. Abstract classes can have a partial implementation, protected parts, static methods, etc.
A Class may implement several interfaces. But in case of abstract class, a class may extend only one abstract class.
Interfaces are slow as it requires extra indirection to to find corresponding method in in the actual class. Abstract classes are fast.

Similarities:

Neither Abstract classes or Interface can be instantiated.


Question: How to define an Abstract class?
Answer: A class containing abstract method is called Abstract class. An Abstract class can't be instantiated.
Example of Abstract class:
abstract class testAbstractClass {
protected String myString;
public String getMyString() {
return myString;
}
public abstract string anyAbstractFunction();
}
Question: How to define an Interface?
Answer: In Java Interface defines the methods but does not implement them. Interface can include constants. A class that implements the interfaces is bound to implement all the methods defined in Interface.
Emaple of Interface:

public interface sampleInterface {
public void functionOne();

public long CONSTANT_ONE = 1000;
}

Question: Explain the user defined Exceptions?
Answer: User defined Exceptions are the separate Exception classes defined by the user for specific purposed. An user defined can created by simply sub-classing it to the Exception class. This allows custom exceptions to be generated (using throw) and caught in the same way as normal exceptions.
Example:
class myCustomException extends Exception {
// The class simply has to exist to be an exception
}

Question: Explain the new Features of JDBC 2.0 Core API?
Answer: The JDBC 2.0 API includes the complete JDBC API, which includes both core and Optional Package API, and provides inductrial-strength database computing capabilities.
New Features in JDBC 2.0 Core API:

Scrollable result sets- using new methods in the ResultSet interface allows programmatically move the to particular row or to a position relative to its current position
JDBC 2.0 Core API provides the Batch Updates functionality to the java applications.
Java applications can now use the ResultSet.updateXXX methods.
New data types - interfaces mapping the SQL3 data types
Custom mapping of user-defined types (UTDs)
Miscellaneous features, including performance hints, the use of character streams, full precision for java.math.BigDecimal values, additional security, and support for time zones in date, time, and timestamp values.


Question: Explain garbage collection?
Answer: Garbage collection is one of the most important feature of Java. Garbage collection is also called automatic memory management as JVM automatically removes the unused variables/objects (value is null) from the memory. User program cann't directly free the object from memory, instead it is the job of the garbage collector to automatically free the objects that are no longer referenced by a program. Every class inherits finalize() method from java.lang.Object, the finalize() method is called by garbage collector when it determines no more references to the object exists. In Java, it is good idea to explicitly assign null into a variable when no more in use. I Java on calling System.gc() and Runtime.gc(), JVM tries to recycle the unused objects, but there is no guarantee when all the objects will garbage collected.

Question: How you can force the garbage collection?
Answer: Garbage collection automatic process and can't be forced.

Question: What is OOPS?
Answer: OOP is the common abbreviation for Object-Oriented Programming.

Question: Describe the principles of OOPS.
Answer: There are three main principals of oops which are called Polymorphism, Inheritance and Encapsulation.

Question: Explain the Encapsulation principle.
Answer: Encapsulation is a process of binding or wrapping the data and the codes that operates on the data into a single entity. This keeps the data safe from outside interface and misuse. One way to think about encapsulation is as a protective wrapper that prevents code and data from being arbitrarily accessed by other code defined outside the wrapper.

Question: Explain the Inheritance principle.
Answer: Inheritance is the process by which one object acquires the properties of another object.

Question: Explain the Polymorphism principle.
Answer: The meaning of Polymorphism is something like one name many forms. Polymorphism enables one entity to be used as as general category for different types of actions. The specific action is determined by the exact nature of the situation. The concept of polymorphism can be explained as "one interface, multiple methods".

Question: Explain the different forms of Polymorphism.
Answer: From a practical programming viewpoint, polymorphism exists in three distinct forms in Java:

Method overloading
Method overriding through inheritance
Method overriding through the Java interface


Question: What are Access Specifiers available in Java?
Answer: Access specifiers are keywords that determines the type of access to the member of a class. These are:

Public
Protected
Private
Defaults


Question: Describe the wrapper classes in Java.
Answer: Wrapper class is wrapper around a primitive data type. An instance of a wrapper class contains, or wraps, a primitive value of the corresponding type.

Following table lists the primitive types and the corresponding wrapper classes:
Primitive Wrapper
boolean java.lang.Boolean
byte java.lang.Byte
char java.lang.Character
double java.lang.Double
float java.lang.Float
int java.lang.Integer
long java.lang.Long
short java.lang.Short
void java.lang.Void

Question: Read the following program:

public class test {
public static void main(String [] args) {
int x = 3;
int y = 1;
if (x = y)
System.out.println("Not equal");
else
System.out.println("Equal");
}
}
What is the result?
A. The output is ?Equal?
B. The output in ?Not Equal?
C. An error at " if (x = y)" causes compilation to fall.
D. The program executes but no output is show on console.
Answer: C

Question: what is the class variables ?
Answer: When we create a number of objects of the same class, then each object will share a common copy of variables. That means that there is only one copy per class, no matter how many objects are created from it. Class variables or static variables are declared with the static keyword in a class, but mind it that it should be declared outside outside a class. These variables are stored in static memory. Class variables are mostly used for constants, variable that never change its initial value. Static variables are always called by the class name. This variable is created when the program starts i.e. it is created before the instance is created of class by using new operator and gets destroyed when the programs stops. The scope of the class variable is same a instance variable. The class variable can be defined anywhere at class level with the keyword static. It initial value is same as instance variable. When the class variable is defined as int then it's initial value is by default zero, when declared boolean its default value is false and null for object references. Class variables are associated with the class, rather than with any object.
Question: What is the difference between the instanceof and getclass, these two are same or not ?
Answer: instanceof is a operator, not a function while getClass is a method of java.lang.Object class. Consider a condition where we use
if(o.getClass().getName().equals("java.lang.Math")){ }
This method only checks if the classname we have passed is equal to java.lang.Math. The class java.lang.Math is loaded by the bootstrap ClassLoader. This class is an abstract class.This class loader is responsible for loading classes. Every Class object contains a reference to the ClassLoader that defines. getClass() method returns the runtime class of an object. It fetches the java instance of the given fully qualified type name. The code we have written is not necessary, because we should not compare getClass.getName(). The reason behind it is that if the two different class loaders load the same class but for the JVM, it will consider both classes as different classes so, we can't compare their names. It can only gives the implementing class but can't compare a interface, but instanceof operator can.
The instanceof operator compares an object to a specified type. We can use it to test if an object is an instance of a class, an instance of a subclass, or an instance of a class that implements a particular interface. We should try to use instanceof operator in place of getClass() method. Remember instanceof opeator and getClass are not same. Try this example, it will help you to better understand the difference between the two.
Interface one{
}

Class Two implements one {
}
Class Three implements one {
}

public class Test {
public static void main(String args[]) {
one test1 = new Two();
one test2 = new Three();
System.out.println(test1 instanceof one); //true
System.out.println(test2 instanceof one); //true
System.out.println(Test.getClass().equals(test2.getClass())); //false
}
}

VAO Answer key download

The Village Administrattion Officer Examination was held on September 30, 2012. More than 9 lakh candidates got participated in the examination in various center around the Tamil Nadu. The Results are expected to be declared at the last week of october 2012. The Answer key for the examination is available for download here.
http://www.tnpsc.gov.in/answerkeys_30_09_2012.html 

EC 9151 Electron Devices Syllabus download

EC 9151 ELECTRON DEVICES L T P C
             3 0 0 3

UNIT I SEMICONDUCTOR DIODE 9
PN junction, current equations, Diffusion and drift current densities, VI Characteristics,
Forward and Reverse Characteristics, Switching Times.

UNIT II BIPOLAR JUNCTION TRANSISTOR 9
NPN-PNP-Junctions-Current Early-effect equations - Input and Output Characteristics
of CE, CB CC-Hybrid-pi model h-parameter model - Eber-Moll Model Power BJT
Gummel Poon model.

UNIT III FIELD EFFECT Transistors 9
JFETs - Drain and Transfer Characteristics, pinch-off voltage-current equations and STIs
MOSFET-characteristic-DMOSFET significance, EMOSFET-, current-modelparameters equation - Modifications by ion implantation threshold voltage, channel length
modulation.-power MOSFET.

UNIT IV SPECIAL SEMICONDUCTOR DEVICES 9
Metal-Semiconductor Junction-Schottky barrier diodes, Zener diodes, diode Varacter -
Tunnel Diode-Gallium Arsenic devices, laser diodes, LDR, and MESFETs

UNIT V POWER DEVICES AND DISPLAY DEVICES 9
UJT, SCR, Diac, Triac, DMOS, VMOS, FINFET, DUALGATE, MOSFET, LED, LCD, Photo
transistor, Opto Coupler, Solar cell, CCD, Multi Emitter Transistor.
         
TOTAL: 45 Periods

TEXT BOOKS
1. Donald A Neaman, "Semiconductor Physics and Devices", Third Edition, Tata Mc
GrawHill Inc.. , 2007.
2 .. Streetman, "Solid State Electronic Devices", Fifth Edition, Prentice Hall of India-2004

REFERENCES
1. B.JAYANT Dung "Power Semiconductor Devices"-THOMPSON-1996
2. Donal H.TAUB SCHILLING "Digital Integrated Electronics" Mcgrawhill-2006
3. Yang, "Fundamentals of Semiconductor Devices", McGraw Hill International Edition,
1,968

GE 9151 Engineering Mechanics Syllabus download

GE 9151 ENGINEERING MECHANICS
(Common to Civil, Geoinformatics and Agriculture & Irrigation Engineering)
L T P C
3 1 0 4
OBJECTIVE:
At the end of this course the student should be able to understand the vectorial and
scalar representation of forces and moments, static equilibrium of particles and rigid
bodies both in two dimensions and also in three dimensions. Further, the student should
understand the principle of work and energy. The student should be able to comprehend
the effect of friction on equilibrium. The student should be able to understand the laws of
motion, the kinematics of motion and the interrelationship. The student should also be
able to write the dynamic equilibrium equation. All these should be achieved both
conceptually and through solved examples.

UNIT I BASICS & STATICS 12
Introduction - Units and Dimensions - Laws of Mechanics – Lame’s theorem,
Parallelogram and triangular Law of forces – Vectors – Vectorial representation of forces
and moments – Vector operations on forces, dot product and cross product - Coplanar 22
Forces – Resolution and Composition of forces – Equilibrium of a forces – Forces in
space - Equilibrium in space - Equivalent systems of forces – Principle of transmissibility
– Single equivalent force

UNIT II EQUILIBRIUM OF RIGID BODIES 12
Free body diagram – Types of supports and their reactions – requirements of stable
equilibrium – Moments and Couples – Moment of a force about a point and about an
axis – Vectorial representation of moments and couples – Scalar components of a
moment – Varignon’s theorem - Equilibrium of Rigid bodies in two dimensions –
Equilibrium of Rigid bodies in three dimensions – Examples

UNIT III PROPERTIES OF SURFACES AND SOLIDS 12
Determination of Areas and Volumes – First moment of area and the Centroid of
standard sections – T section, I section, Angle section, Hollow section – second and
product moments of plane area – Rectangle, triangle, circle - T section, I section, Angle
section, Hollow section – Parallel axis theorem and perpendicular axis theorem – Polar
moment of inertia – Principal moments of inertia of plane areas – Principal axes of inertia
- Mass moment of inertia – Derivation of mass moment of inertia for rectangular solids,
prism, rods, sphere from first principle – Relation to area moments of inertia.

UNIT IV DYNAMICS OF PARTICLES 12
Displacements, Velocity and acceleration, their relationship – Relative motion –
Curvilinear motion – Newton’s law – Work Energy Equation of particles – Impulse and
Momentum

UNIT V CONTACT FRICTION AND ELEMENTS OF RIGID BODY DYNAMICS 12
Frictional force – Laws of Coloumb friction – simple contact friction – Rolling friction –
Belt friction Translation and Rotation of Rigid Bodies – Velocity and acceleration –
General Plane motion – Impact of elastic bodies
L: 45+T=15 TOTAL : 60 PERIODS

TEXT BOOK
1. Beer,F.P and Johnson Jr. E.R, “Vector Mechanics for Engineers”, Vol. 1 Statics and
Vol. 2 Dynamics, McGraw-Hill International Edition, 2007.
REFERENCES
1. Irving H. Shames, Engineering Mechanics - Statics and Dynamics, IV Edition – PHI /
Pearson Education Asia Pvt. Ltd., 2003
2. Hibbeller, R.C., Engineering Mechanics, Vol. 1 Statics, Vol. 2 Dynamics, Pearson
Education Asia Pvt. Ltd., 2000.
3. Ashok Gupta, Interactive Engineering Mechanics – Statics – A Virtual Tutor
(CDROM), Pearson Education Asia Pvt., Ltd., 2002
4. J.L. Meriam & L.G. Kraige, Engineering Mechanics Vol. I & Vol. II, V edition, John
Wiley & Sons, 2006.
5. P. Boresi & J. Schmidt, Engineering Mechanics Statics & Dynamics, Micro Print Pvt.
Ltec., Chennai, 2004.

GE9261 Environmental Science and Engineering Syllabus download

GE9261 ENVIRONMENTAL SCIENCE AND ENGINEERING L T P C
(Common to all branches) 3 0 0 3


AIM
To create awareness in every engineering graduate about the importance of
environment, the effect of technology on the environment and ecological balance and
make them sensitive to the environment problems in every professional endeavour that
they participates.
OBJECTIVE
At the end of this course the student is expected to understand what constitutes the
environment, what are precious resources in the environment, how to conserve these
resources, what is the role of a human being in maintaining a clean environment and 20
useful environment for the future generations and how to maintain ecological balance
and preserve bio-diversity. The role of government and non-government organization in
environment managements.

UNIT I ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY 14
Definition, scope and importance of environment – need for public awareness - concept
of an ecosystem – structure and function of an ecosystem – producers, consumers and
decomposers – energy flow in the ecosystem – ecological succession – food chains,
food webs and ecological pyramids – Introduction, types, characteristic features,
structure and function of the (a) forest ecosystem (b) grassland ecosystem (c) desert
ecosystem (d) aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries) –
Introduction to biodiversity definition: genetic, species and ecosystem diversity –
biogeographical classification of India – value of biodiversity: consumptive use,
productive use, social, ethical, aesthetic and option values – Biodiversity at global,
national and local levels – India as a mega-diversity nation – hot-spots of biodiversity –
threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts –
endangered and endemic species of India – conservation of biodiversity: In-situ and exsitu conservation of biodiversity.
Field study of common plants, insects, birds
Field study of simple ecosystems – pond, river, hill slopes, etc.

UNIT II ENVIRONMENTAL POLLUTION 8
Definition – causes, effects and control measures of: (a) Air pollution (b) Water pollution
(c) Soil pollution (d) Marine pollution (e) Noise pollution (f) Thermal pollution (g) Nuclear
hazards – soil waste management: causes, effects and control measures of municipal
solid wastes – role of an individual in prevention of pollution – pollution case studies –
disaster management: floods, earthquake, cyclone and landslides.
Field study of local polluted site – Urban / Rural / Industrial / Agricultural.

UNIT III NATURAL RESOURCES 10
Forest resources: Use and over-exploitation, deforestation, case studies- timber
extraction, mining, dams and their effects on forests and tribal people – Water
resources: Use and over-utilization of surface and ground water, floods, drought,
conflicts over water, dams-benefits and problems – Mineral resources: Use and
exploitation, environmental effects of extracting and using mineral resources, case
studies – Food resources: World food problems, changes caused by agriculture and
overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging,
salinity, case studies – Energy resources: Growing energy needs, renewable and non
renewable energy sources, use of alternate energy sources. case studies – Land
resources: Land as a resource, land degradation, man induced landslides, soil erosion
and desertification – role of an individual in conservation of natural resources – Equitable
use of resources for sustainable lifestyles.
Field study of local area to document environmental assets – river / forest / grassland /
hill / mountain.

UNIT IV SOCIAL ISSUES AND THE ENVIRONMENT 7
From unsustainable to sustainable development – urban problems related to energy –
water conservation, rain water harvesting, watershed management – resettlement and
rehabilitation of people; its problems and concerns, case studies – role of nongovernmental organization- environmental ethics: Issues and possible solutions –
climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and
holocaust, case studies. – wasteland reclamation – consumerism and waste products – 21
environment production act – Air (Prevention and Control of Pollution) act – Water
(Prevention and control of Pollution) act – Wildlife protection act – Forest conservation
act – enforcement machinery involved in environmental legislation- central and state
pollution control boards- Public awareness.

UNIT V HUMAN POPULATION AND THE ENVIRONMENT 6
Population growth, variation among nations – population explosion – family welfare
programme – environment and human health – human rights – value education – HIV /
AIDS – women and child welfare – role of information technology in environment and
human health – Case studies.
TOTAL : 45 PERIODS

TEXT BOOKS
1. Gilbert M.Masters, “Introduction to Environmental Engineering and Science”, 2
nd
edition, Pearson Education (2004).
2. Benny Joseph, “Environmental Science and Engineering”, Tata McGraw-Hill, New
Delhi, (2006).

REFERENCES
1. R.K. Trivedi, “Handbook of Environmental Laws, Rules, Guidelines, Compliances
and Standards”, Vol. I and II, Enviro Media.
2. Cunningham, W.P. Cooper, T.H. Gorhani, “Environmental Encyclopedia”, Jaico
Publ., House, Mumbai, 2001.
3. Dharmendra S. Sengar, “Environmental law”, Prentice hall of India PVT LTD, New
Delhi, 2007.
4. Rajagopalan, R, “Environmental Studies-From Crisis to Cure”, Oxford University
Press (2005).

PH9168 Physics for Communication Engineering Syllabus download

PH9168 PHYSICS FOR COMMUNICATION ENGINEERING
(Common to Electronics and Communication Engg., Computer Science and Engg.
and Information Technology)
L T P C
3 0 0 3
OBJECTIVE:
To introduce the essential principles of physics for communication and related
engineering applications.

UNIT I ELECTRICAL PROPERTIES OF METALS 9
Classical theory: Drude model - thermal conductivity, thermal resistance - electrical
conductivity of nonmetals: semiconductors, ionic crystals and glasses - thin metal films:
conductivity and resistivity - Schrödinger wave equation – particle in a box – degenerate
states – Fermi-Dirac statistics – density of states: electron concentration and Fermi
Level - band theory of solids: energy band formation – electron effective mass.

UNIT II SEMICONDUCTORS 9
Intrinsic semiconductors: energy band-diagram - direct and indirect band gap
semiconductors - carrier concentrations and conductivity - extrinsic semiconductors: n,
p-type doping, compensation doping - temperature dependence of conductivity -
degenerate and nondegenerate semiconductors - recombination and minority carrier
injection: direct and indirect recombination - minority carrier lifetime - diffusion and
conduction equations and random motion - continuity equation: time-dependent
continuity equation, steady-state continuity equation - optical absorption - Hall effect and
devices - Ohmic contacts - Schottky diode and solar cell.

UNIT III DISPLAY DEVICES 9
Photoluminescence, cathodoluminescence, electroluminescence, injection luminescence
– plasma displays - LED construction and working – organic LEDs – principles of 19
quantum well laser – liquid crystals and LCD construction and working – numeric
displays

UNIT IV MAGNETIC/OPTICAL DATA STORAGE TECHNIQUES 9
Introduction – magnetic material parameters – magnetic disk memories – optical data
storage – phase change recording – magneto-optical data storage – Hi-tech involved in
system development – capacity of CD in normal use – advantages of CD – holographic
storage – construction of a hologram – reconstruction of a hologram – photorefractive
storage.

UNIT V FABRICATION PROCESS USING SEMICONDUCTORS AND
DIELECTRIC 9
Bulk crystal growth, Epitaxial growth, masking and etching, Diffusion of impurities,
selective diffusion, Formation of PN junction, resistors, capacitors, inductors, Isolation
methods, metal semiconductor contact. Introduction to integrated circuit – Definition of
LSI, MSI, VLSI circuits monolithic and hybrid circuits, Thin film and thick film technology.

TOTAL : 45 PERIODS

TEXT BOOKS
1. Palanisamy, P.K., Materials Science for Electronics Engineers, SCITECH, 2005.
2. Arumugam, M., Materials Science, Anirutha Publ., 2002.

REFERENCES
1. Jasprit Singh, Optoelectronics: An introduction to Materials and Devices, McGraw
Hill, 1998.
2. Wilson, J and Hawkes, J.F.B, Optoelectronics, Printice Hall, 2002
3. Bhattacharya, B., Semiconductor optoelectronic devices, Printice Hall of India, 1995.
4. Kittel, C., Introduction to Solid State Physics, John Wiley, 1996
5. Kasap, S.O. Principles of Electronic Materials and Devices, Tata McGraw-Hill, 2007

CS2202 Digital Principles and System Design question bank download

CS2202 Digital Principles and System Design.Question Bank.Unit - I Boolean algebra and Logic Gates.Part A.

1.  . Find the hexadecimal equivalent of the decimal number 256.
2.  Find the octal equivalent of the decimal number 64.
3.  What is meant by weighted and non-weighted coding?
4. Convert A3BH and 2F3H into binary and octal respectively.
5.  Find the decimal equivalent of (123) 9.
6.  Find the octal equivalent of the hexadecimal number AB.CD.
7.  Encode the ten decimal digits in the 2 out of 5 code.
8. Show that the Excess - 3 code is self-complementing.
9. . Find the hexadecimal equivalent of the octal number 153.4.
10. Find the decimal equivalent of (346) 7.
11. A hexadecimal counter capable of counting up to at least (10,000) 10 is to be constructed.
12. What is the minimum number of hexadecimal digits that the counter must have?
13.  Convert the decimal number 214 to hexadecimal.
14. Convert 231.3 4 to base 7.
15.  Give an example of a switching function that contains only cyclic prime implicant.
16.  Give an example of a switching function that for which the MSP from is not unique.
17. . Express x + yz as the sum of minterms.What is prime implicant?

18Find the value of X = ABC (A + D) if A = 0; B = 1; C = 1 and D = 1.19 What are 'minterms' and 'maxterms'?20 State and prove Demorgan's theorem.21. Find the complement of x + yz.22. Define the following: minterm and term.23. State and prove Consensus theorem.24. What theorem is used when two terms in adjacent squares of K map are combined?25 How will you use a 4 input NAND gate as a 2 input NAND gate?26 How will you use a 4 input NOR gate as a 2 input NOR gate?27 Show that the NAND connection is not associative.28 What happens when all the gates is a two level AND-OR gate network are replaced by.NOR gates?29. What is meant by multilevel gates networks?30. Show that the NAND gate is a universal building block.31. Show that a positive logic NAND gate is the same as a negative logic NOT gate.32. Distinguish between positive logic and negative logic.33. Implement AND gate and OR gate using NAND gate.34. What is the exact number of bytes in a system that contains (a) 32K byte, (b) 64M bytes,.and (c) 6.4G byte?35ist the truth table of the function:.F = x y + x y '+ y' z.Part B.One. (A) Explain how you will construct an (n +1) bit Gray code from an n bit.Gray code.(B) Show that the Excess - 3 code is self-complementing.Two. (A) Prove that (x1 + x2). (X1 '. X3' + x3) (x2 '+ x1.x3) = x1'x2.(B) Simplify using K-map to obtain a minimum POS expression:.(A '+ B' + C + D) (A + B '+ C + D) (A + B + C + D') (A + B + C '+ D') (A '+ B + C'. + D ').(A + B + C '+ D).Three. Reduce the following equation using Quine McClucky method of.minimization F (A, B, C, D) = _m (0,1,3,4,5,7,10,13,14,15).4th. (A) State and Prove idempotent laws of Boolean algebra.(B) using a K-Map, Find the MSP from of F = _ (0,4,8,12,3,7,11,15) + _d (5).5 (a) With the help of a suitable example, explain the meaning of an redundant prime i.implicant.(B) Using a K-Map, Find the MSP form of F = _ (0-3, 12-15) + _d (7, 11).6 (a) Simplify the following using the Quine - McClusky minimization technique.D = f (a, b, c, d) = _ (0,1,2,3,6,7,8,9,14,15). Does Quine-McClusky take care of don't.care conditions? In the above problem, will you consider any don't care conditions?Justify your answer.(B) List also the prime implicants and essential prime implicants for the above case.7 (a) Determine the MSP and MPS focus of F = _ (0, 2, 6, 8, 10, 12, 14, 15).(B) State and Prove Demorgan's theorem.8 Determine the MSP form of the Switching function.F = _ (0,1,4,5,6,11,14,15,16,17,20 - 22,30,32,33,36,37,48,49,52,53,56,63).9th. (A) Determine the MSP form of the Switching function.F (a, b, c, d) = _ (0,2,4,6,8) + _d (10,11,12,13,14,15).(B) Find the Minterm expansion of f (a, b, c, d) = a '(b' + d) + acd '.10 Simplify the following Boolean function by using the Tabulation Method.F = _ (0, 1, 2, 8, 10, 11, 14, 15).11 State and Prove the postulates of Boolean algebra.12 (a) Find a Min SOP and Min POS for f = b'c'd + bcd + acd '+ a'b'c + a'bc'd.13 Find an expression for the following function usingQuine McCluscky method.F = _ (0, 2, 3,5,7,9,11,13,14,16,18,24,26,28,30).14 State and Prove the theorems of Boolean algebra with illustration.15 Find the MSP representation for.F (A, B, C, D, E) = _m (1,4,6,10,20,22,24,26) + _d (0,11,16,27) using K-Map method.Draw the circuit of the minimal expression using only NAND gates.16 (a) Show that if all the gates in a two - level AND-OR gate networks are replaced by.NAND gates the output function does not change.(B) Why does a good logic designer minimize the use of NOT gates?17 Simplify the Boolean function F (A, B, C, D) = _ m (1,3,7,11,15) + _d (0,2,5). If don't.care conditions are not taken care, What is the simplified Boolean function. What are.your comments on it? Implement both circuits.18 (a) Show that if all the gate in a two - level OR-AND gate network are replaced by NOR.gate, the output function does not change.(B) Implement Y = (A + C) (A + D ') (A + B + C') using NOR gates only.19 (a) F3 = f (a, b, c, d) = _ (2,4,5,6).F2 = f (a, b, c, d) = _ (2,3,, 6,7).F1 = f (a, b, c, d) = _ (2,5,6,7). Implement the above Boolean functions.(I) When each is treated separately and.(Ii) When sharing common term.(B) Convert a NOR with an equivalent AND gate.20 Implement the Switching function whose octal designation is 274 using NAND gates only.21 Implement the Switching function whose octal designation is 274 using NOR gates only.22 (a) Show that the NAND operation is not distributive over the AND operation.(B) Find a network of AND and OR gate to realize f (a, b, c, d) = _ m (1,5,6,10,13,14).23 What is the advantages of using tabulation method? Determine the prime implicants of the.following function using tabulation method.F (W, X, Y, Z) = _ (1,4,6,7,8,9,10,11,15).23 (a) Explain about common postulates used to formulates various algebraic structures.(B) Given the following Boolean function F = A "C + A'B + AB'C + BC.Express it in sum of minterms & Find the minimal SOP expression.Unit - II Combinational Logic.Part A.One. How will you build a full adder using 2 half adders and an OR gate?Two. Implement the switching function Y = BC '+ A'B + D.Three. Draw 4 bit binary parallel adder.4th. Write down the truth table of a full adder.Five. Write down the truth table of a full sub tractor.6. Write down the truth table of a half sub tractor.7th. Find the syntax errors in the following declarations (note that names for primitive gates.are optional):.module Exmp1-3 (A, B, C, D, F).inputs A, B, C,.and g1 (A, B, D);not (D, B, A);OR (F, B, C);endmodule;Eight. Draw the logic diagram of the digital circuit specified by.module circt (A, B, C, D, F);input A, B, C, D;output F;wire w, x, y, z, a, d;and (x, B, C, d);and y, a, C);and (w, z, B);or (z, y, A);or (F, x, w);not (a, A);not (d, D);endmodule.9th. Define Combinational circuits.10th. Define Half and Full adder.11th. Give the four elementary operations for addition and subtraction.12th. Design the combinational circuit with 3 inputs and 1 output. The output is 1 when the.binary value of the inputs is less than 3.The output is 0 otherwise.13th. Define HDL.14th. What do you mean by carry propagation delay?15th. What is code converter?16th. Give short notes on Logic simulation and Logic synthesis.17th. What do you mean by functional and timing simulation?18th. What do you mean by test bench?19th. Give short notes on simulation versus synthesis.20th. Define half sub tractor and full sub tractor.Part B.1 Design a 4 bit magnitude comparator to compare two 4 bit number.2 Construct a combinational circuit to convert given binary coded decimal number into an.Excess 3 code for example when the input to the gate is 0110 then the circuit should.generate output as 1001.3 Design a combinational logic circuit whose outputs are F1 = a'bc + ab'c and.F2 = a '+ b'c + bc'.4 (a) Draw the logic diagram of a *-bit 7483 adder.(B) Using a single 7483, Draw the logic diagram of a 4 bit adder / sub tractor.5 (a) Draw a diode ROM, which translates from BCD 8421 to Excess 3 code.(B) Distinguish between Boolean addition and Binary addition.6 Realize a BCD to Excess 3 code conversion circuit starting from its truth table.7 (a) Design a full sub tractor.(B) How to it differ from a full sub tractor.8 Design a combinational circuit which accepts 3 bit binary number and converts its.equivalent excess 3 codes.9 Derive the simplest possible expression for driving segment "a" through 'g' in an 8421.BCD to seven segment decoder for decimal digits 0 through 9. Output should be.active high (Decimal 6 should be displayed as 6 and decimal 9 as 9).10 Write the HDL description of the circuit specified by the following Boolean function.(I) Y = (A + B + C) (A '+ B' + C ').(Ii) F = (AB '+ A'B) (CD' + C'D).(Iii) Z = ABC + AB '+ A (D + B).(Iv) T = [(A + B} {B '+ C' + D ')].11 Design 16 bit adder using 4 7483 ICs.Unit - III Design with MSI Devices.Part A.One. What is a decoder and obtain the relation between the number of inputs 'n' and outputs.'M' of a decoder?Two. Distinguish between a decoder and a demultiplexer.Three. Using a single IC 7485; draw the logic diagram of a 4 bit comparator.4th. what is decoder.Five. What do you mean by encoder?6. Write the short notes on priority encoder.7th. What is multiplexer? Draw the logic diagram of8 to 1 line multiplexer.Eight. What do you mean by comparator?9th. Write the HDL description of the circuit specified by the following Boolean function.X = AB + ACD + BC '.10th. How does ROM retain information?11th. Distinguish between PAL and PLA.12th. Give the classification of memory.13th. What is refreshing? How it is done?14th. What is Hamming code?15th. Write a short notes on memory decoding.16th. List the basic types of programmable logic devices.17th. What is PAL? How it differ from PROM and PLA?18th. Write a short notes on - PROM, EPROM, EEPROM.19th. How many parity bits are required to form Hamming code if massage bits are 6?20th. How to find the location of parity bits in the Hamming code?21. Generate the even parity Hamming codes for the following binary data.1101, 1001.22. A seven bit Hamming code is received as 11111101. What is the correct code?23. Compare static RAMs and dynamic RAMs.24th. Define Priority encoder.25th. Define PLDs.Part B.One. Implement the switching function F = _ (0,1,3,4,7) using a 4 input MUX and explain.Two. Explain how will build a 64 input MUX using nine 8 input MUXs.Three. State the advantages of complex MSI devices over SSI gates.4th. Implement the switching function F (A, B, C) = _ (, 2,4,5) using the DEMUX 74156.Five. Implement the switching function F = _ (0,1,3,4,12,14,15) using an 8 input MUX.6. Explain how will build a 16 input MUX using only 4 input MUXs.7th. Explain the operation of 4 to 10 line decoder with necessary logic diagram.Eight. Draw a neat sketch showing implementation of Z1 = ab'd'e + a'b'c'e '+ bc + de,.Z2 = a'c'e, Z3 = bc + de + c'd'e '+ bd and Z4 = a'c'e + ce using a 5 * 8 * 4 PLA.9th. Implement the switching functions:.Z1 = ab'd'e + a'b'c'e '+ bc + de,.Z2 = a'c'e,.Z3 = bc + de + c'd'e '+ bd and.Z4 = a'c'e + ce Using a 5 * 8 * 4 PLA.10 Design a switching circuit that converts a 4 bit binary code into a 4 bit Gray code using.ROM array.11.Design a combinational circuit using a ROM, that accepts a 3 - bit number and.generates an output binary number equal to the square of the given input number.Unit - IV Synchronous Sequential Logic.Part A.One. Derive the characteristic equation of a D flip flop.Two. Distinguish between combinational and sequential logic circuits.Three. What are the various types of triggering of flip-flops?4th. Derive the characteristic equation of a T flip flop.Five. Derive the characteristic equation of a SR flip flop.6. What is race round condition? How it is avoided?7th. List the functions of asynchronous inputs.Eight. Define Master slave flip flop.9th. Draw the state diagram of 'T' FF, 'D' FF.10th. Define Counter.11th. What is the primary disadvantage of an asynchronous counter?12th. How synchronous counters differ from asynchronous counters?13th. Write a short note on counter applications.14th. Compare Moore and Mealy models.15th. When is a counter said to suffer from lock out?16th. What is the minimum number of flip flops needed to build a counter of modulus z 8?17th. State the relative merits of series and parallel counters.18th. What are Mealy and Moore machines?19th. When is a counter said to suffer from lockout?20th. What is the difference between a Mealy machine and a Moore Machines?21. Distinguish between synchronous and asynchronous sequential logic circuits.22. Derive the characteristic equation of a JK flip flop.23. How will you convert a JK flip flop into a D flip flop.24th. What is mean by the term 'edge triggered'?25th. What are the principle differences between synchronous and asynchronous networks.26th. What is lockout? How it is avoided?27th. What is the pulse mode operation of asynchronous sequential logic circuits not very.popular?28th. What are the advantages of shift registers?29th. What are the applications of a shift register?30th. How many flip-flops are needed to build an 8 bit shift register?31. A shift register comprises of JK flip-flops. How will you complement of the counters of the.register.32. List the basic types of shift registers in terms of data movement.33. Write a short notes on PRBS generator.34th. Give the HDL dataflow description for T flip - flop.35th. Give the HDL dataflow description for JK flip - flop.Part B.1 Draw the state diagram and characteristics equation of T FF, D FF and JK FF.2 (a) What is race around condition? How is it avoided?(B) Draw the schematic diagram of Master slave JK FF and input and output.waveforms.Discuss how it prevents race around condition.3 Explain the operation of JK and clocked JK flip-flops with suitable diagrams.4 Draw the state diagram of a JK flip-flop and D flip - flop.5 Design and explain the working of a synchronous mod - 3 counter.6 Design and explain the working of a synchronous mod - 7 counter.7 Design a synchronous counter with states 0,1, 2,3,0,1 ............. Using JK FF.8 Using SR flip flops, design a parallel counter which counts in the sequence.000,111,101,110,001,010,000 .............9 Using JK flip flops, design a parallel counter which counts in the sequence.000,111,101,110,001,010,000 .............10 (a) Discuss a decade counter and its working principle.(B) Draw as asynchronous 4 bit up-down counter and explain its working.11 (a) How is the design of combinational and sequential logic circuits possible with PLA?(B) Mention the two models in a sequential circuit and distinguish between them.12 Design a modulo 5 synchronous counter using JK FF and implement it. Construct its.timing diagram.12 A sequential machine has one input line where 0's and 1's are being incident. The.machine has to produce a output of 1 only when exactly two 0's are followed by a '1 '.or exactly two 1's are followed by a '0 '. Using any state assignment and JK.flipflop, synthesize the machine.13 Using D flip-flop, design a synchronous counter which counts in the sequence.000, 001, 010, 011, 100, 1001,110,111,000.15 Using JK flip-flops, design a synchronous sequential circuit having one and one.output. the output of the circuit is a 1 whenever three consecutive 1's are.observed. Otherwise the output is zero.14 Design a binary counter using T flip - flops to count in the following sequences:.(I) 000,001,010,011,100,101,110,111,000.(Ii) 000,100,111,010,011,000.15 (a) Design a synchronous binary counter using T flip - flops.(B) Derive the state table of a serial binary adder.17th. Design a 3 bit binary Up-Down counter.18th. (I) Summarize the design procedure for synchronous sequential circuit.(Ii) Reduce the following state diagram.Unit - V Asynchronous Sequential Logic.Part A.One. Distinguish between fundamental mode and pulse mode operation of asynchronous.sequential circuits.Two. What is meant by Race?Three. What is meant by critical race?
4th. What is meant by race condition in digital circuit?Five. Define the critical rate and non critical rate.6. What are races and cycles?7th. What is the significance of state assignment?Eight. What are the steps for the analysis of asynchronous sequential circuit?9th. What are the steps for the design of asynchronous sequential circuit?10th. Write short notes on (a) Shared row state assignment.(B) One hot state assignment.11th. What are Hazards?12th. What is a static 1 hazard?13th. What is a static 0 hazard?14th. What is dynamic hazard?15th. Define static 1 hazard, static 0 hazards, and dynamic hazard?16th. Describe how to detect and eliminate hazards from an asynchronous network?17th. What is static hazard?18th. List the types of hazards?19th. How to eliminate the hazard?20th. Draw the wave forms showing static 1 hazard?Part B.One. What is the objective of state assignment in asynchronous circuit? Give hazard - free.realization for the following Boolean function f (A, B, C, D) = _M (0,2,6,7,8,10,12).Two. Summarize the design procedure for asynchronous sequential circuit.a. Discuss on Hazards and races.b. What do you know on hardware descriptive languages?Three. Design an asynchronous sequential circuit with 2 inputs X and Y and with one output Z.Wherever Y is 1, input X is transferred to Z. When Y is 0; the output does not change for.any change in X.Use SR latch for implementation of the circuit.4th. Develop the state diagram and primitive flow table for a logic system that has 2 inputs, x.and y and an output z.And reduce primitive flow table. The behavior of the circuit is stated.as follows. Initially x = y = 0. Whenever x = 1 and y = 0 then z = 1, whenever x = 0 and y = 1.then z = 0.When x = y = 0 or x = y = 1 no change in z ot remains in the previous state. The.logic system has edge triggered inputs with out having a clock. the logic system changes.state on the rising edges of the 2 inputs. Static input values ​​are not to have any effect in.changing the Z output.Five. Design an asynchronous sequential circuit with two inputs X and Y and with one output Z.Whenever Y is 1, input X is transferred to Z.When Y is 0, the output does not change for.any change in X.6. Obtain the primitive flow table for an asynchronous circuit that has two inputs x, y and one.output Z. An output z = 1 is to occur only during the input state xy = 01 and then if the only if.the input state xy = 01 is preceded by the input sequence.7th. A pulse mode asynchronous machine has two inputs. It produces an output whenever two.consecutive pulses occur on one input line only. The output remains at '1 'until a pulse has.occurred on the other input line. Draw the state table for the machine.Eight.(A) How will you minimize the number of rows in the primitive state table of an incompletely.specified sequential machine.(B) State the restrictions on the pulse width in a pulse mode asynchronous sequential.machine.9th. Construct the state diagram and primitive flow table for an asynchronous network that has.two inputs and one output. The input sequence X1X2 = 00,01,11 causes the output to.become 1.The next input change then causes the output to return to 0.No other inputs will.produce a 1 output.

CS2403 - Digital Signal Processing Question bank download

CS2403 - Digital Signal Processing

POSSIBLE 2 TWO MARKS QUESTIONS (UNIT I-V)

1.     What is meant by aliasing? How can it be avoided?
2.     Find the energy and power of x (n) = Aejωn u (n).
3.     Determine which of the following sequences is periodic, and compute their fundamental period. (A) Aej7πn (b) sin (3n)
4.     Is the system y (n) = ln [x (n)] is linear and time invariant?
5.     Determine Z transform of x (n) = 5nu (n)
6.     State sampling theorem.
7.     Find the signal energy of (1/2) n u (n)
8.     Determine whether the following sinusoids is periodic, if periodic then compute their fundamental period. (A) cos 0.01πn (b) sin (π62n/10)
9.     Check whether the system y (n) = ex (n) is linear.
10.     Determine Z transform of x (n) = anu (n)
11.     How DFT is differ from DTFT
12.     Find DFT of sequence x (n) = {1, 1, -2, -2}
13.     What are the computational saving (both complex multiplication and complex addition) in using N - point FFT algorithm.
14.     What do you mean by in - place computation?
15.     Differentiate between DIT and DIF FFT algorithm.
16.     Write DFT pair of equation
17.     List any four properties of DFT.
18.     Compute DFT of x (n) = {1, -1, 1, -1}
19.     Calculate% saving in computing through radix - 2, DFT algorithm of DFT coefficients. Assume N = 512.
20.     Find the value of WNK when N = 8 and K = 2 and also k = 3
21.     What are the advantages of FIR filters?
22.     What are the desirable characteristics of windows?
23.     Define Phase Delay and Group Delay.
24.     Draw the Direct form I structure of the FIR filter.
25.     Compare FIR and IIR digital filter
26.     Draw the ideal gain Vs frequency characteristics of HPF and BPF.
27.     What is Gibb's phenomenon?
28.     Write the steps involved in FIR filter design.
29.     List out the different forms of structural realizations available for realizing a FIR system.
30.     Use the backward difference for the derivative and convert the analog filter to digital filter given H (s) = 1 / (s2 +16)
31.     State the relationship between the analog and digital frequencies when converting an analog filter using bilinear transformation.
32.     Explain the advantage and drawback of Bilinear transformation
33.     Explain the term "wrapping effect"
34.     Find the transfer function for normalized butterworth filter of order 1 by determining the pole values.
35.     Find digital filter equivalent for H (s) = 1 / (s +8)
36.     Sketch the mapping of s - plane and z - plane in bilinear transformation.
37.     Represent decimal number 0.69 in fixed point representation of length N = 6
38.     What is Vocoder.
39.     What are the different formats of fixed point representation?
40.     State a few applications of adaptive filter

POSSIBLE 16 SIXTEEN MARKS QUESTIONS (UNIT I-V)

1.     (I) Find the convolution of the signals x (n) = and h (n) = u (n). (8)
2. (Ii) Consider a system y (n) + y (n - 1) = x (n) + x (n - 1). Find transfer function, and impulse response the system. (8)
3.     (I) Find inverse Z - transfer of
4. X (Z) = if
5.     ROC: | Z |> 1, (2) ROC: | Z | <0.5, (3) ROC: 0.5 <| Z | <1 (12).
6. (Ii) Derive expressions to relate Z - transfer and DFT (4)
7.     (I) Determine the transfer function, and impulse response of the system y (n) - y (n - 1) + y (n - 2) = x (n) + x (n - 1). (8)
8. (Ii) Find the convolution sum of
9. and h (n) = δ (n) - δ (n - 1) + δ (n - 2) - δ (n - 3). (8)
10.     (I) Find the Z transform of (4 + 4)
11.     x (n) = 2n u (n - 2)
12.     x (n) = n2 u (n)
13. (Ii) State and explain the scaling and time delay properties of Z transform. (8)
14.     (I) Discuss the properties of DFT. (10)
15. (Ii) State and prove the circular convolution property of DFT. (6)
16.     (I) Compute DFT of following sequence (6)
17.     (1) x (n) = {1, 0, -1, 0}
18.     (2) x (n) = {j, 0, j, 1}
19.     (Ii) Using DFT and IDFT method, perform circular convolution of the sequence x (n) = {1, 2, 2, 1} and h (n) = {1, 2, 3}. (10)
20.     Find DFT of the sequence x (n) = {1, 1, 1, 1, 1, 1, 0, 0} using radix -2 DIF - FFT algorithm. (16)
21.     Compute the eight point DFT of the given sequence x (n) = {½, ½, ½, ½, 0, 0, 0, 0} using radix - 2 DIT - DFT algorithm. (16)
22.     (I) Design digital low pass filter using BLT. Given that Assume sampling frequency of 100 rad / sec. (8)
23.     (Ii) Design IIR filter using impulse invariance technique. Given that and implement the resulting digital filter by adder, multipliers and delays. Assume sampling period = 1sec. (8)
24.     (I) Obtain the direct form1, canonic form and parallel form realization structures for the system given by the difference equation () = - 0 .1 (- 1) + 0.72 (- 2) + 0.7 () - 0.252 (- 2) . (10)
25. (Ii) If find using impulse invariant method for sampling frequency of 5 samples / sec (6)
26.     Design butterworth filter using bilinear transformation method for the following specifications
27.   0.8 ≤ | H (ejω) | ≤ 1; 0 ≤ ω ≤ 0.2π
28.                 | H (ejω) | ≤ 0.2; 0.6 ≤ ω ≤ π (16)
29.     Design an IIR digital low pass butterworth filter to meet the following requirements: Pass band ripple (peak to peak): ≤ 0.5dB, Pass band edge: 1.2kHz, Stop band attenuation: ≥ 40dB, Stop band edge: 2.0 kHz, Sampling rate : 8.0 kHz. Use bilinear transformation technique. (16)
30.     Design a symmetric FIR low pass filter whose desired frequency is given as () =
31.     The length of the filter should be 7 and = 1 rad / sample. Use rectangular window. (16)
32.     (I) For a FIR linear phase digital filter approximating the ideal frequency response
33.     () =
34.     Determine the coefficients of a 5 tap filter using rectangular window. (8)
35.     (Ii) Determine unit sample response () of a linear phase FIR filter of length M = 4 for which the frequency response at and is given as r (0) = 1 and r ((8)
36.     (I) Determine the coefficients h (n) of a linear phase FIR filter of length M = 15 which has a symmetric unit sample response and a frequency response (12)
37.             Hr =
38. (Ii) State the advantage of floating point representation over fixed points representation. (4)
39.     (I) Determine the first 15 coefficients of FIR filters of magnitude specification is given below using frequency sampling method: () = (12)
40. (Ii) Discuss the effect of finite word length on digital filter. (4)
41.     With neat diagram and supportive derivation explain multirate signal processing using two techniques. (16)
42.     (I) Explain decimation of sampling rate by an integer factor D and derive spectra for decimated signal. (10)
43. 
    
    (Ii) Discuss on sampling rate conversion of rational factor I / D (6) 
44.     Write short notes on (a) Image enhancement (b) Speech Processing (c) Musical sound processing and (d) vocoder. (16
45.     What is adaptive filter? With neat block diagram discuss any four applications of adaptive filter. (16)