8085 instruction code

1	ACI	CE	2	ADC A	8F	3	ADC B	88	4	ADC C	89	5	ADC D	8A	6	ADC E	8B
7	ADC H	8C	8	ADC L	8D	3	ADC M	8E	10	ADD A  87	CE	11	ADD B 80	8F	3	ADD C 81	88
13	ADD D	82	14	ADD E	83	3	ADD H	84	16	ADD L	85	17	ADD M	86	3	ADI	C6
19	ANA A	A7	20	ANA B	A0	3	ANA C	A1	22	ANA D	A2	23	ANA E	A3	3	ANA H	A4
25	ANA L	A5	26	ANA M	A6	3	ANI	E6	28	CALL	CD	29	CC	DC	3	CM	FC
31	CMA	2F	32	ADC A	8F	3	ADC B	88	34	ACI	CE	35	ADC A	8F	3	ADC B	88
37	ACI	CE	38	ADC A	8F	3	ADC B	88	40	ACI	CE	41	ADC A	8F	3	ADC B	88
43	ACI	CE	44	ADC A	8F	3	ADC B	88	46	ACI	CE	47	ADC A	8F	3	ADC B	88
49	ACI	CE	50	ADC A	8F	3	ADC B	88	52	ACI	CE	53	ADC A	8F	3	ADC B	88
58	ACI	CE	59	ADC A	8F	3	ADC B	88	61	ACI	CE	62	ADC A	8F	3	ADC B	88
64	ACI	CE	65	ADC A	8F	3	ADC B	88	67	ACI	CE	68	ADC A	8F	3	ADC B	88
70	ACI	CE	71	ADC A	8F	3	ADC B	88	73	ACI	CE	74	ADC A	8F	3	ADC B	88
76	ACI	CE	77	ADC A	8F	3	ADC B	88	79	ACI	CE	80	ADC A	8F	3	ADC B	88
82	ACI	CE	83	ADC A	8F	3	ADC B	88	85	ACI	CE	86	ADC A	8F	3	ADC B	88
88	ACI	CE	89	ADC A	8F	3	ADC B	88	91	ACI	CE	92	ADC A	8F	3	ADC B	88
94	ACI	CE	95	ADC A	8F	3	ADC B	88	97	ACI	CE	98	ADC A	8F	3	ADC B	88
100	ACI	CE	2	ADC A	8F	3	ADC B	88	103	ACI	CE	2	ADC A	8F	3	ADC B	88

              
          
                    
                       
                        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 

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
 

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

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.

Unix Shell Programming Example for B.Sc, B.Tech, BCA, MCA

NUMBER	PROGRAM NAME	LINK
1	Use of while loop.	CLICK HERE
2	Use of for loop.	CLICK HERE
3	Leapyear checking.	CLICK HERE
4	Check a number whether it is odd positive,odd negative,even positive,even negative.	CLICK HERE
5	Find out the factorial of a number.	CLICK HERE
6	Print fibonacci series.	CLICK HERE
7	Prime number checking.	CLICK HERE
8	Print twin prime numbers within a range.	CLICK HERE
9	Check if a number is prime fibonacci.	CLICK HERE
10	Check strong number.	CLICK HERE

NETWORKING FOROUZAN QUESTION SET

Networking (Forouzan Ch-1)  - CLICK HERE

Networking (Forouzan Ch-2) - CLICK HERE

Networking (Forouzan Ch-3) - CLICK HERE

Networking (Forouzan Ch-4) - CLICK HERE

Networking (Forouzan Ch-5) - CLICK HERE

Networking (Forouzan Ch-6) - CLICK HERE

Networking (Forouzan Ch-7) - CLICK HERE

Networking (Forouzan Ch-8)

Networking (Forouzan Ch-9)

Networking (Forouzan Ch-10)

Networking (Forouzan Ch-11)

Networking (Forouzan Ch-12)

to be continued...............

Database Management Questions Set

INTRODUCTION

1.  Data vs Information.
2. Meta data,Data dictionary , component of data dictionary , active and passive data dictionaries
3. System catalog
4. Field,record,file
5. Components of database
6. DBMS-operations
7. DA, DBA , functions and responsibilities of DBA.
8. Advantage and disadvantage of file oriented system
9. Advantage and disadvantage of DBMS
10. Redundancy, Consistency, Entity integrity , referential integrity,

LANGUAGE

1.DDL

2.DML

3.DCL

4.4GL
5.SDL

ARCHITECTURE

1. Schemas, subschemas, instances

2. two tier architecture, three tier architecture(advantage and disadvantage)

3. ANSI/SPARC architecture
4. Data Independence -i ) logical  ii) physical
5. Mapping -i) internal ii) external
6. Centralized DBMS, Parallel DBMS, Distributed DBMS, Client-server DBMS, Data Warehouse ( example ,advantage, disadvantage ).

DATA MODEL 

1. Data  model - def

2. Hierarchical model- example ,advantage, disadvantage

3. Network  model- example ,advantage, disadvantage

4. Relational model- example ,advantage, disadvantage

5. Object oriented data model - example ,advantage, disadvantage

FILE ORGANISATIONS

1. RAID level

2. Master file,Transaction file

3. Buffer Management.

4. Fixed length record, variable length record- def,example,advantage,disadvantage

5. Heap file organisation - use , advantage , disadvantage

6. Sequential file organisation - use , advantage , disadvantage
7. Indexed sequential file organisation - use , advantage , disadvantage
8. Hash file organisation - use , advantage , disadvantage
9. Dynamic hashing

INDEXING

1. Ordered and un-ordered indexing

2. Sparse indexing dense indexing

3. Primary indexing, secondary indexing, cluster indexing
4. Tree based indexing
5. B-tree indexing
6. B+ tree indexing
7. inverted indexing
8. indexing vs hashing

RELATIONAL ALGEBRA AND RELATIONAL CALCULUS

1. domain,tuple

2. key - primary key, super key, candidate key, foreign key ( def , example )
3. Composite key, prime attribute

4. Relational Algebra : selection , projection , Cartesian product, union, intersection, set difference, join, natural join, outer join, left outer join, right outer join , division ( def, example)

5. Relational Calculus : tuple calculus, domain calculus, comparison with relational  algebra

SQL

1. advantage, disadvantage 

2. relationally complete

3. create table , update table , delete table 

4. modify structure of table, modify values of table

5. difference between varchar and varchar2.

6. date, to_char(),to_date()

7. in.not in

8. Group by, having
9. order by( asc or desc)
10. string functions, like, wildcard characters
11. set functions
12, aggregate functions ( sum,avg,count,....)
13. NULL values
14. Unique constraints
15. join - natural join, theta join, equi join, outer join., left outer join, right outer join.
16. Create view

17. PL/SQL

ER Diagram

1. Entities, Relationship, attributes, cardinality , constraints, Entity set(Entity type) , Entity instance.

2. Relationship - degree - unary or recursive, binary, ternary

                                   N-ary relationship

3. simple attribute, single valued attribute, multivalued attribute , composite attribute , stored attribute, derived attribute, identifier attributes
4. Participation constraints
5. Conversion from ER model to realtion
6. ER diagram symbols
7. Super Class and sub class
8. Attribute inheritence  , advantage of inheritence

Functional Dependency

1. Functional dependency diagram and examples

2. Partial dependency, Full dependency

3. Armstrong's Axioms for FD

4. Closure of a set of FD

5. Decomposition - lossy and lossless join

6. Dependency preserving decomposition

Normalaization 

1. 1NF,2NF, 3NF, BCNF, 4NF, 5NF
2. Multi valued dependencies
3. Join dependencies
4. Spurious tuples.

to be continued..............

DATA STRUCTURE

Sorting

1.  What do you mean by 'in place' sorting technique?

2. What do you mean by 'stable' sorting technique?

3.  Algorithm,C code,Average Case Complexity of Bubble sort.

4.  Algorithm,C code,Average Case Complexity of Selection sort.

5.  Algorithm,C code,Average Case Complexity of Insertion  sort.

6.  Algorithm,C code,Average Case Complexity of Radix sort.

7.  Algorithm,C code,Average Case Complexity of Merge sort.(recursive and non recursive)

8.  Algorithm,C code,Average Case Complexity of Heap sort.

9.  Algorithm,C code,Average Case,Worst Case  Complexity of Quick sort.(recursive and non recursive)
10. Algorithm of Quick sort using queue.(non-recursive)

Hashing 

1. Why Hashing?

2. How do we pick a good hash function?

3. How do we deal with collisions?

4. Different hashing technique.

5. Linear probing,Chaining.

6. Double hashing.

7. Successful and unsuccessful comparison in linear probing and quadratic probing
8. Algorithm of linear probing,quadratic probing, chaining.