MTH 101 Graded Discussion Board

MTH 101.

Topic:

In the mean value theorems, we discuss the continuity of a given function in the closed interval and the differentiability in the open interval. Why we don’t discuss its differentiability in the closed interval?

Comments:

According to the mean value theorem “ we can differentiate the function on the interval [a,b] and if we are taking continuity of those intervals by using mean value theorem then we must leave that function which is not differentiable at a and b while satisfying the conclusions of Mean Value Theorem.

CS502 Graded Discussion Board

CS 502

Topic:

“NP complete problems are solvable /decidable problems.”  Support or contradict the statement with solid arguments with respect to time constraints. Only two to three sentences are required to give the complete idea.

Comments:

Apparently some problems are “harder” in a relative sense than the other problems within the NP-class of problems. If you can write polynomial algorithm for any one of this group of apparently hard problems, then it can be shown that every NP-class problem will have a polynomial algorithm for each. This group of problems is called NP-complete problems. if there is no HC in a given input graph then HC-problem may not be solved in polynomial time even with non-deterministic algorithms. Some problems are even unsolvable/ un-decidable algorithmically, for which we cannot write a computer program for them.

CS501 GDB 2010

CS 501

Topic:
“In order to achieve multitasking on a single conventional processor, it is favorable to use threads” Justify your comments with appropriate reasons.

Comments:

Multitasking is a method where multiple tasks, also known as processes, share common processing resources such as a CPU. In the case of a computer with a single CPU, only one task is said to be running at any point in time, meaning that the CPU is actively executing instructions for that task. Multitasking solves the problem by scheduling which task may be the one running at any given time, and when another waiting task gets a turn. Threads are subsets of a process. Multiple threads within a process share state as well as memory and other resources. Processes have separate address spaces, whereas threads share their address space. Multithreading, even for single-CPU systems, is the ability for an application to remain responsive to input. In a single-threaded program, if the main execution threads blocks on a long running task, the entire application can appear to freeze. Multithreaded program allows it to operate faster on computer systems that have multiple CPUs, CPUs with multiple cores.