BUET PG -MSc/Mphil/Phd Admission Preparation

BUET PG -MSc/Mphil/Phd Admission Preparation

Share

BUET offers undergraduate and postgraduate degrees in engineering, architecture, and urban planning through five faculties and six institutes.

🌐 𝙂đ™Ēđ™žđ™™đ™žđ™Ŗđ™œ 𝙖𝙨đ™Ĩđ™žđ™§đ™–đ™Ŗđ™Šđ™¨ đ™žđ™Ŗ 👇
CSE | ICT | Math | Physics | IWFM | Chemistry | AI & ML | Data Science | Cyber Security | Computing

🌐 𝐁𝐔𝐄𝐓 𝐏𝐆 (MSc/MPhil/PhD) in Mathematics āϕ⧋āĻ°ā§āϏ āĻ“ 𝐚đĨđĨ 𝐩đĢ𝐞đĻđĸ𝐮đĻ 𝐐&𝐒 āĻĒ⧇āĻ¤ā§‡đŸ‘‰ t.me/BUETpgat đŸŽ¯ 🌐BUET PG (Msc/Mphil/Phd) in Mathematics āϕ⧋āĻ°ā§āϏ⧇āϰ āĻĢā§āϰāĻŋ āĻ•ā§āϞāĻžāϏ āĻĒ⧇āϤ⧇ āĻœā§Ÿā§‡āύ: t.me/BUETpgat āĻ
đŸ”ģ⚡visit- https://t.me/BUETpgat/198 (for all premium)
Also guiding aspirants in:
CSE, ICT, Physics, I

BUET PG (MSc, MPhil, PhD) Admission in Mathematics 28/05/2026

Alhamdulillah, āϏāĻ°ā§āĻŦāĻļ⧇āώ October 25 (held 2026) semester āĻāϰ Paid Batch for BUET MSc /MPhil /PhD Admission in Mathematics āĻĨ⧇āϕ⧇ ā§§ā§Š āϜāύ āϚāĻžāĻ¨ā§āϏ āĻĒā§‡ā§Ÿā§‡āϛ⧇āĨ¤ congratulations to all 🌟

āĻŦāĻŋāĻ¸ā§āϤāĻžāϰāĻŋāϤ āϜāĻžāύāϤ⧇ -

BUET PG (MSc, MPhil, PhD) Admission in Mathematics 💎Run Admission Course for PG in Mathematics [MSc, MPhil, PhD] Also guiding aspirants in: CSE, ICT, Physics, IWFM, AI & ML, Data Science, Cyber Security, Computing,Chemistry. 🌟 visit- https://t.me/BUETpgat/198 đŸ”ģ⚡By-

Photos from BUET PG -MSc/Mphil/Phd Admission Preparation's post 21/05/2026

MSc, MPhil, PhD in mathematics at CUET admission test syllabus

The syllabus may change slightly as per department's will.

The syllabus for Jan-26 intake was.

1. Differentiatial and integral calculas
2. Ordinary and Partial Differential Equation
3. Vector Analysis

The syllabus for July-25 intake was.

1. Differentiatial and integral calculas
2. Ordinary and Partial Differential Equation
3. vector Analysis

The syllabus for January-25 intake was:

1.Ordinary differential equation
2. vector Analysis
3. Numerical Analysis

The Syllabus for January 24 was:

1. Differentiatial and integral calculas
2. Partial Differential Equation
3. 2D and 3D geometry
4. vector Analysis

So, taking generalized preparation from all the mentioned courses is safe.

All these subjects will be covered in our course for BUET MSc /MPhil /PhD Admission in Mathematics

āĻāϰ āϏāĻžāĻĨ⧇ āĻŦ⧇āϏāĻŋāĻ• āĻŽā§‡āĻ•āĻžāύāĻŋāĻ•ā§āϏ āφāϛ⧇āĨ¤ āĻāϟāĻž āĻāϕ⧇āĻ• āϏāĻŽā§Ÿ āĻ­ā§āϝāĻžāϰāĻŋ āĻ•āϰ⧇āĨ¤ āϤāĻŦ⧇ āĻāĻ•ā§āϏāĻžāĻŽ ā§§ āϘāĻ¨ā§āϟāĻžā§Ÿ āĻšā§ŸāĨ¤ āϞāĻŋāĻ–āĻŋāϤ āĻāĻ•ā§āϏāĻžāĻŽāĨ¤ ā§Ŧā§Ļ-ā§Žā§Ļ āĻŽāĻžāĻ°ā§āĻ• āĻĨāĻžāϕ⧇āĨ¤ āĻĒā§āϰāĻļā§āύāϗ⧁āϞ⧋ āĻŽāĻžāĻ°ā§āĻ• ā§Ē/ā§Ž āĻ›āĻŋāϞ āĻāĻŦāĻ‚ āϏāĻŦāĻžāϰ āĻĒā§āϰāĻļā§āύ āϏ⧇āϟ āĻāĻ•āϟāĻŋ āĻĨāĻžāϕ⧇āĨ¤

21/05/2026

Postgraduate Admission Notice for the session July-2026.

https://app.cuet.ac.bd/storage/Notices/6a0d97d0f31fd.pdf

Photos from BUET PG -MSc/Mphil/Phd Admission Preparation's post 19/05/2026

KUET-āĻ Ph.D., M.Phil., M.Sc. āĻĒā§āϰ⧋āĻ—ā§āϰāĻžāĻŽā§‡ āĻŦāĻŋāĻ­āĻŋāĻ¨ā§āύ āĻŦāĻŋāĻ­āĻžāϗ⧇ āĻ­āĻ°ā§āϤāĻŋāϰ āφāĻŦ⧇āĻĻāύ āĻļ⧁āϰ⧁ āĻšā§Ÿā§‡āϛ⧇āĨ¤ āφāĻ—ā§āϰāĻšā§€ āĻĒā§āϰāĻžāĻ°ā§āĻĨā§€āĻĻ⧇āϰ āϜāĻ¨ā§āϝ āĻŦāĻŋāĻ¸ā§āϤāĻžāϰāĻŋāϤ āύāĻŋāĻšā§‡ āĻĻ⧇āĻ“ā§ŸāĻž āĻšāϞ⧋:

āϏ⧁āĻŦāĻŋāϧāĻž āϏāĻŽā§‚āĻš : TA, RA, Fellowship and others. đŸ”Ĩ

​āωāĻšā§āϚāĻļāĻŋāĻ•ā§āώāĻžāϰ āϜāĻ¨ā§āϝ āϝāĻžāϰāĻž āĻ•ā§ā§Ÿā§‡āĻŸā§‡ āĻ­āĻ°ā§āϤāĻŋāϰ āĻ•āĻĨāĻž āĻ­āĻžāĻŦāϛ⧇āύ, āϤāĻžāĻĻ⧇āϰ āϜāĻ¨ā§āϝ āĻāϟāĻŋ āĻĻāĻžāϰ⧁āĻŖ āĻāĻ•āϟāĻŋ āϏ⧁āϝ⧋āĻ—āĨ¤ āϏāĻŽā§Ÿ āĻĨāĻžāĻ•āϤ⧇ āĻĻā§āϰ⧁āϤ āφāĻŦ⧇āĻĻāύ āϏāĻŽā§āĻĒāĻ¨ā§āύ āĻ•āϰ⧇ āĻĢ⧇āϞ⧁āύāĨ¤

​
KUET-āĻ Ph.D., M.Phil., M.Sc. āĻĒā§āϰ⧋āĻ—ā§āϰāĻžāĻŽā§‡ āĻ­āĻ°ā§āϤāĻŋāϰ āφāĻŦ⧇āĻĻāύ āĻļ⧁āϰ⧁ āĻšā§Ÿā§‡āϛ⧇āĨ¤ āφāĻ—ā§āϰāĻšā§€ āĻĒā§āϰāĻžāĻ°ā§āĻĨā§€āĻĻ⧇āϰ āϜāĻ¨ā§āϝ āĻŦāĻŋāĻ¸ā§āϤāĻžāϰāĻŋāϤ āύāĻŋāĻšā§‡ āĻĻ⧇āĻ“ā§ŸāĻž āĻšāϞ⧋:

18/05/2026

āĻ¸ā§āĻŦāĻĒā§āύ āϝāĻ–āύ āĻŦā§ā§Ÿā§‡āϟ āϏāĻŋāĻāϏāχ āĻŽāĻžāĻ¸ā§āϟāĻžāĻ°ā§āϏ (CSE IICT INfo sec)

āφāϏāϏāĻžāϞāĻžāĻŽā§ā§ŸāĻžāϞāĻžāχāϕ⧁āĻŽāĨ¤ āφāϜāϕ⧇ āĻŦā§ā§Ÿā§‡āϟ āϏāĻŋāĻāϏāχ āĻāϰ āĻŽāĻžāĻ¸ā§āϟāĻžāĻ°ā§āϏ⧇ āĻ­āĻ°ā§āϤāĻŋ āĻĒāϰ⧀āĻ•ā§āώāĻž āύāĻŋā§Ÿā§‡ āφāϞ⧋āϚāύāĻž āĻ•āϰāĻŦāĨ¤ āĻāϟāĻŋ āĻāĻ•āϟāĻŋ āϰ⧇āϗ⧁āϞāĻžāϰ āĻŽāĻžāĻ¸ā§āϟāĻžāĻ°ā§āϏāĨ¤ āϏāĻžāϧāĻžāϰāĻŖāϤ āĻĒā§āϰāϤāĻŋāĻŦāĻ›āϰ āĻāĻĒā§āϰāĻŋāϞ⧇ ā§§āϟāĻŋ āϏāĻžāĻ°ā§āϕ⧁āϞāĻžāϰ āφāϏ⧇āĨ¤ āĻŽāĻžāĻā§‡ āĻŽāĻ§ā§āϝ⧇ āĻ…āĻ•ā§āĻŸā§‹āĻŦāϰ⧇ āφāϰ⧇āĻ•āϟāĻž āϏāĻžāĻ°ā§āϕ⧁āϞāĻžāϰ āφāϏ⧇āĨ¤ āφāĻŦ⧇āĻĻāύ āĻ•āϰāĻžāϰ āϝ⧋āĻ—ā§āϝāϤāĻž āĻŦāĻŋāĻāϏāϏāĻŋ āϏāĻŋāϜāĻŋāĻĒāĻŋāĻ ⧍.ā§ĢāĨ¤ āĻŦā§ā§Ÿā§‡āĻŸā§‡ āĻāĻ•āϟāĻŋ āϞāĻŋāĻ–āĻŋāϤ āĻĒāϰ⧀āĻ•ā§āώāĻž āĻāĻŦāĻ‚ āϞāĻŋāĻ–āĻŋāϤ āĻĒāϰ⧀āĻ•ā§āώāĻžā§Ÿ āωāĻ¤ā§āϤ⧀āĻ°ā§āĻŖāĻĻ⧇āϰ āĻāĻ•āϟāĻŋ āĻ­āĻžāχāĻ­āĻž āĻšā§ŸāĨ¤ āĻ­āĻžāχāĻ­āĻžāϤ⧇ āĻŽā§‚āϞāϤ āϏāĻžāĻ°ā§āϟāĻŋāĻĢāĻŋāϕ⧇āϟ āĻšā§‡āĻ• āĻ•āϰāĻž āĻšā§Ÿ, āĻāĻ–āĻžāύ⧇ āϏāĻžāϧāĻžāϰāĻŖāϤ āϕ⧇āω āĻŦāĻžāĻĻ āĻĒā§œā§‡āύāĻžāĨ¤ āϞāĻŋāĻ–āĻŋāϤ āĻĒāϰ⧀āĻ•ā§āώāĻžāϟāĻžāχ āφāϏāϞāĨ¤ āϞāĻŋāĻ–āĻŋāϤ āĻĒāϰ⧀āĻ•ā§āώāĻžā§Ÿ ā§§ā§Ģā§Ļ āύāĻŽā§āĻŦāϰ⧇āϰ āĻĒā§āϰāĻļā§āύ āĻšā§ŸāĨ¤ ā§Šā§Ļ āϟāĻŋ āĻĒā§āϰāĻļā§āύ āĻĨāĻžāϕ⧇, āĻĒā§āϰāϤāĻŋāϟāĻŋ ā§Ģ āĻŽāĻžāĻ°ā§āĻ•āϏ āĻ•āϰ⧇āĨ¤ āφāĻŽāĻžāĻĻ⧇āϰ āĻĒ⧇āχāĻĄ āϰāĻŋāϏ⧋āĻ°ā§āϏ āϕ⧋āĻ°ā§āϏ⧇ āϝ⧇āχ āĻŦāĻŋāώ⧟āϗ⧁āϞ⧋ āφāωāϟāϞāĻžāχāύ⧇ āĻĻ⧇āĻ“ā§ŸāĻž āφāϛ⧇, āĻāĻ–āĻžāύ āĻĨ⧇āϕ⧇āχ āĻĒā§āϰāĻļā§āύ āĻšā§ŸāĨ¤ āϏāĻŽā§Ÿ āĻŦāϰāĻžāĻĻā§āĻĻ āĻĨāĻžāϕ⧇ ā§§āϘāĻ¨ā§āϟāĻž, ā§Šā§ĻāĻŽāĻŋāύāĻŋāϟāĨ¤ āĻŦā§ā§Ÿā§‡āϟ āĻĒāϰ⧀āĻ•ā§āώāĻžā§Ÿ āĻ…āĻ¨ā§āϝāϤāĻŽ āĻšā§āϝāĻžāϞ⧇āĻžā§āϜ āĻšāĻšā§āϛ⧇ āϏāĻŽā§Ÿā§‡āϰ āĻŽāĻ§ā§āϝ⧇ āϞ⧇āĻ–āĻž āĻļ⧇āώ āĻ•āϰāϤ⧇ āĻĒāĻžāϰāĻžāĨ¤ āϞāĻŋāĻ–āĻŋāϤ āĻĒāϰ⧀āĻ•ā§āώāĻžāϰ āĻĒāϰ āĻĻā§āϰ⧁āϤāχ āϰ⧇āϜāĻžāĻ˛ā§āϟ āĻĻāĻŋā§Ÿā§‡ āĻĻ⧇āĻ“ā§ŸāĻž āĻšā§ŸāĨ¤ āϏāĻžāϧāĻžāϰāĻŖāϤ ā§­ā§Ļ-ā§Žā§Ļ āϜāύ āϚāĻžāĻ¨ā§āϏ āĻĒā§‡ā§Ÿā§‡ āĻĨāĻžāϕ⧇āĨ¤ āĻŦāĻžāĻ‚āϞāĻžāĻĻ⧇āĻļ⧇āϰ āĻŽāĻžāĻ¸ā§āϟāĻžāĻ°ā§āϏ⧇ āĻ­āĻ°ā§āϤāĻŋ āĻĒāϰ⧀āĻ•ā§āώāĻžāϗ⧁āϞ⧋āϰ āĻŽāĻ§ā§āϝ⧇ āĻ…āĻ¨ā§āϝāϤāĻŽ āĻĒā§āϰāϤāĻŋāϝ⧋āĻ—āĻŋāϤāĻžāĻŽā§‚āϞāĻ• āĻĒāϰ⧀āĻ•ā§āώāĻž āĻšāĻšā§āϛ⧇ āĻŦā§ā§Ÿā§‡āϟ āϏāĻŋāĻāϏāχāϰ āĻŽāĻžāĻ¸ā§āϟāĻžāĻ°ā§āϏ⧇ āĻ­āĻ°ā§āϤāĻŋ āĻĒāϰ⧀āĻ•ā§āώāĻžāĨ¤ āϚāĻžāĻ¨ā§āϏ āĻĒāĻžāĻ“ā§ŸāĻžāϟāĻž āĻŦ⧇āĻļ āĻ•āĻ āĻŋāύāχ āĻŦāĻŸā§‡āĨ¤ āφāĻĒāύāĻŋ āϝāĻĻāĻŋ āϟāĻĒ āĻŽā§‡āϰāĻŋāϟ āĻĒāϜāĻŋāĻļāύ⧇ āϚāĻžāĻ¨ā§āϏ āĻĒāĻžāύ āĻāĻŦāĻ‚ āϕ⧋āύ⧋ āϜāĻŦ⧇ āύāĻž āĻĨāĻžāϕ⧇āύ, āĻ…āĻ°ā§āĻĨāĻžā§Ž āĻĢ⧁āϞ āϟāĻžāχāĻŽ āĻšāĻŋāϏ⧇āĻŦ⧇ āĻāĻĒā§āϞāĻžāχ āĻ•āϰ⧇ āĻĨāĻžāϕ⧇āύ, āϤāĻŦ⧇ āϟāĻŋāĻ, āφāϰāĻ, āĻĢ⧇āϞ⧋āĻļāĻŋāĻĒ āĻĒ⧇āϤ⧇ āĻĒāĻžāϰ⧇āύāĨ¤ āϟāĻŋāĻāϤ⧇ ⧍⧍ā§Ļā§Ļā§Ļ/= āĻŦ⧇āϤāύ āĻĒāĻžāĻ“ā§ŸāĻž āϝāĻžā§ŸāĨ¤ āφāϰāĻāϤ⧇ ⧍ā§Ģā§Ļā§Ļā§Ļ/= āĻāĻŦāĻ‚ āĻĢ⧇āϞ⧋āĻļāĻŋāĻĒ⧇ ā§Šā§Ļā§Ļā§Ļā§Ļ āϟāĻžāĻ•āĻž āĻĒāĻžāĻ“ā§ŸāĻž āϝāĻžā§ŸāĨ¤ āĻāĻŦāĻžāϰ āφāϏāĻŋ āĻ–āϰāĻšā§‡āϰ āĻŦāĻŋāĻˇā§Ÿā§‡āĨ¤ āĻŦā§ā§Ÿā§‡āĻŸā§‡āϰ āĻŽāĻžāĻ¸ā§āϟāĻžāĻ°ā§āϏ āĻšā§Ÿ ā§§.ā§Ģ- ā§Š āĻŦāĻ›āϰ⧇āϰāĨ¤ āĻāχ āϏāĻŽā§Ÿā§‡ āϏāĻ°ā§āĻŦā§‹āĻšā§āϚ ā§§ā§Ģā§Ļā§Ļā§Ļ āϟāĻžāĻ•āĻžāϰ āĻŦ⧇āĻļāĻŋ āϞāĻžāĻ—āĻŦ⧇āύāĻžāĨ¤ āĻāĻ›āĻžā§œāĻžāĻ“ āϚāĻžāĻ¨ā§āϏ āĻĒāĻžāĻ“ā§ŸāĻžāϰ āĻĒāϰ āĻāĻ•āϜāύ āĻŦā§ā§Ÿā§‡āϟāĻŋ⧟āĻžāύ āĻšāĻŋāϏ⧇āĻŦ⧇ āĻšāϞ⧇ āĻĨāĻžāĻ•āĻžāϏāĻš āϏāĻŦ āϏ⧁āϝ⧋āĻ— āϏ⧁āĻŦāĻŋāϧāĻž āĻĒāĻžāĻ“ā§ŸāĻž āϝāĻžā§ŸāĨ¤

For paid resources message us👇

BUET PG (MSc, MPhil, PhD) Admission in Mathematics 17/05/2026

Congratulations

BUET PG (MSc, MPhil, PhD) Admission in Mathematics BUET PG (MSc/MPhil/PhD in Mathematics āϏāĻžāĻŽāύ⧇āϰ āϏāĻžāĻ°ā§āϕ⧁āϞāĻžāϰ āϟāĻžāĻ°ā§āϗ⧇āϟ āύāĻŋā§Ÿā§‡ āĻŦ⧁āϝāĻŧ⧇āĻŸā§‡āϰ āĻ—āĻŖāĻŋāϤ āĻŦāĻŋāĻ­āĻžāϗ⧇ Msc/MPhil/PhD āĻāĻĄāĻŽāĻŋāĻļāύ āĻĢ⧁āϞ Live āϕ⧋āĻ°ā§āϏ⧇āϰ āĻŦāĻŋāĻ¸ā§āϤāĻžāϰāĻŋāϤ: đŸŸĸ āĻŦ⧁āϝāĻŧ⧇āϟ....

15/05/2026

Previous Year Question of Operating System (MSc in IICT):

1. Explain whith example, how deadlock can be described by resource allocation graphs.
2. How page faults occur? Describe the action taken by OS when page fault occure
3. Logical address space of 16 pages of 2048 words each which is mapped with a physical memory of 64 frames. Then
i) How many bits are required for logical address
ii) How many bit required for physical address
4. Explain the concept of "Locality of refrence".
5. Draw gantt charts using FCFS, SJF and non-preemptive priority scheduling with the follwing data:
process, arrival time, burts time, priority egular ekta chart deya chilo
6. Descrive four condition required for deadlock to occur.
7. Distinguish between process and thread. When thread can be more efficient than process. explain.
8. Advantage and disadvantage of having small page size.
9. Define turn around time and waiting time. SJF, FCFS use kre gantt chart and turn around time ber krte hbe. arrival time,burst time deya chilo.

15/05/2026

Previous Year Questions of Computer Networking :

1.Write the salient feature of WiMAX.
2. Difference between connetionless and connection-oriented delivery
3.Difference amonth cicuit switching, packet switching and cell switching
4. Difference between TCP and UDP. Which protocol use TCP and which ine use UDP?
5. Network address 172.19.0.0 This network need to be grouped among several department each have maximmum 590 hosts. Assume you are the admin of a dpt which have been given the subnet number 9.Write down your subnetwork address and two valid host address.
6.Difference between logical and physical address.
7. What is quality of service (QoS) of a network? How to achieve good QoS?
8. Compare TCP/IP and OSI model
9. Difference between baseband and broadband transmission
10. What are 10base2,10base5 and 10baseT ethernet LAN?
11. Difference amonth message switching, packet switching, circuit switching and cell switching.

Math pattern:

****If a host on a network has the address 172.16.45.14/30, what is the subnetwork this host belongs to?

****Your company has been given the IP Address of 199.2.1.0 /24 to subnet. You plan to put each of the 5 floors in your building on its own subnet. What is the IP range of the LAST available network once you subnet?

****IP Corporation has been assigned the Class B network address 165.87.0.0. NuTex needs to divide the network into eight subnets. What subnet mask should be applied to the network to provide the most hosts per subnet?

**** In an organization, the network address is 172.19.0.0. The network is to be grouped among several departments each having provision of maximum 590 hosts. Assume that the admin of the department has given the subnet number 9. what is the subnetwork address and write any two host address.

15/05/2026

Previous year questions of Data Structure and Algorithm:

1. Explain that we can write 10n^2+7n=O(n^2), but we can not write 10n^2+7n=O(n)
2. Draw a minimmum spanning tree of the following graph. What is the weight of your minimmum spanning tree?
3. Draw a complete binary tree of height 4.
4. What is heap? Build a max heap using the following number.
5.What is asymtotic upper bound of an algorithm? Can we write 10n^2+7n=O(n^2)? Explain
6. Draw minimum spanning tree using prim's algorithm.
7. Write scheudo code for implementing PUSH and POP operation
8. Write an algorithm for finding the k-th smallest element in an array of n element. Analyze the time-complexty of your algorithm
9. Show the insert operation of doubly linked list and write the pscheudo code for it.

***** Construct a binary search tree from the following number:
45,12,35,60,23,12,66,9

**** Draw a binary tree for : 10,5,2,6,14,12,15

15/05/2026

April,2017 Questions of Programming Languages:

1. difference between callByValue and callByreference?
2. write a function that swaps two variable without using the third variable??
3.write a function to determine the second largest element of a array
4. write a function that takes an integer and returns the reverse format of the taken integer without using any
build in string function
5.Write short not on:
a. Encapsulation
b.Inheritance

Want your school to be the top-listed School/college in Dhaka?

Click here to claim your Sponsored Listing.

Location

Address

BUET Central Road, SSH
Dhaka
DHAKA1000