KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Kumar Bhuyan School of Science and Technology

Size: px

Start display at page:

Download "KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Kumar Bhuyan School of Science and Technology"

Deborah Melton
5 years ago
Views:

1 HOME ASSIGNMENT FOR BACHELOR OF COMPUTER APPLICATIONS (BCA) THIRD SEMESTER, 2017 N.B. The learners will have to collect receipt after submitting the assignment with the signature and seal of the collector of study centre and will have to keep with him/her till the declaration of result. Receipt Received the assignment from Mr/Ms.Enrollment number of 3 rd Semester, 2017 BCA on Date: Signature of collector with seal

2 Object-Oriented Programming Through C++ [BCA (S3)08] 3 rd Semester, 2017 A. Answer the following questions: (2 X 4= 8) Q1. Define polymorphism. Q2. Define data abstraction Q3. Give the purpose of using operator overloading Q4. Can destructor be overloaded? B. Answer the following questions: (3 X 4= 12) Q1. Give the advantages of function overloading. Q2. What is run-time and compile-time polymorphism? How these can be achieved? Q3. Write a C++ program to show multi-level inheritance. Q4. Give the characteristics of a constructor. C. Answer the following questions: (5 X 2=10) Q1. Write a program in C++ to call a function which returns the square of a given number. Q2. Write a C++ program that displays the number of digits in a number entered through the keyboard. D. Answer the following questions (10 X 2=20) Q1. Write a program in C++ that displays the factorial of a given number using a constructor and destructor member function. Q2.What is virtual class? Explain the need for virtual classes while building class hierarchy.

3 Database Management System [BCA (S3)09] 3 rd Semester, 2017 A. Answer the following questions: (2 X 4= 8) Q1. What is the purpose of normalizing data? Q2. Define logical data independence and physical data independence? Q3. Define strong and weak entity giving suitable example. Q4. What are integrity constraints? B. Answer the following questions : (3 X 4= 12) Q1. Explain the purpose of GROUP by, HAVING and ORDER BY clause giving suitable examples. Q2. What are DML and DDL? Q3. Describe the three levels of data abstraction? Q4. Explain first, second and third normal form with appropriate examples. C. Answer the following questions : (5 X 2=10) Q1. Draw E-R diagram for an operator who can work on many machines and each machine has many operators. Each machine belongs to one department but a department can have many machines.

4 Q2. Consider the relational table given below and write SQL queries for the following: Employee(SSN_No, Name, Department, Salary) (i) List all the employees whose name starts with the letter 'S'. (ii) Find the minimum salary given to employees in each department. (iii) Find the second minimum salary from the table. (iv) Find the employee who is getting the maximum salary. D. Answer the following questions: (10 X 2=20) Q1. What is the importance of functional dependences in database design? Discuss partial dependency, full functional dependency and transitive dependencies. Q2. Using examples show how a table can be converted from 1NF to 3NF.

5 Operating System [BCA (S3)10] 3r d Semester, 2017 A. Answer the following questions (2 X 4= 8) Q1. Define virtual memory. Q2. Distinguish between process and thread. Q3. Define and give an example of race condition. Q4. Differentiate absolute path from relative path. B. Answer the following questions (3 X 4= 12) Q1. Define the terms: Throughput, Turnaround time and Response time. Q2. What is Belady s anomaly? Q3. Describe the different states in a process model. Q4. Distinguish between preemptive and non-preemptive scheduling. C. Answer the following questions (5 X 2=10) Q1. Define semaphore? What are the requirements to achieve mutual exclusion? Q2. Define paging. Describe the paging technique used in virtual memory. D. Answer the following questions (10 X 2=20) Q1. Define deadlock. Compare and contrast deadlock prevention and deadlock avoidance. Q2. Show using the same example the working of First In First Out and Round Robin scheduling algorithm.

KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Kumar Bhuyan School of Science and Technology

KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Kumar Bhuyan School of Science and Technology HOME ASSIGNMENT FOR BACHELOR OF COMPUTER APPLICATIONS (BCA) THIRD SEMESTER, 2014 N.B. The learners will have to collect receipt after submitting the assignment with the signature and seal of the collector