CS1151 Data Structures B.E Question Bank : niceindia.com

Name of the College : Noorul Islam College of Engineering
University : Anna University
Degree : B.E
Department : Computer Science and Engineering
Subject Code/Name : CS 1151 – Data Structures
Year : II
Semester : III
Document Type : Question Bank
Website : niceindia.com

Download :https://www.pdfquestion.in/uploads/ni…STRUCTURES.pdf

NICE Data Structures Question Paper

UNIT-I

Problem Solving :
Part -A :
1.Write down the definition of data structures? :
A data structure is a mathematical or logical way of organizing data in the memory that consider not only the items stored but also the relationship to each other and also it is characterized by accessing functions.

Related : Noorul Islam College of Engineering EC1009 Digital Image Processing B.E Question Bank : www.pdfquestion.in/2955.html

2. Give few examples for data structures? :
Stacks, Queue, Linked list, Trees, graphs

3. Define Algorithm? :
Algorithm is a solution to a problem independent of programming language. It consist of set of finite steps which, when carried out for a given set of inputs, produce the corresponding output and terminate in a finite time.

4. What are the features of an efficient algorithm? :
** Free of ambiguity
** Efficient in execution time
** Concise and compact
** Completeness
** Definiteness
** Finiteness

5. List down any four applications of data structures? :
** Compiler design
** Operating System
** Database Management system
** Network analysis

6. What is divide and conquer? :
Given a function to compute on ‘n’ inputs the divide and conquer strategy suggests splitting the n inputs into k subsets yielding k subproblems.These sub problems are solved independently and then a solution must be found to combine the sub solutions into a solution of the whole

7.State the importance of dynamic programming
Instead, a mathematical way of thinking about it is to look at what you should do at the end, if you get to that stage. So you think about the best decision with the last potential partner (which you must choose) and then the last but one and so on. This way of tackling the problem backwards is Dynamic programming.

8. Define storage structure? :
The representation of a particular data structure in the memory of a computer is called a storage structure.

9. Define file structure? :
A storage structure representation in auxiliary memory of the compute is known as file structure.

10. What are the four major parts in an iterative process? :
1) Initialization
2) Decision
3) Computation
4) Update

11. Write down the algorithm for solving Towers of Hanoi problem? :
1. Push parameters and return address on stack.
2. If the stopping value has been reached then pop the stack to return to previous level else move all except the final disc from starting to intermediate needle.
3. Move final discs from start to destination needle.
4. Move remaining discs from intermediate to destination needle.
5. Return to previous level by popping stack.

12. What are the different types of data structures? :
i) Primitive data structure
ii) Non primitive data structure.

13. What do you mean by primitive data structure? :
Primitive data structure is concerned with structuring of data at their most primitive level within a computer, that is the data structures are directly operated upon by machine-level instructions eg) Integers, real number, characters

14.What are the three stages of problem solving aspect.
i) Selection of an appropriate mathematical model
ii) Formulation of algorithms based on the choice made in stage I
iii) The design of storage structures for the data structure.

15.Define depth of recursion? :
Depth of recursion means the number of times,the recursive procedure call itself.

UNIT-II

ADT
PART – A
1.What is an Abstract Data type(ADT)? Explain?
Definition of ADT
Example: Rational ADT
Pseudo code of Rational ADT

2.What is a Stack ?
A Stack is an ordered collection of items into which new items may be inserted and from which items may be deleted at one end, called the top of the stack. The other name of stack is Last-in -First-out list.

3.What are the two operations of Stack?
PUSH
POP

4. Write postfix from of the expression –A+B-C+D?
A-B+C-D+

5.What is a Queue ?
A Queue is an ordered collection of items from which items may be deleted at one end called the front of the queue and into which tems may be inserted at the other end called rear of the queue.Queue is called as First –in-First-Out(FIFO).

UNIT-III

TREES
PART- A
1. Define non-linear data structure?
Data structure which is capable of expressing more complex relationship than that of physical
adjacency is called non-linear data structure.

2. Define tree?
A tree is a data structure, which represents hierarchical relationship between individual data items.

3. Define leaf?
In a directed tree any node which has out degree o is called a terminal node or a leaf.

4. What is meant by directed tree?
Directed tree is an acyclic diagraph which has one node called its root with indegree o while all other nodes have indegree I.

5. What is a ordered tree?
In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called
ordered tree.