Printed Page: 1 of 2 

Subject Code: KCS302

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
B TECH
(SEM-III) THEORY EXAMINATION 2020-21
COMPUTER ORGANIZATION AND ARCHITECTURE
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Q no. Question Marks CO
a. Define the term Computer architecture and Computer organization. 2 1
b. What is mean by bus arbitration? List different types of bus arbitration. 2 1
c. Discuss biasing with reference to floating point representation. 2 2
d. What is restoring method in division algorithm? 2 2
e. Define micro operation and micro code. 2 3
f. Write short note on RISC. 2 3
g. Define hit ratio. 2 4
h. What do you mean by page fault? 2 4
i. Explain the term cycle stealing. 2 5
j. What do you mean by vector interrupt? Explain. 2 5

P
SECTION B
0Q

1
2. Attempt any three of the following: 3 x 10 = 30

13
29

Q no. Question Marks CO

2.
a. i. Draw a diagram of bus system using MUX which has four registers of size 4 bits 10 1
0E

24
each.
P2

ii. Evaluate the arithmetic statement.

5.
X = A + B * [C * D + E * (F + G)]
_Q

using a stack organized computer with zero address operation instructions.

.5
17
TU

b. Explain in detail the principle of carry look ahead adder and design 4-bit CLA adder. 10 2
|1

c. Draw the flowchart for instruction cycle with neat diagram and explain. 10 3
AK

d. Discuss 2 D RAM and 2.5D RAM with suitable diagram. 10 4

6
:0

e. Draw and explain the block diagram of typical DMA controller. 10 5

57

SECTION C
:
13

3. Attempt any one part of the following:

Q no. Question Marks CO
1
02

a. An instruction is stored at location 400 with its address field at location 401.The 10 1
address field has the value 500.A processor register R1 contains the number 200.
-2

Evaluate the effective address if the addressing mode of the instruction is (i) direct (ii)
ar

immediate (iii) relative (iv) register indirect (v) index with R1 as index register
M

b. What do you mean by processor organization? Explain various types of processor 10 1

5-

organization.
|1

4. Attempt any one part of the following:

Q no. Question Marks CO
a. Show the systemic multiplication process of (20) X (-19) using Booth’s algorithm 10 2
b. Explain IEEE standard for floating point representation. Represent the number (- 10 2
1460.125)10 in single precision and double precision format.

1 | P a g e  
 
AKTU_QP20E290QP | 15-Mar-2021 13:57:06 | 117.55.242.131
 Printed Page: 2 of 2 
Subject Code: KCS302
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 

5. Attempt any one part of the following:

Q no. Question Marks CO
a. What is a micro program sequencer? With block diagram, explain the working of 10 3
micro program sequencer.
b. Differentiate between hardwired and micro programmed control unit. Explain each 10 3
component of hardwired control unit organization.

6. Attempt any one part of the following:

Q no. Question Marks CO
a. Calculate the page fault for a given string with the help of LRU & FIFO page 10 4
replacement algorithm, Size of frames = 4 and string 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1
236
b. A computer uses RAM chips of 1024*1 capacity. 10 4
i) How many chips are needed & how should their address lines be connected to
provide a memory capacity of 1024*8?
ii) How many chips are needed to provide a memory capacity of 16 KB?

P
7. Attempt any one part of the following: 0Q
Q no. Question Marks CO

1
a. What do you mean by asynchronous data transfer? Explain strobe control and hand 10 5

13
29

shaking mechanism.

2.
0E

b. Discuss the different modes of data transfer. 10 5

24
P2

5.
 
_Q

.5
17
TU

|1
AK

6
:0
:57
13
1
02
-2
ar
M
5-
|1

2 | P a g e  
 
AKTU_QP20E290QP | 15-Mar-2021 13:57:06 | 117.55.242.131
 Printed Page: 1 of 1 
Subject Code: KNC301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 

B. TECH
(SEM III) THEORY EXAMINATION 2020-21
COMPUTER SYSTEM SECURITY
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Q no. Question Marks CO

a. What are the roles of a) cypher and b) key in cryptography? 2

b. What are some of the advantages and limitations of UNIX? 2
c. What is a privilege and discuss any two secure architecture principles 2
d. What is SSL and how does it work? 2
e. Discuss two problems associated with using ptrace 2
f. What are covert channels and what are their disadvantages? 2
g. When changing effective user ids, distinguish between ways to drop privileges 2
h. Why would you recommend using DNSSEC? 2
i. What are the goals of confidentiality policies? 2

P
j. Explain advanced anti-XSS tools 2
0Q

1
SECTION B

13
29

2. Attempt any three of the following: 10 x 3 = 30

2.
0E

a. Define the logout process, its steps and potential problems. Also, define session 10

24
hijacking and discuss steps to mitigate session-tokens theft.
P2

b. Define Network-based IDS. What are its strengths? 10

5.
_Q

c. Discuss a)SQL injection b)CSRF c)XSS d)Sessions e) Four HTTP auth 10

Problems
.5
17
TU

d. Define role-based access control its major properties and why would you use it? 10
|1

e. Discuss session fixation attacks, steps to perform an attack and how can it be 10
AK

prevented?
3
:5

SECTION C
07

3. Attempt any one part of the following: 10 x 1 = 10

a. Discuss how vulnerabilities can be exploited in web applications. 10
:
14

b. Define identity-based access control. What are the problems associated with it?
10
4. Attempt any one part of the following: 10 x 1 = 10
1
02

a. Discuss single vs public-key cryptography 10

b. Define knark. What are its features and why is it used? 10
-2

5. Attempt any one part of the following: 10 x 1 = 10

ar

a. Define any five of the LRK v4 trojans: ifconfig, login, ls, passwd, ps, rshd, 10
M

syslogd
2-

b. Discuss any three digital signatures and what are the steps to use them in the real 10
|1

world?
6. Attempt any one part of the following: 10 x 1 = 10
a. Discuss DoS attacks and briefly discuss various methods for mitigation of DoS 10
attacks.
b. Discuss any three Real-World Protocols and what are the steps to use them in the 10
real world?
7. Attempt any one part of the following: 10 x 1 = 10
a. Compare access control in Windows with the access control in UNIX 10
b. What is DNS and how does it work? 10

AKTU_QP20E290QP | 12-Mar-2021 14:07:53 | 117.55.242.131

 Printed Page: 1 of 2 
Subject Code: KCS303
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
B TECH
(SEM-III) THEORY EXAMINATION 2020-21
DISCRETE STRUCTURE & THEORY OF LOGIC
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

Q no. Question Marks CO
a. Check whether the function f(x) = x2 - 1 is injective or not for f : R→R. 2 CO3
b. Let R be a relation on set A with cardinality n. Write down the number of 2 CO2
reflexive and symmetric relation on set A.
c. Define group. 2 CO3
d. Define ring. 2 CO3
e. Let A = {1, 2, 3, 4, 6, 8, 9, 12, 18, 24} be ordered by the relation ‘a divides 2 CO3
b’. Find the Hasse diagram.
f. If L be a lattice, then for every a and b in L prove that a ˄ b = a if and only if 2 CO3
a ≤ b.

P
g. Write the negation of the following statement: 0Q 2 CO1
“If I wake up early in the morning, then I will be healthy.”

1
13
h. Express the following statement in symbolic form: 2 CO1
29

“All flowers are beautiful.”

2.
0E

i. Define complete and regular graph. 2 CO4

24
j. Prove that the maximum number of vertices in a binary tree of height h is 2h+1, 2 CO4
P2

5.
h ≥ 0.
_Q

.5
17
TU

SECTION B
|1
AK

2. Attempt any three of the following:

1

Q no. Question Marks CO

:4
55

a. If f : R → R, g : R → R and h : R → R defined by 10 CO3

f(x) = 3x2 +2, g(x) = 7x – 5 and h(x) = 1/x.
:
13

Compute the following composition functions

i. (fogoh)(x)
1

ii. (gog)(x)
02

iii. (goh)(x)
-2

iv. (hogof)(x)
ar

b. State and prove Lagrange theorem for group. 10 CO3

M

c. Prove that in any lattice the following distributive inequalities hold 10 CO3
9-

i. a ˄ (b ˅ c) ≥ (a ˄ b) ˅ (a ˄ c)
|1

ii. a ˅ (b ˄ c) ≤ (a ˅ b) ˄ (a ˅ c)
d. Prove the validity of the following argument 10 CO1
“If I get the job and work hard, then I will get promoted. If I get promoted,
then I will be happy. I will not be happy. Therefore, either I will not get the
job, or I will not work hard.”
e. If a connected planar graph G has n vertices, e edges and r region, then n – e 10 CO5
+ r = 2.

1 | P a g e  
 
AKTU_QP20E290QP | 19-Mar-2021 13:55:41 | 117.55.242.131
 Printed Page: 2 of 2 
Subject Code: KCS303
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
SECTION C
3. Attempt any one part of the following:
a. Prove by mathematical induction for all positive integers that 10 CO2
3.52n+1 + 23n+1 is divisible by 17.
b. Find the numbers between the 100 to1000 that are divisible by 3 or 5 or 7. 10 CO2

4. Attempt any one part of the following:

a. A subgroup H of a group G is a normal subgroup if and only if g- 10 CO3
1
hg ϵ H for every h ϵ and g ϵ G.
b. In a group (G, *) prove that 10 CO3
i. (a-1)-1 = a
ii. (ab)-1 = b-1a-1

5. Attempt any one part of the following:

a. Simplify the Boolean function 10 CO3
F (A, B, C, D) = ∑ (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11)
Also draw the logic circuit of simplified F.
b.
P
Simplify the following Boolean expressions using Boolean algebra 10 CO3
0Q

1
i. xy + x΄z +yz

13
29

ii. C(B + C)(A + B + C)

2.
iii. A + B(A + B) + A(A΄ + B)
0E

24
iv. XY + (XZ)΄ + XY΄Z(XY + Z)
P2

5.
_Q

.5
6. Attempt any one part of the following:
17
TU

a. Define tautology, contradiction and contingency? Check whether (p ˅ q) ˄ ( 10 CO1

|1

~ p ˅ r) → (q ˅ r) is a tautology, contradiction or contingency.

AK

b. Translate the following statements in symbolic form 10 CO1

:4

i. The sum of two positive integers is always positive.

55

ii. Everyone is loved by someone.

:

iii. Some people are not admired by everyone.

13

iv. If a person is female and is a parent, then this person is someone’s

mother.
1
02
-2

7. Attempt any one part of the following:

ar

a. Construct the binary tree whose inorder and preorder traversal is given below. 10 CO4
M

Also, find the postorder traversal of the tree.

9-

Inorder: d, g, b, e, i, h, j, a, c, f
|1

Preorder: a, b, d, g, e, h, i, j, c, f
b. Solve the following recurrence relation 10 CO3
an – an – 1 + 20an – 2 = 0 where a0 = – 3 , a1 = – 10
 

2 | P a g e  
 
AKTU_QP20E290QP | 19-Mar-2021 13:55:41 | 117.55.242.131
 Printed Page: 1 of 1 
Subject Code: KAS301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
B TECH
(SEM-III) THEORY EXAMINATION 2020-21
TECHNICAL COMMUNICATION
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Q no. Question Marks CO
a. Describe various characteristics of technical writing. 2  1
b. Explain deductive order. 2  1
c. How many types of reports are there? 2  2
d. What do you mean by seminar? 2  2
e. Define classroom presentation. 2  3
f. Describe the essentials of good public speaking. 2  3
g. What is the objective of interviews? 2  4
h. Define discourse competence. 2  4
i. What are the dimensions of speeches? 2  5
j. What is content? 2  5
SECTION B
2. Attempt any three of the following: 10x3=30

P
Q no. Question Marks CO
0Q

1
a. Describe the basic requirements of paragraph development. 10  1

13
29

b. Explain 7 C’s or principle of business writing. 10  2

2.
0E

c. What are the four modes of speech delivery which can be used for making a 10  3

24
presentation?
P2

d. What are different types of group discussion? Discuss briefly. 10  4

5.
e. Explain professional personality attributes. 10  5
_Q

.5
SECTION C 17
TU

3. Attempt any one part of the following: 10x1=10

|1

Q no. Question Marks CO

AK

a. Technical communication and general communication are poles apart as they differ in 10 1
3
:4

all aspects. Elucidate.

b. How information flows at various levels in an organization? Explain in detail. 10 1
28

4. Attempt any one part of the following: 10x1=10

:
13

Q no. Question Marks CO

a. What are salient features of resume? Write a short resume for the post of technical 10 2
1

executive in HCL at Lucknow. Invent necessary details.

02

b. Describe synopsis with its structure. 10 2

-2

5. Attempt any one part of the following: 10x1=10

ar

Q no. Question Marks CO

a. What are the tips to overcome stage fear or stage fright? 10 3
M
7-

b. Explain audience analysis with different factors. 10 3

|1

6. Attempt any one part of the following: 10x1=10 

Q no. Question Marks CO
a. What are the techniques to improve seminar/conference skills? 10 4
b. How to prepare for interviews? Discuss briefly. 10 4
7. Attempt any one part of the following: 10x1=10
Q no. Question Marks CO
a. Explain rising tone and falling tone in details. 10 5
b. Discuss the process of communication in details. 10 5
 
Page 1 of 1 
 
AKTU_QP20E290QP | 17-Mar-2021 13:28:43 | 117.55.242.131
 Printed Page: 1 of 2 
Subject Code: KOE039
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
 
DIGITAL ELECTRONICS
Time: 3 Hours Total Marks: 100
Notes:
 Attempt all Sections and Assume any missing data.
 Appropriate marks are allotted to each question, answer accordingly.

SECTION-A Attempt All of the following Questions in brief Marks(10X2=20) CO

Q1(a) How are binary digits used to express the integer and fractional parts of a number? 1
Q1(b) Explain how BCD addition is carried out. 1
Q1(c) Implement a 4:1 multiplexer using 2:1 multiplexer. 2
Q1(d) Demultiplexer is decoder circuit with an additional enabling input. Do you agree 2
with the above statement?
Q1(e) Give the difference between positive and negative edge triggering. 3
Q1(f) A flip-flop has 5 ns delay from the time the clock edge occurs to the time the output 3
is complemented. What is the maximum delay in a 10-bit binary ripple counter that
uses these flip-flops? What is the maximum frequency the counter can operate
reliably?
Q1(g) Define critical race and non-critical race. 4
Q1(h) What is the significance of state assignment? 4
Q1(i) Why is ECL logic faster than TTL? 5
Q1(j) Compare static RAM and dynamic RAM. 5

SECTION-B Attempt ANY THREE of the following Questions Marks(3X10=30) CO

Q2(a) Realize a 3-input gate using 2-input gates for the following gates: 1
(i) AND (ii) OR (iii) NAND (iv) NOR
Q2(b) (i)Implement a full subtractor circuit using only NAND gates. 2
(ii)Using 4:1 multiplexers, implement the following function
F (A, B, C) =∑m(0,2,3,5,7)
Q2(c) Define bi-directional shift register. Draw and explain 3 bit bi-directional shift 3
register using D flip-flop.
Q2(d) Design a primitive state diagram and state table for a circuit with two asynchronous 4
inputs (X and Y) and one output Z. This circuit is to be designed so that if any
change takes place on X and Y, Z is to change states. Assume initially that the two
inputs never change simultaneously.
Q2(e) (i) Write a note on interfacing TTL with CMOS. 5
(ii) Explain the parameters used to characterize logic families.
SECTION-C Attempt ANY ONE following Question Marks (1X10=10) CO
Q3(a) Minimize the following using Tabular method 1
F(A,B,C,D,E) =∑m(0,1,2,3,6,7,14,15,16,19,31)
Q3(b) (i)  Reduce the expression f = ∑ m (0,1,2,3,5,7,8,9,10,12,13) using K-maps and 1
implement the real minimal expression using NAND logic.
(ii) Design the logic circuit for a BCD to decimal decoder.

SECTION-C Attempt ANY ONE following Question Marks (1X10=10) CO

Q4(a) Construct BCD adder using two 4-bit binary parallel adder and logic gates. 2
Q4(b) Explain 4-bit magnitude comparator. 2
 Printed Page: 2 of 2 
Subject Code: KOE039
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
 
DIGITAL ELECTRONICS

SECTION-C Attempt ANY ONE following Question Marks (1X10=10) CO

Q5(a) A sequential circuit has one flip-flop Q, two inputs x and y, and one output S. It 3
consists of a full-adder circuit connected to a D flip-flop, as shown in given figure.
Derive the state table and state diagram of the sequential circuit. What does this
circuit represent?

Q5(b) Design a 3-bit UP/DOWN counter with a direction control M, using JK flip-flops. 3

SECTION-C Attempt ANY ONE following Question Marks (1X10=10) CO

Q6(a) Derive the transition table for the asynchronous sequential circuit shown in given 4
figure. Determine the sequence of internal states Y1Y2 for the following sequence of
inputs x1x2: 00,10,11,01,11,10,00.

Q6(b) (i)Distinguish between static and dynamic hazard. How will you determine hazard in 4
combinational circuits?
(ii)Draw the logic diagram of the product-of-sums expressionY= (x1+x2’) (x2+x3)
Show that there is a static 0-hazard when x1 and x3 are equal to 0 and x2 goes from 0
to 1. Find a way to remove the hazard by adding one more OR gate.
SECTION-C Attempt ANY ONE following Question Marks (1X10=10) CO
Q7(a) Design a BCD to Excess-3 code converter and implement it using a suitable PLA. 5
Q7(b) Draw a neat diagram of TTL NAND gate and explain its operation. 5
 Printed Page: 1 of 2 
Subject Code: KCS303
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
DISCRETE STRUCTURES & THEORY OF LOGIC
 
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2x10 = 20
Qno. Question Marks CO
a. Let A = {1,2,3,4,5,6} be the set and R = {(1,1) (1,5) (2,2) (2,3) (2,6) (3,2) 2 1
(3,3,) (3,6) (4,4) (5,1) (5,5) (6,2) (6,3) (6,6)} be the relation defined on set
A.
Find Equivalence classes induced by R.
b. Solve Ackerman Function A (2,1). 2 1
c. State and justify “Every cyclic group is an abelian group”. 2 2
d. State Ring and Field with example. 2 2
e. Differentiate complemented lattice and distributed lattice. 2 3
f. State De Morgan’s law and Absorption Law. 2 3
g. Translate the conditional statement “If it rains, then I will stay at home” into 2 4
contrapositive, converse and inverse statement.
h. State Universal Modus Ponens and Universal Modus Tollens laws. 2 4
i. Explain Euler’s formula. Determine number of regions if a planar graph has 2 5
30 vertices of degree 3 each.
j. Explain pigeonhole principle with example. 2 5
SECTION B
2. Attempt any three of the following: 3x10 =30
Qno. Question Marks CO
a. Justify that for any sets A, B, and C: 10 1
i) (A – (A ∩ B)) = A – B ii) (A – (B ∩ C)) = (A – B) ᴜ (A – C)
b. Explain Cyclic group. Let H be a subgroup of a finite group G. Justify the 10 2
statement “the order of H is a divisor of the order of G”.
c. Solve E(x,y,z,t) = ∑ (0,2,6,8,10,12,14,15) using K-map. 10 3
d. Construct the truth table for the following statements: 10 4
i) (P→Q’)→P’ ii) P↔(P’˅Q’).
e. Solve the recurrence relation using generating function. 10 5
an+2- 5an+1 +6an =2, with a0=3 and a1=7.
SECTION C
3. Attempt any one part of the following: 1x10 =10
Qno. Question Marks CO
a. State Principle of Duality. Let A denote the set of real numbers and a 10 1
relation R is defined on A such that (a,b)R(c,d) if and only if a2 + b2 = c2 +
d2. Justify that R is an equivalence relation.
b. i) Let R = {(1,2) (2,3) (3,1)} defined on A = {1,2,3}. Find the transitive 10 1
closure of R using Warshall’s algorithm.
ii) Justify that “If f: A→B and g: B→C be one-to-one onto functions, then
gof is also one to one onto and (gof)-1= f -1o g -1”.

1 | P a g e  
 
 Printed Page: 2 of 2 
Subject Code: KCS303
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
DISCRETE STRUCTURES & THEORY OF LOGIC
 

4. Attempt any one part of the following: 1x10 =10

Qno. Question Marks CO
a. Define the binary operation * on Z by x*y=x + y + 1 for all x,y belongs to 10 2
set of integers. Verify that (Z,*) is abelian group? Discuss the properties of
abelian group.
b. i) Justify that “The intersection of any two subgroup of a group (G,*) is 10 2
again a subgroup of (G,*)”.
ii) Justify that “If a,b are the arbitrary elements of a group G then (ab)2 =
a2b2 if and only if G is abelian.
5. Attempt any one part of the following: 1x10 =10
Qno. Question Marks CO
a. Define Modular Lattice. Justify that if ‘a’ and ‘b’ are the elements in a 10 3
bounded distributive lattice and if ‘a’ has complement a′. then
I) a ˅ (a′˄ b)=a˅ b II ) a˄ (a′˅ b)=a˄ b
b. i) Justify that (D36,\) is lattice. 10 3
ii) Let L1 be the lattice defined as D6 and L2 be the lattice (P(S), ≤), where
P(S) be the power set defined on set S= {a, b}. Justify that the two lattices
are isomorphic.
6. Attempt any one part of the following: 1x10 =10
Qno. Question Marks CO

a. Use rules of inference to Justify that the three hypotheses (i) “If it does not 10 4
rain or if it is not foggy, then the sailing race will be held and the lifesaving
demonstration will go on.” (ii) “If the sailing race is held, then the trophy
will be awarded.” (iii) “The trophy was not awarded.” imply the conclusion
(iv) “It rained.”
b. Justify that the following premises are inconsistent. (i) If Nirmala misses 10 4
many classes through illness then he fails high school. (ii) If Nirmala fails
high school, then he is uneducated. (iii) If Nirmala reads a lot of books then
he is not uneducated. (iv) Nirmala misses many classes through illness and
reads a lot of books.
7. Attempt any one part of the following: 1x10 =10
Qno. Question Marks CO
a. Explain the following terms with example: 10 5
i. Graph coloring and chromatic number.
ii. How many edges in K7 and K3,3
iii. Isomorphic Graph and Hamiltonian graph.
iv. Bipartite graph.
v. Handshaking theorem.
b. i. Justify that “In a undirected graph the total number of odd degree 10 5
vertices is even”.
ii. Justify that “The maximum number of edges in a simple graph is
n(n-1)/2”.

2 | P a g e  
 
 Printed Page: 1 of 2 
Subject Code: KCS301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
DATA STRUCTURE
 
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If you require any missing data, then choose suitably.
SECTION A
1. Attempt all questions in brief. 2X10 = 20
Q No Questions CO
(a) Convert the infix expression (A+B) *(C-D) $E*F to postfix. Give the answer 1
without any spaces.
(b) Rank the following typical bounds in increasing order of growth rate: 2
O(log n), O(n4), O(1), O(n2 log n)
(c) Draw the binary search tree that results from inserting the following numbers in 3
sequence starting with 11: 11, 47, 81, 9, 61, 10, 12,
(d) What does the following recursive function do for a given Linked List with first 4
node as head?
void fun1(struct node* head)
{
if(head == NULL)
return;
fun1(head->next);
printf("%d ", head->data);
}
(e) Define a sparse matrix. Suggest a space efficient representation for space matrices. 5
(f) List the advantages of doubly linked list over single linked list. 1
(g) Give example of one each stable and unstable sorting techniques. 2
(h) Write advantages of AVL tree over Binary Search Tree (BST) 3
(i) What is tail recursion? Explain with a suitable example. 4
(j) Write different representations of graphs in the memory. 5
SECTION B
2. Attempt any three of the following: 10X3 = 30
Q No Questions CO
(a) Write advantages and disadvantages of linked list over arrays. Write a 'C' function 1
creating new linear linked list by selecting alternate elements of a linear linked list.
(b) Write algorithms of insertion sort. Implement the same on the following numbers; 2
also calculate its time complexity. 13, 16, 10, 11, 4, 12, 6, 7
(c) Differentiate between DFS and BFS. Draw the breadth First Tree for the above 3
graph.

(d) Differentiate between liner and binary search algorithm. Write a recursive function 4
to implement binary search.
(e) What is the significance of maintaining threads in Binary Search Tree? Write an 5
algorithm to insert a node in thread binary tree.

SECTION C
3. Attempt any one part of the following: 10X1 = 10
Q No Questions CO
(a) Suppose a three dimensional array A is declared using A[1:10, -5:5, -10:5) 1
(i) Find the length of each dimension and the number of elements in A
(ii) Explain Row major order and Column Major Order in detail with explanation
formula expression.
 Printed Page: 2 of 2 
Subject Code: KCS301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
DATA STRUCTURE
 
(b) Discuss the representation of polynomial of single variable using linked list. Write 1
'C' functions to add two such polynomials represented by linked list.
4. Attempt any one part of the following: 10 X1 = 10
Q No Questions CO
(a) (i) Use the merge sort algorithm to sort the following elements in ascending order. 2
13, 16, 10, 11, 4, 12, 6, 7.
What is the time and space complexity of merge sort?
(ii) Use quick sort algorithm to sort 15,22,30,10,15,64,1,3,9,2. Is it a stable sorting
algorithm? Justify.
(b) (i) The keys 12, 17, 13, 2, 5, 43, 5 and 15 are inserted into an initially empty hash 2
table of length 15 using open addressing with hash function h(k) = k mod 10 and
linear probing. What is the resultant hash table?
(ii) Differentiae between linear and quadratic probing techniques.
5. Attempt any one part of the following: 10X1 = 10
Q No Questions CO
(a) Use Dijkstra’s algorithm to find the shortest paths from source to all other vertices in 3
the following graph.

(b) Apply Prim’s algorithm to find a minimum spanning tree in the following weighted 3
graph as shown below.

6. Attempt any one part of the following: 10X1 = 10

Q No Questions CO
(a) (i) Write an iterative function to search a key in Binary Search Tree (BST). 4
(ii) Discuss disadvantages of recursion with some suitable example.
(b) (i) What is Recursion? 4
(ii)Write a C program to calculate factorial of number using recursive and non-
recursive functions.
7. Attempt any one part of the following: 10X1 = 10
Q No Questions CO
(a) (i) Why does time complexity of search operation in B-Tree is better than Binary 5
Search Tree (BST)?
(ii) Insert the following keys into an initially empty B-tree of order 5
a, g, f, b, k, d, h, m, j, e, s, i, r, x, c, l, n, t, u, p
(iii) What will be the resultant B-Tree after deleting keys j, t and d in sequence?
(b) (i) Design a method for keeping two stacks within a single linear array so that 5
neither stack overflow until all the memory is used.
(ii) Write a C program to reverse a string using stack.
 Printed Page: 1 of 2 
Subject Code: KCS302
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
COMPUTER ORGANIZATION AND ARCHITECTURE
 
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If you require any missing data, then choose suitably.

SECTION A
1. Attempt all questions in brief. 2x10 = 20
Qno Questions CO
(a) List and briefly define the main structural components of a computer. CO1
(b) Differentiate between horizontal and vertical microprogramming. CO3
(c) Represent the following conditional control statements by two register CO1
transfer statements with control functions.
If(P=1) then (R1 R2) else if (Q=1) then (R1R3)
(d) Design a 4-bit combinational incremental circuit using four full adder CO2
circuits.
(e) Differentiate between Daisy chaining and centralized parallel CO5
arbitration.
(f) What is the transfer rate of an eight-track magnetic tape whose speed is CO5
120 inches per second and whose density is 1600 bits per inch?
(g) Register A holds the binary values 10011101.What is the register value CO2
after arithmetic shift right? Starting from the initial number 10011101,
determine the register value after arithmetic shift left, and state whether
there is an overflow.
(h) What is an Associative memory? What are its advantages and CO4
disadvantages?
(i) Differentiate between static RAM and Dynamic RAM. CO4
(j) What are the different types of instruction formats? CO3

SECTION B
2. Attempt any three of the following: 10x3 = 30
Qno Questions CO
(a) A digital computer has a common bus system for 8 registers of 16 bit CO1
each. The bus is constructed using multiplexers.
I. How many select input are there in each multiplexer?
II. What is the size of multiplexers needed?
III. How many multiplexers are there in the bus?
(b) Explain destination-initiated transfer using handshaking method. CO5
(c) Explain 2-bit by 2-bit Array multiplier. Draw the flowchart for divide CO2
operation of two numbers in signed magnitude form.
(d) A digital computer has a memory unit of 64K X 16 and a cache CO4
memory of 1K words. The cache uses direct mapping with a block size
of four words.
I. How many bits are there in the tag, index, block, and word
fields of the address format?
II. How many bits are there in each word of cache, and how
they are divided into functions? Include a valid bit.
III. How many blocks can the cache accommodate?
(e) Explain with neat diagram, the address selection for control memory. CO3
 Printed Page: 2 of 2 
Subject Code: KCS302
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
COMPUTER ORGANIZATION AND ARCHITECTURE
 
SECTION C
3. Attempt any one part of the following: 10x1 = 10
Qno Questions CO
(a) A binary floating-point number has seven bits for a biased exponent. CO2
The constant used for the bias is 64.
I. List the biased representation of all exponents from -64 to +63.
II. Show that after addition of two biased exponents, it is necessary
to subtract 64 in order to have a biased exponent’s sum.
III. Show that after subtraction of two biased exponents, it is
necessary to add 64 in order to have a biased exponent’s
difference.
(b) Show the multiplication process using Booth algorithm, when the CO2
following binary numbers, (+13) x (-15) are multiplied.

4. Attempt any one part of the following: 10x1 = 10

Qno Questions CO
(a) Draw a diagram of a Bus system in which it uses 3 state buffers and a CO1
decoder instead of the multiplexers.
(b) Explain in detail multiple bus organization with the help of a diagram. CO1

5. Attempt any one part of the following: 10x1 = 10

Qno Questions CO
(a) The logical address space in a computer system consists of 128 CO4
segments. Each segment can have up to 32 pages of 4K words each.
Physical memory consists of 4K blocks of 4K words each. Formulate
the logical and physical address formats.
(b) How is the Virtual address mapped into physical address? What are the CO4
different methods of writing into cache?

6. Attempt any one part of the following: 10x1 = 10

Qno Questions CO
(a) Explain how the computer buses can be used to communicate with CO5
memory and I/O. Also draw the block diagram for CPU-IOP
communication.
(b) What are the different methods of asynchronous data transfer? Explain CO5
in detail.

7. Attempt any one part of the following: 10x1 = 10

Qno Questions CO
(a) Write a program to evaluate arithmetic expression using stack CO3
organized computer with 0-address instructions.
X = (A-B) * (((C - D * E) / F) / G)
(b) List the differences between hardwired and micro programmed control CO3
in tabular format. Write the sequence of control steps for the following
instruction for single bus architecture.
R1  R2 * (R3)
 Printed Page: 1 of 1 
Subject Code: KAS301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
TECHNICAL COMMUNICATION
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Q no. Question Marks CO
a. Describe how clarity can be achieved in technical communication. 2 1
b. Explain devices to obtain coherence in writing. 2 1
c. How will you differentiate between investigative and feasibility report? 2 2
d. What do you understand by theme clarity in expert technical lecture? 2 2
e. Define interpersonal communication. 2 3
f. Determine the essentials of good public speaking. 2 3
g. Figure out the objective of group discussion. 2 4
h. Define critical thinking with its importance. 2 4
i. Assess the importance of pronunciation etiquette during speaking. 2 5
j. Examine the definition of Syllable? Exemplify with two examples 2 5
SECTION B
2. Attempt any three of the following: 10x3=30
Q no. Question Marks CO
a. List differences 10 between general and technical communication 10 1
b. Explain the structure of Technical research paper. 10 2
c. Explore various factors of audience analysis. State some of the ways to retain 10 3
audiences.
d. What personality traits are exhibited during group discussion? Discuss briefly. 10 4
e. Classify importance of various professional personality Attributes. 10 5
SECTION C

3. Attempt any one part of the following: 10x1=10

Q no. Question Marks CO
a. "Language is the expression of ideas by means of speech-sounds combined into words." 10 1
Elucidate different features of language establishing as a tool.
b. Explain in detail the various directions in which communication flows. 10 1
4. Attempt any one part of the following: 10x1=10
Q no. Question Marks CO
a. State different types of resume? Infosys invites application for the position of executive 10 2
engineer, draft a resume to submit for the same with necessary details.
b. Describe different types of reports. Discuss the style of a report. 10 2
5. Attempt any one part of the following: 10x1=10
Q no. Question Marks CO
a. Analyze factors responsible for effective Public Speaking? Discuss the essentials 10 3
techniques to make it influential.
b. Discover the devices used during argumentation skills. 10 3
6. Attempt any one part of the following: 10x1=10
Q no. Question Marks CO
a. Enumerate the factors to be emphasized upon while preparing for an interview? 10 4
b. Discuss different types of effective business communication competencies. 10 4
7. Attempt any one part of the following: 10x1=10
Q no. Question Marks CO
a. Explain paralinguistic features of speech. 10 5
b. Evaluate the steps involved in carrying out the process of communication. 10 5

Page 1 of 1