Scribd
Upload
35 views2 pages

DS Using C++-1

Data structure using cpp

Uploaded by

P Venkatesh
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
35 views2 pages

DS Using C++-1

Data structure using cpp

Uploaded by

P Venkatesh
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/ 2

PJR's SPOORTHY DEGREE COLLEGE–KAMAREDDY

(5048)
(Affiliated to Telangana University)
INTERNAL ASSESSMENT-I
Subject Name: Data Structures Using C++
STUDENT NAME: _____________________________
20
Group & Year: _________________________ HTNO: __________________________

I. Multiple Choice Questions 10X1/2=5


1. ____________ in general reference to a set of consecutive memory locations. [ ]
a) stack b) Queue c) Data d) Array
2. A __________ is a linear data structure that stores a set of elements in a sequential manner
[
]
a) Stack and Queue b) Tree and Graph c) Both (a) and (b) d) None of the above
3. An application of Stack is ______ [ ]
a) Traffic controlling b) Collision resolution c) Recursion d) Open Hashing
4. ______ are used in conversion of expression from infix notation to postfix and prefix notation.
[
]
a) Stacks b) Queues c)Linked list d) Hashing methods
5. Stacks are used in_________ of a graph [ ]
a) Breadth first search b) Tree traversal c) Depth first search d) Both (a) and (b)
6. A______ is an extension of Queue data Structure. [ ]
a) Dequeue b) Enqueue c) Circular queue d) Priority queue
7. Which of the following is not an application of Queues? [ ]
a) Simulation b) Categorization c) CPU scheduling d) None of the above
8. The drawback of linked lists____________. [ ]
a) More memory spaces b) No random access
c) More programming effort d) All the above
9. A_________ list allows traversal of the list in forward direction, but not in backward direction.
[
]
a) Singly linked list b) Doubly linked list c) Circular linked list d) Both(a) and (b)
10. A linked list that enables you to travel in an either direction is a______. [ ]
a) Circular linked list b) Doubly linked list c) Singly linked list d) None of the above
II. Fill in the Blanks 10X1/2=5
11. ________ specify the organization of data as well as the representation of the various objects in computer
memory.
12. __________ is a method representing step-by-step procedure for solving a problem.
13. Algorithm written in English language is called _____________.
14. Stack Structure operates in the ____________ fashion.
15. The collection and addition of free empty blocks from the memory to the available spaces list is
called____________.
16. _____________ is the process or technique by which a function call itself.
17. The primitive operation performed on circular queues are _________ and ___________.
18. ___________ operation inserts an element called item from rear position of dequeue.
19. ___________ operation removes an element called item from the rear end of dequeue.
20. ___________ is simple to implement compared to circular and double linked list.
III. Answer the followings 5X1=5
1. Define Data Structure.
2. Define an Algorithm.
3. Define Stack.
4. Define Queue.
5. Define Linked list.
IV. Assignment 5X1=5

You might also like