Scribd
Upload
11 views2 pages

Bscit 203

Uploaded by

shubhpatil945
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 views2 pages

Bscit 203

Uploaded by

shubhpatil945
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/ 2

Dr.

Babasaheb Ambedkar Open University


Term End Examination February – 2024
Course : BSCIT Date : 12/03/2024
Subject Code : BSCIT-203 Time : 12:45pm to 03:00pm
Subject Name : Data Structure Duration : 02.15 Hours
Max. Marks : 70

Section A
Answer the following (Attempt any three) (30)
1. Explain Representation methods of a graph.
2. List and explain different types of link lists.
3. Explain applications of stack and queue
4. What is Binary Search Tree? Explain insertion, deletion and traversal operations on
binary search tree data structure with suitable example
5. Explain Kruskal’s Algorithm

Section B
Answer the following (Attempt any four) (20)
1. Explain Breadth First Search with suitable example
2. Differentiate between Linear and Binary Search
3. Explain Bubble sorting in brief.
4. Write out short note on File Operations
5. List and explain different types of data structures in brief.
6. What is Sparce Matrix? Explain in brief.

Section C
Part – A (Multiple Choice Questions) (10)
1 Implementation of abstract data types are called _______.
A User defined data types B Built-in data type
C Primitive data types D Data structures
2 Array index in C-Language always starts with ______.
A 1 B 0
C Size-1 D -1
3 In __________ array operation we need to move all data elements towards left side
by adding one zero as a last element.
A Deletion B Insertion
C Searching D Mapping
4 How many for loops (nested) is used, to multiply 2 Matrices?
A 4 B 2
C 3 D 5
5 In a singly Link-List each node has an address of _______ node.
A First B Last
C Previous D Next
6 In _______ link-list, we do not need extra pointer variable to keep track of previous
node in the delnode () function.
A Singly B Doubly
C Circular D All of these
7 Overflow condition for the stack has to check in ______ function.
A Push B Peep
C Pop D None of these
8 Postfix of the Infix expression: A * B – (C + D) + E is ___________.
A AB*CD+-E+ B AB*CD-+E+
C ABCDE*-++ D CD+B-A*E+
9 A Queue is a _________ data structure.
A LIFO B FIFO
C FILO D LILO
10 _______ is a memory efficient version of queue.
A Stack B Tree
C Circular Queue D Graph

Part – B (Do as Directed) (10)


State whether the following statements are true or false
1 Queue cannot be implemented using array or Link-List data structures.
2 A Tree is a linear data structure.
3 All those nodes of the tree having at least one child node are called internal nodes of
the tree.
4 The height of a particular node is the number of edges presented in the longest path
connecting that particular node to its leaf node.
5 Binary tree is a tree data structure in which all node must have at least two children.
6 A complete binary tree is a binary tree in which all the levels are completely filled
except possibly the lowest one, which is filled from the left.
7 In the pre-order traversal, you need to visit Left sub-tree first then you need to visit
Root node and finally you need to visit Right sub-tree.
8 The name AVL-Tree is given from its inventors Adelson,Velsky and Landis.
9 Directed Graph is a graph in which edges of a graph do represent direction.
10 Traversal methods for graph are DFS and BFS.

*****

You might also like