Data and File Structures [NTA-NET (UGC-NET) Computer Science & Applications (87)]: Questions 1 - 3 of 153
Choose Programs:
⏳ 🎯 Online Tests (4 Tests [100 questions each]): NTA Pattern, Analytics & Explanations
Rs. 800.00 -OR-
3 Year Validity (Multiple Devices)
Sample TestsDetailsSee Demo
🎓 Study Material (2083 Notes): 2024-2025 Syllabus
Rs. 1250.00 -OR-
3 Year Validity (Multiple Devices)
Topic-wise Notes & SampleDetails
🎯 2699 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)
Rs. 600.00 -OR-
3 Year Validity (Multiple Devices)
CoverageDetailsSample Explanation
Help me Choose & Register (Watch Video) Already Subscribed?
Question 1
Appeared in Year: 2015
Question MCQ▾
In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp
It shows which of the following depth first forest?
Choices
Choice (4) | Response | |
---|---|---|
a. | {a, b, e} {c, d, h} {f, g} | |
b. | {a, b, e} {c, d, f, g, h} | |
c. | {a, b, c, d} {e, f, g} {h} | |
d. | {a, b, e} {f, g} {c, d} {h} |
Question 2
Appeared in Year: 2015
Question MCQ▾
A three dimensional array in ‘C’ is declared as int A [x] [y] [z] . Here, the address of an item at the location A [p] [q] [r] can be computed as follows (where w is the word length of an integer) : (December)
Choices
Choice (4) | Response | |
---|---|---|
a. | &A [0] [0] [0] + w (x × y × p + z × q + r) | |
b. | &A [0] [0] [0] + w (y × z × q + z × p + r) | |
c. | &A [0] [0] [0] + w (y × z × p + z × q + r) | |
d. | &A [0] [0] [0] + w (x × y × q + z × p + r) |
Question 3
Appeared in Year: 2015
Question MCQ▾
The inorder traversal of the following tree is: (December)
Choices
Choice (4) | Response | |
---|---|---|
a. | 2 3 4 6 7 13 15 17 18 18 20 | |
b. | 2 4 3 13 7 6 15 17 20 18 18 | |
c. | 15 13 20 4 7 17 18 2 3 6 18 | |
d. | 20 18 18 17 15 13 7 6 4 3 2 |