Code No: NR220104
NR
Set No. 2
1. (a) Distinguish between linear and binary search methods.
[8+8]
ld .
(b) Write an algorithm for non-recursive binary search method.
in
II B.Tech II Semester Supplementary Examinations,May 2010 DATA STRUCTURES THROUGH C Civil Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????
2. Write a C program for replacing a substring with another string.
[16]
3. (a) Write a ‘C’ Program to convert a prefix string to infix string .
or
(b) Consider the following arithmetic expression in prefix notation: + + A −∗ $BCD/ + EF∗ GHI Find the equivalent infix form of the above.
[8+8]
4. (a) What are the advantages of adjacency matrix representation of graphs. (b) Define spanning tree of an undirected graph.
[8+8]
5. (a) Explain various queue operations performed using linked lists.
uW
(b) Compare stacks and queues.
[8+8]
6. (a) Explain the construction of a Binary search tree for the following data: 14, 60, 33, 75,15, 50, 66,44. (b) Explain properties of binary search tree.
[8+8]
7. (a) compare quick sort and tree sort methods.
nt
(b) Explain quick sort method for the elements. 11,51,71,21,61,41,91,31,
[8+8]
8. (a) What are the advantages and disadvantages of using arrays to implement linked list.
Aj
(b) Write a C program to construct a linear linked list of n numbers and to display the list in First in first out method. [4+12] ?????
1
Code No: NR220104
NR
Set No. 4
1. Write a C program for replacing a substring with another string.
in
II B.Tech II Semester Supplementary Examinations,May 2010 DATA STRUCTURES THROUGH C Civil Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ????? [16]
ld .
2. (a) What are the advantages and disadvantages of using arrays to implement linked list.
(b) Write a C program to construct a linear linked list of n numbers and to display the list in First in first out method. [4+12]
or
3. (a) Explain the construction of a Binary search tree for the following data: 14, 60, 33, 75,15, 50, 66,44. (b) Explain properties of binary search tree.
[8+8]
4. (a) compare quick sort and tree sort methods.
uW
(b) Explain quick sort method for the elements. 11,51,71,21,61,41,91,31,
[8+8]
5. (a) What are the advantages of adjacency matrix representation of graphs. (b) Define spanning tree of an undirected graph.
[8+8]
6. (a) Write a ‘C’ Program to convert a prefix string to infix string .
nt
(b) Consider the following arithmetic expression in prefix notation: + + A −∗ $BCD/ + EF∗ GHI Find the equivalent infix form of the above.
[8+8]
7. (a) Distinguish between linear and binary search methods. (b) Write an algorithm for non-recursive binary search method.
[8+8]
8. (a) Explain various queue operations performed using linked lists.
Aj
(b) Compare stacks and queues.
[8+8] ?????
2
Code No: NR220104
NR
Set No. 1
in
II B.Tech II Semester Supplementary Examinations,May 2010 DATA STRUCTURES THROUGH C Civil Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ????? 1. (a) What are the advantages of adjacency matrix representation of graphs.
[8+8]
ld .
(b) Define spanning tree of an undirected graph.
2. (a) Explain the construction of a Binary search tree for the following data: 14, 60, 33, 75,15, 50, 66,44. (b) Explain properties of binary search tree.
[8+8]
3. (a) Write a ‘C’ Program to convert a prefix string to infix string .
or
(b) Consider the following arithmetic expression in prefix notation: + + A −∗ $BCD/ + EF∗ GHI Find the equivalent infix form of the above.
[8+8]
4. (a) Explain various queue operations performed using linked lists.
uW
(b) Compare stacks and queues.
[8+8]
5. (a) compare quick sort and tree sort methods. (b) Explain quick sort method for the elements. 11,51,71,21,61,41,91,31,
[8+8]
6. (a) Distinguish between linear and binary search methods. [8+8]
7. Write a C program for replacing a substring with another string.
[16]
nt
(b) Write an algorithm for non-recursive binary search method.
8. (a) What are the advantages and disadvantages of using arrays to implement linked list.
Aj
(b) Write a C program to construct a linear linked list of n numbers and to display the list in First in first out method. [4+12] ?????
3
Code No: NR220104
NR
Set No. 3
in
II B.Tech II Semester Supplementary Examinations,May 2010 DATA STRUCTURES THROUGH C Civil Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????
(b) Explain quick sort method for the elements. 11,51,71,21,61,41,91,31,
[8+8]
ld .
1. (a) compare quick sort and tree sort methods.
2. (a) Explain various queue operations performed using linked lists. (b) Compare stacks and queues.
[8+8]
3. (a) Distinguish between linear and binary search methods.
or
(b) Write an algorithm for non-recursive binary search method.
[8+8]
4. (a) Write a ‘C’ Program to convert a prefix string to infix string .
uW
(b) Consider the following arithmetic expression in prefix notation: + + A −∗ $BCD/ + EF∗ GHI Find the equivalent infix form of the above.
[8+8]
5. (a) Explain the construction of a Binary search tree for the following data: 14, 60, 33, 75,15, 50, 66,44. (b) Explain properties of binary search tree. 6. Write a C program for replacing a substring with another string.
[8+8] [16]
nt
7. (a) What are the advantages and disadvantages of using arrays to implement linked list. (b) Write a C program to construct a linear linked list of n numbers and to display the list in First in first out method. [4+12]
8. (a) What are the advantages of adjacency matrix representation of graphs.
Aj
(b) Define spanning tree of an undirected graph. ?????
4
[8+8]