INFORMATION TECHNOLOGY (IT)
Information Technology (IT)
چار آپشن میں سے کسی ایک پر کلک کرنے سے جواب سرخ ہو جائے گا۔
- Eulerian Graph
- Cycle
- Tree
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A connected graph with n vertices and n-1 edges is always a tree.
It has no cycles and ensures a unique path between any two vertices.
بغیر کسی سائیکل والے گراف کو _____ کہا جاتا ہے؟
- Weighted Graph
- Tree
- Bipartite Graph
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A tree is a connected graph with no cycles.
It has n nodes and (n-1) edges, ensuring a unique path between any two nodes.
- Transitive
- Reflexive
- Symmetric
- All of them
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
An equivalence relation must be reflexive, symmetric, and transitive.
These three properties together define equivalence among elements in a set.
- (1,2), (2,3)
- (1,1), (2,2), (3,3)
- (1,2), (2,1)
- All of them
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A relation is reflexive if every element is related to itself.
Only the set (1,1), (2,2), (3,3) satisfies this condition.
- ~
- V
- A
- &
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
The & operator represents logical AND, returning true only if both operands are true.
It is used in Boolean expressions and bitwise operations.
- What time is it?
- 2 + 2
- X + 5 = 10
- Today is Monday
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A proposition is a statement that is either true or false, not a question or expression.
"Today is Monday" can be evaluated as true or false, making it a proposition.
ڈسک پر کسی شے کو لکھنے کے لئے کون سی اصطلاح استعمال کی جاتی ہے؟
- Tokenization
- Serialization
- De-serialization
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Serialization is the process of converting an object into a format that can be stored or transmitted.
It allows the object to be saved to disk or sent over a network and later reconstructed via deserialization.
- Using erase()
- Automatically
- Using delete
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
In C++, dynamically allocated memory with new is deallocated using delete.
delete[] is used to free memory allocated for arrays.
متعدد استثناء کو سنبھالتے وقت کونسا کیچ بلاک پہلے لکھا جانا چاہئے؟
- Order Irrelevant
- General
- Specific
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Specific exceptions should be caught before general ones to avoid being overshadowed.
Writing a general exception first can prevent specific exception blocks from executing.
کسی رعایت کے بلاک کی وضاحت کے لئے کون سا کلیدی لفظ استعمال کیا جاتا ہے؟
- Finally
- Catch
- Try
- Throw
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
The try block is used to enclose code that may generate exceptions.
Exceptions thrown inside the try block are handled by corresponding catch blocks.
