Please select a subject first
Advertisements
Advertisements
What type of magnetism is shown in the following alignment of magnetic moments?
Concept: undefined >> undefined
Advertisements
Define the following term:
Ferromagnetism
Concept: undefined >> undefined
The complexion [Ni(CN)4]2- is:
Concept: undefined >> undefined
Explain why:
(i) Transition elements form coloured compounds.
(ii) Interhalogen compounds are more reactive than their constituent elements.
(iii) Cu+ is diamagnetic but Cu2+ is paramagnetic. (Z = 29)
Concept: undefined >> undefined
Which one of the following compounds is diamagnetic and colourless?
Concept: undefined >> undefined
Give a reason for the following:
Cu+2 salts are paramagnetic, while Cu+ salts are diamagnetic.
Concept: undefined >> undefined
The metal complex ion that is paramagnetic is ______.
(Atomic number of Fe = 26, Cu = 29, Co = 27 and Ni = 28)
Concept: undefined >> undefined
The keyword used by a class to acquire the properties of an interface is:
Concept: undefined >> undefined
State the principle by which the stack data structure works.
Concept: undefined >> undefined
A Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out).
Define a class Queue with the following details:
| Class name | Queue |
| Data member/instance variable: | |
| dat[ ] | array to hold the integer elements |
| cap | stores the maximum capacity of the queue |
| front | to point the index of the front |
| rear | to point the index of the rear |
| Member functions/methods: | |
| Queue(int max) | constructor to initialize the data member cap = max, front = rear = 0 and create the integer array |
| void add_dat(int v) | to add integers from the rear index if possible else display the message(“Queue full”) |
| int pop_dat( ) | to remove and return elements from front, if any, else returns -999 |
| void display() | to display elements of the queue |
Specify the class Queue giving the details of void add_dat(int) and int pop_dat( ). Assume that the other functions have been defined.
The main( ) function and algorithm need NOT be written.
Concept: undefined >> undefined
A double ended queue is a linear data structure which enables the user to add and remove integers from either ends i.e., from front or rear.
The details for the class deQueue are given below:
| Class name | deQueue |
|
Data members/instance variables: |
|
| Qrr[] | array to hold integer elements |
| lim | maximum capacity of the dequeue |
| front | to point the index of the front end |
| rear | to point the index of the rear end |
|
Methods/Member functions: |
|
| deQueue(int 1) | constructor to initialise lim = 1, front = 0 and rear =0 |
| void addFront(int v) | to add integers in the dequeue at the front end if possible, otherwise display the message “OVERFLOW FROM FRONT” |
| void addRear(int v) | to add integers in the dequeue at the rear end if possible, otherwise, display the message “OVERFLOW FROM REAR” |
| int popFront() | removes and returns the integers from the front end of the dequeue if any, else returns — 999 |
| int popRear ( ) | removes and returns the integers from the rear end of the dequeue if any, else returns — 999 |
| void show( ) | displays the elements of the dequeue |
Specify the class deQueue giving details of the function void addFront(int) and int popFront(). Assume that the other functions have been defined. The main() function and algorithm need NOT be written.
Concept: undefined >> undefined
Differentiate between a stack and a queue.
Concept: undefined >> undefined
int Toy(int n)
{ return (n<=0)? 1: n%10 + Toy(n/10); }With reference to the program code given above, what will the function Toy() return when the value of n = 56?
Concept: undefined >> undefined
Give one reason, why iteration is better than recursion.
Concept: undefined >> undefined
Differentiate between direct recursion and indirect recursion.
Concept: undefined >> undefined
The keyword that allows multi-level inheritance in Java programming is ______.
Concept: undefined >> undefined
The following function task() is a part of some class. Assume ‘m’ and ‘n’ are positive integers greater than 0. Answer the questions given below along with dry / run working.
int task(int m, int n)
{ if(m=n)
return m;
else if (m>n)
return task(m-n, n);
else
return task(m, n-m)
}- What will the function task() return when the value of m=30 and n=45?
- What function does task() perform, apart from recursion?
Concept: undefined >> undefined
Draw the logic circuit for a 4 :1 multiplexer and explain its working.
Concept: undefined >> undefined
A linked list is formed from the objects of the class given below:
class Node
{
doubel sal;
Node next;
}Write an Algorithm OR a Method to add a node at the end of the an existing linked list. The method declaration is as follows:
void addNote(Node ptr, double ss)
Concept: undefined >> undefined
