SCDL

Program Name:
Subject:
Assessment Name:
Weightage:
Total Marks:
Duration:

PGDITM
Algorithms and Programming Concepts - OAS (2014)
APC - Exam
70
70
80 mins

Online Examination:
Online examination is a Computer based examination.
Online examination comprises of Total 29 Questions - Out of 70 marks.
Duration of online examination will be of 1 Hour 20 minutes (80 minutes).

Section - I Instructions:
- It is compulsory and has total 3 Subjective Questions.
- Students are required to solve any 2 Subjective Type Questions. Each question is of 5 marks.
- Section I is out of 10 Marks.
Please refer following instructions regarding Subjective examination:
- While attempting subjective examination Text formatting facility will be disabled such as use of bullets,
making the text bold, underlining the text etc. Only normal character on the key board will be available.
- Special characters available on the keyboard will be allowed.
- Students can not attempt more than 2 questions out of given 3.
- A blank (space typed) or any entry in the space provided will be considered as question is answered.
- Hand written answers are not allowed. Subjective test can be answered by using key board.
- No brail support shall be provided, but writer assistance shall be allowed. The student has to intimate it to
SCDL well in advance by completing applicable formalities.
- Answers for both the questions should not exceed more than 110 words. The maximum word limit per
answer is 55 words (for Subjective part).

Page 1 of 7

SCDL

1) Why is it important to write language-neutral algorithms?

(5)
1. The algorithms can be implemented in any language of choice. 2. The algorithms can be implemented
in any language based on need. 3. The algorithms may be written in one language and used as an
independent module in a heterogeneous setup. 4. Choice of language should not decide the logic of
solution. 5. Effectiveness of an algorithm is not based on simplicity but on efficiency.
2) Describe the following with examples: i. Parallel flow /execution ii. Nested flow
(5)
i. Parallel flow: Whenever multiple sets of instructions have to execute simultaneously, we can use parallel
execution. The implementation of parallel execution is dependent on underlying operating system. We
need to use parallel execution whenever two sets of instructions can be handled independently and
parallel. For optimising the memory utilisation, multiple steps may need to be performed in parallel, like
checking the current memory use, freeing the memory occupied by unused objects, prioritising the current
applications, moving the objects occupying large amount of memory out of memory, etc. Example: an
algorithm to optimise the memory utilisation. ii. Nested flow: In an algorithm, multiple steps are written
one after the other, in the order in which they should be executed. We can jump to specific statements if
that need to be executed next. Unless a jump is introduced, the algorithm continues in sequence. If we
need to repeat certain steps, we jump back to a previous step number. Example: Algorithm to check if the
given number is prime or not.
3) Sorting is the method of arranging data elements in a particular order. Discuss the advantages of Sorting
and also explain the differences between Internal and External Sorting methods.
(5)
Sorting is the technique of arranging the elements/records in a particular order or sequence. The
arrangement is most often made as ascending or descending, if there is numerical data and alphabetical, if
there is character data. The advantage of sorting is that it allows to arrange the data in a meaningful
order, but it also is a time-consuming process. Internal sorting is applied in situations where the data
elements to be sorted are small and can fit into the processor's main memory and no extra space is
required. External sorting is applied in situations where the data to be sorted is large enough to fit into the
processor's memory.

Section 1 is complete.
Please click on "Next" button to proceed.

Section - II Instructions:
- It comprises of Objective Questions Only.
Page 2 of 7

SCDL

- Total 60 marks are allotted for objective type questions.

- The objective questions are of following type and carries marks as given under.
Multiple Choice Multiple Response
Multiple Choice Single Response
True or False
Select a Blank
Match the Column
Total Questions
Total Marks

: 4 Questions - 16 Marks (Each 4 marks)

: 9 Questions - 18 Marks (Each 2 marks)
: 5 Questions - 5 Marks (Each 1 mark)
: 5 Questions - 5 Marks (Each 1 mark)
: 4 Questions - 16 Marks (Each 4 marks)
: 27
: 60

1) Which of the following is an exponential operator?

(2)
1] ^
2] %
3] ( )
4] _
2) Match the Following
(4)
1] Exponential
2] Parenthesis
3] Modulus
4] Assignment

1] ^
2] ( )
3] %
4] ==
5] +
6] -

3) The algorithm must have this feature:

(2)
1] Ineffective
2] Ambiguity
3] Infiniteness
4] Finiteness
4) Flowcharts are also called :BLANK .
(1)
1] Process flow chart
2] Data flow chart
3] Document flow chart
4] System flow chart
5) Major factor that governs the choice of an algorithm over another is the
(2)
1] Time taken by the algorithm
2] Space occupied
3] Both
4] None
Page 3 of 7

SCDL

6) It is possible that the time taken by an algorithm to sort a set of 10 numbers is more than the time taken to
sort a set of 30 numbers using Bubble Sort.
(1)
1] True
2] False
7) Match the Following
(4)
1] The worst-case runtime
complexity
2] The best-case runtime
complexity
3] The average case runtime
complexity
4] The amortised runtime
complexity

1] Maximum number of steps taken on any instance of size a

2] Minimum number of steps taken on any instance of size a
3] Average number of steps taken on any instance of size a
4] Sequence of operations applied to the input of size a and averaged
over time
5] Number of steps taken on any instance of size a
6] Number of bit levels

8) These are building blocks for efficient and logical problem solving.
(2)
1] Algorithms
2] Programs
3] Procedures
4] None of the above
9) Match the Following
(4)
1] Input
2] Output
3] Sequence of
steps
4] Data
structures

1] Must be clearly defined

2] The derived resultant
3] Various steps are involved in solving the problem
4] Storing the computation of results from various operations performed during
execution of a program
5] Used for checking complexity
6] Conditional searching

10) The implementation of parallel execution is dependent on underlying :BLANK .

(1)
1] Memory structure
2] Data structure
3] Program structure
4] Operating system
11) Searching is
(2)
1] The process of finding a particular item in a collection of items
2] The process of arranging the items in ascending order
3] The process of arranging the items in decending order
4] All of the above
12) Dynamic structures allow :
Page 4 of 7

SCDL

(2)
1] Insertion
2] Deletion
3] Modification
4] All of the above
13) Array index values are always
(2)
1] Unordred
2] Ordered
3] Both
4] None of the above
14) The complexity of binary search in worst and average cases is :BLANK for n items list.
(1)
1] O(log2n)
2] O(1)
3] O(n)
4] O(n^2)
15) :BLANK is the algorithmic process of finding a particular item.
(1)
1] Searching
2] Sorting
3] Linear search
4] Binary search
16) Match the Following
(4)
1] O(1)
2] O(log2n)
3] O(n)
4] O(n^2)

1] Best case complexity of binary search

2] Worst case complexity of binary search
3] Complexity of sequential search
4] Average case complexity of bubble sorting
5] Average case complexity of quicksort
6] Average case complexity of merge sort

17) Dynamic programming is powerful enough for designing algorithms related to optimization problems.
(1)
1] True
2] False
18) The advantage of writing pseudocodes is that it provides the advantages of an informal language like
English along with the precision of code.
(1)
1] True
2] False
19) In pseudocode, keywords should be written in capital letters.
(1)
1] True
Page 5 of 7

SCDL

2] False
20) This tool is used to represent algorithm in a pictorial format.
(2)
1] Program flow chart
2] Document flow chart
3] System flowchart
4] Data flow chart
21) Runtime complexity of a sequential searching in an array of size n is
(4)
1] Worst-case runtime complexity is O(n)
2] Best-case runtime complexity is O(1)
3] Average case runtime complexity is O(n)
4] Average case runtime complexity is O(n log n)
22) Complexity of algorithms is in general represented using
(4)
1] Work
2] Risk
3] Time
4] Cost
23) Since the order of execution cannot be defined, the dependent sets of instructions should not be placed in
parallel sets of execution.
(1)
1] True
2] False
24) Steps after :BLANK do not continue unless all the steps in forked sets are completed.
(1)
1] Join
2] Bridge
3] Fork
4] Split
25) If the list is unordered and the item is not present in the list, the comparisons used in sequential search are
(4)
1] n comparisons in best case
2] n comparisons in worst case
3] n comparisons in average case
4] 1 comparison in best case
26) Spanning trees are useful for the following reasons :
(4)
1] They can construct a sparse sub graph that provides information about the original graph
2] Assist in designing efficient routing algorithms
3] Few complex problems can be solved approximately
4] All complex problems can be solved approximately

Page 6 of 7

SCDL

27) In this sorting, the data to be sorted is held in the primary memory.
(2)
1] Bidirectional
2] Internal
3] Ordered
4] Unordered

Section 2 is complete.
Please click on "Next" button to proceed.

Page 7 of 7