Data Structures With C Jan 2014
Uploaded by
Prasad C MData Structures With C Jan 2014
Uploaded by
Prasad C M06cs35
USN
3a.
b.
c.
a.
(,)
,
o
(.)
6
o
(.)
ox
bo-
-y2
6e
6
oo
1l
troo
d
.i-
Y(]
og
-c
a,)
a=
oC)
b0tr
ccd
,6
OE
o.L
or!
o=
atC
lo
>(H
ooo
C oll
o=
*o
tr>
=o
5L
rJ<
-N
0,
Ol
Z
Third Semester B.E. Degree Examination, Dec.2013 I Jan.2Ol,4
Data Structures with G
Time: 3 hrs. Max. Marks:100
Note: Answer ony FIVEfull questions, selecting atleast TWO questionfrom eerch port.
PART - A
I a. Write the syntax and usage of the following operators in C language :
i)" .selection
ii) Indirection iii) Address.
;...,,
(06 Marks)
b. What,is,rneant by rvalue and [value expression? Give examples.
'";
(04 Marks)
c. Distinguish,,,,,between static and dynamic memory allocation. With' syntax, explain four
dynamic memory allocation functions. (10 Marks)
::::",'
2 a. Write an user defiqqd function in C to find if two fractions'are equal. Use structure data type
b.
c.
Write a C program to merge two files of integers to produce a third file. (06 Marks)
Write a C program to concatenate First name and Last name of a person without using any
library function. (08 Marks)
Define stack. List atleast f"r. rriii"ations of r,u.f.. (05 Marks)
Write an algorithm for evaluating apo$ fii expression and trace it on 123 +
*
321 - +
*.
.
",ii.,;
i'-!
(09Marks)
Write C functions for implementi_-4gpiimitive stack operations. (07 Marks)
What is recursion? Evaluate fib(4), that is fin{ing 4'h term of Fibonacci sequence using
recursion and iteration. Which is better? (08 Marks)
c.
6
,,.
*'
."
"b.
,ll
c.
la.
b.
c.
b. Write the static implementation of priority queue in C language. With illustration, explain
major limitation of suqh a queue. (12 Marks)
PART - B
Give the str.uctural features of a linked list. Discuss how an"'affay, can be used to store a
linked list, ,. (05 Marks)
Givgn a singly linked list with plist as the external pointer, write an algorithm to insert a
new.'node to the end of the list. Assume nodes hold integers. (05 Marks)
FIow is a stack implemented using linked list? Write C program for the same. (10 Marks)
What is a circularly linked list? Write algorithm for merging two circularly linked lists.
(07
&X,arks)
Write the algorithm for deleting the first occurrence of a given valve from a doubly. linked
list. (08 Marks)
Discuss how to implement a queue using circular linked list. (05 Marks)
Define complete binary tree and almost complete binary tree. Give examples. (05 Marks)
With suitable example, explain implicit array representation of binary search tree. (05 Marks)
What is a binary search tree? Write an algorithm to construct a binary search tree. (10 Marks)
a. What is tree traversing? Explain the standard methods available for tree rrur"rr,n*dff-l';
b. write short notes on : i) circular queue ii) Efficiency of recursion.
(ff
Tfl*,
For More Question Papers Visit - www.pediawikiblog.com
For More Question Papers Visit - www.pediawikiblog.com
w
w
w
.
p
e
d
i
a
w
i
k
i
b
l
o
g
.
c
o
m
