Importance  I.T Engineering
List of importance for Second year  Sem 3 and Sem 4
Semester 3
Applied maths III
Given below are the important topics from the chapters. The semester papers mostly contains the sums on this concepts, if you can deal all this concept you can easily score pare excellence in exam
CHAPTER NO 1 : COMPLEX VARIABLES CauchyRiemann Equation (Cartisian Coordinates) and constants C.R Equations in PolarCoordinates Harmonic functions Find Analytic function when real and imaginary part are given. Find Analytic function when imaginary part are given. Find Analytic function when U+V and UV is given. Find Analytic function when harmonic function is given. Orthogonal curves (To find orthogonal tragectory means to find imaginary part equation) CHAPTER NO 4 : LAPLASE TRANSFORM  II
Problems on simple Inverse Laplase transform Methods of obtaining I.L.T a) use of standard results b) Use of shifting theorem c)Method of partial fraction d)Use of change of scaleproperty e)Convolution Theorem f) Use of differentiation. g)Use of Integration Laplase transform of periodic function CHAPTER NO 6 : COMPLEX FORMS OF FOURIER SERIES
Complex forms in (c, c+2l) and other intervals. Orthogonal and Orthonormal Fourier Integral theorem Fourier Sine and Cosine Integrals CHAPTER NO 10 : ZTRANSFORM
Determination of ZTRANSFORM Find Inverse ZTRANSFORM 
CHAPTER NO 2 and 3
Normal L.T  Standard form Evaluation of standard L.T Change of scale property First shifting theorem Evaluation of such integrals. (put exact value of s) Evaluation of such integrals. (put the value of s) Effect of multiply by 't' Effect of Divide by 't' CHAPTER NO 5 : FOURIER SERIES
Fourier Expansion for f(x) in Interval Fourier series in (c, c+2l) Fourier series of even and odd function(l,l) Half range series CHAPTER NO 7 : VECTOR ALGEBRA
Scalar product Scalar triple product Vector product Volume of Parallelopiped Volume of tertahedron Vector triple product CHAPTER NO 8 : VECTOR DIFFERENTIATION
Decomposition Directional Derivative of function Divergence and curl 
OOPM
IMPORTANT THEORY QUESTIONS

IMPORTANT BASIC PROGRAMS
Note: Also refer list of programs covered in your practicals. 
DBMS
1. Responsibilities of DBA
2. Define: DBMS 3. Explain primary key with example 4. Explain aggregation with example 5. Explain total participation and partial participation 6. Degree of relationships 7. Weak entity set 8. Short note: Attributes 9. Difference between: File processing system and Database management system. 10.Data Independence 11.Authorization 12. Log based recovery 13. 2PLprotocol 14. Query optimization and evaluation 
15. Database system structure
16. Specialization and generalization 17. ERDiagrams 18. Explain trigger with example 19. Define normalization and explain 1NF,2NF,3NF 4NF and BCNF with example 20. Explain view serializability and conflict serializability 21. Explain following relational algebra operation (Generalize projection, Rename,Set Difference,Division, Join(natural)) 22. What is transaction. Discuss ACID properties of transaction 23. Explain Deadlock and prevention of deadlock 24. Security 25. Authorization 
26. Shadow paging
27. Introduction of views 28. Short note: Types of constraints 29. Referential Integrity 30. Timestamp based protocols 31. Aggregate functions 32. Explain sortmerge join algorithm 33. Explain data modeling Note: SQL queries are very important.

DSAA
1. Asymptotic Notations.
2. Linear and nonlinear data structures 3. Explain Linked list and its applications. 4. Programs based on Linked list 5. Singly and doubly linked list 6. Priority queue and its implementation 7. Double ended queue 8. Insertion and deletion algorithms for binary search tree 9. Infix and Postfix expression 10. Explain AVL tree with Sums based on it 11. Find minimum spanning tree using Prim’s and Kruskal’s algorithm 12. Short note: DFS and BFS 13. Short note: BTree 
14. Short note: Red and Black trees
15. Construction of Inorder and post order 16. Short note on: Radix sort, Merge sort, Shell sort 17. Short note on: Euclid’s algorithm Note: For more information regarding Sums and Programs refer Notes

PADC
1. Advantages of digital communication over analog communication
2. Explain digital communication in detail 3. Need for modulation 4. Compare code and delta modulation n 5. Explain FosterSeelay discriminator working along with circuit and phasor diagram 6. Explain generation and detection of FSK signal 7. State and prove sampling theorem 8. Draw the block diagram of PWM generator. Explain the working giving waveforms at the output of each block. 9. Explain Multiplexing. Draw and explain in brief the transmitter and receiver of FDM 10. What are the limitations of TRF receiver. Explain how these limitations can be avoided using super heterodyne receiver 11. State and prove Time shifting and Convolution in time domain of Fourier Transform with example 12.Explain preemphasis and deemphasis 13.Short note: Noise Bandwidth, Balanced modulator, ratio detector 14. What is PPM? Explain modulation and demodulation used in PPM 
15. Obtain Fourier transform of a sine wave having frequency f0 and peak amplitude of unity. Also plot its frequency spectrum.
16. Short note: Friiss Formula, QPSK 17. Explain baud rate and bit rate 18. Explain generation and demodulation of SSBSC 19. Describe PCM and also explain the PCM encoder and decoder with block diagram. 20.Explain the basic principle, working of Transmitter and receiver and BPSK. Note: For more details about Sums refer Blueprints. and notes

ADC

11.Compare BJT and JFET
12. NAND and NOR as universal gates 13. Short note on: VDHL 14. Sums on Kmap 15. Simplify the given equation and realize using logic gates 16. 8 bit comparator using IC 7485 17. Sums on Implementation of the logic function using MUX 18. Design synchronous counter given following states using JKFF 19. Explain Modulo 5 ripple up counter. 20. Integrator using OAmp 
l.D
Q1. Compare schottky barrier diode and PN junction diode.
Q2. Compare BJT and FET.
Q3. What are different methods used to improve CMRR in differential amplifier.
Q4. Find out relations between 𝞪, 𝜷 and 𝜸 as current amplification factor for CE, CB, CC configuration.
Q5. Give some applications of Opamp and explain the block diagram of Op Amp.
Q6. State ideal and practical characteristics of OPAMP.
Q7. Explain Instrumentation amplifier using 3 OpAmps.
Q8. What is Zener shunt regulator? Explain and derive stability factor.
Q9. Draw a block diagram of voltage shunt regulator and explain its working.
Q10. Define i)slew rate ii)CMRR.
What are the typical values of slew rate and CMRR for Opamp IC741?
Q11. What is the need of biasing ?
Q12. Current Mirror Circuit
Q13. Explain any 4 linear application of operational amplifier
Q14. Explain inverting amplifier using Opamp. Derive the expression of output voltage.
Q15. NonInverting amplifier
Q16. Explain differential amplifier and one method to improve CMRR
Q17. Explain Differentiator using OpAmp.
Q18. Explain voltage biasing and locate the Q point.
Q19. Explain in brief different biasing techniques.
Q20. Explain the working of liquid Crystal Display.
Q21. Design and Implement 4bit binary to gray code converter using decoder.
Q22. Convert (101101.1101)2 to decimal, octal and Hexadecimal.
Q23. Add (83)10 and (34)10 in BCD.
Q24. Short note: Basic logic gate.
Q25. NAND gate is a universal gate.
Q26. Compare Combinational and sequential logic
Q27. Minimize the following expression using kmap and realize using gates.
Y = Σm (1, 2, 9, 10, 11, 15)
Q28. 1 bit bcd adder using IC7483.
Q29. Develop the truth table for 2bit comparator & design it using a suitable decoder & additional gates.
Q30. Full Subtractor.
Q31. Draw truth table for full adder and realise 3:8 decoder.
Q32. Implement F(A,B,C,D) = Σm (0,1,2,4,6,9,12,14) using 8:1 Multiplexer.
Q33. Realize the following expression using only one 8:1 MUX and few logics.
F(A,B,C,D) = Σm (0,3,6,8,11,13,15)
Q34. SR flip flop and JK flip flop.
Q35. Race around.
Q36.Short Note: bidirectional shift register.
Q37. Explain Parallel input, serial output shift register.
Q38. What is shift register?
Q39. Convert SR flipflop to D flipflop.
Q40. Design a synchronous counter using JK flipflop which goes through following states.
Q41. Design mod5 asynchronous counter and also draw waveforms.
Q42. Design Half adder using VHDL.
Q2. Compare BJT and FET.
Q3. What are different methods used to improve CMRR in differential amplifier.
Q4. Find out relations between 𝞪, 𝜷 and 𝜸 as current amplification factor for CE, CB, CC configuration.
Q5. Give some applications of Opamp and explain the block diagram of Op Amp.
Q6. State ideal and practical characteristics of OPAMP.
Q7. Explain Instrumentation amplifier using 3 OpAmps.
Q8. What is Zener shunt regulator? Explain and derive stability factor.
Q9. Draw a block diagram of voltage shunt regulator and explain its working.
Q10. Define i)slew rate ii)CMRR.
What are the typical values of slew rate and CMRR for Opamp IC741?
Q11. What is the need of biasing ?
Q12. Current Mirror Circuit
Q13. Explain any 4 linear application of operational amplifier
Q14. Explain inverting amplifier using Opamp. Derive the expression of output voltage.
Q15. NonInverting amplifier
Q16. Explain differential amplifier and one method to improve CMRR
Q17. Explain Differentiator using OpAmp.
Q18. Explain voltage biasing and locate the Q point.
Q19. Explain in brief different biasing techniques.
Q20. Explain the working of liquid Crystal Display.
Q21. Design and Implement 4bit binary to gray code converter using decoder.
Q22. Convert (101101.1101)2 to decimal, octal and Hexadecimal.
Q23. Add (83)10 and (34)10 in BCD.
Q24. Short note: Basic logic gate.
Q25. NAND gate is a universal gate.
Q26. Compare Combinational and sequential logic
Q27. Minimize the following expression using kmap and realize using gates.
Y = Σm (1, 2, 9, 10, 11, 15)
Q28. 1 bit bcd adder using IC7483.
Q29. Develop the truth table for 2bit comparator & design it using a suitable decoder & additional gates.
Q30. Full Subtractor.
Q31. Draw truth table for full adder and realise 3:8 decoder.
Q32. Implement F(A,B,C,D) = Σm (0,1,2,4,6,9,12,14) using 8:1 Multiplexer.
Q33. Realize the following expression using only one 8:1 MUX and few logics.
F(A,B,C,D) = Σm (0,3,6,8,11,13,15)
Q34. SR flip flop and JK flip flop.
Q35. Race around.
Q36.Short Note: bidirectional shift register.
Q37. Explain Parallel input, serial output shift register.
Q38. What is shift register?
Q39. Convert SR flipflop to D flipflop.
Q40. Design a synchronous counter using JK flipflop which goes through following states.
Q41. Design mod5 asynchronous counter and also draw waveforms.
Q42. Design Half adder using VHDL.
Get answers to each questions in Brainheaters Notes !
#solvedquestionbanks
Semester 4
Maths IV  Concepts
Do well all this concepts from "KUMBHOJKAR" (Students recommended) even if you are ready with all solved problems, you are done !
Complex Integration
Cauchy’s Theorem
Taylor’s and Laurent’s Series
Residues
Eigen values and Eigen Vectors
Correlation

Expectation
Some Standard Distribution
Simplex Method
NonLinear Programming
Regression
Probability

DBMS  (Now in semester 3)
Explain following relational algebra operation:


cn
Chp1:

Chp2:

Chp3:

Chp4:

Chp5:

Chp6:

coa
 Define Computer Graphics and state its application
 What is pixel and frame buffer?
 Explain the symmetric properties of circle
 What is aliasing and antialiasing?
 What are different antialiasing techniques?
 Draw a line using DDA or Bresenham’s line drawing algorithm
 Explain Scaling transformation
 Explain Rotation transformation
 Derive the matrix for rotation about an arbitrary point
 Draw a circle using Bresenham’s circle or midpoint algorithm
 Explain the parallel projection
 Explain the perspective projection
 Explain the 3D clipping
 Explain zbuffer along with advantages and disadvantages
 Explain: Bezier curve
A.T
CHAPTER 1 & 2

CHAPTER 3 & 4

CHAPTER 5, 7 & 8

itc
Chp1: Introduction
Chp2: Divide and Conquer
Chp3: Greedy Method

Chp4: Dynamic Programming
Chp5: Backtracking
Chp6: String Matching Algorithm
Naive String Matcher RabinKarp algorithm Finite automata KnuthMorrisPratt Algorithm Longest common subsequences Chp7: Branch and Bound
Difference between Dynamic programming and Branch & Bound 15Puzzle problem Traveling Salesman problem 
IMPORTANT LIST OF ALGORITHM
  Minmax(Divide and Conquer)
 Merge sort(Divide and Conquer)
 Quick sort(Divide and Conquer)
 Prim’s algorithm
 Kruskal’s algorithm
 Knapsack problem(Fractional)
 Dijkstra’s algorithm
 0/1 knapsack problem
 Graph coloring
 Naive string matcher
 RabinKarp algorithm
 KnuthMorrisPratt Algorithm
 Longest common subsequences
 Sum of subsets
 NQueen problem