Scribd
Upload
12 views4 pages

Chapter 4

Uploaded by

kiran
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
12 views4 pages

Chapter 4

Uploaded by

kiran
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/ 4

DATA STRUCTURE

One mark Questions


1.Differentiate between one-dimensional array and two dimensional array ?

One dimensional array Two dimensional array


It is a type of array it has only one It is a type of array it has two
subscript subscript

2.Give any two examples for primitive data structure.


Integer,floating point,character,pointers
3.Mention any two examples for Non-primitive data structures.
Arrays,Lists,File
4.What are primitive data structures?(Mar 2015)
The primitive data structure means it is directly operated by the machine level
instructions.
5.What are Non- primitive data structures?
Non-primitive data structures are more complex data structures.These data structures
are derived from the primitive data structure.
6.Name the data structure which is called LIFO list.
Stack
7.What is the other name of queue?
Linear queue
8.Define an array.(Mar 2017)
It is a collection of homogeneous elements of same data type under the same name.
9. Name any one non-linear data structure(Mar-2016)
Trees and graph
10.What is meant by linear data structures ?
Linear data structures are a kind of data structure that has homogeneous elements.
11.What are Non-linear data structures?(Jun 2017)
A non-linear data structure is a data structure in which a data item is connected to
several other data items.

9
DATA STRUCTURE

12.What is a stack?
A stack is an ordered collection of items. Where the addition of new items and the
removal of existing items always take place at the same end.This end is commonly
reffered to as the “top”.
13.What is a queue?(Jun 2016)
A queue is a ordered collection of items where an item is inserted at one end called
the “rear” and an existing ite is removed at the other end,called the “front end”
14.Name the data structure whose relationship between data elements is by means
of links.
Linked list
15.What is a linked list?
Linked list is a collection of nodes.Each node containing two fields data field and link
field.data field containing the information and link field containing the address of the
next node.
16.Mention any one application of stack.
Quick sort
17.What do you mean by traversal in data structure.
The process of accessing each data item exactly once to perform some operation is
called as traversing.
18.Define searching in one dimensional array.
Finding the location of the element in an array.
19.What is the meant by sorting in an array?
The process of arranging of the data item in ascending or descending order.
20.Mention the types of searching in an array.
a)Linear Search
b)Binary Search
21.What are Non-linear data structures ?
A non-linear data structure is a data structure in which a data item is connected to
several other data item.

10
DATA STRUCTURE

22.What is a binary tree?


A binary tree contains a) a node(called root node) and
b) left and right sub-trees.
23.What do you meant by a depth of a tree?
The depth of a tree is the length of the path to its root.
24. Give an example for linear data structure.(Jun 2015)
Stack,Queue,Linked list
25.What are the operations performed on stack?
Stack( ), Push(item), pop( ), Peek( ), isEmpty( ), size( )
26.What are the operations performed on queues?
Queue( ), enqueue( item), dequeue( ), isEmpty( ), Size( )
27.Define the term PUSH and POP operation in stack.
PUSH:Inserting an element into the top of the stack.
POP :Deleting an element into an top of the stack.
28.What is FIFO list ?
It is a First In First Out Process.
29.What is LIFO list ?
It is a Last In Larst Out Process.
30.Mention the different types of queues.
a)Linear Queue
b)Circular Queue
c)Priority Queue
d)Double-Ended Queue

Three marks Questions

1.Write an algorithm for push operation in stack.(Mar 2015)


2.Explain the various operations performed on queue data structures.(Jun 2015)
3.What is stack ? Write an algorithm for POP operation.( Mar 2016)

11
DATA STRUCTURE

4. Write an algorithm for traversal in a linear array.( Jun 2016)


5. Explain memory representation of two dimensional array.( Mar 2017)
6. Write an algorithm to insert an element in an array.( Jun 2017)
7.Mention the various operations performed on data structures.
8.Explain memory representation of one dimensional array.
9.Explain memory representation of a stack using one-dimensional array.
10.Explain memory representation of a queue using one-dimensional array.
11.Explain memory representation of single linked list.
12. Define .a)root b)subtree c)depth d)degree

Five marks Questions

1.Explain any five basic operations performed as arrays.(Mar 2015)


2.Write an algorithm to delete a data element from of the queue.( Mar 2015)
3.Explain memory representation of a stack using array.( Jun 2015)
4.Write an algorithm to search an element in an array using binary search.( Jun 2015)
5.Write an algorithm to insert a data element from queue.( Mar 2016)
6.What is sorting? Write an algorithm to sort an array using insertion sort.
( Mar 2016,jun 2017)
7.Write an algorithm to search an element in an array using linear search.( Jun 2016)
8.What is linear data structure? Explain the operations performed on linear data
structure.( Jun 2016)
9.Write an algorithm to insert an element in an array.( Mar 2017)
10. What is stack ? Write an algorithm for push and pop operation(Mar 2017)
11. Write an algorithm to delete an element in an array.
12.What are the different operations performed on queues? Write an algorithm to delete
an element from queue.( Jun 2017)

1mark 2marks 3marks 5marks Total Marks

1 - 1 2 14

12

You might also like