Deemed University 2009 A.M.I.E.T.E Electronics

(C) 1st (D) second

h. A leaf node of a tree is a node with a degree equal to __________.

(A) 0 (B) 1
(C) two (D) k

i. For a binary tree, the maximum number of nodes at level i will be _____.

(A) (B) 2i
(C) 2i-1 (D) none

j. A graph can be traversed _____________.

(A) only by using the depth-first traversal
(B) only by using the breadth-first traversal
(C) using the depth-first traversal or breadth-first traversal
(D) none of the above


ans any 5 ques. out of 8 ques..
every ques. carries 16 marks.


Q.2 a. What is kind conversion? Differentiate ranging from explicit and implicit kind conversion. Substantiate your ans with help of an example. (6)

b. List the various arithmetic operators available in C. discuss with help of example what is meant by precedence of arithmetic operators. (6)

c. Write the subsequent function using conditional operator
y = 1.5x + three for x 2
y = 2x +5 for x > two (4)

Q.3 a. Write a switch statement and an if-else statement in C to obtain the grade of a learner as per the subsequent conditions:
If percentage < 40 then grade = Fail
percentage ranging from 41 and 50 then grade = C
percentage ranging from 51 and 60 then grade = B
percentage ranging from 61 and 80 then grade = A
beyond 80 then A+ (8)

b. Write a C program to add 1st n even numbers. (8)

Q.4 a. With a C program example, show how an array element can be accessed using a pointer. (6)

b. Write a C function that adds 2 integers without using the + operator. (4)

c. Write a C recursive function for calculating factorial of a provided integer. (6)


Q.5 a. Differentiate ranging from a structure and a union. discuss with the help of example how are individual members accessed in every of them. (6)

b. elaborate direct access file and indexed sequential file? (4)

c. Write a program to copy 1 string into a different and count the number of characters copied. (6)

Q.6 a. Write a C program to sort a provided set of N integers using bubble sort. (12)

b. describe a heap. Point out the difference ranging from a maximum heap and minimum heap. (4)

Q.7 a. Write a C program to implement a stack using linked list representation. (12)

b. elaborate queues and circular queues? (4)

Q.8 a. describe a Binary search tree. Draw the binary search tree for the subsequent data assuming tree is initially empty.
50, 33, 44, 22, 77, 35, 60, 40 (8)

b. Write a C program to count the number of nodes in a provided binary tree. (8)

Q.9 a. Represent the subsequent graph using
(i) Adjacency matrix


(ii) Adjacency list (8)











b. describe a minimum spanning tree. Outline Prims Algorithm to create a minimum spanning tree for a weighted graph. (8)

Earning:   Approval pending.