Scribd
Upload
11 views3 pages

HCSCR3052T

This document outlines the examination details for the Data Structures course at St. Xavier's College, Kolkata, including instructions for answering questions, submission guidelines, and the structure of the question paper. Students are required to answer specific questions from two groups, with emphasis on handwritten submissions and clarity in scanned documents. The paper consists of various topics related to data structures, algorithms, and their implementations in C programming.

Uploaded by

shubhamshaw90000
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views3 pages

HCSCR3052T

This document outlines the examination details for the Data Structures course at St. Xavier's College, Kolkata, including instructions for answering questions, submission guidelines, and the structure of the question paper. Students are required to answer specific questions from two groups, with emphasis on handwritten submissions and clarity in scanned documents. The paper consists of various topics related to data structures, algorithms, and their implementations in C programming.

Uploaded by

shubhamshaw90000
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

ST.

XAVIER’S COLLEGE
KOLKATA
(AUTONOMOUS)

3rd SEMESTER EXAMINATION


JANUARY – FEBRUARY 2021
B.A./B.Sc.
Friday, January 15, 2021
HCSCR3052T 12:00 Noon to 2:30 PM
2 hours 30 minutes
DATA STRUCTURES
Full Marks : 50

PLEASE READ THESE INSTRUCTIONS BEFORE YOU START WRITING:


• Of the questions attempted, the answers to only the first required number of questions (as stipulated
in the question paper) will be evaluated. So please do not attempt extra questions.

• Only HAND WRITTEN answer scripts (using black or blue ink) on A4 size sheets will be
considered.
• Answer in your own words as far as practicable.
• Save the scanned pages to a single PDF file and name the document accurately i.e.
RollNo_PaperCode.PDF (example: 147_HPHCR2032T).
• Students have to write legibly their answers on A4 size sheets, scanning them and sending the entire
answer script as one PDF file to the following email address within 30 minutes of the completion
of the examination:[email protected]
• In the subject field of your email, please write “Answer Script – Roll No, Paper Code” (example:
“Answer Script – 147, HPHCR2032T”).
• The scanned answer scripts should have enough clarity to enable evaluation.
• On top of each page the following information should be entered by the student: Name, Roll
Number, Paper Code, Date, and Page Number
• No multiple submissions would be allowed.

The marks are given in brackets [ ] at the end of each question or part question.

The question paper consists of 3 pages.

2021 1
Of the questions attempted, the answers to only the first required number of
questions (as stipulated in the question paper) will be evaluated.
So, PLEASE DO NOT ATTEMPT EXTRA QUESTIONS.

GROUP A
Answer QUESTION NO. 1 and ANY ONE from the rest.

1. Answer ANY TWO of the following questions. [2×5=10]


(a) Explain the importance of Big-Oh notation used in complexity analysis.
(b) Write a C function to place the first element of an input array in such a way that all
the elements to its left are less than it and all the elements to its right are greater
than it.
(c) Discuss the demerits of a linear queue and the way these demerits are overcome
using a circular queue.

2. (a) What are the different types of linear data structures? Give proper examples to
discuss the answer.
(b) Write a C function to reverse a singly linked list. Explain the code.
(c) The running time of an algorithm is given as: T(n) = T(n/2) + 1, for n ≥ 2 and
T(n) = 1, for n = 1. Here ‘n’ is the input size. Can the time complexity of this
algorithm be logarithmic? Justify.
(d) What is a Reverse Polish Notation? Using a stack, convert the following infix
expression to its equivalent Reverse Polish Notation: (A + B – C) * (D + E / F).
[3+4+3+(1+4)=15]

3. (a) What are stable sorting and in-place sorting techniques?


(b) Write a C function to implement Shell sort algorithm.
(c) Write a C function to delete the pth node present in a doubly linked list with ‘n’
number of nodes, where n > p > 1.
(d) Is it possible to emulate the operations of a stack using linear queue? You may
consider more than one linear queue. Discuss. [3+5+4+3=15]

GROUP B
Answer QUESTION NO. 4 and ANY ONE from the rest.

4. Answer ANY TWO of the following questions. [2×5=10]


(a) Define data structure. Suppose a multidimensional array MA is declared using
MA(2:6,-1:4,:5). Programming language stores MA in the memory in the row-major
order and Base(MA) = 4000 and W = 4 words/memory cell. Calculate the address of
of the element MA[4,4,4]. [1+4=5]

(b) How many different types of binary trees can be developed by n nodes? Draw the
expression tree for the arithmetic expression: A = (2x+3y)(6a – b)3 [1+4=5]

(c) Write a C function to calculate the total number of non-terminal nodes in a BST. [5]
2021 2
5. (a) Construct a binary search tree from the following keys. Perform the inorder
traversal on the tree.
90, 36, 58, 96, 32, 92, 12, 93, 24, 97, 38, 60, 58
(b) Create a binary tree whose inorder traversals and postorder traversals are
respectively given by the following sequences of elements:
JFCIHABDGE
JFIHCGDEBA
(c) Define the heap data structure. Create a max-heap for the following set of
elements:
25, 35, 18, 9, 46, 70, 48
All the steps should be shown. [5+5+5=15]

6. (a)Define an AVL tree.


(b) What is a threaded binary tree? What are its different types? Explain with proper
examples.
(c) Define hashing technique. Write down the criteria for choosing a good hash
function. Explain any one collision resolution technique by taking a suitable
example. [2+(2+3)+(2+2+4)=15]

***************

2021 3

You might also like