https://www.google.com/contributor/welcome/?utm_source=publisher&utm_medium=banner&utm_campaign=2376261057261409

Search This Blog

Search with our Site

Custom Search

Friday, February 4, 2011

Assignment5_extension cs502 assignment # 5


Assignment5_extensionDated: Feb 04, 11
Dear Students! Due to LMS Issue Your due assignment date has been extended enjoy the relaxation and upload within new extended dates; no assignment will be accepted via mail. Students who have submitted the assignment via mail are bound to upload via their LMS account.

Thursday, February 3, 2011

Please send your GDB (Graded Discussion Board) on vulms today is last date of MCS 3rd Samester


How queuing theory is useful for measuring the performance of I/O subsystems




Performance of I/O Subsystems There are three methods to measure I/O subsystem performance: Straight away calculations using execution time Simulation Queuing Theory Loss System Loss system is a simple system having no buffer so it does not have any provision for the queuing. In a loss system, provision is time in term of how many [...]
WAITING LINES Learning Objectives After completing the lecture, we should be able to explain the formation of waiting lines in unloaded systems, identify the goal of queuing ( waiting line) analysis, list the measures of system performance that are used in queuing analysis. We should be able to understand the importance of simulation and at [...]


Some people think that web is a rich and best source of information for a data warehouse. To what extent to you agree with this statement. Give reasons and quote examples where appropriate.


Please put your comments on the statement whether this source is more appropriate or some other means of sources are more appropriate, precisely and briefly.
The web is a rich and fertile source of data-related information. But tracking things down on the web can sometimes be difficult – especially if you do not know where to look.

“Dynamic programming can also suggest solutions for other than the optimization problems.”  Support or contradict the statement with example. Be precise in your answer.


“Dynamic programming can also suggest solutions for other than the optimization problems.”
  Support or contradict the statement with example. Be precise in your answer
Dynamic programming is a method for efficiently solving a broad range of search and optimization problems which 
exhibit the characteristics of overlappling subproblems and optimal substructure
Dynamic programming is both a mathematical optimization method and a computer programming method.