Scribd
Upload
14 views2 pages

Important Questions

Uploaded by

prateekkaushik435
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views2 pages

Important Questions

Uploaded by

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

Important Questions

Unit-I

Q1 What is string ? How is it useful and used ? Discuss string operations with examples.

Q2. Discuss uses of Big-O notation with examples.

Q3. Define data structure. Differentiate between primitive data structure and non-primitive data
structure. Also describe various operations performed on data structure.

Q4. What do you mean by time and space complexity of an algorithm ? explain.

Q5. What do you mean by pattern matching ? explain various patterns matching algorithm by using
example.

Unit-II

Q1. What is threaded list ? How is it useful and used ? Explain with examples.

Q2. What is Lined list ? what are the advantage and disadvantage of representing a group of items as
an array versus a linear linked list ?

Q3. What is an array ? Differentiate between one-dimensional and two-dimensional arrays with
example. Also write a program in C to insert and delete a node in single linked list.

Q4. What is the difference between array and linked list? How can you represent a linked list in
memory ? explain the insertion and deletion operations of linked list by using suitable example.

Q5. What is two dimensional array ? describe the formula for calculating the address of any element
of a two dimensional array. Also discuss sparse array.

Unit-III

Q1. What do you mean by stack ? describe its applications . also write code in C for Push and Pop
operation on stack.

Q2. What is queue ? what are the operations on queue ? How to implement queue as linked list ?
explain. Write its algorithms.

Q3. Explain the application of queues and stack.

Q4. Explain the concept of priority queues in detail with suitable example.

Q5. What is postfix/prefix/infix notation ? explain the methods of evaluating postfix expression by
giving suitable example.

Unit-IV

Q1. What is binary tree ? how is it used and useful ? discuss its applications with examples.

Q2. Explain the following briefly with examples:


a) Application of graph theory.
b) Sequential and Linked representation of graphs.

Q3. Define tree ? what do you mean by traversing binary trees ? explain in details.

Q4. What is binary search tree ? explain the various methods of representation a binary tree in
memory.

Q5. What is meant by traversal of a graph ? discuss the breadth first and depth first traversal
techniques with help of example.

You might also like