Wednesday, February 13, 2019

DATE command in SQL

                                                                                             edited  by Sukamal
1:
 select sysdate
from dual
output:
SYSDATE
13-FEB-19

2:
select to_char(sysdate,'dd/mm/yy')
from dual
output:
TO_CHAR(SYSDATE,'DD/MM/YY')
13/02/19

3:
 select to_char(sysdate,'dd/mm/yyyy')
from dual
output:
TO_CHAR(SYSDATE,'DD/MM/YYYY')
13/02/2019

4:
select to_char(sysdate,'dy/mon/yyyy')
from dual
output:
TO_CHAR(SYSDATE,'DY/MON/YYYY')
wed/feb/2019

5:
select to_char(sysdate,'day/month/yyyy')
from dual
output:
TO_CHAR(SYSDATE,'DAY/MONTH/YYYY')
wednesday/february /2019

6:
select to_char(sysdate,'dd/mm/yy,hh:mi:ss')
from dual
output:
TO_CHAR(SYSDATE,'DD/MM/YY,HH:MI:SS')
13/02/19,02:48:55

7:
create table employee(id varchar2(20) primary key,name varchar2(20),dob date);
insert into employee values('1','vk',to_date('05/11/1988','dd/mm/yyyy'));
insert into employee values('2','msd',to_date('02/07/1982','dd/mm/yyyy'));
select *
from employee
output:

ID
NAME
DOB
2
msd
02-JUL-82
1
vk
05-NOV-88

8:Find the name of the employee who is younger than msd.

select name
from employee
where dob>(select dob from employee where name ='msd');
output:
NAME
vk

9:Find the name of employee who was born before 1985.

select name
from employee
where dob <to_date('1985','yyyy');
output:
NAME
msd

10:Find the name and month of dob of each employee.

 select name,to_char(dob,'mm') as month
from employee
output:
NAME
MONTH
msd
07
vk
11

11:Find the age of all employee.

select floor((sysdate-dob)/364.25)
from employee;
output:
FLOOR((SYSDATE-DOB)/364.25)
30
36


Thursday, December 27, 2018

CBCS C++ ASSIGNMENT

                                                                                             edited by TANIMA LODH & BKPAUL
ASSIGNMENT 1:

#include<iostream>
using namespace std;
class Area
{
private:
double l,b;
public:
Area(double x,double y)
{
l=x;
b=y;
}
void output()
{
cout<<"THE AREA OF THE RECTANGLE IS:"<<l*b;
}
};
int main()
{
double x,y;
cout<<"ENTER THE LENGTH AND THE BREADTH OF THE RECTANGLE: \n";
cin>>x>>y;
Area a(x,y);
a.output();
return 0;
}


OUTPUT:

ENTER THE LENGTH AND THE BREADTH OF THE RECTANGLE:
2.1
4.5
THE AREA OF THE RECTANGLE IS:9.45
--------------------------------
Process exited after 4.91 seconds with return value 0
Press any key to continue . . .

ASSIGNMENT 2:

#include<iostream>
#include<math.h>
using namespace std;
class Tri_Area
{
private:
double a,b,c;
public:
Tri_Area(double x, double y, double z)
{
a=x;
b=y;
c=z;
}
void output()
{
double s;
s=(a+b+c)/2;
cout<<"THE AREA OF THE TRIANGLE IS:"<<sqrt(s*(s-a)*(s-b)*(s-c));
}
};
int main()
{
cout<<"ENTER LENGTH OF THREE SIDES OF A TRIANGLE: \n";
double x,y,z;
cin>>x>>y>>z;
Tri_Area t(x,y,z);
t.output();
}

OUTPUT:

ENTER LENGTH OF THREE SIDES OF A TRIANGLE:
1.2
3.2
3.4
THE AREA OF THE TRIANGLE IS:1.91977
--------------------------------
Process exited after 13.29 seconds with return value 0
Press any key to continue . . .

ASSIGNMENT 3:

#include<iostream>
using namespace std;
class Distance
{
private:
int ft,in;

public:
Distance()
{
}
Distance(int f, int i)
{
ft=f;
in=i;
int r;
if(in>=12)
{
r=in/12;
in=in%12;
}
ft=ft+r;
}
void show_distance(Distance ob1,Distance ob2)
{
cout<<"THE 1st DISTANCE IS:"<<ob1.ft<<" feet "<<ob1.in<<" inches \n";
cout<<"THE 2nd DISTANCE IS:"<<ob2.ft<<" feet "<<ob2.in<<" inches \n";
}
void add(Distance ob1,Distance ob2)
{
Distance ob;
ob.ft=ob1.ft+ob2.ft;
ob.in=ob1.in+ob2.in;
if(ob.in>=12)
{
ob.in=ob.in-12;
ob.ft=ob.ft+1;
}
cout<<"THE RESULTANT DISTANCE IS:"<<ob.ft<<" feet "<<ob.in<<" inches";
}
};

int main()
{
int w,x,y,z;
cout<<"ENTER THE FEET AND INCHES OF 1ST DISTANCE: \n";
cin>>w>>x;
cout<<"ENTER THE FEET AND INCHES OF 2ND DISTANCE: \n";
cin>>y>>z;
Distance ob1(w,x), ob2(y,z),ob;
ob.show_distance(ob1,ob2);
ob.add(ob1,ob2);
}

OUTPUT:

ENTER THE FEET AND INCHES OF 1ST DISTANCE:
5
10
ENTER THE FEET AND INCHES OF 2ND DISTANCE:
9
17
THE 1st DISTANCE IS:5 feet 10 inches
THE 2nd DISTANCE IS:10 feet 5 inches
THE RESULTANT DISTANCE IS:16 feet 3 inches
--------------------------------
Process exited after 7 seconds with return value 0
Press any key to continue . . .

Assignment 4:

#include<iostream>
#include<string.h>
using namespace std;
class Student
{
private:
char name[20];
int marks1,marks2,marks3;
public:
Student()
{
cout<<"ENTER THE NAME: \n";
gets(name);
cout<<"ENTER THE MARKS: \n";
cin>>marks1>>marks2>>marks3;
}
void show_student()
{
cout<<"NAME:";
puts(name);
cout<<"MARKS OBTAINED BY "<<name<<" are: \n 1)"<<marks1<<"\n 2)"<<marks2<<"\n 3)"<<marks3<<endl;
}
void grade()
{
int avg=(marks1+marks2+marks3)/3;
if(avg>=80)
cout<<"GRADE A";
else
{
if(avg>=60)

cout<<"GRADE B";
else
{
if(avg>=40)
cout<<"GRADE C";
else
cout<<"FAIL";
}
}

}
};
int main()
{
Student s;
s.show_student();
s.grade();
}

Output :

ENTER THE NAME:
Tanima Lodh
ENTER THE MARKS:
98
95
93
NAME:Tanima Lodh
MARKS OBTAINED BY Tanima Lodh are:
 1)98
 2)95
 3)93
GRADE A
--------------------------------
Process exited after 15.88 seconds with return value 0
Press any key to continue . . .

Assignment 5:
#include<iostream.h>
class matrix
{
int mat[5][5],row,column;
public:
matrix(int,int);
matrix(matrix&);
void getdata();
matrix operator-(matrix);
matrix operator+(matrix);
matrix operator*(matrix);
void display();
};
matrix::matrix(int r,int c)
{
cout<<"constructor to initialize no. of rows and coloumns"<<endl;
row=r;
column=c;
}
matrix::matrix(matrix& m)
{
row=m.row;
column=m.column;
cout<<"copy constructor \n";
for(int i=0;i<row;i++)
{
for(int j=0;j<column;j++)
{
mat[i][j]=m.mat[i][j];
}
}
}
void matrix::getdata()
{
cout<<"value input: \n";
for(int i=0;i<row;i++)
{
for(int j=0;j<column;j++)
{
cout<<"value("<<i+1<<")("<<j+1<<"):";
cin>>mat[i][j];
}
}
}
matrix matrix::operator+(matrix a)
{
cout<<"addition operator \n";
matrix temp(row,column);
for(int i=0;i<row;i++)
{
for(int j=0;j<column;j++)
{
temp.mat[i][j]=mat[i][j]+a.mat[i][j];
}
}
return temp;
}
matrix matrix::operator-(matrix a)
{
cout<<"subtraction operator \n";
matrix temp(row,column);
for(int i=0;i<row;i++)
{
for(int j=0;j<column;j++)
{
temp.mat[i][j]=mat[i][j]-a.mat[i][j];
}
}
return temp;
}
matrix matrix::operator*(matrix a)
{
cout<<"multiplication operator \n";
matrix temp(row,column);
for(int i=0;i<row;i++)
{
for(int j=0;j<column;j++)
{
temp.mat[i][j]=0;
for(int k=0;k<column;k++)
{
temp.mat[i][j]=temp.mat[i][j]+(mat[i][k]*a.mat[k][j]);
}
}
}
return temp;
}
void matrix::display()
{
cout<<"the matrix is: \n";
for(int i=0;i<row;i++)
{
for(int j=0;j<column;j++)
{
cout<<mat[i][j]<<"\t";
}
cout<<endl;
}
}
void  main()
{
matrix m1(2,2),m2(2,2),m3(2,2);
m1.getdata();
m2.getdata();
m3=m1+m2;
m3.display();
m3=m1-m2;
m3.display();
m3=m1*m2;
m3.display();

}
Output:





Assignment 6:
#include<iostream.h>
#include<math.h>
class triangle
{
private:
int x1,y1,x2,y2,x3,y3;
public:
triangle(int a,int b, int c,int d,int e,int f)
{
x1=a; y1=b;  x2=c; y2=d; x3=e; y3=f;

}
void output()
{
double l1= sqrt((y2-y1)*(y2-y1)-(x2-x1)*(x2-x1));
double l2=sqrt((y3-y2)*(y3-y2)-(x3-x2)*(x3-x2));
double l3=sqrt((y1-y3)*(y1-y3)-(x1-x3)*(x1-x3));
if(l1==l2 && l2==l3)
{
cout<<"equilateral";
}
else
{
if(l1==l2||l1==l3)
{
cout<<"isosceles";
}
else
{
cout<<"scalene";
}
}
}
~triangle(){}
};
void main()
{
int a,b,c,d,e,f;
cout<<"enter the coordinates of the 1st triangle:";
cin>>a>>b;
cout<<"enter the coordinates of the 2nd triangle:";
cin>>c>>d;
cout<<"enter the coordinates of the 3rd triangle:";
cin>>e>>f;
triangle t(a,b,c,d,e,f);
t.output();
}
Output:




Assignment 7:
#include<iostream.h>
#include<math.h>
class polar
{
private:
int r, theta;
public:
void input()
{
cout<<"enter the polar coordinates of the point: \n";
cin>>r>>theta;
}
double getx()
{
return r*cos(theta);
}
  double gety()
{
return r*sin(theta);
}
void display()
{
cout<<"radius="<<r<<endl<<"angle="<<theta;
}
polar operator+(polar p)
{
double x=getx()+p.getx();
double y=gety()+p.gety();
 polar temp;
double z=sqrt(x*x+y*y);
double a=atan(y/x);
temp.r=z;
temp.theta=a;
return temp;
}
};
void main()
{
polar p1,p2,p3;
p1.input();
p2.input();
p3=p1+p2;
p3.display();
}
Output:




Assignment 8:
#include<iostream.h>
class fraction
{
private:
int n,d;
public:
void input()
{
cout<<"enter the numerator of the fraction: \n";
cin>>n;
cout<<"enter the denominator of the fraction: \n";
cin>>d;
}
fraction operator+(fraction f)
{
fraction temp1;
temp1.d=d*f.d;
temp1.n=n*f.d+f.n*d;
return temp1;
}
fraction operator-(fraction f)
{
fraction temp2;
temp2.d=d*f.d;
temp2.n=n*f.d-f.n*d;
return temp2;
}
void display();

};
void fraction::display()
{    int cf;
if(n>0 && d>0)
{
for(int i=1;i<=n && i<=d;i++)
{
  if(n%i==0&&d%i==0)
  {
  cf=i;
  }
}
cout<<"the fraction is:"<<endl<<n/cf<<"/"<<d/cf<<endl;
}
if(n<0)
{
n=n*(-1);
 for(int i=1;i<=n && i<=d;i++)
{
  if(n%i==0&&d%i==0)
  {
  cf=i;
  }
}
cout<<"the fraction is:"<<endl<<"-"<<n/cf<<"/"<<d/cf<<endl;
}
}
void main()
{
fraction f1,f2,f3,f4;
f1.input();
f2.input();
f1.display();
f2.display();
f3= f1+f2;
cout<<"after addition \n";
f3.display();
 f4= f1-f2;
cout<<"after subtraction \n";
f4.display();
}
Output:





Assignment 11:
#include<iostream.h>
class bit_op
{
private:
int a,b;
public:
bit_op(int x,int y)
{
  a=x;
  b=y;
}
void bit_and()
{
int m=a&b;
cout<<a<<" AND "<<b<<"="<<m<<endl;
}
void bit_or()
{
int n=a|b;
cout<<a<<" OR "<<b<<"="<<n<<endl;
}
void bit_xor()
{
int o=a^b;
cout<<a<<" XOR "<<b<<"="<<o<<endl;
}
};
void main()
{
cout<<"enter two integers"<<endl;
int x,y;
cin>>x>>y;
bit_op b(x,y);
b.bit_and();
b.bit_or();
b.bit_xor();
}
Output:



Saturday, August 5, 2017

8085 assignment list



1.  Add two 8 bit data,result 16 bit.
2.  Add two 16 bit numbers,result 16 bit.
3.  Subtract  two 16 bit numbers,result 16 bit.
4. Add two 8 bit decimal  number, result 16 bit
5. 8 bit decimal subtraction
6. find all flags after inr b, and save it in B register
7. 2’s complement of a number,16bit
8. Add content of two memory location
9. 8 bit data shift right,1bit
10. 8 bit data shift left,1bit
11. 16 bit data shift right,1bit
12. 16 bit data shift left,1bit
13. sum of n numbers , result 16bit
14. data transfer from one memory block to another
15. max from set of  n numbers
16. min from set of n numbers
17. linear search
18. 2nd highest from n numbers
19. multiply using repeated addition
20. multiply using add ­shift
21. count all even numbers and odd numbers
22. count positive ,negative,zero from n numbers
22. division 16 bit data by 8 bit
23. BCD addition
24. BCD subtraction
25. factorial of a number
26. fibonacci series
27. calculate number of ones and zeros in a 8 bit number
28. calculate number of ones and zeros in a 16 bit number
29. Ascending order sorting
30. descending order sorting
31. multibyte addition
32. multibyte decimal addition
33. sum of series multibyte addition
34. multibyte subtraction
35. function ­ addition,subtraction,multiply,division,square,sorting.
36. half adder and full adder
37. z= 2.A.B+C.D/4B   
38. 8 bit number palindrome checking
39. square root of number
40. merge two sorted list
41. binary code to gray code
42. gray code to binary code

Wednesday, July 26, 2017

8085 instruction code


1ACICE2ADC A8F3ADC B884 ADC C 895ADC D   8A6 ADC E 8B
7ADC H   8C8ADC L  8D3ADC M 8E10ADD A  87  CE11ADD B 808F3 ADD C 81     88
13ADD D 8214   ADD E  833ADD H  84 16 ADD L 8517  ADD M   863ADI   C6
19ANA A  A720  ANA B A03ANA C A1 22ANA D A223ANA E A3 3ANA H A4
25ANA L A526  ANA M A63ANI   E6 28 CALL  CD29CC   DC 3 CM   FC 
31CMA 2F32ADC A8F3ADC B88 34ACICE35ADC A8F3ADC B88
37ACICE38ADC A8F3ADC B88 40ACICE41ADC A8F3ADC B88
43ACICE44ADC A8F3ADC B88 46ACICE47ADC A8F3ADC B88
49ACICE50ADC A8F3ADC B88 52ACICE53ADC A8F3ADC B88
58ACICE59ADC A8F3ADC B88 61ACICE62ADC A8F3ADC B88
64ACICE65ADC A8F3ADC B88 67ACICE68ADC A8F3ADC B88
70ACICE71ADC A8F3ADC B88 73ACICE74ADC A8F3ADC B88
76ACICE77ADC A8F3ADC B88 79ACICE80ADC A8F3ADC B88
82ACICE83ADC A8F3ADC B88 85ACICE86ADC A8F3ADC B88
88ACICE89ADC A8F3ADC B88 91ACICE92ADC A8F3ADC B88
94ACICE95ADC A8F3ADC B88 97ACICE98ADC A8F3ADC B88
100ACICE2ADC A8F3ADC B88 103ACICE2ADC A8F3ADC B88
              
          
                    
                       
                        CMC 3F       CMP A BF    CMP B B8    CMP C B9
CMP D BA    CMP E BB     CMP H BC    CMP L BD   CMP M BD   CNC  D4      CNZ l C4
CP F4             CPE EC          CPI FE          CPO E4        CZ   CC         DAA 27        DAD B 09
DAD D 19      DAD H 29      DAD SP 39   DCR A 3D  DCR B 05      DCR C 0D    DCR D 15
DCR   E 1D    DCR H 25      DCR L 2D     DCR M 35  DCX B 0B      DCX D 1B   DCX H  2B
DCX SP 3B    DI F3              EI FB             HLT 76        IN   DB           INR A 3C    INR B 04
INR C 0C       INR D 14       INR E 1C      INR H 24     INR L 2C        INR M 34    INX B 03
INX D 13       INX H 23       INX SP 33    JC  DA         JM FA             JMP  C3      JNC D2
JNZ  C2          JP  F2            JPE EA         JPO  E2        JZ CA              LDA 3A      LDAX B 0A LDAX D 1A  LHLD 2A       LXI B 01       LXI D 11      LXI H 21         LXI SP 31
MOV A, A  7F                     MOV A, B 78                      MOV A, C  79                  MOV A, D 7A       MOV A, E 7B                      MOV A, H 7C                     MOV A, L 7D                  MOV A, M 7E      MOV B, A 47                       MOV B, B  40                     MOV B, C 41                   MOV B, D 42         MOV B, E 43                       MOV B, H  44                     MOV B, L 45                   MOV B, M 46 MOV C, A 4F                      MOV C, B 48                      MOV C, C 49                   MOV C, D 4A     MOV C, E 4B                       MOV C, H 4C                    MOV C, L 4D                   MOV C, M 4E      MOV D, A 57                       MOV D, B 50                     MOV D, C 51                   MOV D, D 52       MOV D, E 53                       MOV D, H 54                     MOV D, L 55                    MOV D, M 56        MOV E, A 5F                       MOV E, B  58                    MOV E, C 59                     MOV E, D 5A  MOV E, E 5B                       MOV E, H 5C                    MOV E, L 5D                     MOV E, M 5E    MOV H, A 67                       MOV H, B 60                    MOV H, C 61                     MOV H, D 62        MOV H, E 63                       MOV H, H 64                     MOV H, L 65                     MOV H, M 66       MOV L, A 6F                       MOV L, B 68                     MOV L, C 69                      MOV L, D 6A      MOV L, E 6B                       MOV L, H  6C                   MOV L, L 6D                     MOV L, M 6E  MOV M, A 77                      MOV M, B 70                    MOV M, C 71                     MOV M, D 72     MOV M, E 73                      MOV M, H 74                    MOV M, L 75                   
MVI A 3E                            MVI B,06                            MVI C 0E                  MVI D 16                MVI E 1E                            MVI H, 26                           MVI L 2E                  MVI M 36
NOP 00                               ORA A B7                           ORA B B0                 ORA C B1        
ORA D B2                          ORA E B3                           ORA H B4                 ORA L B5               ORA M B6                         ORI F6                                 OUT D3                     PCHL E9
POP B C1                           POP D D1                            POP H E1                 POP PSW F1  
PUSH B C5                        PUSH D D5                         PUSH H  E5             PUSH PSW F5 
RAL 17                              RAR 1F                                RC D8                       RET C9     
RIM 20                              RLC 07                                 RM  F8                      RNC D0                   RNZ C0                             RP F0                                    RPE  E8                    RPO E0     
RRC 0F                             RST 0 C7                              RST 1 CF                  RST 2    
RST 3 DF                          RST 4 E7                               RST 5 EF                  RST 6 F7  
RST 7 FF                           RZ C8                                     SBB A 9F                 SBB B  98  
SBB C 99                           SBB D 9A                              SBB E 9B                 SBB H 9C 
SBB L 9D                          SBB M 9E                              SBI Data DE             SHLD  22        
SIM  30                              SPHL F9                                STA  32                     STAX B 02
STAX D 12                        STC 37                                   SUB A 97                 SUB B 90         
SUB C 91                          SUB D 92                               SUB E 93                  SUB H 94
SUB L 95                          SUB M 96                              SUI D6                      XCHG EB         
XRA A AF                        XRA B A8                             XRA C A9                XRA D AA             XRA E AB                       XRA H AC                             XRA L AD               XRA M  AE 
XRI Data EE                    XTHL E3 

Tuesday, July 18, 2017

B.SC IN COMPUTER SCIENCE HONOURS ( WEST BENGAL STATE UNIVERSITY ) -- PART I, PART II, PART III

            

PART 1 - 200    [ PAPER 1-THEORY, PAPER 2A-THEORY,PAPER 2B-PRACTICAL ]
PART II - 200   [ PAPER 3-THEORY, PAPER 4A -THEORY,PAPER 4B-PRACTICAL]
PART III - 400  [ PAPER 5,6 -THEORY, PAPER 7,8 - PRACTICAL ]      -----------------------------------------
   TOTAL - 800
 -----------------------------------------



PART 1, PAPER 1

GROUP A : COMPUTER FUNDAMENTAL
GROUP B : BASIC ELECTRONICS
GROUP C : DIGITAL ELECTRONICS
GROUP D : COMPUTER ORGANIZATION-I


PART 1 , PAPER 2A

GROUP A : SYSTEM SOFTWARE AND DATA STRUCTURE-I
GROUP B : C - LANGUAGE

PART 2 , PAPER 3    

GROUP A : DISCRETE MATHEMATICAL STRUCTURE
GROUP B : NUMERICAL METHOD
GROUP C : AUTOMATA THEORY

PART 2, PAPER 4A

GROUP A : DATA STRUCTURE II
GROUP B : OPERATING SYSTEM

PART 3 , PAPER 5

GROUP A : MICROPROCESSOR AND COMPUTER ORGANIZATION-II
GROUP B : NETWORKING
GROUP C : INFORMATION TECHNOLOGY

PART 3 , PAPER 6

GROUP A : OBJECT ORIENTED PROGRAMMING
GROUP B : SOFTWARE ENGINEERING
GROUP C : GRAPHICS
GROUP D : DBMS

B.SC IN COMPUTER SCIENCE HONOURS ( UNIVERSITY OF CALCUTTA ) -- PART I, PART II, PART III

              

PART 1 - 200    [ PAPER 1-THEORY, PAPER 2A-THEORY,PAPER 2B-PRACTICAL ]
PART II - 200   [ PAPER 3-THEORY, PAPER 4A -THEORY,PAPER 4B-PRACTICAL]
PART III - 400  [ PAPER 5,6 -THEORY, PAPER 7,8 - PRACTICAL ]      -----------------------------------------
   TOTAL - 800
 -----------------------------------------



PART 1, PAPER 1

GROUP A : COMPUTER FUNDAMENTAL
GROUP B : BASIC ELECTRONICS
GROUP C : DIGITAL ELECTRONICS
GROUP D : COMPUTER ORGANIZATION-I


PART 1 , PAPER 2A

GROUP A : SYSTEM SOFTWARE AND OPERATING SYSTEM
GROUP B : DATA STRUCTURE-I

PART 2 , PAPER 3    

GROUP A : DISCRETE MATHEMATICAL STRUCTURE
GROUP B : NUMERICAL METHOD
GROUP C : AUTOMATA THEORY

PART 2, PAPER 4A

GROUP A : DATA STRUCTURE II
GROUP B : C - LANGUAGE

PART 3 , PAPER 5

GROUP A : MICROPROCESSOR
GROUP B : COMPUTER ORGANIZATION-II
GROUP C : NETWORKING

PART 3 , PAPER 6

GROUP A : OBJECT ORIENTED PROGRAMMING
GROUP B : SOFTWARE ENGINEERING
GROUP C : GRAPHICS
GROUP D : DBMS
 

Tuesday, January 24, 2017

C++ question set (Balagurusamy)


CHAPTER 3  CLICK HERE

CHAPTER 4  CLICK HERE

CHAPTER 5  CLICK HERE

CHAPTER 6  CLICK HERE

CHAPTER 7  CLICK HERE

CHAPTER 8  CLICK HERE

CHAPTER 9 CLICK HERE

CHAPTER 10 CLICK HERE

CHAPTER 11 CLICK HERE

CHAPTER 12 CLICK HERE

CHAPTER 13 CLICK HERE

CHAPTER 14 CLICK HERE

CHAPTER 15 CLICK HERE

CHAPTER 16  CLICK HERE






Tuesday, January 17, 2017

COMPUTER GRAPHICS question set (PAKHIRA)

CHAPTER 1 CLICK HERE

CHAPTER 2 CLICK HERE

CHAPTER 3 CLICK HERE

CHAPTER 4  CLICK HERE

CHAPTER 5 CLICK HERE

CHAPTER 6 

CHAPTER 7 CLICK HERE

CHAPTER 8 CLICK HERE

CHAPTER 9  CLICK HERE

CHAPTER 10

CHAPTER 11

CHAPTER 12

CHAPTER 13

CHAPTER 14

CHAPTER 15

CHAPTER 16

CHAPTER 17

SOFTWARE ENGINEERING QUESTION SET (Rajib Mall)

Chapter 1:
1.       Program vs. software products.
2.       Structured programming and unstructured programming.
3.       Object oriented design.
Chapter 2:
1.       Need of life cycle model.
2.       Steps of classical waterfall life cycle model.
3.       Limitation of classical waterfall life cycle model.
4.       Iterative waterfall model, comparison with classical waterfall life cycle model.
5.       Prototyping model.
6.       Evolutionary model.
7.       Spiral model.
8.       Comparison of different life cycle model.
Chapter 3:
1.       Job responsibility, skills necessary of software project manager.
2.       Metric of project size estimation- i) LOC, ii) FP iii) Feature point
3.       Project estimation technique.
4.       COCOMO
5.       Staff management.
6.       Critical path
7.       Organization structure: functional format, project format.
8.       Team structure.
9.       Roles of good software engineer.
10.   Risk and their identification.
Chapter 4:
1.       Requirement gathering and analysis.
2.       Anomaly, Inconsistency, Incompleteness.
3.       What is SRS?
4.       Content of SRS document.
5.       Characteristics of Good SRS.
6.       Decision tree and decision table.
Chapter 5:
1.       Modularity.
2.       Cohesion and coupling.
3.        Classification of cohesiveness and coupling.
4.       Object oriented design and function oriented design.
Chapter 6:
1.       SA and SD, Structured chart, Structured English.
2.       DFD - symbols, application, context diagram, higher levels, balancing, shortcoming.
3.       Data dictionary.
4.       Logical DFD, Physical DFD.

Chapter 10:
1.       What is coding?
2.       Coding Standard.
3.       Code review- definition, different types.
4.       What is testing?
5.       Test case, test suit.
6.       Verification and validation.
7.       Testing in large Vs. Testing in small.
8.       Driver and stub module.
9.       White box and black box testing.
10.   Alpha testing and beta testing.
11.   CFG
12.   Cyclomatic complexity.(3 types)
13.   Mutation testing.
14.   Integration testing.
15.   Phased vs. Incremental testing.
16.   System testing.
Chapter 11:
1.       Software quality.
2.       ISO 9000.ISO 9001.
3.       CMM.
4.       PSP.