Bh.Questionbanks  SEComps 
Brainheaters Questionbanks (Semester Exam) is the collection of handpicked set of questions which are mostly repeated, important and recommended. Learning this set of questions can easily help you top or even just clear the exams. Given below are Expected Questionbanks for semester. To get the solutions to this questions just simply click the Notes and you will be redirected to our notes, Bh.Notes holds your answers. (All Notes are Not Available) !!
Semester 3D.s
MODULE1 1. Explain linear and non linear data structure with example. 2. Iteration VS Recursion 3. Explain different types of Data Structures with example. MODULE2 1. Write ADT for stack. Give application of stack. 2. Write a program to convert an expression from infix to postfix using stack. 3. What is recursion? Write a recursive function in ‘C’ to find sum of digits of a number. 4. Convert the following expression to postfix. (Given with Question) 5. Give ADT for the queue data structure. Discuss any two applications of queue data structure. 6. Write a program to implement linear queue using array. 7. Write a program in 'C' to evaluate postfix expression using STACK ADT. 8. Write a program in 'C' to implement Circular queue using arrays. MODULE3 1. Explain Circular queue and Double ended queue with example. 2. Write a program in C to create a singly linked list and perform the following operations. (i) Insert into list (ii) Search for data (ii) Delete from list (iv) Display data. (i) Insert a node in the beginning (ii) Insert a node in the end (iii) Insert a node after a specific node (iv) Deleting element from the beginning (v) Displaying the list (vi) Exit 3. Write a Program in 'C’ to implement : Doubly linked list with methods insert, delete and Search. (i) Insert a node in the beginning (ii) Insert a node in the end. (iii) Delete a node from the end (iv) Display the list 4. Write a program in 'C’ to implement QUEUE ADT using LinkedList. Perform the following operations: (i) Insert a node in the Queue. (ii) Delete a node from the Queue (iii) Display Queue elements 5. State advantages of LinkedList over arrays. Explain different applications of Linkedlist MODULE4 1. Explain practical applications of trees. 2. Insert the following elements in a AVL search tree: 40, 23, 32, 84, 55, 88, 46, 71, 57. Explain different rotations in AVL trees 3. Write a program to construct binary tree for the following preorder and inorder traversal sequences. PreOrder: A B D G C E H I F InOrder: D G E A H E I C F 4. What is Huffman coding? Construct the Huffman Tree and determine the code for each symbol in the sentence "ENGINEERING". 5. Threaded binary tree 6. Explain B tree and B+ Tree. 7. Expression Trees 8. Splay Tree and Trie. MODULE5 1. Write a function for BFS traversal of graph. 2. Various techniques of Graph representation MODULE6 1. Write a program in C to perform Quick sort. Show steps with example. 2. What is hashing? What is meant by collision? Using modulo division method insert the following values in a hash table of size 10. Show how many collisions occurred. 99, 33, 23, 44, 56 , 43, 19 3. Short note on Heap Sort 4, Using Linear probing and Quadratic Probing insert the following values in a hash table of Size 10. Show how many collisions occur in each iteration: 28, 55, 71, 67, 11, 10 90, 44. 5. Compare Quick Sort and Radix Sort based on their advantages and disadvantages. 6. Write a ‘C’ program to search a list using Indexed Sequential Search. What are the advantages of using Indexed Sequential Search over Sequential Search. 7. Write a program to implement binary search on sorted set of integers. 8. Explain Topological sorting with example. 9. Write a program in 'C' to implement Merge sort DSGT
MODULE1
1. Prove the following (AB)U(BA)=(A U B) (An B). 2. PROVE USING MATHEMATICAL INDUCTION 2+5+8+......+3(n1)=n(3n+1)/2 3. let A={a,b,c,d,e,f,g,h} Consider the following subsets of A A1={a,b,c,d} A2={a,c,e,g,h} A3={a,c 1 e,g} A4={b,d} A5={f,h} Determine whether following is partition of A or not. Justify i) {A1,A2} ii){A3,A4,A5} 4. In a class of students undergoing a computer course the following were observed Out of a total of 50 students. 30 know pascal 18 know Fortran 26 know COBOL 9 know both pascal and fortran 16 of them both Pascal and COBOL 8 know both fortran and cobol 47 know at least one of 3 languages For this we have to determine : 1) How many students know none of these languages 2) how many students know all three languages 3) how many students know exactly one language MODULE2 1. Determine the number of integers between 1 to 250 that are divisible by any integer 2,3,5,7. 2. Show that n(n21) is divisible by 24, where n is any odd positive integer. 3. Determine the following posets are boolean algebra. Justify your answer. i) A={1,2,3,6} with divisibility ii) D20: divisors of 20 with divisibility 4. Define universal and existential quantifiers? explain with examples. 5. Show that (~P^(~Q^R))V(Q^R)V(P^R)⇔R MODULE3 1. Suppose that A is non empty set, and f is a function that has A as its domain. Let R be the Relation on A consisting of all ordered pair (x,y) where f(x)=f(y) show that Ris an equivalence relation of A. 2. Given S={1,2,3,4} and a relation R on S given by R={(4,3),(2,2),(2,1),(3,1),(1,2)} i) show R is not transitive ii) Find transitive closure of R by warshall’s algorithm 3. Functions f,g,h are defined as a set X={1,2,3} f={(1,2),(2,3),(3,1)} , g{(1,2),(2,1),(3,3)} , h{(1,1),(2,1),(3,1)} i) Find f o g , g o f are they equal? ii) Find f o g o h and f o h o gv 4. Determine the matrix of partial order of visibility on the set A={1,3,5,15,30} Draw the Hasse diagram of the poset. Indicate whether it is a chain or not. 5. Find complement of each element in D30 6. Explain distributive Lattice show that the following diagrams represent nondistributive lattice. (Diagram) 7. Let the function f:RRf(x)=2x3 Find f2=f o f, f3=f o f 8. Let A be set of integers and R be the relation on AXA defined by(a,b)R(c,d) if and only if a+d=b+c. Prove that R is an equivalence relation. 9. Define reflexive closure and symmetric closure of a relation, Also find reflexive and symmetric Closure of R. A={1,2,3,4} R={(1,1),(1,2),(1,4),(2,4),(3,1),(3,2)(4,2),( 4,3),(1.4} MODULE4 1. find the ordinary generating functions for the given sequence: i) {0,1,2,3,4…} ii) {1,2,3,4…..} iii) {0,3,32,33,....} iv) {2,2,2,2,.....} 2. Define pigeonhole principle and extended pigeonhole principle show that if seven colours are used to paint 50 by cycles and at least 8 bicycles will be of same color. MODULE5 1. Prove that a connected graph with n vertices must have at least n1 edges. Can a single undirected graph of 8 vertices have 40 edges excluding self loop. 2. Let T be the set of even integers, show that (Z,+) and (T,+)are isomorphic. 3. Define Hamiltonian path and circuit with example what is the necessary and sufficient condition To exist Hamiltonian circuit? 4. Find the solution of ar+2+2ar+13ar=0 that satisfies a0=1, a1=2 5. Find the solution for ar+2+2ar+13ar=0 6. Decode the following words relative to a maximum spanning tree. use the same to find minimum tree for the following. (Diagram) 7. Define Euler's path i)Determine Euler cycle and path in graph in (a) ii)Determine Hamiltonian cycle and path in graph shown in (b). (Diagram) MODULE6 1. Consider the set A={1,2,3,4,5,6} under the multiplication modulo 7. i) find the multiplication table for above. ii) find the inverse of 2,3 and 5,6 iii) prove that it is a cyclic group iv) find the orders and the subgroups generated by{3,4}and {3,4}. 2. For each of the following sets of weights construct an optimal binary prefix code. For each weight. In the set give the corresponding code word: i) 1,2,4,6,9,10,12 ii)10,11,14,16,18,21 iii) 5,7,8,15,35,40. 3. Show that the (2,5) encoding functions e: B2B5 is defined by e(00)=00000 e(01)=01110 e(10)=10101 e(11)=11011 is a group code. How many errors will it detect? 4. prove that the set G ={0,1,2,3,4,5} is an abelian group of order 6 with respect to addition modulo 6. 5. consider the {3,5} group encoding function defined by 8e(000)=00000 e(001)=00110 e(010)=01001 e(011)=01111 e(100)=10011 e(101)=10101 e(110)=11010 e(111)=11000 6. Be a parity check matrix. Determine the group code group (Matrix) 7. Determine if following groups G1 and G2 are isomorphic or not. (Diagram) Maths III
MODULE1 1. Find laplace transform of (Given any Numerical) 2. Find laplace transform of F(x) = (Given any Numerical) 3. Using Laplace transform Evaluate (Given any Numerical) MODULE2 1. Find Laplace Inverse (Given any Numerical) using convolution theorem. 2. Solve using Laplace transform Differential equation (Given any Numerical MODULE3 1. Find half range cosine series for f(x)= (Given any Numerical) 2. Obtain fourier series for following functions: (Given any Numerical) 3. Show that set of following functions (Given any Numerical) Form an orthogonal set in (L, L) and construct an orthogonal set. MODULE4 1. Is f(z)= (Given any Numerical) is analytic? 2. if (Given any Numerical) show that V and H Harmonic and Find the corresponding analytic function. 3. Find the bilinear transformation which maps the points 0, 1, 2i Of zplane onto the points 4i, , 0 resp. Of wplane. Also obtain fixed Points of the transformation. 4. Find that (Given any Numerical) is analytic and find its derivative. 5. Find the analytical function (Given any Numerical) 6. Find the orthogonal trajectory of (Given any Numerical). 7. Show that (Given any Numerical) maps the circle (Given any Numerical) into straight line (Given any Numerical) 8. Show that the function f(z)= (Given any Numerical) is analytic and find f’(z) in terms of z. MODULE5 1. Find the Ztransformation of (Given any Numerical) 2. Find inverse Ztransform of f(x)= (Given any Numerical) 3. Find the Z transform of (Given any Numerical) MODULE6 1. Find the equation of the line of regression or Y on X for the following data. (Given any Numerical) 2. Calculate the coefficient of correlation between X and Y from the following data. (Given any Numerical) 3. Fit a curve of the form (Given any Numerical) to the following data (Given any Numerical) 4. From 8 observations the following results were obtained (Given any Numerical) Find the equation of the line of regression of x on y and the coefficient of correlation. 5. Compute Spearman’s Rank correlation coefficient for the following data: (Given any Numerical) 6. Fit a straight line of the form y=a+bx to the following data and estimate the value of y for x= 3.5. (Given any Numerical) ECCF
MODULE1 1. Mention important specifications of ADC and DAC required for communication. 2. Determine the output voltage for the circuit of (Given any value) (Given Circuit) 3. Draw input and output characters of BJT state significance of DC load line. 4. For the emitter bias network of figure given below determine. (Given any value) (Given Circuit) MODULE2 1. Compare Hartley and Colpitts Oscillator along with neat diagrams. 2. Differentiate between BJT based Class A and Class C power amplifiers. 3. State and explain Barkhausen's criteria for oscillations. MODULE3 1. Determine suitable resistor values for the circuit shown in fig. using a (Given any value) op amp. (Given Circuit) 2. With neat block diagram explain how PLL can be used to generate large number of frequencies from a single reference frequency 3. For the common source circuit shown in figure. Calculate the gate input impedance, the drain output impedance, the circuit input and output impedance and the voltage gain. Use the typical parameters for the FET. (Given Circuit) 4. With suitable waveforms explain how opamp can be used as differentiator. 5. Explain the concept of virtual ground in operational amplifier. 6. With neat diagram explain the operating principle of PLL and its use as a phase shifter. 7. Determine: (Given any value) (i) upper and lower side frequencies. (ii) modulation coefficient and percentage modulation. (iii) peak amplitude of the modulated carrier and upper and lower side frequency voltages. (iv) expression for the modulated wave. (v) draw the output spectrum. 8. List down various parameters of op amp along with their typical values for IC741. Also explain what is the significance of CMRR and Slew Rate. 9. Write neat diagram explain any one application of opamp based comparator. 10. Discuss the operating principle of PLL and explain its use as FM detector. 11. What is source of the leakage current in a transistor? If the emitter current of a transistor in (Given any value) determine the levels of IC and IB. 12. The emitter bias configuration as shown in following figure has the specification: (Given any value) Determine (Given any value) 13. Explain the following parameters and their values for 741 op amp. CMRR, Slew Rate, Gain Bandwidth product, Input Offset Voltage and output Resistance. 14. Write short note on opamps as comparator. 15. Write a note on zero crossing detector using op amp with waveforms. 16. Implement summing operational amplifier using inverting configuration of opamp. 17. With suitable waveforms explain how of opamp can be used as differentiator. MODULE4 1. When a broadcast AM transmitter is 50% modulated, its antenna current is (Given any value). What will be the current,when the modulation depth is increased to 0.9? 2. Explain the generation of DSB SC using balanced modulator. 3. With neat diagram and waveforms, explain the principle of operation of superheterodyne receiver. 4. Write short note on generation of FM by Armstrong method. 5. Explain the necessity and significance of modulation in communication. 6. Draw the block diagram of phase cancellation SSb generation and explain how the carrier and unwanted sidebands are suppressed. 7. With respect to neat diagram explain the elements of analog communication system. 8. For an AM DSB SC modulator with carrier frequency (Given any value) and a maximum modulating signal frequency (Given any value) determine.
I. peak amplitude of USF and LSF II. peak amplitude of carrier III. peak change in amplitude of envelope IV. modulation coefficient V. draw AN envelope. MODULE5 1. Compare various pulse modulation techniques. 2. Explain the detection of pulse code modulation 3. Discuss delta modulation and adaptive delta modulation. 4. Draw the spectrum of amplitude modulated wave and explain its components. 5. Explain principle of TDM. 6. Draw the PAM, PPM and PWM waveforms in the time domain assuming a sinusoidal modulating signal. Explain them in brief. 7. Nyquist Criteria? What is its significance? 8. Write a note on Pulse code modulation with waveforms. MODULE6 1. What is the maximum capacity of a perfectly noiseless channel whose bandwidth is (Given any value) in which the values of the data transmitted may be indicated by any one of the 10 different amplitudes? 2. Give the proper definition for entropy and information rate. DLDA
MODULE1 1. Convert Decimal number (Data) into binary, base4, octal, hexadecimal system. 2. A 7 bit even parity hamming code is received as 100010. Correct it for any errors & extract 4 bit data. 3. Convert (Data) to its equivalent sign magnitude form. (Data) 4. Construct Hamming code for BCD (Data). Use even parity. OR Design a logic circuitto convert BCD to Gray code. 5. Perform subtraction using 16’s complement. (Data) OR Perform subtraction using 2’s complement at for (Data) OR Find 8’s complement of following numbers. (Data) 6. Explain the term prime Implicant. 7. Convert (Data) into Excess3 code. OR Perform addition of (Data) 8. Explain ASCII code in brief. MODULE2 1. Express the equation in standard SOP form: (Given Data) OR Minimize the following standard POS expression using Kmap. (Given Data) OR Simplify the following equation using Kmap to obtain minimum SCOP equation & realize the minimum equation using two level NAND gates only (Given Data) 2. Reduce using Quine McCluskey method & realize the equation using only NAND gates.(Given Data) 3. Prove using boolean algebra: "NAND gate is universal gate". 4. Prove that “A positive logic and operation is equivalent to a negative logic OR operation”. 5. Prove ORAND configuration is equivalent to NORNOR configuration 6. Implement the following Boolean equation using NAND gates only. OR Simplify (B+A)(B+D)(A+C)(C+D). 7. Write the entity declaration in VHDL for NOR gate. 8. State and prove De Morgan's law MODULE3 1. What is Multiplexes Implement the following function using 4:1 multiplexer and few gates. (Given Data) OR Implement the following using 8:1 MUX. (Given Data) 2. Develop the truth table for 2bit binary multiplier & design it using a suitable decoder & additional gates. 3. Develop the truth table of 3 bit binary to gray code converter and design it by using 3:8 decoder with active low outputs & additional gates. 4. 2bit Magnitude comparator. 5. Implement the following functions using demultiplexer.(Given Data) OR Design 1:16 Demultiplexer using I:4 Demultiplexer. 6. Priority encoder. 7. Carry look ahead adder. MODULE4 1. Draw JK flipflop using SR flipflop & additional gates. Explain briefly the race around condition in JK flipflop 2. Design MOD7 synchronous upcounter. Show all the design steps. OR Design mod 12 asynchronous UP counter. 3. Draw a circuit diagram for MOD10 asynchronous binary up counter using masterslave JK flipflops. Show the output of each of the flipflop with respect to the clock applied, write the state transition table and explain the operation in brief. 4. What is shift register? Draw a 4bit universal shift register & explain PISO & SIPO operations. 5. Draw & explain the working of 4bit twisted ring counter with timing diagram. 6. List the applications of shift registers. 7. Explain Astable multivibrator. OR State table. 8. Draw the circuit for SR flip flop using two NOR gates and write the architecture body for the same using structural modeling. 9. ALU IC 74181 10. Sequence Generator 11. What is race around condition? How to overcome it? 12. Moore and Mealy machine. MODULE5 1. Write the entity declaration construct in VHDL for NOR gate. 2. Explain Data flow modelling and Behavioral modelling in VHDL 3. Explain the features of VHDL and its modeling. styles. MODULE6 1. Compare TTL & CMOs with respect to speed, power dissipation, fanin & fanout & also define these terms. Semester 4Maths4
MODULE1
aoa
MODULE1
CG
MODULE1
COA
MODULE1
OS
MODULE1

Back to Study Room You loved it ?
Do you think team brainheaters efforts transformed your studies to a smarter version ? Share your ratings with us ! #studyroom
