हिंदी

ISC (Commerce) कक्षा १२ - CISCE Question Bank Solutions

Advertisements
[object Object]
[object Object]
विषयों
मुख्य विषय
अध्याय

Please select a subject first

Advertisements
Advertisements
< prev  321 to 340 of 828  next > 

A class Gcd has been defined to find the Greatest Common Divisor of two integer numbers. Some of the members of the class are given below:

Class name Gcd
Data member/instance variable:
num1 integer to store the first number
num2 integer to store the second number
Member functions/methods:
Gcd( ) default constructor
void accept( ) to accept the numbers
int gcd(int x,int y) return the GCD of the two numbers x and y using recursive technique
void display( ) displays the result with an appropriate message

Specify the class Gcd, giving details of the Constructor, void accept( ), int gcd(int,int), and void display( ). Define the main() function to create an object and call the functions accordingly to enable the task.

[11] Recursion
Chapter: [11] Recursion
Concept: undefined >> undefined

A super class Godown has been defined to store the details of the stock of a retail store. Define a subclass Update to store the details of the items purchased with the new rate and update the stock. Some of the members of both the classes are given below:

Class name Godown
Data members/instance variables:
item to store the name of the item
qty to store the quantity of an item in stock
rate to store the unit price of an item
amt to store the net value of the item in stock
Member functions/methods:
Godown(…) parameterized constructor to assign value to the data members
void display( ) to display the stock details

 

Class name Update
Data members/instance variables:
pur_qty to store the purchase quantity
pur_rate to store the unit price of the purchased item
Member functions/methods:
Update(…) parameterized constructor to assign values to the data members of both the classes
void update( ) to update the stock by adding the previous quantity by the purchased quantity and replace the rate of the item if there is a difference in the purchase rate. Also update the current stock value as:
(quantity * unit price)
void display( ) to display the stock details before and after updating

Assume that the super class Godown has been defined. Using the concept of inheritance, specify the class Update giving details of the constructor, void update ( ) and void display( ).

The super class, main function and algorithm need NOT be written.

[12] Inheritance and Polymorphism
Chapter: [12] Inheritance and Polymorphism
Concept: undefined >> undefined

Advertisements

When a sequence of OR, NOT, NOR are connected in series, the logic gate obtained is ______.

[2] Computer Hardware
Chapter: [2] Computer Hardware
Concept: undefined >> undefined

Idempotence Law states that ______.

[2] Computer Hardware
Chapter: [2] Computer Hardware
Concept: undefined >> undefined

Assertion: Recursive data structure follows the LIFO principle.

Reason: Execution of recursive code follows the concepts of data structure Queue.

[11] Recursion
Chapter: [11] Recursion
Concept: undefined >> undefined

State any one difference between instance variable and class variable.

[5] Objects
Chapter: [5] Objects
Concept: undefined >> undefined

The following function is a part of some class:

int jolly(int[] x, int n, int m)
  {
if (n<0)
  return m;
else if(n<x.length)
  m=(x[n]>m)?x[n]:m;
return jolly(x, --n, m);
  }
  1. What will be the output of jolly() when the value of x[ ]={6,3,4,7,1}, n=4 and m=0?
  2. What function does jolly() perform, apart from recursion?
[11] Recursion
Chapter: [11] Recursion
Concept: undefined >> undefined

Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs.

[2] Computer Hardware
Chapter: [2] Computer Hardware
Concept: undefined >> undefined

Design a class DeciHex to accept a positive integer in decimal number system from the user and display its hexadecimal equivalent.

Example 1:

Decimal number= 25

Hexadecimal equivalent= 19

Example 2:

Decimal number =28

Hexadecimal equivalent = 1C

Some of the members of the class are given below.

Class name DeciHex
Data members/instance variables:
num stores the positive integer
hexa string to store the hexadecimal equivalent of num
Methods / Member functions:
DeciHex() constructor to initialise the data members with legal initial values
void getNum() to accept a positive integer
void convert(int n) to find the hexadecimal equivalent of the formal parameter 'n' using the recursive technique
void display() to display the decimal number and its hexadecimal equivalent by invoking the function convert()

Specify the class DeciHex giving details of the constructor( ), void getNum( ), void convert(int) and void display(). Define a main() function to create an object and call all the functions accordingly to enable the task.

[11] Recursion
Chapter: [11] Recursion
Concept: undefined >> undefined

Draw the logic circuit for 3:8 decoder (Octal decoder). Which multiplexer can be derived from the Octal decoder?

[2] Computer Hardware
Chapter: [2] Computer Hardware
Concept: undefined >> undefined

Consider the following statement written in class Circle where pi is its data member.

static final double pi = 3.142;

Which of the following statements are valid for pi?

  1. It contains a common value for all objects class Circle.
  2. Its value is non-changeable.
  3. At a time two access modifiers, static and final, cannot be applied to a single data member pi.
[5] Objects
Chapter: [5] Objects
Concept: undefined >> undefined

A matrix M[-6….10, 4…15] is stored in the memory, with each element requiring 4 bytes of storage. If the base address is 1025, find the address of M[4][8] when the matrix is stored in column major-wise.

[10] Arrays, Strings
Chapter: [10] Arrays, Strings
Concept: undefined >> undefined

The following function getIt() is a part of some class. Assume x is a positive integer, f is the lower bound of arr[ ] and l is the upper bound of the arr[ ].

Answer the questions given below along with dry run/working.

public int getIt(int x,intarr[],int f,int l)
  {
   if(f>l)
     return-1;
   int m=(f+l)/2;
   if(arr[m]<x)
     return getIt(x,m+1,l);
   else if(arr[m]>x)
     return getIt(x,f,m-1);
   else
     return m;
}
  1. What will the function getIt( ) return if arr[ ] = {10,20,30,40,50} and x = 40?
  2. What is function getIt( ) performing apart from recursion?

[10] Arrays, Strings
Chapter: [10] Arrays, Strings
Concept: undefined >> undefined

Draw the logic circuit to decode the following binary number (0001, 0101, 0111, 1000, 1010, 1100, 1110,1111) to its hexadecimal equivalents. Also, state the Hexadecimal equivalents of the given binary numbers.

[2] Computer Hardware
Chapter: [2] Computer Hardware
Concept: undefined >> undefined

The following is a function of class Armstrong. This recursive function calculates and returns the sum of the cubes of all the digits of num, where num is an integer data member of the class Armstrong.

[A number is said to be Armstrong if the sum of the cubes of all its digits is equal to the original number].

There are some places in the code marked by ?1?, ?2?,?3? which may be replaced by a statement/expression so, that the function works properly.

public int sumOfPowers(int num) 
  {
     if(num == 0) 
        return ?1?
     int digit = ?2?;
        return(int)Math.pow(digit, 3) + ?3?;
}
  1. What is the expression or statement at ?1?
  2. What is the expression or statement at ?2?
  3. What is the expression or statement at ?3?
[11] Recursion
Chapter: [11] Recursion
Concept: undefined >> undefined

A class LCM has been defined to find the Lowest Common Multiple of two integers.

Some of the data members and member functions are given below:

Class name LCM
Data members/instance variables:
n1 to store an integer number
n2 to store an integer number
large integer to store the largest from n1,n2
sm integer to store the smallest from n1,n2
l to store lcm of two numbers
Methods / Member functions:
LCM( ) default constructor to initialize data members with legal initial values
void accept() to accept n1 and n2
int getLCM() returns the lcm of n1 and n2 using the recursive technique
void display( ) to print the numbers n1, n2 and lcm

Specify the class LCM giving details of the constructor( ), void accept( ), int getLCM() and void display( ). Define a main ( ) function to create an object and call the member functions accordingly to enable the task.

[11] Recursion
Chapter: [11] Recursion
Concept: undefined >> undefined

The following function is a part of some class which is used to find the smallest digit present in a number. There are some places in the code marked by ?1?, ?2?, ?3? which must be replaced by an expression/a statement so that the function works correctly.

int small_dig(int n)
{   int min=?1?;
    while(n!=0)
    {
    int q=n/10;
    int r=?2?*10;
    min=r>min ? ?3? : r;
    n=q;
    }
    return min;
} 
    
  1. What is the expression or statement at ?1?
  2. What is the expression or statement at ?2?
  3. What is the expression or statement at ?3?
[8] Statements, Scope
Chapter: [8] Statements, Scope
Concept: undefined >> undefined

Recycle is an entity which can hold at the most 100 integers. The chain enables the user to add and remove integers from both the ends i.e. front and rear.

Define a class ReCycle with the following details:

Class name ReCycle
Data members/instance variables:
ele[ ] the array to hold the integer elements
cap stores the maximum capacity of the array
front to point the index of the front
rear to point the index of the rear
Methods / Member functions:
ReCycle (int max) constructor to initialize the data cap = max, front = rear = 0 and to create the integer array.
void pushfront(int v) to add integers from the front index if possible else display the message(“full from front”).
int popfront( ) to remove the return elements from front. If array is empty then return-999
void pushrear(int v) to add integers from the front index if possible else display the message(“full from rear”).
int poprear( ) to remove and return elements from rear. If the array is empty then return-999.
  1. Specify the class ReCycle giving details of the functions void pushfront(int) and int poprear( ). Assume that the other functions have been defined.
    The main( ) function and algorithm need NOT be written.
  2. Name the entity described above and state its principle.
[13] Data Structures
Chapter: [13] Data Structures
Concept: undefined >> undefined

Convert the following infix notation to postfix notation:

A * (B + C / D ) – E / F 
[13] Data Structures
Chapter: [13] Data Structures
Concept: undefined >> undefined

Convert the following infix notation to postfix form.

(P + Q * R - S)/T * U

[13] Data Structures
Chapter: [13] Data Structures
Concept: undefined >> undefined
< prev  321 to 340 of 828  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×