242/BCA SKBU/UG/2nd Sem/BCA/HC201/19 g) Write the difference between combinational

circuit and sequential circuit?

U.G. 2nd Semester Examination - 2019
h) Convert binary number (10110101)2 to gray
BCA code.
Course Code : BBCACCHC201
i) Write the limitation of S-R flip flop.
Course Title: Digital Logic
Full Marks : 30 Time : 2 Hours j) What do you mean by ripple counter?
The figures in the right-hand margin indicate marks. k) Express the decimal number (3421) 10 in
Candidates are required to give their answers in their Excess-3 code.
own words as far as practicable.
l) A certain multiplexer (MUX)can switch one
of 32 data inputs to its output. How many
1. Answer any ten questions: 1×10=10 different inputs does this MUX have?

a) Convert the decimal number (FB17) 16 into m) What do you mean by trigger?
octal number. n) Write the advantage of using K-map.
b) Draw the two exclusive gates. o) Find 10's complement of (216)10.
c) What is the use of don't care condition? 2. Answer any five questions: 2×5=10
d) How many flip flops are required to design a a) Implement Ex-OR gate using only NAND
mod-8 counter? gates.
e) Subtract-45 from 36 using 2's complement. b) Implement F=(A+B). BC using basic gates
f) Multiply the binary number (1011) 2 with except OR gates.
(101) 2. c) How does an encoder differ from decoder?

[Turn Over] 242/BCA (2)

 d) Differentiate between ripple counter and c) i) Design a counter with the following
synchronous counter. binary sequence: 0, 4, 2, 1, 6 using J-K
e) Show that dual of EX-NOR is equal to its flip flop.
complement. ii) Explain the operation of universal shift
f) Simplify using K-map: register. 2+3

m(0, 2, 4, 8, 10) + (12, 13, 14, 15).

d —————
g) What is full-subtractor? Design and write its
truth table.
h) Design a 4-bit SISO (Serial In Seriout Out) Shift
register.
3. Answer any two questions: 5×2=10
a) i) Implement a full adder using two half
adder.
ii) Simplify the following expression using
boolean algebra:
xyz + xyz + x y z + xyz + xyz .
2+3
b) The sum of two numbers written as 21 and 18
is 110. What is the base of the number system?
Design a binary comparator to compare two
binary numbers A and B each consisting of two
bits. 2+3

242/BCA (3) [Turn Over] 242/BCA (4)

243/BCA SKBU/UG/2nd Sem/BCA/HC202/19 g) What is a binary search tree?
h) Define depth of a node of a binary tree.
U.G. 2nd Semester Examination - 2019
i) What is full binary tree?
BCA
Course Code : BBCACCHC202 j) What data structure is used to perform
Course Title: Data Structure using C recursion?
Full Marks : 30 Time : 2 Hours k) State two applications of stack.
The figures in the right-hand margin indicate marks.
l) What does the following postfix expression
Candidates are required to give their answers in their
evaluate to?
own words as far as practicable.
2 2 3 + *
m) What is Deque?
1. Answer any ten questions from the following:
1×10=10 n) What is the prerequisite for binary search
algorithm?
a) What do you mean by leaf node of a tree?
o) What is an abstract data type (ADT)?
b) What is complete graph?
2. Answer any five questions from the following:
c) What is the time complexity to insert an
2×5=10
element at the beginning of a singly linked list?
a) Sort the numbers 10, 6, 5, 7 and 1 using bubble
d) State two examples of non-linear data
sort algorithm.
structure.
b) What are the differences between array and
e) What is malloc ( )?
linked list?
f) What is the worst-case time complexity of
quick sort algorithm?

[Turn Over] 243/BCA (2)

 c) Define PUSH operation of stack. g) Draw the picture of the directed graph
specified below:
d) The following postfix expression with single-
digit operands is evaluated using a stack: G = (V, E)

8 2 3 ^ / 2 3 * + 5 1 * – V(G) = {1, 2, 3, 4, 5, 6}
E(G) = {(1, 2), (2, 3), (3, 4), (5, 1),
Note that ^ is the exponentiation operator. What
(5, 6), (2, 6), (1, 6), (4, 6), (2, 4)}
will be the top two elements of the stack after
the first * is evaluated? h) What is stable sorting?
3. Answer any two questions from the following:
e) What is a circular linked list? What is the
5×2=10
advantage of a circular queue?
a) Write down the algorithm/pseudocode for
f) Find the pre-order, in-order and post-order
selection sort. Write down the C code for
traversals of the following binary tree. deleting the last element of a singly linked list.
2+3
A
b) Implement the ENQUEUE and DEQUEUE
operations of a queue. State an application of
B C queue. 4+1
c) The in-order and pre-order traversals of a
binary tree are:
D E
In-order: 4 5 6 3 1 8 7 9 11 10 12
Pre-order: 1 3 5 4 6 7 8 9 10 11 12

F
Construct the binary tree from the given
G
information and find the post-order traversal.
4+1
H I —————

243/BCA (3) [Turn Over] 243/BCA (4)