MOD PAST PAPERS
فری تیاری کیلے وٹس ایپ گروپ
جوائن کریں
Click here
Show Answers
چار آپشن میں سے کسی ایک پر کلک کرنے سے جواب سرخ ہو جائے گا۔
مندرجہ ذیل میں سے کون سا سی++ میں پری پروسیسر ڈائریکٹیو ہے؟
Using namespace std;
#include <iostream>
// comments
None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Preprocessor Directives are instructions processed before compilation in C++. #include tells the compiler to include the input-output library. Examples : #define, #ifdef, #ifndef. Last verified on 24-03-2026
مندرجہ ذیل میں سے کس مواصلاتی طریقے میں ہر اسٹیشن بھیج اور وصول کر سکتا ہے، لیکن ایک وقت میں نہیں، جب ایک ڈیوائس بھیج رہی ہو تو دوسری صرف وصول کر سکتی ہے؟
Half-Duplex
Simplex
Full-Duplex
None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
In Half-Duplex , communication is two-way but alternating; only one device transmits at a time . Example : Walkie-talkies – one speaks, the other listens, then roles switch. More efficient than Simplex (one-way only) but slower than Full-Duplex (simultaneous two-way). Last verified on 24-03-2026
مرج سورٹ الگورتھم کی مجموعی ٹائم کمپلیکسٹی کیا ہے؟
O(n log n)
O²(n log n)
O(n log n²)
None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Merge Sort is a divide and conquer algorithm that splits the array into halves, sorts them recursively, and merges them . Each level of recursion processes n elements, and there are log₂n levels , giving O(n log n) time complexity . It is stable and works well for large datasets. Worst, average, and best case all have O(n log n) complexity. Last verified on 24-03-2026
مندرجہ ذیل میں سے کون سا سب کلاسز کے اراکین کے تعلق کو بیان کرتا ہے اور یہ ظاہر کرتا ہے کہ کیا کسی سپر کلاس کا رکن ایک یا ایک سے زیادہ سب کلاسز کا حصہ ہو سکتا ہے؟
Disjoint constraint
Composition
Participation constraint
None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Disjoint constraint defines the relationship between superclass and its subclasses. It shows whether a member of a superclass can belong to one subclass only ( disjoint ) or more than one subclass ( overlap ). This concept is widely used in Database Design and Object-Oriented Modeling . Ensures clear organization of entities in a hierarchy and avoids ambiguity. Last verified on 24-03-2026
کس نیٹ ورک ٹوپولوجی میں، ایک لمبی کیبل نیٹ ورک میں موجود تمام آلات کو جوڑنے کے لیے ریڑھ کی ہڈی کا کام کرتی ہے؟
Mesh Topology
Ring Topology
Bus Topology
None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
In Bus Topology , a single central cable (the bus) connects all devices in the network. Data sent by one device is received by all other devices , but only the intended recipient processes it. It is simple and cost-effective for small networks. Last verified on 24-03-2026
O(1)
O(2)
O(3)
None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Heap Sort is an in-place sorting algorithm, meaning it does not require extra arrays. All operations are performed within the original array. Therefore, its space complexity is constant, O(1) . Last verified on 24-03-2026
The minimal number of attributes necessary to support the data requirements of the enterprise.
Attributes with a close logical relationship (described as functional dependency) are found in the same relation.
Implementation of a method that depends on the type of the object it is applied to (overriding).
Minimal redundancy with each attribute represented only once with the important exception of attributes that forms all or part of foreign keys, which are essential for the joining of related relations.
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Normalization organizes a database to reduce redundancy and dependency. A suitable set of relations has minimal attributes, logical grouping, and minimal redundancy. Object-oriented concepts like overriding are not related to normalization. Last verified on 24-03-2026
O(log n)
O²(log n)
O(log n²)
None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Quick Sort is an in-place sorting algorithm. It does not require extra arrays, but uses recursion stack space . On average, recursion depth is log n, so space complexity is O(log n) . Additional information :
Average space → O(log n) Best case → O(log n) Worst case → O(n) (unbalanced recursion) Time (average) → O(n log n) Last verified on 24-03-2026
{S = F(S)}
{S < F(S)}
{S | F(S)}
None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
In Tuple Relational Calculus (TRC), queries are written using set-builder notation. The expression {S | F(S)} means “ all tuples S such that condition F(S) is true ”. It focuses on what to retrieve, not how to retrieve it. Additional information :
General form → {t | P(t)} t → Tuple variable P(t) → Predicate (condition) Last verified on 24-03-2026
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
