Register

UGC NET CSE | December 2006 | Part 2 | Question: 25

• edited by
821 views

1 Answer

2 votes
2 votes
Linked List, Stack, and Tables are Abstract Data Type (ADT). They can can be accessed through some well-defined operations such as PUSH and POP in the case of Stack.

Whereas an array is a primitive data type that we can access and modified with low-level code such as memory offset or index. Hence array is a physical data structure.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Mar 27, 2020
572 views
UGC NET CSE | December 2006 | Part 2 | Question: 11
When a function is recursively called, all automatic variables : are initialized during each execution of the function are retained from the last execution are maintained in a stack are ignored
When a function is recursively called, all automatic variables :are initialized during each execution of the functionare retained from the last executionare maintained in...
User Avatar
1 votes
1 votes
2 answers
2
go_editor asked Mar 27, 2020
6,520 views
UGC NET CSE | December 2006 | Part 2 | Question: 23
What is the time required to insert an element in a stack with linked implementation ? $O (\log_2 n)$ $O (n)$ $O (n\log_2 n)$ $O (1)$
What is the time required to insert an element in a stack with linked implementation ?$O (\log_2 n)$$O (n)$$O (n\log_2 n)$$O (1)$
User Avatar
0 votes
0 votes
2 answers
3
go_editor asked Mar 27, 2020
1,075 views
UGC NET CSE | December 2006 | Part 2 | Question: 24
The equivalent postfix expression for $d{\large /}(e+f)+b*c$ : $defbc/++*$ $def+/bc+*$ $def+/bc*+$ None of these
The equivalent postfix expression for $d{\large /}(e+f)+b*c$ :$defbc/++*$$def+/bc+*$$def+/bc*+$None of these
User Avatar
0 votes
0 votes
1 answer
4
go_editor asked Mar 27, 2020
1,531 views
UGC NET CSE | December 2006 | Part 2 | Question: 1
Which of the regular expressions corresponds to this grammar ? $S → AB/AS, A → a/aA, B → b$ $aa^*b^+$ $aa^*b$ $(ab)^*$ $a(ab)^*$
Which of the regular expressions corresponds to this grammar ?$S → AB/AS, A → a/aA, B → b$$aa^*b^+$$aa^*b$$(ab)^*$$a(ab)^*$
User Avatar
Link Copied!