HamroCSIT Logo
HAMRO CSIT
  • Course New
  • Entrance
    • Take Free Test
    • MCQ Questions
    • Colleges
    • Entrance Class
    • Entrance Books
    • Free Entrance Video Course
  • Semester
    • First Semester
    • Second Semester
    • Third Semester
    • Fourth Semester
    • Fifth Semester
    • Sixth Semester
    • Seventh Semester
    • Eight Semester
  • Questions
  • Subscription Automated
  • Notices
  • Articles
  • More
    • Ask Question
    • College Ambassadors
    • Financial Support Program
    • Contribute
    • Contact Us
Login Register
Hamro CSIT User Account
  • Sign In
  • Create Account




Shape | Hamro CSIT Shape | Hamro CSIT Shape | Hamro CSIT Shape | Hamro CSIT

Questions

  • Ask Any Question From TU CSIT Syllabus?
Search
Semester
Subject
Answer
Order
HamroCSIT User
Using mathematical induction show that $$2+5+8+…+(3n−1) = \frac{{n(3n+1)}}{{2​}}.$$
Not Answered No Subject Asked on 2081 Exam
HamroCSIT User
Find the GCD of 12 and 16 using Extended Euclidean Algorithm.
Not Answered Discrete Structure Asked on 2081 Exam
HamroCSIT User
How do you think deadlock can be avoided? Explain.
Not Answered Fourth Semester Asked on 2081 Exam
HamroCSIT User
Consider a swapping system in which memory consists of the following hole sizes in memory order:
15 MB, 2 MB, 10 MB, 6 MB, 8 MB and 20 MB.
Which hole is taken for successive segment requests of:

(a) 10 MB
(b) 10 MB
For first fit, next fit and best fit.

Not Answered Fourth Semester Asked on 2081 Exam
HamroCSIT User
Explain Inter-Process Communication in Linux.
Not Answered Fourth Semester Asked on 2081 Exam
HamroCSIT User
Write short notes on:

  1. Virtual Memory
  2. Race Condition
Not Answered No Subject Asked on 2081 Exam
HamroCSIT User
Explain the Sleeping Barber problem. Illustrate on how it can be solved.
Not Answered No Subject Asked on 2081 Exam
HamroCSIT User
Explain memory-mapped I/O.
Not Answered No Subject Asked on 2081 Exam
HamroCSIT User
List different file structures and explain them.
Not Answered No Subject Asked on 2081 Exam
HamroCSIT User
Calculate the average waiting time and turnaround time using priority algorithm (Priority 1 being the highest) for the given scenario:

PID Brust Time Arrival Time Priority
A 3 0 3
B 2 2 3
C 4 3 2
D 2 3 1
Not Answered No Subject Asked on 2081 Exam
Page navigation
  • «
  • « First
  • Page 90
  • Page 91
  • Current Page 92
  • Page 93
  • Page 94
  • Last »
  • »
Question's Answer
Solution Video
Solution
Share

Share this link via

Or copy link

logoHAMROCSIT

Hamro CSIT is a comprehensive web and mobile platform that provides B.Sc. CSIT students with resources like notes, syllabi, question banks, solved past papers, practical files, and free entrance preparation materials — all in one place.

  • [email protected]
Semester
  • First Semester
  • Second Semester
  • Third Semester
  • Fourth Semester
  • Fifth Semester
  • Sixth Semester
  • Seventh Semester
  • Eighth Semester
Links
  • About Us
  • FAQs
  • Sitemap
  • Privacy Policy
  • Terms and Conditions
  • College Ambassadors
  • Financial Support Program
Hits Counter
20089948
Google Play App Store
Follow Us

Copyright 2026 | HAMROCSIT | All Right Reserved

Official Payment Partner Esewa Logo
HAMROCSIT.COM

Copyright 2024 | HAMROCSIT.COM | All Right Reserved - Nymna Technology