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
Write an algorithm to find the nth fibonacci number with its time and space complexity.
Not Answered Design and Analysis of Algorithms Asked on 2081 Exam
HamroCSIT User
Does greedy algorithm guarantee optimal solution? Solve the Fractional knapsack problem to find maximum loot from given information.

Item 1 2 3 4 5 6 7
Value 12 10 20 15 2 3 50
Weight (kgs) 2 1 3 2 12 10 1
Not Answered Design and Analysis of Algorithms Asked on 2081 Exam
HamroCSIT User
Differentiate between dynamic programming and memorization. Compute the shortest path between every pairs in the following graphs using Floyd Warshal algorithm.

- Hamro CSIT

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam
HamroCSIT User
Solve the following linear equation using Chinese Remainder Theorem.

x = 1 MOD 3

x = 2 MOD 5

x = 0 MOD 7

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam
HamroCSIT User
Define order statistics problem. Find the edit distance between “cat” and “car” using dynamic programming.
Not Answered Design and Analysis of Algorithms Asked on 2081 Exam
HamroCSIT User
Solve the following recurrence relations using master’s method.

(a)
\[
T(n) = 2T\left( \frac{n}{2} \right) + n^3, \quad n > 1
\]
\[
T(n) = 1, \quad n = 1
\]

(b)
\[
T(n) = 2T\left( \frac{n}{4} \right) + 1, \quad n > 1
\]
\[
T(n) = 1, \quad n = 1
\]

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam
HamroCSIT User
Given a set A=(5,7,10,12,15,18,20}, find the subset that sum to 35 using backtracking.
Not Answered Design and Analysis of Algorithms Asked on 2081 Exam
HamroCSIT User
Explain the optimization techniques for code optimization. Convert the following program to basic block and control flow.
M = A + B
N = C + D
IF (M > N)
X = M – N;
ELSE
E = M + N + X
Not Answered No Subject Asked on 2081(new) Exam
HamroCSIT User
Define explicit and implicit type conversion. Why do we need to check type of the system? Justify with an example.
Not Answered No Subject Asked on 2081(new) Exam
HamroCSIT User
Construct the LL(1) parsing table for the following grammar.
S → AS1 | C
A → 0
C → 2C | ε
Not Answered No Subject Asked on 2081(new) Exam
Page navigation
  • «
  • « First
  • Page 62
  • Page 63
  • Current Page 64
  • Page 65
  • Page 66
  • 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
20084762
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