📥 Downloads

Choose your education board to browse study resources.

Select Class

Choose a class to view available subjects.

Select Subject

Pick a subject to see all available files.

Entry Test Preparation Hub

🎯 Crack Your Entry Test

Past papers, MCQs, and guides for major university entry tests in Pakistan — all in one place. Select your exam below to get started.

NET — NUST NAT — NTS GAT GRE MDCAT ECAT
🏛️
NET
NUST Entry Test — Engineering, CS, Business & Sciences
1 file available
📋
NAT
National Aptitude Test by NTS
Coming Soon
🎓
GAT
Graduate Assessment Test — HEC Pakistan
Coming Soon
🌐
GRE
Graduate Record Examination — International
Coming Soon
🩺
MDCAT
Medical & Dental College Admission Test
Coming Soon
⚙️
ECAT
Engineering College Admission Test — UET
Coming Soon

🏛️ NUST Entry Test (NET)

Past papers, MCQs & complete guide to NET — your gateway to NUST

📄
NUST NET — Math Past Papers (120 MCQs)
Mathematics · Past Questions · 120 MCQs compiled · PDF
Download PDF

What is NET?

The NUST Entry Test (NET) is the official admission test conducted by NUST for undergraduate (BS) programs. It is a computer-based (and in some cities paper-based) exam consisting of MCQs based primarily on Matric (SSC) and Intermediate (HSSC) syllabus.

NET is designed to evaluate students' academic knowledge, analytical skills, and readiness for higher education in fields such as:

  • Engineering
  • Computer Science
  • Business & Social Sciences
  • Natural Sciences
  • Architecture & Design

The test typically includes 200 MCQs to be solved in 3 hours, with subject weightage depending on the chosen discipline.

Why NET is Important?

  • NET plays a central role in securing admission to NUST, one of Pakistan's top-ranked universities. Here's why it matters:
  • NUST primarily uses NET scores to determine merit. A higher score increases your chances of getting into competitive programs.
  • Students can appear in NET multiple times within the same admission cycle, and only the best score is considered, giving you multiple chances to improve.
  • NET ensures a fair and standardized assessment system for all applicants across Pakistan and overseas.
  • Clearing NET opens doors to prestigious undergraduate programs in engineering, computing, business, and sciences.

📅 How Many NETs Are Conducted for Fall Intake?

For each Fall admission cycle, NUST conducts the NET in multiple series throughout the year.

NUST conducts 4 NET series every year for Fall admissions:

NET-1
Usually in December
NET-2
Usually in February
NET-3
Usually in April
NET-4
Usually in June / July (final attempt)
⚠️
Important: You can attempt each series once per discipline. You can appear in multiple series. Best score is counted for final merit.

📝 Test Format & Key Features

FeatureDetails
SyllabusFSc / A-Level syllabus
FormatMCQ-based exam
Duration180 minutes (3 hours)
Total Questions200 MCQs
Exam ModeComputer-based (Islamabad & Quetta) · Paper-based (Karachi & Gilgit)
CitiesIslamabad, Karachi, Quetta, Gilgit

Because NET is conducted multiple times:

  • Attempt more than one series
  • Learn from previous attempts
  • Improve your score progressively

This flexibility is one of the biggest advantages of the NUST admission system.

📝 Register for NET

To apply for the NUST Entry Test or get the latest updates, visit the official admissions portal:

🌐 Visit NUST Admissions Portal →

The NUST Entry Test (NET) is not just an exam — it is your gateway to one of Pakistan's leading universities. With multiple attempts, a clear structure, and merit-based selection, it provides a fair opportunity for every student to succeed.

🚀 Prepare smart, attempt wisely, and aim for your best score!

University Course Notes Hub

🎓 University Notes & Resources

Solved problems, notes, and study material for university-level engineering and CS courses. Select your subject below to get started.

Digital Logic Design Circuit Theory More Coming Soon
🔌
DLD
Digital Logic Design — Notes & Solved Problems
22 files available
Circuit Theory
Circuit Analysis & Electrical Network Theory
1 file available
💻
DS&A
Data Structures & Algorithms
Coming Soon
🔢
Discrete Math
Discrete Mathematics for Computer Science
Coming Soon

🔌 Digital Logic Design (DLD)

Solved problems, notes & key concepts for Digital Logic Design

📄
DLD — Solution of Most Important Problems
Digital Logic Design · Solved Problems · University Level · PDF
Download PDF
📄
DLD — Important Problems
Digital Logic Design · Important Problems · University Level · PDF
Download PDF
📘
Logic and Computer Design Fundamentals — 4th International Edition
M. Morris Mano & Michael D. Ciletti · E-Book · University Level · PDF
Download PDF

📘 About the Textbook

Logic and Computer Design Fundamentals (4th International Edition) by M. Morris Mano and Michael D. Ciletti is the definitive textbook for Digital Logic Design courses worldwide. This comprehensive resource bridges the gap between logic design theory and practical computer design, making it essential reading for Computer Engineering and Electrical Engineering students.

  • Complete coverage of Boolean algebra, logic gates, and combinational circuit design with minimization techniques.
  • In-depth treatment of sequential circuits including flip-flops, registers, counters, and finite state machines.
  • Computer design fundamentals, register-transfer level design, datapaths, control units, and the link between hardware and instruction sets.
  • Hundreds of worked examples, problems, and design exercises to reinforce every concept.
📖
Recommended: Use this textbook as your primary reference alongside the lecture slides below for a thorough understanding of every DLD topic.

🗂️ Lecture Slides — Morris Mano

Complete set of lecture slides covering the full Digital Logic Design course, based on Morris Mano's textbook. Download individual slides or work through them in order for a structured study plan.

PPT
Lecture 1–2
Introduction to Digital Logic Design — Number Systems & Binary Arithmetic
Download
PPT
Lecture 3
Boolean Algebra — Fundamentals, Postulates & Theorems
Download
PPT
Lecture 4–5
Gate-Level Minimization — SOP, POS & Canonical Forms
Download
PPT
Lecture 6
Karnaugh Maps (K-Maps) — Two & Three Variable Simplification
Download
PPT
Lecture 6–7
K-Map Simplification & Don't-Care Conditions
Download
PPT
Lecture 8–9
Combinational Logic Circuits — Adders, Subtractors & Multiplexers
Download
PPT
Lecture 10–12
Rules of Boolean Algebra Expressions — Simplification & Applications
Download
PPT
Lecture 13–15
Decoders, Encoders, Multiplexers & Demultiplexers
Download
PPT
Lecture 16
Introduction to Sequential Circuits — Latches & Flip-Flops
Download
PPT
Lecture 17–19
Flip-Flop Types, Excitation Tables & Clocked Sequential Circuit Design
Download
PPT
Lecture 20
State Machines — State Diagrams, State Tables & Reduction
Download
PPT
Lecture 21
Registers & Shift Registers — Design and Applications
Download
PPT
Lecture 22
Counters — Binary, BCD, Ring & Johnson Counters
Download
PPT
Lecture 23–25
Memory & Programmable Logic — ROM, PLA, PAL Concepts
Download
PPT
Lecture 26–28
Register-Transfer Level Design — Datapaths & Control Units
Download
PPT
Lecture 29–32
Computer Design — Instruction Sets, ALU Design & Processor Organization
Download
PPT
Lecture 33–34
I/O Interface, Memory Systems & Advanced Topics in Computer Design
Download
PPT
ASM & Traffic Light Example
Algorithmic State Machine (ASM) Charts — Traffic Light Controller Design Example
Download
PDF
Sequential Design Review
Comprehensive review of sequential circuit design methods — exam preparation guide
Download

📖 About Digital Logic Design

Digital Logic Design (DLD) is a foundational course in Computer Engineering and Electrical Engineering programs. It covers the principles of designing digital circuits and systems using logic gates, Boolean algebra, and combinational/sequential circuits.

  • Number systems & Boolean algebra — the mathematical backbone of all digital systems.
  • Combinational circuits — adders, subtractors, multiplexers, decoders, and encoders.
  • Sequential circuits — flip-flops, registers, counters, and state machines.
  • Simplification techniques — Karnaugh Maps (K-Maps) and Quine-McCluskey method.
  • Logic families & implementation using TTL and CMOS technologies.

📝 What's Covered in This File?

This PDF compiles solutions to the most important and frequently asked problems in Digital Logic Design, making it ideal for exam preparation and concept revision.

  • Step-by-step worked solutions to high-weightage problems.
  • K-Map simplifications with clear grouping and SOP/POS derivations.
  • Truth tables and circuit designs for combinational logic problems.
  • Sequential circuit analysis including state diagrams and transition tables.
💡
Tip: Use this resource alongside your textbook to reinforce understanding — don't just memorize, understand the method behind each solution.

Mastering Digital Logic Design gives you the building blocks to understand computer architecture, processors, and embedded systems. It is one of the most important foundational courses for any Computer or Electrical Engineering student.

🚀 Understand the logic. Build the future.

⚡ Circuit Theory (LCA)

Solved problems, notes & key concepts for Circuit Theory — RLC Circuits & Op-Amps

📄
RLC & Op-Amp — Most Important Problems with Solutions
Circuit Theory (LCA) · Solved Problems · University Level · PDF
Download PDF

📖 About Circuit Theory (LCA)

Circuit Theory (Linear Circuit Analysis) is a core course in Electrical and Computer Engineering programs. It lays the mathematical and physical foundation for understanding how electrical circuits behave, covering DC and AC analysis, transient response, and active components like Op-Amps.

  • RLC circuits — resistors, inductors, and capacitors in series and parallel configurations.
  • Transient & steady-state analysis — natural and forced responses of first and second-order circuits.
  • Operational Amplifiers (Op-Amps) — inverting, non-inverting, summing, and differentiator/integrator configurations.
  • Phasor analysis — AC circuit analysis using impedance and admittance.
  • Network theorems — Thevenin, Norton, Superposition, and Maximum Power Transfer.

📝 What's Covered in This File?

This PDF compiles solutions to the most important and frequently asked problems in Circuit Theory, covering both RLC circuits and Operational Amplifiers — ideal for exam preparation and concept revision.

  • Step-by-step worked solutions to high-weightage RLC circuit problems.
  • Transient analysis of first and second-order circuits with complete derivations.
  • Op-Amp circuit analysis — gain calculations, virtual ground concept, and feedback networks.
  • Phasor-domain problems with impedance and frequency response analysis.
💡
Tip: Focus on understanding the method behind each solution — especially the choice of analysis technique. Being able to recognize which approach fits a given circuit is the key skill examiners test.

Mastering Circuit Theory gives you the analytical tools to understand every electrical system — from power grids to microchips. It is one of the most fundamental courses for any Electrical or Computer Engineering student.

⚡ Understand the circuits. Power the world.

Disclaimer: All documents on this site are for educational purposes only and intended solely to support learning.