COMPUTER
Download PDF Click here
فری تیاری کیلے Whatsappجوائن کریںClick
here
چار آپشن میں سے کسی ایک پر کلک کرنے سے جواب سرخ ہو جائے گا۔
کون سا بیان سب سے بہتر طریقے سے ٹرانزٹیو ریلیشن کی وضاحت کرتا ہے؟
- If A > B and B > C, then A > C
- If A = B and B ≠ C, then A = C
- If A is adjacent to B, then B is adjacent to A
- If A is connected to B, then B is disconnected from A
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A transitive relation means that if a relation holds between A and B, and B and C, it also holds between A and C.
Example: “greater than” (>) is transitive: if 5 > 3 and 3 > 2, then 5 > 2.
This property is important in mathematics and computer science.
Relations like adjacency or inequality may or may not be transitive.
Understanding transitivity helps in reasoning and designing algorithms.
- 0
- 1
- 2
- 3
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- Output of code (bool b = false; cout << b + 2;)
- false = 0, so 0 + 2 = 2 → Output = 2
- 0
- 1
- Error
- Undefined
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
&& is evaluated before || due to operator precedence.
a && b gives 0 because one operand is false.
Then a || 0 is evaluated.
1 || 0 gives 1.
So the program prints 1.
- O(n)
- O(log n)
- O(n²)
- O(n log n)
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A loop inside another loop is called a nested loop.
If both loops run n times, the inner loop runs n times for each iteration of the outer loop.
Total iterations = n × n = n².
Therefore, the time complexity is O(n²).
ڈیٹا سٹرکچرز میں، ان شفٹ کیا کرتا ہے؟
- Adds an element to the beginning
- Removes the last element
- Removes the first element
- Adds an element to the end
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- In arrays or lists, unshift adds a new element to the start of the structure.
- The existing elements are shifted one position to the right to make space.
- The opposite operation is shift, which removes the first element.
- Unshift is useful when you need to prioritize new elements at the front.
- It is commonly used in queue implementations and array manipulations.
ڈیٹا سٹرکچرز میں، شفٹ کیا کرتا ہے؟
- Removes the first element
- Adds an element to the end
- Removes the last element
- Adds an element to the beginning
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- In arrays or lists, shift removes the first element.
- The remaining elements are shifted one position to the left to fill the gap.
- The opposite operation is unshift, which adds an element to the beginning.
- Shift is useful in queue implementations where the first element is processed first.
- It helps in efficiently managing data in ordered sequences.
ڈیٹا سٹرکچرز میں، پُش کیا کرتا ہے؟
- Removes the first element
- Adds an element to the end
- Removes the last element
- Adds an element to the beginning
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
In stack data structures, push is used to add an element.
The element is added to the top of the stack (end of the structure).
The opposite operation is pop, which removes the top element.
Stacks follow the LIFO (Last In, First Out) principle.
Push helps in storing data temporarily during computations and function calls.
ڈیٹا سٹرکچرز میں، پاپ کیا کرتا ہے؟
- Adds an element to the beginning
- Removes the last element
- Removes the first element
- Adds an element to the end
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
In a stack, pop removes the element from the top (the last element added).
Stacks follow the LIFO (Last In, First Out) principle.
The opposite operation of pop is push, which adds an element.
Pop is commonly used in undo operations, expression evaluation, and recursion.
It helps in retrieving and removing the most recently added data efficiently
- Using consistent colors
- Using too many labels or a distorted scale
- Accurate data representation
- Correct legends
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Charts can mislead if the scale is distorted or labels are overwhelming.
This can make differences appear larger or smaller than they actually are.
Using consistent colors, correct legends, and accurate data ensures clarity.
Misleading charts can affect decisions and interpretations.
Always check the axis, scale, and labeling to avoid misrepresentation.
مندرجہ ذیل میں سے پری ایمپٹیو شیڈولنگ کے بارے میں کون سا درست ہے؟
- A process cannot be interrupted once started
- A process can be interrupted to allow a higher-priority process to run
- CPU is always allocated in a fixed order
- All processes run simultaneously
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Preemptive scheduling allows the CPU to pause a running process if a higher-priority process needs it.
This ensures important tasks are handled promptly.
It is different from non-preemptive scheduling, where a process runs until completion.
Examples include Round Robin and Priority Scheduling.
