Step 1  Simplify the given expression using appropriate theorems/ rules.
           \((\overset { \_ \_ \_ \_ \_ \_ \_ }{ \bar { X } .Y } ).(\overset { \_ \_ \_ \_ \_ \_ \_ \_ }{ \bar { X } .\bar { Z } } )=(\overset { \_ \_ \_ }{ \bar { X } } +\bar { Y } ).(\overset { \_ \_ \_ }{ \bar { X } } +\overset { \_ \_ \_ }{ \bar { Z } } )\\ =(X+\bar { } ).(X+Z)\\ =X.X+X.Z+X.\bar { Y } +\bar { Y } .Z\\ =X+X.Z+X.\bar { Y } +\bar { Y } .Z\\ =X.(1+Z)+X.\bar { Y } +\bar { Y } .Z\\ =X+X.\bar { Y } +\bar { Y } .Z\\ =X(1+\bar { Y } )+\bar { Y } .Z=X+\bar { Y } .Z\) 
          Since it is a 3 variables expression, a product term must have all 3 variables.
Step 2   Wherever a variable is missing, multiply that term with (missing variable+ compliment of missing variable)
          \(=X.(Y+\bar { Y } ).(Z+\bar { Z } )+(X+\bar { X } ).\bar { Y } .Z\\ =(X.Y+X.\bar { Y } ).(Z+\bar { Z } )+X.\bar { Y } .Z+\bar { X } .\bar { Y } .Z\\ =X.Y.Z+X.Y.\bar { Z } +X.\bar { Y } .Z+X.\bar { Y } .\bar { Z } +X.\bar { Y } .Z+\bar { X } .\bar { Y } .Z\)  
Step 3 Remove all duplicate term, i.e.,
         \(=X.Y.Z+X.Y.\bar { Z } +X.\bar { Y } .Z+X.\bar { Y } .\bar { Z } +\bar { X } .\bar { Y } .Z\) 
        This is the desired canonical Sum of Products form.

(i) DHTML DHTML stands for Dynamic HyperText Markup Language. It refers to the web content that changes according to the user request. It will react the user input without sending requests to the web server.

(ii) ISP ISP stands for Internet Service Provider. It refers to the company that provides Internet Services. Some common examples of ISPs are Airtel, BSNL, Tata docomo, etc.

void ColProd(int A[][10], int r, int c)
{
  int Prod,i,j;
  for(j=0;j<c;j++)
  {
    Prod = 1;
    for(i=0;i<r;i++)
      Prod *= A[i][j];
    cout<<"Product of column"<<j+1<<"="<<Prod<<end1;
  }
}

Output
16,24,6
6,34,16
18,22,28

class RESTRA
{
    int FoodCode;
    char Food[30],FType[20],Sticker[20];
    void GetSticker()
    {
        if(strcmp(FType,"Vegeterian")==0)
           strcpy(Sticker,"GREEN");
        else if(strcmp(FType,"Contains Egg")==0)
                  strcpy(Sticker,"YELLOW");
         else if(strcmp(FType,"Non-vegetarian")==0)
                   strcpy(Sticker,"RED");
     }
     public:
         void GetFood()
         {
            cout<             cin>>FoodCode;
            gets(Food);
            gets(FType);
            }

2:30&60%
5:22&75%
2:30&65%

Drawbacks of linear queue are:
      By the definition of a queue, when we add an element in queue, Rear pointer is increased by 1 whereas, when we remove an element, Front pointer is increased by 1.
But, in array implementation of queue this may cause problem as follows:

Consider the operations performed on a queue(with SIZE=5) as follows:
(i) Initially, empty queue is there so, Front=-1 and Rear=-1
Front=-1
Rear=-1

0                       1                       2                      3                      4

(ii)When we add 5 elements in queue, the state of the queue becomes as follows with Front=0 and Rear=4
Front=0 
Rear=4

0                       1                       2                      3                      4

(iii) Now suppose, we delete 2 elements from queue,then the state of the queue becomes as follows, with Front=2 and Rear=4
Front=2
Rear=4

0                       1                       2                      3                      4

(iv) Now, actually we have deleted 2 elements from queue so, there should be space for another 2 elements in the queue, but as Rear pointer is pointing at last position. So, queue overflow condition is reached.
(Rear==SIZE-1) is true, we can't insert new element in the queue even if it has an empty space.To overcome this problem, there is another variation of queue called circular queue.

Line 1=5&8
Line 2=11&9
Line 1=6&9
Line 1=12&10

The Relational View of above data is:
Teacher

Topics

Class

A class binds data and its associated functions together under one unit, which enforcing encapsulation that means wrapping up data and associated functions together into a single unit.
Member of the class can be group into three parts: public, private, and protected.The private and protected functions remain hidden from outside world.Thus, through private and protected members a class enforce the data hiding.The public member can be used outside the world, that is important and necessary information, rest of the thing remain hidden which is nothing but abstraction.We can say that an abstraction means representing only essential features without expressing background details.

(i) 400 because the arithmetic operator + has higher precedence than ?: operator, so the n+val condition is taken as n+val>1750=(1000+200)>1750 is true.

(ii) 400 because (1000+1000)>1750 is true.

(iii) 200 because (1000+500)>1750 is false.

output
Value is Pass
New value is Best of Luck

output
80,73,95,

#include<iostream.h>
#include<conio.h>
struct students_record
{
    int s_rollno,s_class;
};
void display(struct students_record*s1);
void main()
{
     struct students_record s1;
     s1.s_rollno=14;
     s1.s_class=2;
     display(&s1);
     getch();
}
void display(struct students_record *s1)
{
   cout<<"\nRoll no: "<<s1->s_rollno;
   cout<<"\nClass:  "<<s1->s_class;
}
Output
Roll no:14
Class:2

#include<iostream.h>
#include<conio.h>
void main()
{
    int i, j;
    for(i=0; i<10; i++)
    {
          cout<<"\n Outer loop executing. i="<<i;        
           for(j=0; j<2; j++)
            {
                  cout<<"\n Inner loop executing. j="<<j;
                  if(i==3)
                       goto stop;
          }
    } 
 cout<<"\n Loop exited.  i="<<i;
stop;
                   //This message does not print 
 cout<<"\n Jumped to stop. i="<<i;
getch();
}
Output
Outer loop executing. i=0
Inner loop executing. j=0
Inner loop executing. j=1
Outer loop executing. i=1
Inner loop executing. j=0
Inner loop executing. j=1
Outer loop executing. i=2
Inner loop executing. j=0
Inner loop executing. j=1
Outer loop executing. i=3
Inner loop executing. j=0
Jumped to stop. i=3

Output
Enter the time
HOURS 10
MINUTES 50
SECONDS 30
Enter the time
HOURS 12
MINUTES 15
SECONDS 40
Resultant time
HOURS 23
MINUTES 6
SECONDS 10

The function is:
void stack:: pop()
{
  if(top==0)
     err_rep(1);
  else
     cout< }

int countupcase()
{
   ifstream fin("ARTICLE.TXT");
   char ch;
   int count = 0;
   while(!fin.eof())
    {
       fin>>ch;
       if(isupper(ch))
         count++;
    }
    fin.close();
    return count;
}

A constructor is a member function having the same name as that of class and it gets invoked every time when new object is created.It is used to construct and initialize object values.A constructor that accepts no parameters is known as default constructor.
A destructor function has the same name as that of constructor function, preceded with a tilde (~) sign. it gets invoked every time an object goes out of scope. it is used to destroy objects.

(a)(i) SELECT Name, Price
       FROM ACCESSORIES
       ORDER BY Price;
   (ii) SELECT Id, SName
        FROM SHOPPE
        WHERE Area='Nehru Place';|
   (iii) SELECT MIN(Price)"Minimum Price",
        MAX(Price) "Maximum Price", Name
        FROM ACCESSORIES
        GROUP BY Name;
   (iv) SELECT Name,Price, SName
       FROM ACCESSORIES A, SHOPPE S
       WHERE A.Id=S.Id;
 but this query enable to show the result because A.Id and S.Id are not identical.
(b)(i) 

(ii) 

(iii) 

(iv) The given query will result in an error as there is no column named SNo in ACCESSORIES table.

(i) DF2()
(ii) B2, C2, A3, B3
(iii) 16
(iv) Data members that are accessible in function F1() are none, because the function F1() is not the member function of any class.

#include
#include
void main()
{
    int n, i;
    clrscr();
    cout<<"Enter the number to find the multiple";
    cin>>n;
    for(i=1;i<=10;i++)
        cout< getch();
}