Scribd
Upload
61 views

Ds Using C Imp Questions

The document contains questions from multiple sections about data structures and algorithms. It includes questions about arrays, linked lists, stacks, queues, trees, sorting, searching and their applications. The document tests knowledge of fundamental data structures and algorithms.

Uploaded by

rojamani ganta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
61 views

Ds Using C Imp Questions

The document contains questions from multiple sections about data structures and algorithms. It includes questions about arrays, linked lists, stacks, queues, trees, sorting, searching and their applications. The document tests knowledge of fundamental data structures and algorithms.

Uploaded by

rojamani ganta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

IMPORTANT QUESTIONS

SET:1
1) Section - A is Compulsory.
2) Attempt any Four questions from Section–B.
Section –A
1. Write short not e on:
a. What is an Algorithm?
b. What is array of pointers?
c. What are various operations on Strings ?
d. What are linked List?
e. What is linked representation of sparse Matrix?
f. Differentiate between Postfix and Prefix notation .
g. What is a priority Queue?
h. What is dequeue?
i. What are Binary search Tree?
j. What is sorting?
Section –B

2. Discus the various common matrix operations . Elaborate your answer with
suitable programs in C.

3. What is relationship between pointers and Strings? Explain two dimensional


array of strings

4. What are circular linked lists? Explain the dulcet(), cirq-display function
associated with circular linked lists.

5. What are Stacks ? what are the various application of stacks?

6. Explain in detail the linked representation and Array representation of Binary


tree.

7. Explain in detail linear search and binary search.

SET:2
Time : 3 Hrs.
INSTRUCTION TO CANDIDATES :
1. SECTION-A is COMPULSORY consisting of TEN questions carrying
TWO marks each.
2. SECTION-B contains SIX questions carrying TEN marks each and
students has to attempt any FOUR questions.

SECTION-A
l. Answer briefly :

(a) What is a data structure? Mention the various types of data structures.
(b) What is an array? Give the formula to find the address of a particular location
in the array.
(c) What is a circular queue? How it differs from linear queue?
(d) Give the postfix form of an expression: (a - b * c + d) / (e + f)
(e) What is a doubly linked list?
(f) Give the linked memory representation of a binary tree.
(g) What is a sparse matrix?
(h) Mention any two applications of linked lists.
(i) Mention any two applications of stack.
(j) What is the brute force approach?

SECTION-B

2. How a two dimensional matrix is represented in the memory of a computer?


How can you access an element a[i][j] in a two dimensional matrix of
dimension m×n? Give the access formula in:

(i) Row-major order

(ii) Column-major order


3. Order the following functions by growth rate: N, N1.5, N2 , N log log
N, N log2 N, N log (N2), 2/N, 2N, 2N/2, 37, N2 log N, N3.
Indicate which functions grow at the same rate.

4. Explain the merging of two linked lists (exiting in ascending order) to


generate a sorted list.
5. How can a sparse matrix be represented as an array? Discuss addition,
multiplication and transpose operations on a linked list.

6. Explain binary search with the help of an illustrative example.

7. Discuss various Pre-order, Post-order and In-order tree traversal algorithms.

SET:3
Time : 3 Hrs.
INSTRUCTION TO CANDIDATES :
1) Section - A is Compulsory.
2) Attempt any Four questions from Section–B.
Section –A

Q. 1. (a) List out the areas in which data structures are used?
(b) Which data structure is used to perform recursion?
(c) What are sparse matrices?
(d) Write the complexities of (i) Bubble sort (ii) Selection sort.
(e) Why are queues called FIFO data structure?
(f) Define AVL trees.
(g) What are the different ways to traverse a binary tree?
(h) What is time space trade off?
(i) Give some applications of arrays as data structure.
(j) Differentiate between stack and queues.

Section-B

Q. 2. (a) What is an algorithm? What are its characteristics?

(b) How an array can be used to represent a string? Give three string related
function.

Q. 3. (a) Write an algorithm to perform PUSH and POP operation on stack.


(b) Give linked list representation of sparse matrix.
Q. 4. (a) Write an algorithm to delete an element from doubly linked list.
(b) Translate infix expression into its equivalent post fix expression
(using stack):
A* (B+D)/E-F * (G+H/K)

Q. 5. Write an algorithm to perform various tree traversal methods. Give example.

Q. 6. (a) Differentiate between circular and double queue? Which one is better and
when?

(b) What are arrays? How are they useful?

Q. 7. (a) Write an algorithm for Bubble sort? Sort the following elements: 24, 56, 13,
89, 42.

(b) How linked list can be used to represent a polynomial.

SET:4
Time : 3 Hrs.
INSTRUCTION TO CANDIDATES :
1) Section - A is Compulsory.
2) Attempt any Four questions from Section–B.
Section –A
1. Write briefly:
a. Write 5 basic characteristics of an algorithm.
b. What is the brute force approach?
c. What is an array of pointers?
d. Write the function to copy one string into another.
e. What is polish notation?
f. What is row-major and column – major order?
g. Write the application of binary trees.
h. How is binary search better then the linear search?
i. Draw the logical diagram of a doubly linked list.
j. What are self referential structures?
Section –B
2.
a. Define best-case, worst –case and average-case complexity of an algorithm
what is time space trade off?
b. What are the various notations to express the time and space complexity?

3. Describe the array of notation to represent a list of strings.

4. Explain using appropriate diagrams the algorithm to:

a. Add a new element at the beginning of a linked list.

b. Add a new element at the beginning of a doubly linked list.

5.
a. Write the overflow and underflow conditions for a circular queue using
diagrams.

b. Write push and pop algorithms for a stack.

6. Explain Quick sort with example.

7. How do you search an element in a binary search tree? How it is efficient?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy