Faculty of Engineering & Technology

Department of Computer Science & Engineering

Question Bank

Subject: Data Structures in C and Applications Semester:III

Subject Code: 22CS33 Academic Year:2023-24

Module I:
Data Structures, Classifications (Primitive & Non Primitive), Data structure operations, Structures,Self
ReferentialStructures,and Unions.PointersandDynamicMemoryAllocationFunctions.RepresentationofLinear
Arrays in Memory, Dynamically allocated arrays.
Array Operations: Traversing, inserting, deleting, Searching: Linear Search, Binary Search, and Sorting:
Bubble Sort. Multidimensional Arrays, Polynomials: PolynomialRepresentation, Polynomial Addition, Sparse
Matrices: Sparse Matrix Representation, Transposing Matrix.
Strings:Basic Terminology,OperationsandPattern Matching algorithm: Naïve String Matching algorithm.
Programming Examples.
Q. Questions CO PO RBT Marks
No.
1 Define Data structures. Explain the types of data CO1 1,2,3 L1 8M
structures.
2 Differentiate between structure and union. CO1 1,2,3 L1 5M
3 Define pointer. Explain pointer initialization and CO1 1,2,3 L1 6M
declaration and justify how pointers can be dangerous.
4 Explain dynamic memory allocation with examples. CO1 1,2,3 L2 4M
5 Explain the operations of array with example. CO1 1,2,3 L2 5M
6 What is sparse matrix? Explain the sparse matrix CO1 1,2,3 L1 8M
representation. How transposing of a sparse matrix
done?
7 What is a polynomial? Apply appropriate data structures CO1 1,2,3 L1 8M
to represent two polynomials and write a function to add
the polynomials.
8 Explain the following: i) String ii) Length of string iii) CO1 1,2,3 L2 5M
Null String iv) Concatenation of string v) Substring .
9 Explain string manipulation function(operations). CO1 1,2,3 L2 5M
10 Show how strings are stored with a block diagrams. CO1 1,2,3 L1 5M
11 Write Navie pattern matching algorithms and explain CO1 1,2,3 L1 5M
with examples
12 Write binary search algorithm/function with an example. CO1 1,2,3 L1 5M
13 Write bubble sort algorithm/function with an example. CO1 1,2,3 L1 5M
14 Explain the operations of data structures. CO1 1,2,3 L2 5M
15 What is array? How array are declared and implemented CO1 1,2,3 L1 5M
in C explain with example.
16 Show how one and two dimensional arrays are allocated CO1 1,2,3 L1 5M

Page 1 of 6
 dynamically
17 Write a note on structure with in structure, Self- CO1 1,2,3 L1 5M
referential structures with an example.
Module II:
Definition, Stack Operations, Array Representation of Stacks and Stack Applications: Infix to postfix
conversion, evaluation of postfix expression.Recursion: Factorial, Fibonacci Sequence, Tower of Hanoi.
Queues:Definition,ArrayRepresentation.QueueOperations,CircularQueues, Dequeue, Priority Queues.
Programming Examples.
1 Define stack. Implement the operations of stack using CO2 1,2,3 L1 6M
arrays or explain operations on stack.
2 Assume A=1, B=2, C=3. Evaluate the following postfix CO2 1,2,3 L6 8M
expressions:
a. A B + C – B A + C $ -
b. A B C + * C B A – + *
3 Apply suitable data structure to covert infix to postifix CO2 1,2,3 L6 10M
expression
a. A $ B * C – D + E / F / (G + H)
b. A – B / (C * D $ E)
c. ((A-(B+C))*D)$(E+F)
d. (a * b) +c/d
e. (((a / b)-c) + (d * e)) - (a * c).

4 Write a C function/Algorithm to convert infix to a CO2 1,2,3 L1 4M

postfix expression
5 Write a C function /Algorithm to evaluate a postfix CO2 1,2,3 L1 4M
expression.
6 What is recursive function? Show that how factorial CO2 1,2,3 L1 5M
using for loop is different from recursive function

7 Discuss the Tower of Hanoi with example using CO2 1,2,3 L1 5M

recursive function.
8 Define Queue. Implement the operations of queue using CO3 1,2,3 L1 6M
arrays or explain operations on queue.
9 Show how queues are represented using arrays? CO3 1,2,3 L1 5M
10 With an example explain the GCD and Fibonacci CO3 1,2,3 L1 5M
sequence.
11 Give the disadvantage of ordinary queue and explain CO3 1,2,3 L1 5M
how it is solved with circular queue, implement
operations of circular queue using C language.
12 Write a note on dequeue. CO3 1,2,3 L1 5M
13 Define priority queue. Explain in detail the CO3 1,2,3 L1 6M
representation of a Priority Queue with example
Module-III:
Linked Lists: Definition, Representation of linked lists in Memory, Memory allocation and Linked list
operations:Traversing,Searching,Insertion, and Deletion. Doubly Linked lists. Linked Stacks and Queues.

Page 2 of 6
Programming Examples.
1 Define linked list. Write the representation of linked lists CO3 1,2,3 L1 5marks
in memory and node represented using C .
2 Develop C functions for the following functions in a CO3 1,2,3 L6 4marks
singly linked list.
(i) Insertion at the beginning(front) (iii)
Insertion at the end
(ii) Deletion at the beginning(front) (iv)
Deletion at the end

3 Apply linked list to represent two polynomials and write CO3 1,2,3 L3 5marks
a function to add the polynomials using linked list.
4 Show the diagrammatic linked list representation for CO3 1,2,3 L1 4marks
following sparse matrices.
0 1 2
3 0 0
0 0 0

5 Design C function to implement operations of queue CO3 1,2,3 L1 5marks

using linked list.
6 What is doubly linked list? Write the declaration of CO3 1,2,3 L1 5marks
doubly linked list in C.
7 With the C program explain how the elements are CO3 1,2,3 L1 5marks
inserted and deleted from a doubly linked list
8 Write a note on a header linked list CO3 1,2,3 L1 5marks
9 Outline with neat diagram, how linked list can be used CO3 1,2,3 L1 6marks
as stack and queue.
10 List out and explain any two applications of linked list CO3 1,2,3 L1 8marks
and Write any two advantages of doubly linked list
over singly linked list
11 Write short note on circular lists. Write a function to CO3 1,2,3 L1 8marks
insert a node at front and rear end in a circular linked
list. Write down sequence of steps to be followed
Module-IV:
Trees: Terminology, Binary Trees, Properties of Binary trees, Array and linked Representation of Binary Trees
Binary Tree Traversals - Inorder, postorder, preorder; Additional Binary treeoperations-copying binarytree,
testing equality. Threaded binary trees, Binary Search Trees – Definition, Insertion, Deletion (An empty left
sub tree and nonempty right sub tree and vice-versa), Traversal, Searching, Application of Trees-Evaluation
of Expression, Programming Examples.

1 Define tree? explain the various terminologies CO3 1,2,3 L1 8marks

associated with trees.
2 With an example, explain the different types of CO3 1,2,3 L1 6marks
representation of tree.
3 Explain properties of binary trees. CO3 1,2,3 L2 5marks

Page 3 of 6
 4 Define a binary tree. With example show array and CO3 1,2,3 L1 5marks
linked representation of binary tree.
5 Construct an expression tree for an expression i) A / B + CO3 1,2,3 L6 6marks
C * D + E ii) ((6+(3-2)*5)^2+3) iii) A/B+C*D+E
6 Given the following traversal, draw binary tree. CO3 1,2,3 L6 6marks
(i) inorder: 4 2 5 1 6 7 3 8
(ii) postorder: 4 5 2 6 7 8 3 1
7 Define tree traversal. Write the C-routines to traverse the CO3 1,2,3 L1 9marks
given tree using i) In order ii) Pre-order iii) Post-order.
( Solve the problems on traversals).
8 Develop C function to copy binary tree, testing equality CO3 1,2,3 L1 5marks
of binary tree.
9 Discuss threaded binary tree with neat diagrams. CO3 1,2,3 L6 5marks
10 Write c functions to insert, traverse, search and delete an CO3 1,2,3 L1 10marks
element in binary search tree(all kinds of insertion,
deletion).
11 Problem/function on Evaluation of Expression CO3 1,2,3 L6 6marks
Module-V:
Graphs: Definitions, Terminologies, Matrix and Adjacency List Representation Of Graphs,
Elementary Graph operations, Traversal methods: Breadth First Search and Depth First Search.
Sorting Techniques: Insertion Sort, Radix sort, selection sort.
Hashing: Collision concept, Linear Probing, quadratic probing, double hashing examples.
1 What is a graph? Write the terminologies used in graph CO5 1,2,3 L1 5marks
2 Write matrix and adjacency list representation of graphs CO5 1,2,3 L1 6marks
(PROBLEM)
3 Explain different graph traversal methods (DFS &BFS). CO5 1,2,3 L2 8marks
4 problems and algorithm of BFS and DFS. CO5 1,2,3 L6 8marks
5 Explain insertion sort and write C function of insertion CO5 1,2,3 L2 8marks
sort(solve problem)
6 explain radix sort and insertion sort with example (solve CO5 1,2,3 L2 6marks
problem)
7 Write a note selection sort.(solve problem) CO5 1,2,3 L1 6marks
8 Explain the hash table organization. CO5 1,2,3 L2 6marks
9 Explain hash functions with examples. CO5 1,2,3 L2 6marks

REVISEDBloom’sTaxonomyActionVerbs
Definitio I. II. III. Applying IV. Analyzing V. Evaluating VI.
ns Rememberin Understanding Creating
g

Bloom’s Exhibit Demonstrate Solve Examine and Present and Compile

Definitio memory of understanding problems to break defend information

Page 4 of 6
n previously of facts and new situations information opinions by together in a
learned ideas by by applying into parts by making different way
material by organizing, acquired identifying judgments by
recalling facts, comparing, knowledge, motives or about combining
terms, basic translating, facts, causes. Make information, elements in a
concepts, and interpreting, techniques and inferences and validity of new pattern
answers. giving rules in a find evidence to ideas, or or proposing
descriptions, different way. support quality of alternative
and stating generalizations. work based on solutions.
main ideas. a set of
criteria.

Verbs • Choose • Classify • Apply • Analyze • Agree • Adapt

• Define • Compare • Build • Assume • Appraise • Build
• Find • Contrast • Choose • Categorize • Assess • Change
• How • Demonstrat • Construct • Classify • Award • Choose
• Label e • Develop • Compare • Choose • Combin
• List • Explain • Experime • Conclusion • Compare e
• Match • Extend nt with • Contrast • Conclude • Compile
• Name • Illustrate • Identify • Discover • Criteria • Compos
• Omit • Infer • Interview • Dissect • Criticize e
• Recall • Interpret • Make use • Distinguish • Decide • Construc
• Relate • Outline of • Divide • Deduct t
• Select • Relate • Model • Examine • Defend • Create
• Show • Rephrase • Organize • Function • Determine • Delete
• Spell • Show • Plan • Inference • Disprove • Design
• Tell • Summarize • Select • Inspect • Estimate • Develop
• What • Translate • Solve • List • Evaluate • Discuss
• When • Utilize • Motive • Explain • Elaborat
• Where • Relationshi • Importanc e
ps e • Estimate
• Which
• Simplify • Influence • Formula
• Who
• Survey • Interpret te
• Why
• Happen
• Take part • Judge
in • Imagine
• Justify
• Test for • Improve
• Mark
• Theme • Invent
• Measure
• Make up
• Opinion
• Maximiz
• Perceive
e
• Prioritize
• Minimiz
• Prove
e
• Rate
• Modify
• Recomme
• Original
nd
• Originat
• Rule on
e
• Select
• Plan
• Support
• Predict
• Value • Propose
• Solution
• Solve

Page 5 of 6
 • Suppose
• Test
• Theory

Page 6 of 6