Toggle navigation
Login / Register
Ask Questions
Study
Current Affairs
Previous Papers
Kerala PSC
IBPS
UPSC
RBI
TNPSC
MPSC
SSC
CBSE
United States
Model Tests
News
More
Answers
Coaching Centres
Careers
Downloads
Colleges
Kuwait News & Classifieds
Classic Jhumka Earrings Silver
INR 113.00
Free Shipping
Buy Now
Black Jhumka Earrings & Studs
INR 94.00
Free Shipping
Buy Now
Classic Jhumka Earrings Silver
INR 207.00
Free Shipping
Buy Now
Beautiful stud earing
INR 93.00
Free Shipping
Buy Now
Different Size Hoop and Stud Earrings Set
INR 243.00
Free Shipping
Buy Now
Golden Hoop Earing
INR 70.00
Free Shipping
Buy Now
×
Create account with Openguide
Sign Up
By clicking Sign Up, you agree that you have read and accepted the
Open Guide Online User Agreement.
Already have an account?
Log in
×
Login to OpenGuide
Login
Forgot password?
Reset it
New user?
Register
×
Reset your password
Reset Password
Registered user?
Log in
New user?
Register
Home
Questions & Answer
Technology Questions & Answers
Data Structure Questions & Answers
Data Structure Questions & Answers
(Compiled from UPSC, SSC ,PSC ,IBPS previous question papers)
Which of the following statement is false
A
Pointers are very useful.
B
Pointers store the next data element of a list
C
Data elements in linked lists need not be stored in adjacent space in memory
D
Linked lists are collection of the nodes that contain information part and next pointer.
E
Arrays are dense lists and static data structure.
What are the minimum number of queues needed to implement the priority queue?
A
One
B
Two
C
Three
D
Four
The complexity of merge sort algorithm is
A
O(n)
B
O(log n)
C
O(n2)
D
O(n log n)
The complexity of Bubble sort algorithm is
A
O(n)
B
O(log n)
C
O(n2)
D
O(n log n)
The complexity of Binary search algorithm is
A
O(n)
B
O(log n)
C
O(n2)
D
O(n log n)
The complexity of linear search algorithm is
A
O(n)
B
O(log n)
C
O(n2)
D
O(n log n)
Which of the following data structure is linear data structure
A
Trees
B
Graphs
C
Array
D
None of above
Which of the following name does not relate to stacks
A
FIFO lists
B
LIFO list
C
Piles
D
Push-down lists
The memory address of the first element of an array is called
A
floor address
B
first address
C
foundation address
D
base address
A graph with one or more edges is at least
A
1-chromatic
B
2-chromatic
C
3-chromatic
D
4-chromatic
Which data structure is needed to convert infix notations to postfix notations
A
linear list
B
tree
C
stack
D
queue
Which sorting method is slowest
A
Quick sort
B
Heap sort
C
Shell sort
D
Bubble sort
Which is having highest precedence in C
A
relational operators
B
equality operator
C
logical operator
D
arithmetic operator
Merge sort uses
A
Divide and conquer strategy
B
Backtracking approach
C
Heuristic search
D
Greedy approach
Which of the languages is often translated to the pseudo code
A
PASCAL
B
FORTRAN
C
PL/I
D
BASIC
O log(n) can be conneted with
A
Selection sort
B
Insertion sort
C
Binary sort
D
Merge sort
How many divisions are there in COBOL language
A
Two
B
Three
C
Four
D
Five
Which is ALGOL based simulation language
A
FORTRAN
B
SIMSCRIPT
C
GASP IV
D
none of above
A linear list from which elements can be added or removed from either end is called
A
stack
B
queue
C
deque
D
tree
Recursive problems are implemented by
A
queues
B
stacks
C
linked lists
D
strings
Recursive problems are implemented by
A
queues
B
stacks
C
linked lists
D
strings
Sort which compares adjacent elements in a list and switches where necessary is
A
Insertion sort
B
Heap sort
C
Quick sort
D
Bubble sort
Which is problem oriented language
A
BASIC
B
PL/I
C
FORTRAN
D
none of above
minimum number of stacks of size n required to implement a queue of size n
A
One
B
Two
C
Three
D
Four
In C how many parameters can passed to a function
A
2
B
5
C
10
D
as many as defined in function definition
Which statement we should ignore in structure programming
A
WHILE-DO
B
GO-TO
C
IT-ELSE
D
SWITCH
Deletion from one end and insertion from other end is
A
stack
B
branch
C
tree
D
queue
Repeated execution of simple computation may cause compounding of
A
round off errors
B
syntax errors
C
run time errors
D
logic errors
++i is equivalent to
A
i = i + 2
B
i = i + 1
C
i = i + i
D
i = i - 1
Information about an array used in a program will be stored in
A
symbol table
B
activation record
C
dope vector
D
system table
1
2
Categories
Android
C programming
C++ programming
Cloud Computing
Computer
Computer System Architecure
Data Base
Data Structure
Internet & Social Media
Java programming
Manual Testing
MS Office
MySQL
Networking
Operating System
PHP
Programming
Software Engineering
Software Testing
Help & Support
About Us
Contact Us
Terms of Service
