INFORMATION TECHNOLOGY (IT)
Information Technology (IT)
چار آپشن میں سے کسی ایک پر کلک کرنے سے جواب سرخ ہو جائے گا۔
- O(n)
- O(n²)
- O²(n²)
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- Best case occurs when the array is already sorted.
- With an optimized Bubble Sort (using a swap flag), no swaps are needed.
- The algorithm makes only one pass, resulting in O(n) time.
Additional information:
- Average case → O(n²)
- Worst case → O(n²)
- Comparisons in best case → (n − 1)
- Swaps → 0
Last verified on 24-03-2026
- PAN (Personal Area Network)
- SAN (Storage Area Network)
- MAN (Metropolitan Area Networks)
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- MAN (Metropolitan Area Network) covers a city or large town area.
- It is larger than LAN but smaller than WAN.
- It provides high-speed internet and connectivity across a city.
Additional information:
- PAN → Few meters (personal devices)
- LAN → Building / campus level
- MAN → City-wide (10–100 km range)
- WAN → Country / global level
Last verified on 24-03-2026
- Finite set of input symbols
- Finite set of states
- A transition function that maps Q × Σ --> Q
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- In a Deterministic Finite Automaton (DFA), δ (delta) represents the transition function.
- It defines how the automaton moves from one state to another.
Additional information:
- Q → Finite set of states
- Σ → Finite set of input symbols
- δ → Transition function (Q × Σ → Q)
- q₀ → Initial (start) state
- F → Set of final (accepting) states
Last verified on 24-03-2026
مرتب شدہ زبانوں کے کیا فوائد ہیں؟
- It is easy to write the source code
- It is faster to declare variables
- Their execution speed is faster
- Both A and B
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- Compiled languages convert source code into machine code before execution.
- This makes programs run much faster than interpreted languages.
- Examples include C, C++, and Go.
Last verified on 24-03-2026
- O(n log n²)
- O²(n log n)
- O(n log n)
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- Best case occurs when the pivot divides the array into two equal halves each time.
- This leads to a balanced recursion tree.
- Hence, Quick Sort runs in O(n log n) time in the best case.
Additional information:
- Average case → O(n log n)
- Worst case → O(n²)
- Example size: n = 8 → log₂(8) = 3 levels
- Total comparisons ≈ n log n
Last verified on 24-03-2026
- List
- ArrayList
- Vector
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- In C++, vector is used as a dynamic array.
- It automatically resizes itself when elements are added or removed.
- It is part of the Standard Template Library (STL).
Last verified on 24-03-2026
- O(n)
- O(n log n)
- O(n²)
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- Merge Sort requires extra memory to merge sorted subarrays.
- It is not an in-place algorithm.
- Therefore, its space complexity is O(n) for an array of size n.
Additional information:
- Time complexity (Best) → O(n log n)
- Time complexity (Average) → O(n log n)
- Time complexity (Worst) → O(n log n)
- Recursion stack → O(log n)
Last verified on 24-03-2026
ڈیٹابیس میں کینڈیڈیٹ کی کیا ہوتی ہے؟
- The minimal set of attributes that unique identifies each occurrence of an entity type.
- Set of one or more attribute that can used to uniquely identify the records in table.
- The candidate key that is selected: uniquely Identify each occurrence of a entity type.
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- A Candidate Key is the smallest (minimal) set of attributes that uniquely identifies each record in a table.
- They are also called possible keys.
- It must be unique and cannot contain unnecessary attributes.
- A table can have multiple candidate keys, but only one is chosen as the primary key.
Last verified on 24-03-2026
متوازن بائنری سرچ ٹری میں کسی عنصر کی تلاش میں وقت کی پیچیدگی کیا ہے؟
- O(1)
- O(n)
- O(log n)
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
In a balanced binary search tree, the height is proportional to log n, ensuring efficient searches.The time complexity is O(log n) as the search halves the tree at each step.Last verified on 23-03-2026
فوری ترتیب والے الگورتھم کی بدترین صورتحال کا وقت کی پیچیدگی کیا ہے؟
- O(log N)
- O(N log N)
- O(N²)
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- Quick Sort is a divide-and-conquer sorting algorithm.
- In the worst case, it occurs when the pivot divides the array very unevenly (e.g., always smallest or largest element).
- This results in O(n²) comparisons for an array of size n.
Additional information:
- Average case → O(n log n)
- Best case → O(n log n)
- Worst case → O(n²)
Last verified on 23-03-2026
