No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
11 Posted Topics
 | Can u help me please I have a confusion in case of for and while loop in calculating the number of program steps for the purpose of finding time complexity. Is the control part of the loops only considered? I have seen somewhere that the step count of for loop …  |
| | The problem of scheduling unit-time tasks with deadlines and penalities for a single processor has following inputs S={a1,a2,...,an} of n unit-time task. A unit-time task requires exactly 1 unit of time to complete deadlines d1,d2,...,dn, 1<=di<=n penalities w1,w2,...,wn. A penality wi is incurred if task ai is not finished by … |
| | The following function DateAdd("h", -24, DateAdd("d", 1, DateValue(Now))) gives todays date without any minutes or seconds. How is it possible by just adding 1 day and subtracting 24 hours we get todays date without time in the result. 'Now' actually displays time along with date |
| | I have to program Portable Data Terminal(PDT) using C++. Is there any site that gives the details? I could not find. Please help me with code examples bcause I am new to this. Thanks in advance |
| | I want to do a multithreading program in c++. How to create thread in C++. I made a class with methods start() , run() etc for this purpose. But how to give delays. Am not able to implement multithreading. Can anyone tell me how to do that |
| | In CD writing is performed from inner to outer of CD. How is it done in hard disk? |
| | In CD writing is done from innerside to outer side.. how is data written into hard disk?  |
| | I got a code. But it is not working compilation error is - undefined symbol try , throw , catch. I am using C++ compler version 3.0. Is this version not enough. Or any header file is to be included for exception handling. Please help me |
| | I know that red black tree is a special case of binary-search tree. But what is the advantage of red black trees over BSTs. Is there any advantage regarding complexity. Does coloring the node cause any difference regarding the complexity? please anyone give me an answer.. Thanks in advance  |
| | I have a code as below // pointer to functions [code=cplusplus] #include <iostream> using namespace std; int addition (int a, int b) { return (a+b); } int subtraction (int a, int b) { return (a-b); } int operation (int x, int y, int (*functocall)(int,int)) { int g; g = (*functocall)(x,y); …  |
| | If we use substitution method, finding T(n) for different values of n with boundary condition T(1)=1, We obtain arelation of the form T(n)=-n+2, which can be written as O(n). Is it right? |
The End.