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.

Tuesday, November 29, 2016

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

NUMBER PROGRAM NAMELINK
1 Use of while loop.CLICK HERE
2Use of for loop.CLICK HERE
3 Leapyear checking.CLICK HERE
4Check 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
7Prime number checking.CLICK HERE
8Print twin prime numbers within a range.CLICK HERE
9Check if a number is prime fibonacci.CLICK HERE
10 Check strong number.CLICK HERE

Monday, November 14, 2016

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...............

Friday, November 11, 2016

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..............

Saturday, November 5, 2016

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.

Friday, November 4, 2016

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