Department of Computer Science and Application Karimganj

Department of Computer Science and Application

Karimganj College

Karimganj

Instruction: Students are advised to submit the assignment to the mail-id

[email protected] only in PDF format.

TDC (CBCS) 2nd Semester

BCA (Core)

Internal Assessment

Assignment

BCACC-201: Introduction to Programming

Full Marks: 14

The questions are of equal value. The figures in the margin indicate full marks for the questions.

Answer any 7 (seven) questions. All questions carry 2 marks and are of descriptive nature.

1. Write down the characteristics of procedure oriented programming and object oriented programming.

2. Write a C/C++ program to calculate the roots of a quadratic equation.

3 . Write a C/C++ program to find the greatest number among 3 numbers using ternary operator.

4 . Explain the utility of iterative statements with examples.

5 . How nested statements are implemented in C/C++? Explain with example.

6 . Explain with example: call by value and call by reference.

7 . How two dimensional arrays are declared and initialized? Explain with example.

8 . Write down the difference between structure and union.

9 . What is macro pre-processor? Write a C/C++ program to swap two numbers using macro.

10 . Explain different classes for file stream operations. Write down the syntax for opening and closing a

file.

11 . What is class? How class can be declared? What is the purpose of private and public access

modifier? What is data member and member function? Explain with example.

12 . What is constructor? Write down the characteristics of constructor. Define default, parameterized and

copy constructor. Give example.

13 . Explain different types of polymorphism with example.

14 . What is inheritance? Explain any two types of inheritance with example.

mailto:[email protected]


BCA (Core)

Internal Assessment

Assignment

BCACC-202: Computer System Architecture

Full Marks: 20

Answer Any 5 questions of your choice each question carry 4marks each

1. Simplify the following Boolean functions using four-variable maps:

(a) F(A,B,C,D)= Ʃ(0,1,2,4,5,7,11,15)

(b) F(A,B,C,D)= Ʃ(0,2,4,5,6,7,8,10,13,15)

2. Simplify the following expressions using Boolean algebra:

(a) A+AB

(b) A′B+ABC ′+ABC

3. Explain 4×1 multiplexer with diagram.

4. Explain Memory-reference instruction and Register-reference instruction.

5. Explain the D flip-flop along with logic diagram and truth table

6. Explain the SR flip-flop along with logic diagram and truth table.

7. Explain JK flip flop with logic diagram and truth table.

8. Define the following terms:

(a) micro operation

(b) microinstructions

9. Explain Booth Multiplication Algorithm.

10. What is an instruction format? Explain Three-Address instruction format.

11. Explain Register mode and Relative mode addressing methods.

12. Differentiate between RISC and CISC characteristics.

13. Explain External Interrupts and Internal Interrupts.

14. Explain (r-1)′s complement and (r ′s) complement with an example.

15. Convert the following arithmetic expressions from infix to reverse Polish notation:

(a) A*B+C*D+E*F (b) A*B+A*(B*D+C*E)

Instruction: Students are advised to send their assignment on mail id

[email protected] (For Second Semester)


Internal Assessment

Assignment

CSCHCC/CSC-GE/DSC 201: Computer System Architecture

Full Marks: 20 Answer Any 5 questions of your choice each question carry 4marks each

1. Simplify the following Boolean functions using four-variable maps:

(a) F(A,B,C,D)= Ʃ(0,1,2,4,5,7,11,15)

(b) F(A,B,C,D)= Ʃ(0,2,4,5,6,7,8,10,13,15)

2. Simplify the following expressions using Boolean algebra:

(a) A+AB

(b) A′B+ABC ′+ABC

3. Explain 4×1 multiplexer with diagram.

4. Explain Memory-reference instruction and Register-reference instruction.

5. Explain the D flip-flop along with logic diagram and truth table

6. Explain the SR flip-flop along with logic diagram and truth table.

7. Explain JK flip flop with logic diagram and truth table.

8. Define the following terms:

(a) micro operation

(b) microinstructions

9. Explain Booth Multiplication Algorithm.

10. What is an instruction format? Explain Three-Address instruction format.

11. Explain Register mode and Relative mode addressing methods.

12. Differentiate between RISC and CISC characteristics.

13. Explain External Interrupts and Internal Interrupts.

14. Explain (r-1)′s complement and (r ′s) complement with an example.

15. Convert the following arithmetic expressions from infix to reverse Polish notation:

(a) A*B+C*D+E*F

(b) A*B+A*(B*D+C*E)



Internal Assessment

Assignment

CSCHCC-202: Data Structure

Full Marks: 14

The questions are of equal value. Answer any 7 (seven) questions. All questions

carry 2 marks and are of descriptive nature.

1. What is linear array? Write down the memory representation of linear array. Also write down

the algorithm to traverse a linear array.

2. How sparse matrix can be represented in memory? Explain different ways with example.

3. Write an algorithm to insert and delete operation in linear queue.

4. Write an algorithm to evaluate the postfix expression.

5. What is a threaded binary tree? Explain with example. What are its advantages and

disadvantages?

6. What is binary search? Explain the procedure to search 34 and -14 in the following list of

elements: 23, 34, 54, 60, 71, 93, 105.

7. Write down the algorithm for shell sort. Sort the following elements using shell sort

algorithm: 56, 4, 12, 78, 63, 47, 53, 22.

8. Explain the following with example:

a. Deque

b. Doubly linked list

9. Explain binary search tree by taking suitable example.

10. Write an algorithm to implement priority queue using linked list.

11. How to resolve collision using open addressing method? Give example.

12. What is rehashing? Write down the procedure to delete an element from

hash table.

13. Write a program in C/C++ to generate Fibonacci sequence using recursion.

14. Consider the following arithmetic infix expression:

Q: A+(B*C-(D/E↑F)*G)*H

Transform the expression into postfix form.



TDC (CBCS) 4th Semester

B.Sc. (Computer Science Core/GE/DSC)

Internal Assessment

Assignment

CSC-GE-401/DSC-401: Database Management System

Full Marks: 14


Answer any 7 (seven) question. All questions carry 2 marks and are of descriptive nature.

1. Define data abstraction. Explain the 3 levels of data abstraction.

2. Explain 3 types of data models available for database system. Give example.

3. Draw the E-R diagram of university academic and administrative system.

4. Discuss the main characteristics of the database approach and how it differs from traditional file

system.

5. Explain different relational algebra operations with examples.

6. What is entity and attribute? Briefly describe different types of attributes.

7. Explain different types of key constraints. Give example for each.

8. Answer the following:

a. What is SQL? Briefly define DDL, DML, DCL and TCL.

b. What is the difference between ‘IN’ and ‘BETWEEN’ operators in SQL with example?

c. What is the difference between CHAR and VARCHAR2 data type in SQL?

d. Explain how SQL JOIN operation works?

e. How GROUP BY clause works in SQL

9. Write an SQL command to create a table (Employee) with the following attribute:

Ecode Number

Ename Varchar2 (25)

Grade Char (2)

Gross Decimal Number

a. Set Ecode as the primary key of the table. The attribute should not allow NULL values.

b. Find the name of the employee whose gross salary is between 10000 to 15500.

c. Add one more column/ attribute ‘Doj’ of type Date to the given table.

d. Modify the size of the attribute Ename to 30.

e. Update the grade of ‘Anil Kumar’ to ‘O+’

10. What is normalisation? Explain with example different types of normalisation (1NF, 2NF, 3NF &

BCNF).

11. Draw a state diagram for a typical transaction process and discuss the states that a transaction goes

through during transaction.

12. Explain ACID properties of transaction.

13. Discuss the several types of locks that are used in concurrency control.

14. Explain different types of file organization.





BCA (Computer Application)

Internal Assessment

Assignment

BCACC-401: Design and Analysis of Algorithm

Full Marks: 20


1. What is an algorithm? Write and algorithm for insertion into a Stack.

2. Write an algorithm for Quick Sort.

3. Write an algorithm for Merge Sort. Also explain the time complexity analysis.

4. Explain Divide and Conquer also write an algorithm for Divide & Conquer.

5. Explain Heap sort with and example.

6. Write and algorithm for Selection Sort.

7. Explain Depth First Search and Breadth First Search.

8. Explain Knap-Sack Problem using Greedy method.




Internal Assessment

Assignment

BCACC-402: Computer Graphics

Full Marks: 14

1. Answer any two questions. Each questions carry 5 marks

a. Explain briefly Raster scan and Random scan display.

b. What are the different types of display devices explain with example.

c. What do you mean by polygon filling algorithm?

d. Explain 2 D transformation in detail.

e. What is window-to-viewport transformation?

f. Explain Clipping with diagram

2. Write Short notes (any two). Each short note carry 2 marks each

a) Graphics input devices

b) Line attributes

c) Application of Computer Graphics

d) Graphics Software

e) Scan Conversion



Internal Assessment

Assignment

BCACC-403: Introduction to Database

Full Marks: 14







system.











Ecode Number

Ename Varchar2 (25)

Grade Char (2)








BCNF).









B.Sc. (Computer Science Core)

Internal Assessment

Assignment

CSCHCC-401: Computer Network

Full Marks: 20


1. Explain the role of data link layer and network layer in OSI reference model.

2. What are the various modes of Data communication?

3. Mention the advantages and disadvantages of Bus topology and Star topology.

4. Describe in brief:

i) LAN

ii) MAN

5. Discuss NRZ (Non-Return-to-Zero) and NRZ-L line coding schemes.

6. Differentiate between Manchester and Differential Manchester.

7. Compare between PCM and DM.

8. Differentiate between Time Division Multiplexing and Frequency Division Multiplexing.

9. Describe the following:

(a) Circuit-Switched network

(b) Packet-Switched network

10. Explain Stop-and-Wait Protocol.

11. What is Carrier Sense Multiple Access (CSMA)?

12. Compare and contrast HDLC with PPP. Explain byte-oriented and bit-oriented protocol.




Internal Assessment

Assignment

CSCHCC-402: Database Management System

Full Marks: 14







system.











Ecode Number

Ename Varchar2 (25)

Grade Char (2)








BCNF).








Internal Assessment

Assignment

CSCHCC-403: Design Analysis and Algorithm Full Marks: 20


1. What is asymptotic notation? Explain Big-Oh(O) notaion.

2. Explain Greedy Method algorithm.

3. Write and algorithm for Insertion Sort.

4. Explain Divide and Conquer algorithm also explain its time complexity.

5. Write an Algorithm for Counting Sort.

6. Write an Algorithm for Radix Sort.

7. Write an Algorithm for Heap Sort.

8. Explain Red-Black Tree with an example.

Documents

Department of Computer Science and Application Karimganj