NSCT PAST PAPERS AND SYLLABUS
فری تیاری کیلے وٹس ایپ
گروپ جوائن کریں
Click here
چار آپشن میں سے کسی ایک پر کلک کرنے سے جواب سرخ ہو جائے گا۔
- Total packets sent over UDP
- Total segments exchanged during the connection
- Number of ICMP requests sent
- Number of hosts in the network
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
In a TCP connection, communication happens via segments.
The number of messages indicates how many segments were sent and received.
Each segment contains data and control information for reliable transmission.
This helps in monitoring connection activity and performance.
It is specific to TCP and does not apply to UDP or ICMP.
لینکس میں تمام فائلز اور ڈائریکٹریز کی فہرست دیکھنے کے لیے کون سا کمانڈ استعمال ہوتا ہے؟
- ls
- cd
- mkdir
- rm
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
The ls command in Linux is used to list all files and directories in the current location.
It can show detailed information with options like ls -l (long format) or ls -a (including hidden files).
cd is used to change directories, not list them.
mkdir creates a new directory, and rm deletes files or directories.
کون سا شیڈولنگ الگورتھم سی پی یو وقت کو پروسیس کرنے کے لیے "ٹائم کوانٹم" کا استعمال کرتا ہے؟
- Priority Scheduling
- Round Robin (RR)
- Shortest Job First (SJF)
- None of these
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Round Robin (RR) is a CPU scheduling algorithm that assigns each process a fixed time slice called a time quantum.
Each process runs for the duration of the time quantum and then moves to the end of the ready queue if it isn’t finished.
It is a preemptive scheduling algorithm, meaning a process can be interrupted when its time quantum expires.
فلو چارٹ الگورتھم کی کون نمائندگی ہے؟
- Diagrammatic
- Symbolic
- Linked
- Both A & B
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A flowchart visually represents an algorithm using diagrams and symbols.
Diagrammatic representation helps in understanding the flow of the process easily.
Symbolic representation uses standard shapes like ovals, rectangles, diamonds for start/end, processes, and decisions.
کون سا ایس ڈی ایل سی ماڈل قدم بہ قدم ترتیب وار (سیکوینشل) طریقہ اپناتا ہے؟
- Agile
- Waterfall
- Spiral
- Incremental
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
The Waterfall model is a linear and sequential SDLC model, where each phase must be completed before the next begins.
Typical phases include Requirement Analysis → Design → Implementation → Testing → Deployment → Maintenance.
It is easy to manage because of its structured approach.
Changes are difficult to implement once a phase is completed, unlike Agile.
ٹائم کمپلیکسٹی کس چیز کی پیمائش کرتی ہے؟
- Memory usage
- Speed of execution
- Code length
- Output size
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
- Time complexity helps developers choose efficient algorithms for faster execution.
- It helps predict performance for large datasets.
- Common notations include O(1), O(n), O(n²), etc.
- It does not measure memory usage—that is space complexity.
سافٹ ویئر ریلیز کے بعد غلطیوں کو درست کرنا کیا کہلاتا ہے؟
- Preventive
- Adaptive
- Corrective
- Perfective
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Corrective maintenance refers to fixing errors or bugs discovered after software has been released.
It ensures the software works as intended and meets user requirements.
Unlike preventive or adaptive maintenance, it reacts to problems rather than anticipating them.
Common examples include patches, bug fixes, and error corrections.
ٹرانسفارمرز کس چیز میں استعمال ہوتے ہیں؟
- Networking
- Natural Language Processing
- Hardware design
- Graphics
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
Transformers are a type of AI model used to process and understand human language.
They are widely used in language translation, text summarization, and chatbots.
Unlike older models, transformers can handle long-range dependencies in text efficiently.
Famous examples include ChatGPT, BERT, and GPT series.
ڈی ایس اے (اسٹیک) کس اصول کی پیروی کرتا ہے؟
- FIFO
- LIFO
- Random
- Circular
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A stack is a data structure where the last element added is the first to be removed.
LIFO stands for Last In, First Out, reflecting this behavior.
Common examples include undo features in software and browser back buttons.
Stacks are used in function calls, recursion, and expression evaluation in programming.
- LIFO
- FIFO
- Random
- Priority only
اس سوال کو وضاحت کے ساتھ پڑھیں
Explanation
A queue is a data structure where elements are processed in the order they arrive.
FIFO stands for First In, First Out,Meaning the first element added is the first one to be removed.
Common examples include print queues and lineups at stores.
It is the opposite to stack, which uses LIFO (Last In, First Out).
