Scribd
Upload
7 views3 pages

ADT Array NET Test Ques

The document contains a series of questions related to data structures, specifically focusing on Abstract Data Types (ADTs) and arrays, along with their properties and complexities. It includes questions about time complexity, advantages and disadvantages of linked lists and arrays, and applications of sparse matrices. The questions are framed in the context of competitive exams like UGC NET and GATE.

Uploaded by

Jinisha
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
7 views3 pages

ADT Array NET Test Ques

The document contains a series of questions related to data structures, specifically focusing on Abstract Data Types (ADTs) and arrays, along with their properties and complexities. It includes questions about time complexity, advantages and disadvantages of linked lists and arrays, and applications of sparse matrices. The questions are framed in the context of competitive exams like UGC NET and GATE.

Uploaded by

Jinisha
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

DATA STRUCTURES

ADT, ARRAY
UGC NET, GATE QUESTIONS - TEST
1. Which of the following is true about Abstract Data Types? (TN SET 2011)
A) They specify the data storage method.
B) They define operations without specifying implementation.
C) They are dependent on programming languages.
D) They are the same as data structures.

2. An abstract data type (ADT) is: (TN SET 2018)


A) A data type that cannot be instantiated
B) A data type for which only the operations defined on it can be used, but none else
C) A data type that can be used only with the class in which it is defined
D) All of the above

3. An Abstract Data Type (ADT) is: (GATE 2015)


A) A data structure with a set of operations
B) A data structure with a set of operations and their implementations
C) A data structure with a set of operations and their specifications
D) A data structure with a set of operations and their representations

4. What is the time complexity of accessing an element in an array? (TN SET 2017)
A. O(1)
B. O(n)
C. O(log n)
D. O(n log n)

5. What is the main disadvantage of the linked list over the array? (TN SET 2012)
A. Dynamic size
B. Ease of insertion/deletion
C. Random access
D. Memory overhead
6. The complexity of multiplying two matrices of dimensions m x n and n x p is:
(UGC NET 2018)
A. O(mnp)
B. O(m + n + p)
C. O(mnp^2)
D. O(m^2np)

7. Which of the following is a suitable application for sparse matrices? (GATE 2021)
A. Image compression
B. Social network analysis
C. Financial modeling
D. Sorting algorithms

8. Which of the following is a common use of sparse matrices? (UGC NET 2018)
A. Image processing
B. Graph algorithms
C. Database indexing
D. Text processing

9. An array index is also known as


a) Key
b) Subscript
c) Pointer
d) Address

10. What is the time complexity of merging two sorted arrays?


a) O(n)
b) O(n log n)
c) O(n²)
d) O(1)

11. What is the space complexity of an array?


a) O(1)
b) O(n)
c) O(n log n)
d) O(n²)
12. In an array, the elements are stored in __________ memory locations.
a) Non-contiguous
b) Contiguous
c) Random
d) None of the above

13. What is the primary advantage of using a sparse matrix over a dense matrix?
(UGC NET 2017)
A. Faster computation
B. Reduced memory usage
C. Easier implementation
D. Better accuracy

14. What is the advantage of using arrays?


a) Fast access time
b) Dynamic size
c) Occupies less space
d) None of the above

15. What is the main disadvantage of arrays?


a) Fixed size
b) Easy access to elements
c) Contiguous memory allocation
d) Efficient searching

You might also like