2017
(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) Define data structure.
b) The insertion and deletion of LIFO is called _________. (Fill in the blank)
c) Define inheritance.
d) Which of the following data structures cannot store non-homogeneous data elements?
1) Stack.
2) Array.
3) Pointers.
4) Records.
(Choose the correct answer)
e) The variable which can be accessed by all modules of the program is called as
1) Static variable.
2) Auto variable.
3) Global variable.
4) Local variable.
(Choose the correct answer)
2. Answer the following questions:
a) What are the advantages of doubly linked list over singly linked list? 2
b) Write the algorithm of traversing a linked list. 2
c) What is a binary tree? Give its advantages. 2
d) Write the difference between C and C++. 3
e) Write the algorithm of selection sort. 3
f) Explain how is array implemented on stack. 3
3. Answer the following questions: 7x4=28
(a) What is linked list? Explain how link lists can be represented in memory by use of stock. 2+5=7
Or
Write a C++ program to convert upper case letter to lowercase and lowercase letter to uppercase. 7
(b) What do you mean by algorithm? How can you analyze an algorithm? What is space complexity of an algorithm? Explain with example. 7
Or
Construct the binary tree with proper explanation from the following: 7
|
In-order: |
1 |
3 |
4 |
5 |
6 |
7 |
9 |
12 |
|
Post-order: |
3 |
5 |
4 |
1 |
7 |
12 |
9 |
6 |
(c) Define stack. What are the basic operations associated with stack? Write the algorithm for PUSH and POP stack operations, when a stack is represented by an array. 1+2+4=7
Or
Write the linear search algorithm and find its complexity. 7
(d) Explain the following operations with appropriate examples: 7
1) Traversing.
2) Sorting.
3) Searching.
Or
How do you define bubble sort? Write the algorithm of bubble sort. 7
(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: 1x5=5
a) What is multiprogramming?
b) What is a process?
c) Define virtual memory.
d) What is a logical address space?
e) What do you understand by throughput?
2. Answer the following questions: 2x5=10
a) Write any two operating system services.
b) What is contiguous memory allocation?
c) Differentiate between FIFO and SJF scheduling.
d) What are the various stages of a process?
e) Distinguish between regular files and directories in computer file system.
3. Answer any three of the following: 11x3=33
a) (1) What is a real-time system? How does it differ from a time-sharing system? 4
(2) Differentiate between paging and segmentation. 4
(3) Briefly explain the file operations. 3
b) Explain, with the help of necessary diagram, the different directory structures. 11
c) Explain, in brief, different scheduling algorithms.
d) (1) Explain different CPU scheduling criteria. 3
(2) Explain different file protection methods. 4
(3) What is fragmentation? Explain how it is implemented in storage management. 4
e) Discuss, in brief, different techniques for free-space management. 11
***
Post a Comment
Kindly give your valuable feedback to improve this website.