कम्प्युटर र सूचना प्रविधि (प्राविधिक)
कम्प्युटर र सूचना प्रविधि (प्राविधिक)
Computer & IT (Technical) · ५,०७६ प्रश्न
५,०७६ प्रश्न उपलब्ध। मोड छान्नुहोस्:
कम्प्युटर र IT: प्रश्न र उत्तर
सही लागेको विकल्पमा थिच्नुहोस्। सही भए हरियो, गलत भए रातो देखिन्छ; ३ सेकेन्डपछि सही उत्तर र व्याख्या देखिन्छ।
सही: ० / ०
-
Inserting the keys 10, 20, 30, 40, 50 in that order into an empty (unbalanced) binary search tree produces:
सही उत्तर: क) a right-skewed tree that behaves like a linked list
Each new key is larger than all previous ones, so it always becomes the right child, giving a chain with O(n) search time.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
The keys 30, 10, 40, 5, 20 are inserted in that order into an empty binary search tree. What is its level-order traversal?
सही उत्तर: घ) 30 10 40 5 20
Level by level: root 30; then 10 and 40; then 5 and 20 (children of 10).
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
LSD radix sort sorts numbers digit by digit, starting from the least significant digit; for the result to be correct, the sort used on each digit must be:
सही उत्तर: ख) stable
Each pass must keep the order produced by earlier (less significant) digits for equal keys, so the per-digit sort must be stable, as counting sort is.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
If the Fibonacci function stores (memoises) each computed value, the time to compute fib(n) becomes:
सही उत्तर: घ) O(n)
With memoisation each fib(k) for k = 0 to n is computed only once, so the time is linear.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
Using Kadane's algorithm, what is the maximum sum of a contiguous subarray of [-2, 1, -3, 4, -1, 2, 1, -5, 4]?
सही उत्तर: ग) 6
The best subarray is [4, -1, 2, 1], whose sum is 6.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
If the key being searched is equally likely to be any of the n elements, the average number of comparisons in a successful linear search is:
सही उत्तर: क) (n + 1) / 2
The key is at position i with probability 1/n and needs i comparisons, so the average is (1 + 2 + ... + n)/n = (n + 1)/2.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
What is the minimum number of levels a binary tree must have to hold 100 nodes?
सही उत्तर: ख) 7
A binary tree with k levels holds at most 2^k - 1 nodes; 2^6 - 1 = 63 is too few, while 2^7 - 1 = 127 is enough.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
In the linked representation of a binary tree with n nodes, how many child pointers are NULL?
सही उत्तर: घ) n + 1
There are 2n child pointers in all, and n - 1 of them point to actual nodes (one per edge), leaving 2n - (n - 1) = n + 1 NULL.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
What is the time complexity of: for (i = 1; i ＜= n; i++) for (j = 1; j ＜= n; j += i) count++; ?
सही उत्तर: ग) O(n log n)
The inner loop runs about n/i times, and n/1 + n/2 + ... + n/n = n x (harmonic number), which is O(n log n).
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
A directed graph has edges A->B, A->C, B->D and C->D. Which of the following is a valid topological order?
सही उत्तर: घ) A C B D
In a topological order every edge goes from an earlier to a later vertex; A must come first and D last, which only A C B D satisfies.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
यी अभ्यास प्रश्न हुन्, आधिकारिक प्रश्न होइनन्। पाठ्यक्रम, विज्ञापन र नतिजाका लागि सम्बन्धित निकायको आधिकारिक वेबसाइट हेर्नुहोस्। उत्तरमा गल्ती भेटे प्रश्नमुनिको "टिप्पणी / गल्ती रिपोर्ट" मा लेख्नुहोस्।
नमस्ते! पाठ्यक्रम, सामान्य ज्ञान, भाषा परीक्षा वा कुनै प्रश्नको उत्तर बुझ्न सोध्नुहोस्।
AI ले गल्ती गर्न सक्छ। महत्वपूर्ण कुरा आधिकारिक स्रोतमा जाँच्नुहोस्।