Test your basic knowledge on DATASTRUCTURES, STACK

Is this statement is true or false “To implement stack using linked lists, you need to use dynamic memory location for declaring the size of the stack”
True
False
Not a valid statement
None of the above
In how many ways, can you express the mathematical expressions?
Pre order
In order
Post order
All of the above
What is dynamic memory allocation?
Dynamic memory allocation is a feature in programming language that enables you to create data types of memory size based on the requirements of the data types in the program.
Dynamic memory allocation is a feature in programming language that enables you to create data types of address size based on the requirements of the data types in the program.
Dynamic memory allocation is a feature in programming language that enables you to create data types of address size based on the requirements of the programmer.
None of the above
You can use various functions such as ----------,----------and ------------ to use dynamic memory allocation in a program?
Malloc, calloc, static
Size of, static, calloc
Malloc , Size of ,free
None of the above
What are the various types of queues?
Simple, circular
priority
Dequeue
All of the above
Write an application of the priority queue?
Priority queue is used in operating system to manage the process in queue and process them on the basis of their priority number.
Priority queue is used in operating system to manage the process in queue and process them on the basis of random selection.
Priority queue is used in operating system to manage the process in queue and process them on the basis of sequential selection.
None of the above
What is the difference between a stack and queue?
A queue performs insertion of elements from one end deletion of the elements from the other end, where as a stack performs insertion and deletion only from one end.
A stack performs insertion of elements from one end deletion of the elements from the other end, where as a queue performs insertion and deletion only from one end.
None of the above
All of the above
Using a circular linked list, you can sequentially access all the data elements of a linked list in both he directions, backward and forward, in a ----------- order.
Sequential
Random
Cyclic
None of the above
To implement a queue using a linked list, you need to use a single pointer called--------------.
Back
Front
Node
Cone of the above
What are the various operations that you can perform on stack?
PUSH
POP
PEEP
All of the above
Description:

This test is a very interesting collection of questions in the form of MCQ where the test-takers get an opportunity to check their performance to appear in UGC, NET (Computer Science)

Discussion

Sachin K V

Got 10 out of 10.

1378 days 11 hours 57 minutes ago

nupur pandey

it is a good method to chequck our knowledge ......

3216 days 49 minutes ago

Harshit Kumar Singh

Good work..!!

3441 days 10 hours 39 minutes ago

chakri

good

3465 days 16 hours 1 minutes ago

Hussain Savani

thanks for creating... nice test... hope for more tests on data structures... :-)

3536 days 18 hours 3 minutes ago

anju joshi

very very nice test....

3670 days 17 hours 31 minutes ago

Your Facebook Friends on WizIQ

More Tests By Author

ASP Server Controls
10 Questions | 667 Attempts

ASP.NET, Namespaces ASP.NET
10 Questions | 2028 Attempts

An ASP.NET Application
10 Questions | 437 Attempts