UNIVERSITY OF CALCUTTA SYLLABUS of Bachelor of Science (B. Sc.) (Honours) in Computer Science (CMSA) Choice Based Credit System (CBCS) Semester - IV

 UNIVERSITY OF CALCUTTA SYLLABUS of Bachelor of Science (B. Sc.) (Honours) in Computer Science (CMSA) Choice Based Credit System (CBCS) Semester - IV

CORE

HONOURS	PAPER CODE	PAPER TITLE	CREDIT	LINK
THEORY	CMS-A-CC-4-8-TH	Data communication , Networking and Internet technology	4	CLICK HERE
PRACTICAL	CMS-A-CC-4-8-P	Computer Networking and Web Design Lab	2	CLICK HERE
THEORY	CMS-A-CC-4-9-TH	Introduction to Algorithms & its Application	4	CLICK HERE
PRACTICAL	CMS-A-CC-4-9-P	Algorithms Lab.	2	CLICK HERE
THEORY	CMS-A-CC-4-10-T	Microprocessor and its Applications	4	CLICK HERE
PRACTICAL	CMS-A-CC-4-10-P	Programming with Microprocessor 8085	2	CLICK HERE

SEC 

SEC-B-1	CMS-A-SEC-B-4-1-TH Information Security	CREDIT=2	CLICK HERE
SEC1	CMS-A-SEC-B-4-2-TH E-Commerce	CREDIT=2	CLICK HERE

UNIVERSITY OF CALCUTTA SYLLABUS of Bachelor of Science (B. Sc.) (Honours) in Computer Science (CMSA) Choice Based Credit System (CBCS) Semester - III

 UNIVERSITY OF CALCUTTA SYLLABUS of Bachelor of Science (B. Sc.) (Honours) in Computer Science (CMSA) Choice Based Credit System (CBCS) Semester - III

CORE

HONOURS	PAPER CODE	PAPER TITLE	CREDIT	LINK
THEORY	CMS-A-CC-3-5-TH	Computer Organization & Architecture	4	click here
PRACTICAL	CMS-A-CC-3-5-P	Computer Organization Lab	2	click here
THEORY	CMS-A-CC-3-6-TH	Computational Mathematics	4	click here
PRACTICAL	CMS-A-CC-3-6-P	Computational Mathematics Lab	2	click here
THEORY	CMS-A-CC-3-7-TH	Operating Systems	4	click here
PRACTICAL	CMS-A-CC-3-7-P	Operating Systems Lab	2	click here

SEC1	CMS-A-SEC-A-3-1-TH Computer Graphics	CREDIT=2	click here
SEC1	CMS-A-SEC-A-3-2-TH IoT (Internet of Things)	CREDIT=2	click here

UNIVERSITY OF CALCUTTA SYLLABUS of Bachelor of Science (B. Sc.) (Honours) in Computer Science (CMSA) Choice Based Credit System (CBCS) Semester - II

 UNIVERSITY OF CALCUTTA SYLLABUS of Bachelor of Science (B. Sc.) (Honours) in Computer Science (CMSA) Choice Based Credit System (CBCS) Semester - II

CORE

HONOURS	PAPER CODE	PAPER TITLE	CREDIT	LINK
THEORY	CMS-A-CC-2-3-TH	Data structure	4	click here
PRACTICAL	CMS-A-CC-2-3-P	Data structure using C	2	click here
THEORY	CMS-A-CC-2-4-TH	Basic Electronic Devices and Circuits	4	click here
PRACTICAL	CMS-A-CC-2-4-P	Basic Electronic Devices and Circuits	2	click here

UNIVERSITY OF CALCUTTA SYLLABUS of Bachelor of Science (B. Sc.) (Honours) in Computer Science (CMSA) Choice Based Credit System (CBCS) Semester - I

  Bachelor of Science (B. Sc.) (Honours) in Computer Science (CMSA) Choice Based Credit System (CBCS) Semester - I 

CORE

HONOURS	PAPER CODE	PAPER TITLE	CREDIT	LINK
THEORY	CMS-A-CC-1-1-TH	Digital Logic	4	click here
PRACTICAL	CMS-A-CC-1-1-P	Digital Circuits	2	click here
THEORY	CMS-A-CC-1-2-TH	Programming Fundamentals in C	4	click here
PRACTICAL	CMS-A-CC-1-2-P	Programming in C	2	click here

4. WAP to compute the sum of the first n terms of the following series S =1-2+3-4+5……………. CMSACOR01P: Programming Fundamental using C/C++

 4. WAP to compute the sum of the first n terms of the following series S =1-2+3-4+5……………. 

CMSACOR01P: Programming Fundamental using C/C++

3. WAP to compute the sum of the first n terms of the following series S = 1+1/2+1/3+1/4+…… CMSACOR01P: Programming Fundamental using C/C++

 CMSACOR01P: Programming Fundamental using C/C++

3. WAP to compute the sum of the first n terms of the following series S = 1+1/2+1/3+1/4+……  

2. WAP to reverse a number. - CMSACOR01P: Programming Fundamental using C/C++

CMSACOR01P: Programming Fundamental using C/C++

 2. WAP to reverse a number.  - 

1. WAP to print the sum and product of digits of an integer ---CMSACOR01P: Programming Fundamental using C/C++

CMSACOR01P: Programming Fundamental using C/C++

 1. WAP to print the sum and product of digits of an integer.

20. Write a program to create your own exception types to handle situation specific to your application (Hint: Define a subclass of Exception which itself is a subclass of Throwable).

 20. Write a program to create your own exception types to handle situation specific to your application (Hint: Define a subclass of Exception which itself is a subclass of Throwable).

19. Write a program to show the use of nested try statements that emphasizes the sequence of checking for catch handler statements.

 19. Write a program to show the use of nested try statements that emphasizes the sequence of checking for catch handler statements.

18. Write a program ―DivideByZero‖ that takes two numbers a and b as input, computes a/b, and invokes Arithmetic Exception to generate a message when the denominator is zero.

 18. Write a program ―DivideByZero‖ that takes two numbers a and b as input, computes a/b, and invokes Arithmetic Exception to generate a message when the denominator is zero.

SQL

 1. BASIC SQL STEP BY STEP -  CLICK HERE

2. UGC CBCS ASSIGNMENT FOR GENERAL STUDENT - CLICK HERE

3. UGC CBCS ASSIGNMENT FOR HONOURS  STUDENT - 

4. self join in sql - CLICK HERE

5. DATE command in SQL - CLICK HERE

6. wbsu 2016 dbms practical question - CLCIK HERE

7. CHECK CONSTRAINTS - CLICK HERE

JDBC code - create table, insert record, update record, delete record, drop table

 1.  jdbc1.CREATE TABLE using sql - CLICK HERE

2.  jdbc2. DISPLAY TABLE USING JDBC - CLICK HERE

3.  jdbc3. INSERT RECORD IN TABLE USING JDBC -    CLICK HERE

4. jdbc4. UPDATE RECORD IN TABLE USING JDBC -  CLICK HERE

5. jdbc5. CREATE TABLE USING JDBC - CLICK HERE

6. jdbc6. DROP TABLE USING JDBC-    CLICK HERE

7. jdbc7. DELETE DATA FROM TABLE USING JDBC - CLICK HERE

8. jdbc8. ALL ARE IN A SINGLE PROGRAM CREATE TABLE,INSERTION,DELETION, DROP TABLE USING JDBC - CLICK HERE

jdbc8. ALL ARE IN A SINGLE PROGRAM CREATE TABLE,INSERTION,DELETION, DROP TABLE USING JDBC

 jdbc8. ALL ARE IN A SINGLE PROGRAM CREATE TABLE,INSERTION,DELETION, DROP TABLE USING JDBC

jdbc7. DELETE DATA FROM TABLE USING JDBC

 

jdbc7. DELETE DATA FROM TABLE USING JDBC

jdbc6. DROP TABLE USING JDBC

 jdbc6. DROP TABLE USING JDBC

jdbc5. CREATE TABLE USING JDBC

jdbc5. CREATE TABLE USING JDBC

 

jdbc4. UPDATE RECORD IN TABLE USING JDBC

 jdbc4. UPDATE RECORD IN TABLE USING JDBC

jdbc3. INSERT RECORD IN TABLE USING JDBC

 jdbc3. INSERT RECORD IN TABLE USING JDBC

jdbc2. DISPLAY TABLE USING JDBC

 jdbc2. DISPLAY TABLE USING JDBC

jdbc1.CREATE TABLE using sql

 1.jdbc1.CREATE TABLE using sql

 

GRAPH THEORY N.DEO CHAPTER WISE QUESTION

 CHAPTER 1.  CLICK HERE

 CHAPTER 2. CLICK HERE

 CHAPTER 3.  CLICK HERE

 CHAPTER 4.  CLICK HERE

 CHAPTER 5. CLICK HERE

 CHAPTER 7. CLICK HERE

 CHAPTER 8.  CLICK HERE

 CHAPTER 9. CLICK HERE

 CHAPTER 11. CLICK HERE

 

GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 11:

 GRAPH THEORY N.DEO CHAPTER WISE QUESTION 

CHAPTER 11:

1. ALGORITHM 1. NUMBER OF COMPONENTS OF GRPAH.

2. ALGORITHM 2. SPANNING TREE.

3. ALGORITHM 7. SHORTEST PATH.

4. DFS,BFS

 

GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 9:

 GRAPH THEORY N.DEO CHAPTER WISE QUESTION 

CHAPTER 9:

1. DIRECTED GRAPH

2. UNDIRECTED GRAPH.

3. ADJACENCY MATRIX OF DIGRAPH.

 

GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 8:

 GRAPH THEORY N.DEO CHAPTER WISE QUESTION 

CHAPTER 8:

1. CHROMATIC NUMBER.

2. GRAPH COLORING.

3. THEOREM 8.1.

4. THEOREM 8.2.

5. BIPARTITE GRAPH.

6. 

GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 7:

 GRAPH THEORY N.DEO CHAPTER WISE QUESTION 

CHAPTER 7:

1. INCIDENCE MATRIX.

2. THEOREM 7.1.

3. THEOREM 7.2.

4. CIRCUIT MATRIX.

5. CUT SET MATRIX.

6. PATH MATRIX.

7. ADJACENCY MATRIX.

GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 5:

 GRAPH THEORY N.DEO CHAPTER WISE QUESTION

CHAPTER 5:

1. PLANAR GRAPH

2. NONPLANAR GRAPH

3. THEOREM 5.1.

4. THEOREM 5.2.

5. THEOREM 5.6.

GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 4:

 GRAPH THEORY N.DEO CHAPTER WISE QUESTION  CHAPTER 4:

1. CUT SET

2. THEOREM 4.1.

3. THEOREM 4.2.

4. THEOREM 4.3.

5. FUNDAMENTAL CUT SET.

GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 3:

 GRAPH THEORY N.DEO CHAPTER WISE QUESTION

 CHAPTER 3 :

1.TREE

2. NULL TREE

3. THEOREM 3.1.

4. THEOREM 3.2.

5. THEOREM 3.3.

6. THEOREM 3.4.

7. THEOREM 3.5.

8. THEOREM 3.6.

9. THEOREM 3.7.

10. DISTANCE , CENTERS.

11. METRIC.

12. THEOREM 3.8. 

13. THEOREM 3.9.

14. RADIUS , DIAMETER.

15. ROOTED AND BINARY TREE.

16. HEIGHT,LEVEL

17. WEIGHTED PATH LENGTH.

18. THEOREM 3.10.

19. UNLABELED TREE.

20. SPANNING TREE, MINIMAL SPANNING TREE.

21. THEOREM 3.11.

22. THEOREM 3.12.

23. RANK AND NULLITY.

24. MINIMAL SPANNING TREE ALGORITHM.

GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 2:

 GRAPH THEORY N.DEO CHAPTER WISE QUESTION

 CHAPTER 2:

1. ISOMORPHISM

2. SUBGRAPH

3. VERTEX DISJOINT, EDGE DISJOINT.

4. WALK, PATH, CIRCUIT

5. OPEN WLAK, CLOSED WALK.

6. CONNECTED GRAPH, DISCONNECTED GRAPH

7. COMPONENT

8. THEOREM 2-1.

9. THEOREM 2-2.

10. THEOREM 2-3.

11. EULER LINE, EULER GRAPH

12. THEOREM 2-4.

13. UNICURSAL LINE ,UNICURSAL GRAPH..

14. THEOREM 2-5.

15. UNION, INTERSECTION,RING SUM, DECOMPOSITION,DELETION

16. FUSION.

17. THEOREM 2-6.

18. ARBITRARILY TRACEABLE GRAPH.

19. THEOREM 2-7.

20. HAMILTONIAN PATH AND HAMILTONIAN CIRCUIT.

21. COMPLETE GRAPH.

22.  THEOREM 2-8.

23.  THEOREM 2-9.

24. EXERCISE 2.5.

25.  EXERCISE 2.6.

26.  EXERCISE 2.8.