NEWS

This blog consists of all information about bsc csit along with notes, old questions, routines and solutions.

B.Sc.CSIT III Semester-077 Exam Form Filling Notice !!!CLICK HERE

Pageviews

Tuesday, March 17, 2020

Cryptography Model Question Solution | Crypto bsc csit solution | csit 5th sem

Cryptography Model Question Solution | Crypto bsc csit solution | csit 5th sem






CryptographyModel Question Solution | Crypto bsc csit solution | csit 5th sem




DOWNLOAD





Attempt any TWO questions. [2×10=20]
1. Mention the families SHA-2? Describe how 160-bit of hash value is generated by taking
an input message of variable size using SHA-1? [2+8]

2. Discuss how encryption and decryption is done using RSA? In a RSA system, a user
Named Ram has chosen the primes 5 and 7 to create a key pair. The public key is
(eRam,n) and the private key is (dRam, n). Compute the private and public key pairs.
Suppose another user Sita knows public key of Ram and want to send the plaintext “hi”
to Ram using RSA Scheme. Show how Sita has encrypted the plaintext and Ram has
decrypted the ciphertext. [5+5]

3. Describe the working principle of Fiestel Cipher Structure.Give the encryption and
decryption procedure for 2-DES and 3-DES. Find the multiplicative inverse of 7 in Z11
using Extended Euclidean Algorithm.

[4+2+4]

Section B
Short Answer Questions

Attempt any EIGHT questions. [8×5=40]
4. Define authentication system. How challenge response systems can be used as
authentication approach? [1+4]

5. Define SSL. How SSL Record Protocol provides security in Secure Socket Layer
Protocol? [1+4]

6. Decrypt the message “CMAL” using the Hill cipher with the key
   Show your calculations and the result.

7. Divide 5x2+ 4x + 6 by 2x + 1 over GF(7). [5]

8. Differentiate between virus, worm and trojan horse. [5]

9. Describe the purpose of PKI trust model? List any four types of firewall. [3 + 2]

10. What is digital signature? How DSS Approach is used to generate digital signature?
[1+4]

11. Define Euler totient function. Find out whether 3 is primitive root of 7? [1 + 4]

12. Write Short Notes On (Any TWO) [2.5 + 2.5]
a. Vernam Cipher
b. Kerberos Protocol
c. Intrusion Detection System

Thursday, March 12, 2020

Design and Analysis of Algorithm Model Question Solution | DAA bsc csit solution | csit 5th sem

Design and Analysis of Algorithm Model Question Solution | DAA bsc csit solution | csit 5th sem


Design and Analysis of Algorithm Model Question Solution | DAA bsc csit solution | csit 5th sem
bsc csit 5th sem DAA model question solution 






Tribhuvan University
Institute of Science and Technology
Model Question

Bachelor Level/Third Year / Fifth Semester/Science Full Marks: 60
Computer Science and Information Technology Pass Marks: 24
(CSc. 314- Design and Analysis of Algorithm) Time : 3 hours.

Section A
Attempt any two questions. (2 × 10 = 20)
1. Why do you need the algorithm analysis? Discuss about RAM model for analysis of
algorithms. Also discuss about Big Oh, Big Omega and Big theta with examples.
(2+3+5)
2. Discuss the order statistics. Explain about the worst case linear time selection algorithm
and analyze its time complexity. (2 + 8)
3. Explain in brief about the Dynamic Programming Approach for algorithm design. How it
differs with recursion? Explain the Floyd Warshall algorithm to compute the all pair
shortest path in graph and analyze its time complexity. (4 + 6)

Section B
Attempt any eight questions. (8 × 5 = 40)
4. Write the algorithm for Binary Search with divide and conquer approach and explain its
complexity. (5)
5. Solve the following recurrence relations using master method. ( 2.5 + 2.5)
a. T(n) = 3T(n/2) + n
b. T(n) = 2T(n/4) + √n
6. What is prefix code? Explain Huffman algorithm to compute the prefix codes. (5)
7. Write the algorithm for insertion sort and explain its time complexity (5)
8. What do you mean by memoization strategy? Compare memoization with dynamic
programming (5)
9. Explain backtracking with suitable example. (5)
10. Explain the Euclid’s method to solve the modular linear equations with example (5)
11. Explain in brief about the complexity classes P, NP and NP Complete (5)
12. Write short notes on
a. Tractable and Intractable Problems
b. Approximation Algorithms

Wednesday, March 11, 2020