edited by
7,084 views

2 Answers

Best answer
6 votes
6 votes

String,Lists and Queues all are Linear Data Structure. 

Option(D)All of the above.

selected by
4 votes
4 votes

String : A string is generally understood as a data type and is often implemented as an array of bytes (or words) that stores a sequence of elements, typically characters, And an Array is a Linear Data Structure Here is the reference 

Lists : One very useful data structure that we’ll frequently use is called a list. Lists are a way to store many different values under a single variable. Every item in this list is numbered with an index. By calling the list and passing it a particular index value, a programmer can pull out any item placed into it. Unlike counting things that exist in the real world, index variables always begin with the number 0. For this too check the above reference.

For Queue refer this 

Answer:

Related questions

3 votes
3 votes
2 answers
1
go_editor asked Jul 5, 2016
22,755 views
To represent hierarchical relationship between elements, which data structure is suitable?DequeuePriorityTreeAll of the above
2 votes
2 votes
1 answer
2
go_editor asked Jul 5, 2016
4,279 views
The Inorder traversal of the tree will yield a sorted listing of elements of tree inBinary treeBinary search treeHeapsNone of the above
3 votes
3 votes
1 answer
3
go_editor asked Jul 4, 2016
1,337 views
A binary search tree is a binary tree in whichAll items in the left subtree are less than rootAll items in the right subtree are greater than or equal to rootEach subtree...
2 votes
2 votes
2 answers
4
go_editor asked Jul 4, 2016
3,818 views
The postfix expression AB + CD -* can be evaluated using astacktreequeuelinked list