Register

NTA PhD Entrance Examination CS 2023| Part 2 Question: 27

93 views
0 votes
0 votes
NTA PhD Entrance Examination CS 2023| Part 2 Question-27

Question No. 27 / Question ID 974082
Marks: 4.00

In data structures, stacks are useful for implementing

  1. Radix sort
  2. Breadth-first search
  3. Recursion
  4. Depth-first search

    Choose the most appropriate answer from the options given below:
    1. A and B Only
    2. A and C Only
    3. B and D Only
    4. C and D Only
    1
    2
    3
    4 (Chosen Option)
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
admin asked Nov 30, 2023
82 views
NTA PhD Entrance Examination CS 2023| PART 1 | Question: 27
Which of the following allows us to exclude variability from the experimental error, related to extraneous factors? Principle of Randomization Principle of Replication Principle of Local Control Principle of Formalization
Which of the following allows us to exclude variability from the experimental error, related to extraneous factors?Principle of RandomizationPrinciple of ReplicationPrinc...
User Avatar
0 votes
0 votes
1 answer
2
admin asked Dec 2, 2023
158 views
NTA PhD Entrance Examination CS 2023| Part 2 Question: 1
Question No. 1 / Question ID 974051 Marks: 4.00 The number of divisors of 2100 is 1. 42 2. 36 3. 78 4. 72 1 (Chosen Option) 2 3 4
Question No. 1 / Question ID 974051Marks: 4.00The number of divisors of 2100 is1. 422. 363. 784. 721 (Chosen Option)234
User Avatar
0 votes
0 votes
1 answer
4
admin asked Dec 2, 2023
137 views
NTA PhD Entrance Examination CS 2023| Part 2 Question: 3
Question No. 3 / Question ID 974076 Marks: 4.00 void main() \{ int $\mathrm{i}$; for $(i=0 ; i
Question No. 3 / Question ID 974076Marks: 4.00void main()\{int $\mathrm{i}$;for $(i=0 ; i
User Avatar
Link Copied!