Courses / HEC NSCT – National Skill Competency Test: Complete Preparation for Computing Graduates
Exam Toolkit – Formulas, Facts and Test-Day Technique
Start Here – About NSCT, Weightage, Study Plan and Diagnostic Test · 30 min read · 30 MCQs to check yourself
Exam toolkit – formulas and facts to remember
Problem solving
- Successive % changes a and b: net = a + b + ab/100. Profit % = profit ÷ cost × 100.
- Speed: km/h × 5/18 = m/s. Average speed for equal distances = 2xy ÷ (x + y).
- Work: if A takes a days and B takes b days, together = ab ÷ (a + b).
- nPr = n! ÷ (n − r)!, nCr = n! ÷ (r!(n − r)!). Probability = favourable ÷ total.
Programming and DSA
| Operation | Array | Linked list | BST (balanced) | Hash table |
|---|---|---|---|---|
| Search | O(n) (O(log n) if sorted) | O(n) | O(log n) | O(1) average |
| Insert | O(n) | O(1) at head | O(log n) | O(1) average |
- Sorting: bubble/selection/insertion O(n²); merge and heap O(n log n); quick O(n log n) average, O(n²) worst. Merge sort is stable.
- BFS uses a queue (shortest path in unweighted graphs); DFS uses a stack/recursion. Dijkstra: no negative edges.
- Binary search needs sorted data; ⌈log₂ n⌉ + 1 comparisons at most.
Databases
- 1NF atomic values → 2NF no partial dependency → 3NF no transitive dependency → BCNF every determinant is a candidate key.
- ACID: Atomicity, Consistency, Isolation, Durability. WHERE filters rows, HAVING filters groups.
- INNER JOIN = matching rows; LEFT JOIN = all left rows + matches (NULLs otherwise).
Networks
- Usable hosts = 2^(32 − prefix) − 2. /24 → 254, /25 → 126, /26 → 62, /27 → 30, /28 → 14, /29 → 6, /30 → 2.
- Private ranges: 10.0.0.0/8, 172.16.0.0/12, 192.168.0.0/16.
- Ports: HTTP 80, HTTPS 443, SSH 22, FTP 21, SMTP 25, DNS 53, DHCP 67/68.
- OSI (7→1): Application, Presentation, Session, Transport, Network, Data Link, Physical.
AI / ML
- Accuracy = (TP + TN) ÷ total; Precision = TP ÷ (TP + FP); Recall = TP ÷ (TP + FN); F1 = 2PR ÷ (P + R).
- Overfitting: great on training, poor on test → regularise, more data, simpler model, cross-validation.
Operating systems
- Turnaround = completion − arrival; waiting = turnaround − burst. SJF gives minimum average waiting time.
- Deadlock needs all four: mutual exclusion, hold and wait, no pre-emption, circular wait.
- FIFO can show Belady's anomaly; Optimal is the best possible; LRU approximates it.
Cyber security
- CIA = Confidentiality, Integrity, Availability. Encrypt to someone with their public key; sign with your own private key.
- SQL injection → parameterised queries; XSS → output encoding/CSP; CSRF → anti-CSRF tokens.
- Store passwords with bcrypt/Argon2 + salt. Backups: 3-2-1 rule. Pakistan's cyber law: PECA 2016.
Test-day technique
- About 72 seconds per MCQ. Do a first pass answering everything you know, mark the rest, then return.
- No negative marking (as reported) – guess intelligently rather than leave blanks.
- For scenarios, read the question first, then the case; four questions share one case, so read it carefully once.
This lesson ends with a quiz of 30 MCQs. Open the lesson on PrepOasis to take it and save your progress.
Previous: About NSCT – Pattern, 10 Areas and Weightage, 2026 Results and 6-Week Study Plan · Next: 1.1 Logical Reasoning Made Easy