bsccsit 2nd semsester | notes | old question | solution | model question

Notes Object oriented(c++) Maths-II Microprocessor Statistics I Discrete Structure Old Questions Object oriented (c++) Maths-II Statistics-I Microprocessor Discrete Structure /* Style The Dropdown Button */ .dropbtn { background-color: #4CAF50; color: white; padding: 16px; font-size: 16px; border: none; cursor: pointer; } /*...

Scope of Bsc. CSIT in Nepal 2019 TU

Scope of Bsc. CSIT in Nepal IT or Information Technology is not a new term to Nepalese. We have been  familiar about this Nepal has enjoyed incredible success in digital adoption as compared to its neighbors, with mobile penetration exceeding 100% and Internet penetration reaching 60%. Nepal...

OS Model Question Solution [Bsc csit Operating System 4th Semester]

OS Model Question Solution [Bsc csit Operating System 4th Semester] Long Questions Attempt any two questions. (2 × 10 = 20) 1 What is sleep and wakeup? Demonstrate problem with suitable code snippet and illustration. 2 When page fault occurs and how it is handled? Demonstrate...

AI Model Question Solution Bsc csit

AI Model Question Solution Bsc csit Long Answer Questions Attempt any Two questions. [2*10=20] 1. What do you mean by heuristic search? Given following state space representation, show how greedy best first and A* search is used to find the goal state. [2+8] [Unit 3] S is the start...

CN Model Question Solution Bsc CSIT

CN Model Question Solution Bsc CSIT Group A (Long Answer Question Section) Attempt any TWO questions. (2x10=20) 1. Suppose you are assigned to design a LAN for an office having 3 departments. Each department will have 50 computers locating in 10 rooms each equipped with 5 computers....

TOC Model Question Solution Bsc csit

TOC Model Question Solution Bsc csit Theory Of Computation Bsc csit  1. Define the extended transition function of DFA. Draw a DFA accepting language L= {1n | n=2,3,4…….}. Show acceptance of strings 1110011 and 1110 using extended transition function. [2+4+4] 2. What is deterministic...

MiniMax Algorithm in Game Theory and C implementation

The Minimax Algorithm and it's implementation in C programming Let us assign the following values for the game: 1 for win by X, 0 for draw, -1 for loss by X. Given the values of the terminal nodes (win for X (1), loss for X (-1), or draw (0)), the values of the non-terminal nodes are computed as follows:  ...

CN Old Questions Bsc CSIT 2067-2074 Computer Networks

CN Old Questions Bsc CSIT (adsbygoogle = window.adsbygoogle || []).push({}); DOWNLOAD QUESTIONS ...

TOC Old Questions Bsc CSIT 2067-2074

TOC Old Questions Bsc CSIT 4th Semester Course Title: Theory of Computation                                                           ...