Enrollment No
Enrollment No
Enrollment No
Bachelor of Engineering
Third Semester Main Examination, Dec-2020
Digital Circuit & Design [CS222T]
Branch-CS
Time: 3:00 Hrs Max Marks 70
Note : Attempt any five questions. All question carry equal Marks.
Q.1 (a) Write down AND gate, NAND gate and exclusive-OR gate with suitable diagram and truth table.
(b) Explain De-Morgan’s theorem with example.
Q.6 (a) What is difference between level triggering and edge triggered?
(b) Write down the master-slave flip-flop.
Q.8 (a) Write down half adder substractot with truth table?
(b) Simplify the logic function using K-map
F ( A, B, C ) = A’C+A’B+AB’C+BC
Enrollment No……………………….
Bachelor of Engineering
Third Semester Main Examination, Dec-2020
Electronic Devices & Circuits [CS-221]
Branch-CS
Time: 3:00 Hrs Max Marks 70
Note : (i) Attempt any five questions.
(ii) Answer should be precise & to be point only.
(iii) Assume suitable data if necessary & state them clearly
Q.1 (a) Explain the V.I characteristics of a PN junction diode and show that PN diode works as a rectifier.
(b) Differentiate BJT and FET.
Q.2 (a) With the help of characteristics curves and neat sketches explain the operation of the junction FET.
(b) What is Zener diode? Explain.
Q.3 (a) What do you understand by feedback in amplifier? Explain it’s types. Write two advantages and
disadvantages of negative feedback.
(b) Draw wien bridge oscillator and explain it’s working.
Q.5 (a) Explain how transistor can be used as a switch. Also discuss it’s switching characteristics.
(b) Write short note on bistable multivibrator.
Enrollment No……………………….
Bachelor of Engineering
Third Semester Main Examination, Dec-2020
Data Structure-II [CS-223]
Branch- CS
Time: 3:00 Hrs Max Marks 70
Note : (i) Attempt any five questions.
(ii) All question carry equal marks.
Q.1 (a) What do you understand by Asymptotic notation? Explain each notation with example and
diagram.
(b) Explain different non primitive data structure and the operation associated with them.
Q.3 Explain the AVL tree insert method and explain. Why its insertion time complexity is still of the
same order as binary tree?
Q.4 (a) Construct an AVL search tree by inserting the following element in order of their occurrence
64, 1, 44, 26, 13, 110, 98, 85
(b) Explain analysis of Heap operation with example.
Q.5 (a) What is a stable sorting algorithm? Also prove counting sort is stable.
(b) Explain outline and offline algorithm.
Q6. (a) What do you understand by data structure maintenance? Explain.
(b) Explain Augmentation strategy with example.
Q.7 (a) Write short note on Internal trees. Explain with example.
(b) Explain retrieving an element with a given rank.
Q.8 (a) Explain Quick sort? Sort the following elements using Quick sort:
32, 23, 56, 78, 12, 66, 37, 93, 29, 80
(b) Write a short notes:
(i) Comparison of indexing and hashing
(ii) Radix sort
(iii) Insertion sort
Enrollment No……………………….
Bachelor of Engineering
Third Semester Main Examination, Dec-2020
Discrete Structures [CS-224]
Branch-CSE
Time: 3:00 Hrs Max Marks 70
Note : Attempt any five questions. All questions carry equal marks.
Q.2 (a) Define - Graph, Degree of a vertex, Even and odd vertex, Degree of Graph, Path.
(b) Define – (A) Ring, (B) Field
Q.6 (a) Show that {1, −1, 𝑖, −𝑖} be the group with respect to multiplication.
(b) A relation R is defined on the set 𝑍� by “𝑎�𝑅�𝑏�𝑖�𝑓�𝑎� – 𝑏� is divisible by 5” for 𝑎�, 𝑏�∈𝑍�.
Examine if R is an equivalence relation on 𝑍�.
Q.7 (a) Expand (2𝑥 – 5𝑦) 7 with the help of binomial expansion.
(b) Define - (A) Set, (B) Countable Set, (C) Uncountable Set
Enrollment No……………………….
Bachelor of Engineering
Third Semester Main Examination, Dec-2020
Communication Skills [HU220]
Branch-CE/EX/EC/CSE/IT/ME
Time: 3:00 Hrs Max Marks 70
Note : Attempt any five questions. All questions carry equal marks.
Enrollment No……………………….
Bachelor of Engineering
Third Semester Main Examination, Dec-2020
Mathematics-III [MA-220]
Branch-EE/EC/CS/IT
Time: 3:00 Hrs Max Marks 70
Note : Attempt any five questions.
All question carry equal marks.
Q.4 (a) Using Newton’s forward Interpolation formula, find the value of 𝑓( ),if
𝑥
𝑦 ���� ���� ���� ����
(b) Solve the following system by Gauss elimination method
𝑥 𝑥 𝑥
𝑥 𝑥 𝑥
𝑥 𝑥 𝑥
Q.5 (a) Apply Lagrange’s formula to find the value of x when ( ) given that
𝑥
𝑓(𝑥) ���� ���� ���� ����
(b) Solve initial value problem 𝑥𝑦 𝑦( )=1 for 𝑥 � by using Milne’s method
when it is given that
𝑥
𝑦 ���� ���� ���� ����
Q.6 (a) Solve the equation 𝑥 𝑦 with initial condition𝑦( ) by Runge kutta rule from 𝑥 to
𝑥 with�
⁄
(b) Evaluate∫ approximately by using a suitable formula.
𝑥 𝑦 𝑧
𝑥 𝑦 𝑧