Scribd
Upload
13 views3 pages

II - IA-DS - Scheme and Solution

Data Structure Paper and Solution

Uploaded by

mdiliyazcs_735857212
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
13 views3 pages

II - IA-DS - Scheme and Solution

Data Structure Paper and Solution

Uploaded by

mdiliyazcs_735857212
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

USN 1 R L Subject Code BCS304

Sri Devaraj Urs Educational Trust (R.)


R. L. JALAPPA INSTITUTE OF TECHNOLOGY
(Approved by AICTE, New Delhi & Affiliated to VTU, Belagavi)
Kodigehalli, Doddaballapur- 561 203
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Continuous Internal Evaluation – II (Scheme and Solution )
CIE II
Subject: Data Structures and Applications
Semester III
Section A&B Faculty Name: Vinaykumar Y B & Iliyaz Pasha M

Q. No Questions Marks
Writing any four difference between ordinary queue and circular queue.
Writing c function to implement following 4M

6M

1 a)

Page 1 of 3
USN 1 R L Subject Code BCS304

5M
b)

Types of Binary Trees


• Strictly Binary Tree 3M
• Complete Binary Tree
• Almost complete Binary Tree
• Right Skewed BT
a)
• Left Skewed BT
• Extended Binary Tree
• Binary Search Tree(BST)
7M
Explain each with example.
A linked list is a data structure which is collection of zero or more nodes where each node is
1M
connected to one or more nodes.

4M
b)

PART B
Definition of Double linked list
1M
3 a) C funtion to insert node at rear end deleted node at font end in Double linked list
4M

Page 2 of 3
USN 1 R L Subject Code BCS304

(i) Array Representation.

2M

(ii) Linked List Representation

3M

b)

OR
Inorder - I-D-J-B-F-A-G-K-C-H
preorder - A-B-D-I-J-F-C-G-K-H
a) 5M
postorder - I-J-D-F-B-K-G-H-C-A

Binary tree is a special type of tree data structure in which every node can have a maximum of 2 children. 1M
4 • One is known as left child and
• The other is known as right child
b) 4M
Depth- In a tree data structure, the total number of edges from root node to a particular node.
Height- In a tree data structure, the total number of edges from leaf node to a particular node in the longest
path.
Degree of a node- In a tree data structure, the total number of children of a node. With examples.

Prepared By Verified by Department IQAC Approved by HoD


Co-ordinator

Page 3 of 3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy