CS502 - Fundamental of Algorithm

CS502 – Fundamental of Algorithm midterm past papers

CS502 - Fundamental of Algorithm Solved Midterm Past Papers Q. we can avoid unnecessary repetitions for recursive calls?  Answer:- We can avoid these unnecessary repetitions by writing down the results of recursive calls and looking them up...
CS604- Operating Systems

CS604- Operating Systems midterm past papers

CS604- Operating Systems Midterm Solved Past Papers Q. How The open source help us to test the algorithm. Answer:- The Open Source software licensing has made it possible for us to test various algorithms by...
cs609 midterm solved papers -system programming

CS609- System Programming midterm past papers

CS609- System Programming Midterm Solved Past Papers Q. XON and OFF in software flow contol Answer:- XON whenever received indicates the start of communication and XOFF whenever received indicates a temporary pause in the communication. Q....
Web Design and Development

CS506- Web Design and Development midterm past papers

Web Design and Development CS506 Midterm Solved Past Papers(Subjective) Q. How a window handle its own events. Answer:-  Using listeners is the preferred way of handling events since it is easier than enabling events directly for an...
CS504-Softwere Engineering -1

CS504-Softwere Engineering -1 midterm Past Papers

CS504-Softwere Engineering -1 midterm Past Papers Q. Define abstraction? Answer:-  An abstraction is a technique in which we construct a model of an entity based upon its essential characteristics and ignore the inessential details. Q.Is the design of software...
database-management-system

CS403- Database Management Systems midterm Past Papers

CS403- Database Management Systems midterm Past Papers Q. Write the two types of Completeness Constrains? Answer:-  There are two types of completeness constraints, partial completeness constraints and total completeness constraints. Q- What is the significance of normalization? Answer: Normalization is basically;...

Data Structures: CS301 Midterm Solved Papers(Mega File)

CS301- Data Structures Midterm Past Papers(Subjective) Q:1 What is complete binary tree? Answer: "A complete binary tree is a binary tree with the additional property that every node must have exactly two children if an...
VU BS(CS), BS(SE)

BS (COMPUTER SCIENCE), BS (INFORMATION TECHNOLOGY)

BS (COMPUTER SCIENCE), BS (INFORMATION TECHNOLOGY) The Department of Computer Science offers a four-year program leading to either a BS degree in Computer Science. The specialization is determined by the choice of required and elective...
vu mscs entry test mcqs, helping material

VU Entry Test MS(CS) – Practice Test MCQs

Virtual University entry test for MS(CS) will be held on 28.09.2017. Below are some practice MCQs for VU entry test. This practice test can be helpful in your preparation. Q.1. The ASCII Code (American Standard Code...

Operating Systems

Operating System - CS604 Question No: 1    ( Marks: 1 )    - Please choose one A                  (or an exception) is a software-generated interrupt caused either by an error (division by zero or invalid memory access) or...