NSCT PAST PAPERS AND SYLLABUS
فری تیاری کیلے وٹس ایپ
گروپ جوائن کریں
Click here
چار آپشن میں سے کسی ایک پر کلک کرنے سے جواب سرخ ہو جائے گا۔
- Under budget and ahead of schedule
- Over budget and behind schedule
- On budget and on schedule
- Cannot determine
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Actual Cost (AC) measures money spent so far.
Earned Value (EV) measures the value of work actually completed.
If AC > EV, the project is spending more than the value earned → over budget.
If EV is low, less work is completed than planned → behind schedule.
- Optimization
- Reduce memory loss
- Code reusability (generic programming)
- Memory allocation
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Templates in C++ allow writing generic functions or classes.
They enable the same code to work with different data types without rewriting it.
This improves code reusability and maintainability.
Templates are not directly about memory optimization or allocation.
Example: template <typename T> T add(T a, T b) works for int, float, or double.
- A
- B
- C
- E
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
The traveler starts at city A and follows the path: A → B → C → D → E → A.
The journey ends back at city A to complete the circuit.
All other cities (B, C, D, E) are visited only once.
Returning to the starting point is typical in circular routes or tours.
Therefore, city A is visited twice.
- HTML
- CSS
- Python
- JavaScript
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Server-side rendering (SSR) generates HTML on the server before sending it to the client.
Python (with frameworks like Django or Flask) can render templates on the server.
JavaScript can also do SSR (e.g., with Node.js), but in this option, Python is the server-side language.
HTML and CSS are used for structure and styling, not server-side logic.
SSR improves initial page load speed and SEO.
- Stores data in tables with rows and columns
- Only allows sequential storage of data
- Does not support queries
- Uses key-value pairs exclusively
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A relational database organizes data into tables (relations).
Each table consists of rows (records) and columns (fields).
It supports SQL queries for data manipulation and retrieval.
Data is related using keys (primary and foreign keys).
- $1000
- $1500
- $2000
- $2500
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Profit = Revenue − Cost
Revenue = $5000, Cost = $3500
Profit = 5000 − 3500 = 1500
- To store variables
- To group identifiers and avoid name conflicts
- To create new functions
- To allocate memory
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- A namespace in C++ is used to organize code into logical groups.
- It helps avoid name conflicts when different parts of code use the same names.
- For example, two libraries can have functions with the same name but in different namespaces.
- The std namespace (e.g., std::cout) is a common example.
- Namespaces improve code clarity and maintainability.
- DELETE
- DROP
- TRUNCATE
- REMOVE
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
TRUNCATE removes all rows from a table but keeps the table structure intact.
It is faster than DELETE because it does not log individual row deletions.
DELETE can remove specific rows and can be rolled back.
DROP deletes the entire table structure and data.
REMOVE is not a valid SQL command.
- Increases noise
- Reduces smoothing
- Increases smoothing and reduces detail
- Has no effect
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A kernel is used to smooth data by averaging nearby values.
Increasing kernel size means more neighboring points are considered.
This results in stronger smoothing of the data.
However, it also removes fine details and sharp features.
So larger kernels increase smoothing but reduce detail.
- A path can repeat vertices but not edges
- A cycle cannot start and end at the same vertex
- The shortest path always has the maximum number of edges
- Graphs cannot have isolated vertices
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A path may revisit vertices but cannot reuse the same edge.
A cycle actually starts and ends at the same vertex, so B is incorrect.
The shortest path minimizes edges or weight, not maximizes them.
Graphs can have isolated vertices with no connections.
