Scribd
Upload
553 views102 pages

DSTL U-5 ONE SHOT (2) Combined Notes - 29825512 - 2024 - 02 - 13 - 21 - 16

Uploaded by

ks881650
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
553 views102 pages

DSTL U-5 ONE SHOT (2) Combined Notes - 29825512 - 2024 - 02 - 13 - 21 - 16

Uploaded by

ks881650
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 102

ONE SHOT PDF NOTES

 Available in Gateway Classes App


 Download Gateway Classes App from the Google play store
 App link in Description
 DATA STRUCTURE / COA / PYTHON / CYBER SECURITY / UHVPE / TC Playlist link in Description
III Semester theory examination 2022-23
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐴
1. 𝐷𝑟𝑎𝑤 𝑎𝑛 𝑎𝑑𝑗𝑎𝑐𝑒𝑛𝑐𝑦 𝑚𝑎𝑡𝑟𝑖𝑥 𝑓𝑜𝑟 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑔𝑟𝑎𝑝ℎ.
2. 𝐷𝑒𝑠𝑐𝑟𝑖𝑏𝑒 𝑝𝑙𝑎𝑛𝑎𝑟 𝑔𝑟𝑎𝑝ℎ 𝑎𝑛𝑑 𝑒𝑥𝑝𝑟𝑒𝑠𝑠 𝐸𝑢𝑙𝑒𝑟 ′ 𝑠 𝑓𝑜𝑟𝑚𝑢𝑙𝑎 𝑓𝑜𝑟 𝑝𝑙𝑎𝑛𝑎𝑟 𝑔𝑟𝑎𝑝ℎ.
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐵
3. 𝐸𝑥𝑝𝑙𝑎𝑖𝑛 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 ∶
𝑖 𝐸𝑢𝑙𝑒𝑟 𝑔𝑟𝑎𝑝ℎ 𝑎𝑛𝑑 𝐻𝑎𝑚𝑖𝑙𝑡𝑜𝑛𝑖𝑎𝑛 𝑔𝑟𝑎𝑝ℎ.
𝑖𝑖 𝐶ℎ𝑟𝑜𝑚𝑎𝑡𝑖𝑐 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎 𝑔𝑟𝑎𝑝ℎ
𝑖𝑖𝑖 𝑊𝑎𝑙𝑘 𝑎𝑛𝑑 𝑝𝑎𝑡ℎ.
𝑖𝑣 𝐵𝑖𝑝𝑎𝑟𝑡𝑖𝑡𝑒 𝑔𝑟𝑎𝑝ℎ.
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐶
4. 𝑈𝑠𝑖𝑛𝑔 𝑃𝑖𝑔𝑒𝑜𝑛ℎ𝑜𝑙𝑒 𝑝𝑟𝑖𝑛𝑐𝑖𝑝𝑙𝑒 𝑓𝑖𝑛𝑑 𝑡ℎ𝑒 𝑚𝑖𝑛𝑖𝑚𝑢𝑚 𝑛𝑢𝑚𝑏𝑒𝑟 𝑛 𝑜𝑓 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 𝑡𝑜 𝑏𝑒
𝑠𝑒𝑙𝑒𝑐𝑡𝑒𝑑 𝑓𝑟𝑜𝑚 𝑆 = 1, 2, 3, 4, 5, 6, 7, 8, 9 𝑠𝑜 𝑡ℎ𝑎𝑡 .
𝑖 𝑇ℎ𝑒 𝑠𝑢𝑚 𝑜𝑓 𝑡𝑤𝑜 𝑜𝑓 𝑡ℎ𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 𝑖𝑠 𝑒𝑣𝑒𝑛
𝑖𝑖 𝑇ℎ𝑒 𝑑𝑖𝑓𝑓𝑒𝑟𝑒𝑛𝑐𝑒 𝑜𝑓 𝑡𝑤𝑜 𝑜𝑓 𝑡ℎ𝑒 𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 𝑖𝑠 5.
III Semester theory examination 2021-22
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐴
1. 𝐸𝑥𝑝𝑙𝑎𝑖𝑛 𝐸𝑢𝑙𝑒𝑟 ′ 𝑠 𝑓𝑜𝑟𝑚𝑢𝑙𝑎. 𝐷𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑟𝑒𝑔𝑖𝑜𝑛𝑠 𝑖𝑓 𝑎 𝑝𝑙𝑎𝑛𝑎𝑟 𝑔𝑟𝑎𝑝ℎ
ℎ𝑎𝑠 30 𝑣𝑒𝑟𝑡𝑖𝑐𝑒𝑠 𝑜𝑓 𝑑𝑒𝑔𝑟𝑒𝑒 3 𝑒𝑎𝑐ℎ.
2. 𝐸𝑥𝑝𝑙𝑎𝑖𝑛 𝑝𝑖𝑔𝑒𝑜𝑛ℎ𝑜𝑙𝑒 𝑝𝑟𝑖𝑛𝑐𝑖𝑝𝑙𝑒 𝑤𝑖𝑡ℎ 𝑒𝑥𝑎𝑚𝑝𝑙𝑒.
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐶
1. 𝐸𝑥𝑝𝑙𝑎𝑖𝑛 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑡𝑒𝑟𝑚𝑠 𝑤𝑖𝑡ℎ 𝑒𝑥𝑎𝑚𝑝𝑙𝑒 ∶
𝑖 𝐺𝑟𝑎𝑝ℎ 𝑐𝑜𝑙𝑜𝑟𝑖𝑛𝑔 𝑎𝑛𝑑 𝑐ℎ𝑟𝑜𝑚𝑎𝑡𝑖𝑐 𝑛𝑢𝑚𝑏𝑒𝑟.
𝑖𝑖 𝐻𝑜𝑤 𝑚𝑎𝑛𝑦 𝑒𝑑𝑔𝑒𝑠 𝑖𝑛 𝐾7 𝑎𝑛𝑑 𝐾3,3 .
𝑖𝑖𝑖 𝐼𝑠𝑜𝑚𝑜𝑟𝑝ℎ𝑖𝑐 𝑔𝑟𝑎𝑝ℎ 𝑎𝑛𝑑 𝐻𝑎𝑚𝑖𝑙𝑡𝑜𝑛𝑖𝑎𝑛 𝑔𝑟𝑎𝑝ℎ.
𝑖𝑣 𝐵𝑖𝑝𝑎𝑟𝑡𝑖𝑡𝑒 𝑔𝑟𝑎𝑝ℎ.
𝑣 𝐻𝑎𝑛𝑑𝑠ℎ𝑎𝑘𝑖𝑛𝑔 𝑡ℎ𝑒𝑜𝑟𝑒𝑚.
2. 𝐸𝑥𝑝𝑙𝑎𝑖𝑛 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑡𝑒𝑟𝑚𝑠 𝑤𝑖𝑡ℎ 𝑒𝑥𝑎𝑚𝑝𝑙𝑒 ∶
𝑖 𝐽𝑢𝑠𝑡𝑖𝑓𝑦 𝑡ℎ𝑎𝑡 "𝐼𝑛 𝑎 𝑢𝑛𝑑𝑒𝑖𝑟𝑒𝑐𝑡𝑒𝑑 𝑔𝑟𝑎𝑝ℎ 𝑡ℎ𝑒 𝑡𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑜𝑑𝑑 𝑑𝑒𝑔𝑟𝑒𝑒 𝑣𝑒𝑟𝑡𝑖𝑐𝑒𝑠 𝑖𝑠 𝑒𝑣𝑒𝑛".
𝑖𝑖 𝐽𝑢𝑠𝑡𝑖𝑓𝑦 𝑡ℎ𝑎𝑡 "𝑇ℎ𝑒 𝑚𝑎𝑥𝑖𝑚𝑢𝑚 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑑𝑔𝑒𝑠 𝑖𝑛 𝑎 𝑠𝑖𝑚𝑝𝑙𝑒 𝑔𝑟𝑎𝑝ℎ 𝑖𝑠 𝑛(𝑛 − 1), 2"
III Semester theory examination 2020-21

𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐴
1. 𝐷𝑒𝑓𝑖𝑛𝑒 𝑐𝑜𝑚𝑝𝑙𝑒𝑡𝑒 𝑎𝑛𝑑 𝑟𝑒𝑔𝑢𝑙𝑎𝑟 𝑔𝑟𝑎𝑝ℎ.

𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐵
2. 𝐼𝑓 𝑎 𝑐𝑜𝑛𝑛𝑒𝑐𝑡𝑒𝑑 𝑝𝑙𝑎𝑛𝑎𝑟 𝑔𝑟𝑎𝑝ℎ 𝐺 ℎ𝑎𝑠 𝑛 𝑣𝑒𝑟𝑡𝑖𝑐𝑒𝑠, 𝑒 𝑒𝑑𝑔𝑒𝑠 𝑎𝑛𝑑 𝑟 𝑟𝑒𝑔𝑖𝑜𝑛, 𝑡ℎ𝑒𝑛 𝑛 − 𝑒 + 𝑟 = 2.

𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐶
3. 𝐹𝑖𝑛𝑑 𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 𝑡ℎ𝑒 100 𝑡𝑜 1000 𝑡ℎ𝑎𝑡 𝑎𝑟𝑒 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3 𝑜𝑟 5 𝑜𝑟 7.
III Semester theory examination 2019-20
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐴
1. 𝑆ℎ𝑜𝑤 𝑡ℎ𝑎𝑡 𝑡ℎ𝑒𝑟𝑒 𝑑𝑜𝑒𝑠 𝑛𝑜𝑡 𝑒𝑥𝑖𝑠𝑡 𝑎 𝑔𝑟𝑎𝑝ℎ 𝑤𝑖𝑡ℎ 5 𝑣𝑒𝑟𝑡𝑖𝑐𝑒𝑠 𝑤𝑖𝑡ℎ 𝑑𝑒𝑔𝑟𝑒𝑒𝑠 1,3,4,2,3
𝑟𝑒𝑠𝑝𝑒𝑐𝑡𝑖𝑣𝑒𝑙𝑦.
2. 𝐷𝑒𝑓𝑖𝑛𝑒 𝑃𝑖𝑔𝑒𝑜𝑛ℎ𝑜𝑙𝑒 𝑝𝑟𝑖𝑛𝑐𝑖𝑝𝑙𝑒.
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐵
3. 𝐷𝑒𝑓𝑖𝑛𝑒 𝑝𝑙𝑎𝑛𝑎𝑟 𝑔𝑟𝑎𝑝ℎ. 𝑃𝑟𝑜𝑣𝑒 𝑡ℎ𝑎𝑡 𝑓𝑜𝑟 𝑎𝑛𝑦 𝑐𝑜𝑛𝑛𝑒𝑐𝑡𝑒𝑑 𝑝𝑙𝑎𝑛𝑎𝑟 𝑔𝑟𝑎𝑝ℎ, 𝑣 − 𝑒 + 𝑟 = 2 𝑤ℎ𝑒𝑟𝑒 𝑣, 𝑒, 𝑟 𝑖𝑠
𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑣𝑒𝑟𝑡𝑖𝑐𝑒𝑠, 𝑒𝑑𝑔𝑒𝑠, 𝑎𝑛𝑑 𝑟𝑒𝑔𝑖𝑜𝑛𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑔𝑟𝑎𝑝ℎ 𝑟𝑒𝑠𝑝𝑒𝑐𝑡𝑖𝑣𝑒𝑙𝑦.
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐶
4. 𝐹𝑖𝑛𝑑 𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 1 𝑡𝑜 500 𝑡ℎ𝑎𝑡 𝑎𝑟𝑒 𝑛𝑜𝑡 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 𝑎𝑛𝑦 𝑜𝑓 𝑡ℎ𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 2
𝑜𝑟 3 𝑜𝑟 5 𝑜𝑟 7.
5. 𝐴𝑐𝑜𝑙𝑙𝑒𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 10 𝑒𝑙𝑒𝑐𝑡𝑟𝑖𝑐 𝑏𝑢𝑙𝑏𝑠 𝑐𝑜𝑛𝑡𝑎𝑖𝑛 3 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒 𝑜𝑛𝑒𝑠.
𝑖 𝐼𝑛 ℎ𝑜𝑤 𝑚𝑎𝑛𝑦 𝑤𝑎𝑦𝑠 𝑐𝑎𝑛 𝑎 𝑠𝑎𝑚𝑝𝑙𝑒 𝑜𝑓 𝑓𝑜𝑢𝑟 𝑏𝑢𝑙𝑏𝑠 𝑏𝑒 𝑠𝑒𝑙𝑒𝑐𝑡𝑒𝑑?
𝑖𝑖 𝐼𝑛 ℎ𝑜𝑤 𝑚𝑎𝑛𝑦 𝑤𝑎𝑦 𝑐𝑎𝑛 𝑎 𝑠𝑎𝑚𝑝𝑙𝑒 𝑜𝑓 4 𝑏𝑢𝑙𝑏𝑠 𝑏𝑒 𝑠𝑒𝑙𝑒𝑐𝑡𝑒𝑑 𝑤ℎ𝑖𝑐ℎ 𝑐𝑜𝑛𝑡𝑎𝑖𝑛 2 𝑔𝑜𝑜𝑑
𝑏𝑢𝑙𝑏𝑠 𝑎𝑛𝑑 2 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒 𝑜𝑛𝑒𝑠?
𝑖𝑖𝑖 𝐼𝑛 ℎ𝑜𝑤 𝑚𝑎𝑛𝑦 𝑤𝑎𝑦𝑠 𝑐𝑎𝑛 𝑎 𝑠𝑎𝑚𝑝𝑙𝑒 𝑜𝑓 4 𝑏𝑢𝑙𝑏𝑠 𝑏𝑒 𝑠𝑒𝑙𝑒𝑐𝑡𝑒𝑑 𝑠𝑜 𝑡ℎ𝑎𝑡 𝑒𝑖𝑡ℎ𝑒𝑟 𝑡ℎ𝑒 𝑠𝑎𝑚𝑝𝑙𝑒
𝑐𝑜𝑛𝑡𝑎𝑖𝑛 3 𝑔𝑜𝑜𝑑 𝑜𝑛𝑒𝑠 𝑎𝑛𝑑 1 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒𝑠 𝑜𝑛𝑒𝑠 𝑜𝑟 1 𝑔𝑜𝑜𝑑 𝑎𝑛𝑑 3 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒𝑠 𝑜𝑛𝑒𝑠?
III Semester theory examination 2017-18
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐴
1. 𝐷𝑒𝑓𝑖𝑛𝑒 𝐸𝑢𝑙𝑒𝑟𝑖𝑎𝑛 𝑝𝑎𝑡ℎ, 𝑐𝑖𝑟𝑐𝑢𝑖𝑡 𝑎𝑛𝑑 𝑔𝑟𝑎𝑝ℎ
2. 𝐸𝑥𝑝𝑙𝑎𝑖𝑛 𝑒𝑑𝑔𝑒 𝑐𝑜𝑙𝑜𝑟𝑖𝑛𝑔 𝑎𝑛𝑑 𝑘 𝑒𝑔𝑑𝑒 𝑐𝑜𝑙𝑜𝑟𝑖𝑛𝑔.
3. 𝐷𝑒𝑓𝑖𝑛𝑒 𝐶ℎ𝑟𝑜𝑚𝑎𝑡𝑖𝑐 𝑛𝑢𝑚𝑏𝑒𝑟 𝑎𝑛𝑑 𝐼𝑠𝑜𝑚𝑜𝑟𝑝ℎ𝑖𝑐 𝑔𝑟𝑎𝑝ℎ.
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐵
4. 𝐷𝑒𝑓𝑖𝑛𝑒 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑤𝑖𝑡ℎ 𝑜𝑛𝑒 𝑒𝑥𝑎𝑚𝑝𝑙𝑒.
𝑖 𝐵𝑖𝑝𝑎𝑟𝑡𝑖𝑡𝑒 𝐺𝑟𝑎𝑝ℎ.
𝑖𝑖 𝐶𝑜𝑚𝑝𝑙𝑒𝑡𝑒 𝐺𝑟𝑎𝑝ℎ
𝑖𝑖𝑖 𝐻𝑜𝑤 𝑚𝑎𝑛𝑦 𝑒𝑑𝑔𝑒𝑠 𝑖𝑛 𝐾7 𝑎𝑛𝑑 𝐾3,6 .
𝑖𝑣 𝑃𝑙𝑎𝑛𝑎𝑟 𝐺𝑟𝑎𝑝ℎ.
𝑆𝑒𝑐𝑡𝑖𝑜𝑛 − 𝐶
5. 𝐷𝑒𝑓𝑖𝑛𝑒 𝑎𝑛𝑑 𝐸𝑥𝑝𝑙𝑎𝑖𝑛 𝑎𝑛𝑦 𝑡𝑤𝑜 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 ∶
𝑖 𝐸𝑢𝑙𝑒𝑟 𝐺𝑟𝑎𝑝ℎ
𝑖𝑖 𝐴𝑑𝑗𝑎𝑐𝑒𝑛𝑐𝑦 𝑚𝑎𝑡𝑟𝑖𝑥 𝑜𝑓 𝑎 𝑔𝑟𝑎𝑝ℎ.

You might also like