Exam (elaborations)
DSA EXAM QUESTIONS AND ANSWERS
- Course
- Institution
Exam of 12 pages for the course DSA at DSA (DSA EXAM)
[Show more]
Content preview
DSA EXAMC - answer1. Which of the following data structure is non linear data structure?
A. Arrays
B. Linked lists
C. Trees
D. None of above
C - answer2. Which of the following data structure is linear data structure?
A. Trees
B. Graphs
C. Arrays
D. none of the above
D - answer3. The operation of processing each element in the list is known as
A. Sorting
B. Merging
C. Inserting
D. Traversal
B - answer4. Finding the location of the element with a given value is:
A. Traversal
B. Search
C. Sort
D.None of above
A - answer5. Arrays are best data structures
A. for relatively permanent collections of data
B.for the size of the structure and the data in the structure are constantly changing
C. for both of above situation
D. for none of above situation
B - answer6. Linked lists are best suited
A. for relatively permanent collections of data
B.for the size of the structure and the data in the structure are constantly changing
C. for both of above situation
D. for none of above situation
C - answer7. Each array declaration need not give, implicitly or explicitly, the information
about
A. the name of array
, B.the data type of array
C. the first data from the set to be stored
D. the index set of the array
A - answer8. The elements of an array are stored successively in memory cells because
A. by this way computer can keep track only the address of the first element and the
addresses of other elements can be calculated
B. the architecture of computer memory does not allow arrays to store other than
serially
C. both of above
D.none of above
D - answer9. The memory address of the first element of an array is called
A. floor address
B.foundation address
C. first address
D. base address
A - answer10. The memory address of fifth element of an array can be calculated by the
formula
A. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per
memory cell for the array
B. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per
memory cell for the array
C. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per
memory cell for the array
D. None of above
A - answer11. Which of the following data structures are indexed structures?
A. linear arrays
B. linked lists
C.both of above
D. none of above
C - answer12. Which of the following is not the required condition for binary search
algorithm?
A.The list must be sorted
B.there should be the direct access to the middle element in any sublist
C. There must be mechanism to delete and/or insert elements in list
D. none of above
D - answer13. Which of the following is not a limitation of binary search algorithm?
A. must use a sorted array
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller Dreamer252. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $11.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
76710 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now