Unix and Shell Programming, Q P Code: 60305. Additional Mathematics I Q P Code: 60306 Computer Organization and Architecture Q P Code: 62303 Data Structures Using C Q P Code: 60303 Discrete Mathematical Structures Q P Code: 60304 Engineering Mathematics - III Q P Code: 60301 Soft Skill Development Q P Code: 60307

1. (
TTc' &,rn c9
ADICHUNCHANAGIRI U NIVE
18C532
Third Semester BE Degree Examinatio
(CBCS Scheme)
MaxMarks: 100 marks
Time: 3 Hours
Sub: Analog and Digital Electronics
Q P Code: 60302
Instructions: 1. Answer five full questions.
2. Choose one full question from each module.
3. Your answer should be specific to the questions asked.
4. write the same question numbers as they appear in this question paper.
5. Write Legibly
a
b
Module - 1
Explain the construction, working and characteristics of photodiode.
Explain a stable Multi vibrator using Timer IC 555
0r
Explain with a neat diagram an inverting amplifier and non-inverting arnplifier
Explain the principle of relaxation oscillator to generate rectangular output. Draw a neat
circuit diagram and waveform.
Module - 2
Find the Minimum Sum of Product and Product of Sum cxpression using K-map.
F(a,b,c,d):' Im( 1,3,4, 1 1 )+dc(2, 7, 8,12,1 4,1 5)
What are the disadvantage of K-map? How they are overcome in Quine McClusky method.
Simplify the following function using Quine McClusky method.
F(a,b,c,d): Im (0,1 .2,5,6,7,8,9,10,14)
Or
Minimize the following function for product of sum using K-map and realize it by using
Basic gates. F(a,b,c,d):flM(5,7, 13,14,15) + dc( 1,2,3,9)
Simplify the following Boolean function using Tabulation Method
F(a,b,c,d): 2m (0,1,2,3,10,1 1,I2,73,I 4,1 5)
With an example explain Data flow Modeling of Hardware Description Language.
Module - 3
Define Multiplexer. Implement following function using 8:1 Multiplexer
F(a,b,c,d): 2m (0,1,2,4,5,6,9,I0,12,13)
Implement Full Subtractor using 3 to 8 Decoder using Nand gates.
Show how four 2-to-l and one 4-to-l Multiplexers could be connected to form an 8-to-1
MUX with three control inputs.
Or
a What is Magnitude comparator? Design and explain 1-bit Magnitude comparator
10 marks
l0 marks
10 marks
10 marks
10 marks
10 marks
8 marks
8 marks
4 marks
7 marks
7 marks
6 marks
8 marks
PTO
a
b

2. b
C
lmplement the seven segment decoder using Programmable Logic Array.
Write a verilog code for 4-to-1 Multiplexer using conditional assign statement.
Module - 4
a Explain the working of SR Flip Flop using NOR gate
b With a neat diagram explain J-K Master Slave Flip Flop.
c Write a Verilog code that converts an D Flip Flop to an SR Flip Flop
Or
a Explain 8-bit serial input shift register using J-K Flip Flop
b With a neat diagrarn explain Universal Shift Register'
Module - 5
a Explain Three-bit Binary Ripple counter.
b Derive the characteristic equation of SR, JK, D and T Flip Flop.
c Design a modulo-6 colrnter using JK Flip Flop in which all the unused state leads to
state cBA:000.
Or
a What is Binary Ladder? Explain the binary ladder with digital input of 1000.
b Discuss the working of the following Analog to Digital (A/D) converter.
i) 3-bit Simultaneous A/D converter.
ii) Continuous A/D convefier.
8 marks
4 marks
7 marks
7 marks
6 marks
8 marks
12 marks
6 marks
8 marks
6 marks
8 marks
12 marks
10

3. ADICHUNCHANAGIRI UNIVERSIry
Third Semester BE Degree Examination April
(CBCS Scheme)
Time: 3 Hours Max MarkS: 1'00 marks
Sub: Data Structures Using C
Q P Code: 60303
Instructions: 1. Answer five full questions.
2. Choose one full question from each module.
3. Your answer should be specific to the questions asked.
4. write the same question numbers as thcy appear in this question paper.
5. Write Legibly
Module - I
a Write a program by implementing binary search to find an element in an array.
b Define pointers. Give advantages and disadvantages of pointers.
c What is primitive and non-primitive data structures with example.
Or
a what is dynamically allocated arrays? Explain with suitable example.
b What is self-referential structure? List the diffbrence betweeu structure and rmion.
c Define strugture with example.
d Write a C program for pattern matching using pointers.
Module - 2
a Write a note on Ackennan's firnction.
b Write a C program to implement Tower of Hanoi problem using recursive function
c Define stack. Implement push and pop functions for stack using alrays.
Or
a Differentiate between Iteration and Recursion.
b Explain with a suitable example, how would you implement circular queue using dynamically
allocated arays.
c Write the postfix form of the following exprcssion using stack.
i) a$b* c-d-ef(g+h)
ii) a-b(c*d$ e)
Module - 3
a Write a C program to implernent STACK operatiorls using single linked list.
b Write a C function to insert a node at front and delete a node from the rear end in a circular
linked list.
l0 marks
6 marks
4 marks
5 marks
5 marks
4 marks
6 marks
4 marks
6 marks
l0 rnarks
6 marks
6 marks
8 marks
10 marks
l0 marks
PTO

4. 6a
b
Or
Write a C program to implement linked stacks.
Write a node structure for linked representation of polynomial.
two polynomials represented using linked list.
For a given sparse matrix give the linked list representation
10 marks
Explain the algorithm to add 6 marks
4 marks
8 marks
8 marks
4 marks
10 marks
04 marks
6 marks
10 marks
l0 marks
a
b
A: 00400
6s000
03010
000 02
Module - 4
What is the advantages of threaded binary tree over binary tree? Explain the construction of
threaded binary tree for 10,20,30. 40. 50.
What is binary search tree? Write an algorithrn to search given element in a binary search
trcc.
Write the routines to traverse tu,'o given tree using pre-order traversal.
Or
What is a Tree? Explain these terms by taking an example.
i. Root node
ii. Leaf node
iii. Degree
iv. Siblings
v. Depth of a tree
Construct a binary search tree having the tbllowing sequences.
i. Preorder ABCDGHEFI
ii. Inorder BCEDAGHFI
Writc a function to insert an item into a binary search tree based on direction.
Module - 5
Write a short note on hashing. Explain any 3 popular Hash functions.
Define graph. Give adjacency matrix and adjacency linked list for the given weighted graph
ref fig. Q9
0r
Define the terminologies with example fbr graph data structures.
(a) Multigraph
(b)Complete graph
Explain in detail about static and dynamic hashing
What are the basic operations that can be performed on files? Explain briefly
10a 4 marks
6 marks
10 marks
b
C

5. ADICHUNCHANAGIRI UNIVERSITY
Third Semester BE Degree Examination April
(CBCS Scheme)
Time: 3 Hours Max
Sub: Discrete Mathematical Structures
Q P Code: 60304
Instructions: l. Answer five full questions.
2. Choose one full question from each module.
3. Your answer should be specific to the questions asked.
4. write the same question numbers as they appear in this question paper.
5. Write Legibly
Module - 1
a Prove the following logical equivalence using laws of logic.
i)-[{(pvq) nr}+-q] <}qnr ii) [(pvq)n(pv-q)] vq<> pvq
b Test whether the following arguments are valid:
i) (-pvq)-+r ii) p-+r
Marks: 100 marks
r-+(svt)
-rSA-rU
--U-+-rt
.'. p
r-)s
tv'-s
'r tvu
-U
7 marks
7 marks
3 marks
3 marks
7 marks
7 marks
5 marks
5 marks
PTO
c i) Test the validity of the following ar!X*.rr'
If Ravi goes out with friends, he will not stlrdy.
If Ravi does not study, his father becomes angry.
His father is not angry.
.'. Ravi has not gone out with friends
ii) Prove the following using truth table with the aid of logical irnplication:
a) [p
^
(p-+ q)] =+ q b) [(p -+q) n -q] =-p c) [(p v q) n -p] = q
Or
Prove the following logical equivalence.
i) [-pn(---qnr)] v(qnr)v(pzrr)<+r ii) [(-pv-q) +(pnqnr)] e pnq
Establish the validity of the following argument using the rr,rles of inference:
{p,. (p + q)
^
(s v r) n (r + -q)} = (svt)
Let p(x): x2-7x+10:0, q(x):x2-2x-3:0, r(x):x<0, determine the truth or falsity of the 6 marks
following statements when the universe U contains only the integers 2 and 5. If a statement
is false, provide a counter example or explanation.
i) v* p(x) -+-r(x) ii) v-. q(x) -+r(x)
iii) !x, q(x) -+r(x) iv) !x, p(x) +r(x)
Module - 2
Prove by rnathematical induction that for every positive integer 'n', the number
An:5n+2.3n-1+1 is a multiple of 8.
i) How many arrangements are there for all letters in the word SOCIOLOGICAL?
ii) In how many of these arrangements:
(a) A & G are adjacent. (b) All the vowels are adjacent.

6. c In how many ways can 10 identical pencils be distributed among 5 children in the following 5 ntrrks
cases. i) There are no restrictions ii) Each child gets at least one pencil.
iii) The youngest child gets at least 2 pencils.
d Find the coefficient of xey3 in the expansion (2x-3y)12. 5 marks
Or
4 a For the Fibonacci sequence Fo, Fr, F2 prove that 5 marks
F,,: I /i5 [( 1+r/stzl'-1t -{5/2)'].
b A woman has 1 I close relatives & she wishes to invite 5 of them to dinner. In how many 5 marks
ways can she invite them in the following situations?
(i) There is no restriction on the choice.
(ii) Two particular persons will not attend separately.
(iii) Two particular persons will not attetrd together.
c In how many ways can we distribute 7 Apples and 6 Oranges among 4 children, so that 5 marks
each child gets at least 1 Apple.
d Find the coefficient of arbsc2ds in the expansion of (a+2b-3c+2d+5)r6. 5 marks
Module - 3
5 a Let A:{ 1,2,3,4,5,6} and B:{6,7,8,9,10}. If a function f: A-+B is defined by, 7 marks
f: 10,7 ),(2,7),(3, 8 ),(4,6),( 5, 9).(6,9 ) ) rietermine f -'
(6) and f -' (9).
lf Br: {7, 8} and Bz: {8, 9, 10}, find f-r(Br) and f-r@z).
b i) Let f and g be the functions fi'om R to R defined by f(x): ax+b and g(x): cx*d. 7 marks
What relationship must be satisfied by a,b,c,d if goFfog?
ii) Let f and g be the functions from R to R defined by f(x):ax*b and g(x):1-x+x2.
If (gofXx) :9x2-9x+3, determine a,b.
c i) Prove that if 30 dictionaries in a library contain a total of 61,321 pages, then at least one 6 marks
of the dictionaries must have at least 2045 pages.
ii) ff 5 colours are used to paint 26 doors, prove that at least 6 doors will have the same
colour.
Or
6 a let f: R---+R be defincd by
rix)- ft,tr,'x>o
I -3x+1 lorx<0
t
i) Determ-ine f(0).f(- 1 ).f(5/3 ),f(-5l3).
ii) Find f1(0), f,l(-1), f 1(3), f'(-3), f ',(-6).
iii) What are f 1([-5,5]) and f t([-6,5])
b Consider the functions f and g defined by f(x):x3 and g(x):x2+1, Y* e R. 6 marks
Find gof, fog, P and 92'
c Let A: { I ,2,3,4} and B: { 1,2,3,4,5,6 t . 7 marks
i) Find how many functions are there from A to B. How many of these are one-to- one?
How many are onto?
ii) Find how many functions are there fiom B to A. How many of these are one-to-one?
How many are onto?
Module - 4
7 a Let A: t7,2,3,4,6,12) on A, define the relation R by aRb if and only if a divides b. 7 marks
i) Prove that R is a partial order on A.
ii) Drai,v the Hasse diagram.
iii) Write down the matrix of relation.
b Find the number of pennutations of the letters a,b,c,....x,y,z in which none of the patterns 7 marks
spin, game, path or net occurs.
7 marks

7. l0a
Describe the expansion formula for rook polynomials.
board using the expansion formula.
Find the rook polynomial
Or
a Consider the Hasse diagram of a poset (A,R) given below.
If B:{c,d,e}, find : i) All upper bounds of B ii) All lower bor-urds of B
iii) The least upper bound of B iv) The greatest lowcr bound of B
In how many ways can the integers 1,2,3,....,10 be arranged in a line so that no even integer
is in its nafural place.
An Apple, abanana, a mango, and an orange are to be distributed to 4 boys B1, B.2,83,84.
The boys 81 and 82 do not wish to have apple, the boy b3 does not want banana or mango,
andb4 refuses orange. In how many ways the distribution can be madc so that no boy is
displeased
Module - 5
Define the following with examples:
i) Simple Graph ii) Complete Graph iii) Regular Graph iv) Bipartite Graph
v) Hand Shaking Property.
i) If G:(V,E) is a simple graph prove that 2lEl5lvlt-lvl.
ii) Show that a complete graph with n vefiices, namely Kn,has ll2n(n-l) edges.
Obtain an optimal prefix code for the message "MESSAGE RECIEVED". Indicate the
code.
0r
Determine the order lVl of the graph G:(V,E) in
i) G is cubii graph with 9 edges
ii) G is regular with 15 edges
iii) G has 10 edges with 2 vefiices of degree 4 and all other vertices of degree 3
Prove that in a graph
i) The sum of degrees of all the vertices is an even number and is equal to twice the number
of edges in the graph.
ii) The number of vertices of odd degree is even.
iii) Show that a tree with 'n' vertices has n-1 edges.
Define optimal tree and construct an optimal tree fbr a given set of Weights 7 marks
{4,15,25,5,8,16}. Hence find the weight of the optimal tree.
6 marks
7 marks
7 marks
6 marks
7 marks
7 marks
6 marks
7 marks

8. ADICHUNCHANAGI RI UNIVERSITY
Third Semester BE Degree Examination aprit
Time: 3 Hours
(CBCS Scheme)
Sub: Unix and Shell Programming
Q P Code: 60305
Instructions: 1. Answer five full questions.
2. Choose one fulI question from each module.
3. Your answer should be specific to the questions asked.
4. write the same question numbers as they appear in this question paper.
5. Write Legibly
Module - 1
a Describe the IINIX architecture with a neat sketch.
b Explain the following commands with suitable examples:
i. cal and who
ii. date and passwd
Or
a Explain the Internal and External commands with suitable cxarnples
b Discuss role and the significance of the su command in UNIX.
c With the help of examples, describe the knowing a user terminal, and it's displaying
characteristics.
Module - 2
a List and explain the categories of basic files.
b What is a directory? Explain the directory commands used in the UNIX.
Or
a Explain the absolute and relative permissions with sr-ritable examples.
b Name the command used to listing directory contents? Explain its Options in detail.
Module - 3
a With aneat sketch, explain the vi editor.
b Describe the basic concepts of shell interpretive cycle.
Or
a What are the 3 standard files supported by LINIX and Illustrates horv an input and output
redirection works in I-INIX.
b With an example, explore the features of the grep command.
Module - 4
a Describe the shortcuts feature of test command with suitablc examples.
l:,^r,
- ,:.
' i[cs:s
iI
|:::ff
,' 'i ij
til
.0dmarks
::..- -
10 marks
10 marks
10 marks
5 marks
5 marks
l0 marks
10 marks
10 marks
10 marks
10 marks
10 marks
10 marks
10 marks
l0 marks
PTO
i'd
':d

9. 9a
b
b Explain thc shell features of it and while control statements with syntax.
Or
Dcscribc thc role played by the following commands in IINIX.
i. Head ii. Umask iii. Cut iv. Paste
Erplain the features of inode structure in UNIX.
Module - 5
What is process? Explain the mechanism of process creation.
Explore the features of Lists and arrays in Perl.
Or
Explain the following Perl script functions with suitable examples:
i. push ( ) and pop ( )
ii. opcn ( ) and die ( )
Writc a Perl script to converts decimal numbers to a binary.
10 marks
l0 marks
10 marks
10 marks
10 marks
10 marks
10 marks
l0a