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.

CHECK CONSTRAINTS

Check

create table employee(eid number primary key , ename varchar2(30), city varchar2(30),salary number);

insert into employee values(1,'ram','kol',20000);

insert into employee values(2,'sam','goa',30000);

insert into employee values(3,'jam','delhi',40000);

create table employee2(eid number  , ename varchar2(30) check (ename like 's%'));

Table created

insert into  employee2 values(1,'sam');

1 row(s) inserted.

insert into  employee2 values(1,'ram');

ORA-02290: check constraint (SYS.SYS_C003999) violated

create table employee3(eid number  , ename varchar2(30), city varchar2(30) check(city in('kol','goa'))  ); Table created. 0.68 seconds

insert into  employee3 values(1,'ram','kol');

1 row(s) inserted.

0.07 seconds

insert into  employee3 values(2,'sam','delhi');

ORA-02290: check constraint (SYS.SYS_C004000) violated

create table employee1(eid number primary key , ename varchar2(30) check (ename like 's%'), city varchar2(30) check(city in('kol','goa')),salary number check(salary>20000)); insert into employee1 values(1,'jam','delhi',40000); ORA-02290: check constraint (SYS.SYS_C003996) violated

8085 Microprocessor sample question set THEORY

Gaonkar Chapter 1 - CLICK HERE

Gaonkar Chapter  2 - CLICK HERE

Gaonkar Chapter  3 - CLICK HERE

Gaonkar Chapter  4 - CLICK HERE

GaonkarChapter  5 - CLICK HERE

Gaonkar Chapter  6 - CLICK HERE

Gaonkar Chapter  7 - CLICK HERE

Gaonkar Chapter  8 - CLICK HERE

Gaonkar Chapter  9 - CLICK HERE

Gaonkar Chapter  10 - CLICK HERE

Operating System Question Set

Operating System Question Set 
GALVIN

INTRODUCTION: -  CLICK HERE

PROCESS: CLICK HERE

THREAD: CLICK HERE

Process synchronisation: CLICK HERE

Memory management. CLICK HERE

File system: CLICK HERE

Disk Scheduling: CLICK HERE

Deadlock:  CLICK HERE

C Language QUESTION Theory Set :

set1:  CLICK

set2:  CLICK

set3: CLICK

Basic Electronics Set 2

1. Operation of a pnp transistor,  npn transistor
2. Basic circuit for using a pnp transistor as an amplifier
3. Why this is called bipolar transistor?
4.Why this is called current controlled device?
5. Emitter follower.
6. Common-base, common-emitter and common-collector amplifiers
7. Relationship between α and β.
8. Load line analysis,Q-point
9. Describe the operation of a transistor amplifier in CE configuration.
10.Differentiate between FET and BJT transistors.
11. What is the use of biasing? Draw the DC equivalent model.
12. Thermal Runaway, thermal resistance
13.  Draw a BJT fixed bias circuit and derive the expression for the stability factor ‘S’.
14.Advantages and  disadvantages of fixed bias circuit
15. what is the condition for thermal stability?
16. Explain thermal instability. What are the factors affecting the stability factor?

Basic Electronics Set 1

1. Conductor , insulator , semiconductor - definition, example.
2. Valence band, conduction band, band gap
3.  Intrinsic semiconductor, extrinsic semiconductor, doped semiconductors,doping
4. Hole,doping,Recombination
5. Diffusion and drift, drift current
6. filter,rectifier
7. Characteristics graph of forward biasing,reverse biasing
8.avalanche break down,Zener break down
9. LED
10.Depletion region
11.Diode current equation
12. Half wave rectifier
13.full wave rectifier-center trap,bridge rectifier(with filter and with out filter)
13. ripple factor,PIV,Load current,rectifier efficiency
14. Characteristics of Zener diode
15. Diode as a voltage regulator

Computer Organization Question set 7

Chapter 7 – I/O Organization

1. I/O controller or I/O interface

2. I/O driver

3. I/O port

4. Synchronous data transfer and asynchronous data transfer

5. Handshaking mode, strobe control mode (source initiated, destination initiated)

6. Programmed I/O

7. Interrupt I/O

8. DMA –DMA controller, handshaking mode, cycle stealing mode

9. Software interrupt, Hardware interrupt

10. Internal interrupt, External interrupt

11.Vector interrupts non-vectored interrupt
12. ISR

13. Bus Arbitration – daisy chaining, polling, independent request

14. Input output processor

15. Memory mapped I/O,I/O mapped I/O

16. Serial communication, parallel communication, advantages, disadvantages

17. Short note – SCSI,PCI,USB

Computer Organization Question set 6

Chapter 6 – Control unit

1. Definition control unit

2. Hardwired control unit, micro programmed control unit advantages, disadvantages, comparison

3. State table method, sequence counter, delay element

4. Control memory

5. Wilkes design

6. Horizontal micro instruction, vertical micro instruction, comparison

7. Encoding of micro instruction

8. Parallelism in micro instruction 

Computer Organization Question set 5

                                 Chapter 5 – Instruction set

1. Instruction set

2. Instruction set completeness

3. Instruction format

4. Accumulator organization

5. Stack organization

6. Three address instruction, two address instruction, one address instruction, Zero address instruction

7. Addressing mode

8. CISC/RISC advantages, disadvantages, comparison

9. Instruction pipeline definition only

Computer Organization Question set 4

Chapter 4 – Memory

1. Defination – seek time, capacity, Rotational delay

2. Short note – memory hierarchy

3. SRAM – read and write technique

4. DRAM – Read and Write technique

5. SRAM,DRAM – Comparison

6. RAM CHIP, ROM CHIP example.

7. LARGE memory using small chip, range of memory address map

8. Memory -1D,2D,2.5D,3D

9. PROM, EPROM, EEPROM,FLASH MEMORY – Comparison

10. Magnetic Disc- track, sector, cylinder, inter-sector gap, surface, platter

11.  Short note- optical drive, associative memory

12. Cache memory- cache hit, cache miss, locality of reference, spatial locality, temporal locality, direct mapping, associative mapping, se-associative mapping, write through, write back, two level cache

13. Virtual memory

14. Page, frame

15. Page replacement technique.

16. Desructive and nondestructive memory

Computer Organization Question set 3

Chapter 3 - arithmetic

1.  Data representation –                                                                                 

a) sign magnitude

     b) 1‘s complement

     c) 2’s complement

   Advantages, disadvantages, comparison

      2. r‘s complement, r-1’s complement

      3.Floating point number representation (8 bit,32 bit,64 bit)

      4.Special cases of IEEE 754 format.

      5.1’s complement arithmetic,2’s complement arithmetic

      6.Overflow and underflow detection

      7.Algorithm or flowchart – a) fixed point addition-subtraction

                                                    b) add –shift   multiplication

                                                    c) Booth’s multiplication

                                                   d) restore and non-restore division  

                                                   e) floating point addition, subtraction,                                                                        multiplication, division

     8.Common bus system

     9.Tristate buffer

    10.parallel adder, cla, adder-subtractor, carry save multiplier

    11. Bit sliced ALU

    12. 4bit ALU design

Computer Organization Question set 2

Chapter 2 – instruction cycle

1. Instruction cycle

2. Fetch, decode, execute

3. MAR, MBR, PC, SP, IR, DR, Flag register

4. PSW

Computer Organization Question set 1

Chapter 1 - Introduction

1. Generation of computer, advantages, disadvantages

2. IAS computer structure, block diagram.

3. Von-Neumann concept.

4. Bottleneck of Von-Neumann.

5. Harvard architecture

6.Comparison of Harvard and Von Neumann.