Advertisements
Advertisements
Write the differences between Object-Oriented Programming and procedural programming?
Concept: undefined >> undefined
class x
{
int y;
public:
x(int z){y=z;} } x1[4];
int main()
{ x x2(10);
return 0;}
How many objects are created for the above program?
Concept: undefined >> undefined
Advertisements
Write the characteristics of the sixth generation.
Concept: undefined >> undefined
How many characters can be handled in Binary Coded Decimal System?
Concept: undefined >> undefined
For 11012 the equivalent Hexadecimal equivalent is?
Concept: undefined >> undefined
Convert (46)10 into a Binary number.
Concept: undefined >> undefined
What is radix of a number system? Give example
Concept: undefined >> undefined
Write a note on the binary number system.
Concept: undefined >> undefined
Which of the following device identifies the location when the address is placed in the memory address register?
Concept: undefined >> undefined
What is instruction?
Concept: undefined >> undefined
What is the meaning of "Hibernate" in Windows XP/Windows 7?
Concept: undefined >> undefined
Explain the versions of the Windows Operating System.
Concept: undefined >> undefined
Why is a function an abstraction?
Concept: undefined >> undefined
How do we refine a statement?
Concept: undefined >> undefined
Define a function to double a number in two different ways:
(1) n + n,
(2) 2 x n
Concept: undefined >> undefined
If the Fibonacci number is defined recursively as F(n) = `{(0, "n" = 0), (1, "n" = 1), ("F"("n" - 1),+ "F"("n" - 2) "otherwise"):}`
to evaluate F(4), how many times F() is applied?
Concept: undefined >> undefined
Using this recursive definition
`"a"^"n" = {(1, "if" "n" = 0), ("a" × "a"^("n" - 1), "otherwise"):}`
how many multiplications are needed to calculate a10?
Concept: undefined >> undefined
What is recursive problem-solving?
Concept: undefined >> undefined
Define factorial of a natural number recursively.
Concept: undefined >> undefined
Power can also be defined recursively as
`"a"^"n" = {(1, "if" "n" = 0), ("a" × "a"^("n" - 1), "if n is odd"), ("a"^("n""/"2) × "a"^("n""/"2), "if n is even"):}`
Construct a recursive algorithm using this definition. How many multiplications are needed to calculate a10?
Concept: undefined >> undefined
