Dibrugarh University Question Paper - Computer Science – Arts and Science (Nov'2018)

 

2018

(November)

COMPUTER SCIENCE

(General)

Course: 301

(New Course)

(Data Structure with C++)

Full Marks: 48

Pass Marks: 14

Time: 2 hours

The figures in the margin indicate full marks for the questions

1. Answer the following as directed:                       1x5=5

a)         What is object?

b)         _________ implements LIFO. (Fill in the blank)

c)          _________ is not the operation that can be performed on queue. (Fill in the blank)

d)         The complexity of binary search algorithm is

1)         O (n).

2)         O (log n).

3)         O (n₂).

4)         O (n log n)

(Choose the correct option)

e)         What is polymorphism?

2. Answer the following questions:

a)         Explain abstract data types.                                               2

b)         What is circular linked list? Write one advantage of it.                           2

c)          Explain the concept of priority queue.                                                          2

d)         Explain all the operations of data structure.                                               3

e)         Write the algorithm for PUSH operation of stack.                    3

f)          Explain double-ended queue.                                          3

3. Answer the following questions:                                          7x4=28

(a) What is queue? Explain how queue can be represented in memory by use of array.

Or

What is binary search? Write the algorithms for binary search.

(b) Construct the binary tree with proper explanation from the following:

In-order:	4	8	2	5	1	6	3	7
Post-order:	8	4	5	2	6	7	3	1

 

Or

Write a C++ program to concatenate two strings and find the length of the final string.                            

(c) What is doubly linked list? Write an algorithm for insert element for doubly linked list.

Or

Write a C++ program to copy one string to another and reverse the final string.

(d) What is binary tree? Explain how linked list is represented in binary tree.

Or

What is bubble sort? Write an algorithm for bubble sort.

 

(Old Course)

(Operating System)

Full Marks: 48

Pass Marks: 19

Time: 2 hours

The figures in the margin indicate full marks for the questions

1. Answer the following briefly:                                                 1x5=5

a)         What is batch system?

b)         Define process scheduling.

c)          What is a physical address space?

d)         Define paging.

e)         Define file.

2. Answer the following questions:                          2x5=10

a)         What is the difference between distributed system and real-time system?

b)         Write one benefit and one drawback of SJF scheduling.

c)          Write the difference between internal and external fragmentation.

d)         What is the need for segmentation?

e)         What is a free space list?

3. (a) Differentiate among job, program and task.                                             3

(b) What is the difference between scheduler and dispatcher?                                              3

(c) Explain the working of feedback queue scheduling.                                              5

4. (a) Explain different mechanisms used for protection of a file.                                               4

(b) Explain in brief the index allocation method.                                                            4

(c) How does operating system function as a resource manager?                          3

5. Explain the mechanism of round robin scheduling. What are the rules of selecting a time quantum? What are the benefits and drawbacks of round robin scheduling?                                        4+2+5=11

 

***