Scribd
Upload
16 views1 page

Data Structures Imp

The document lists important questions related to data structures, including explanations of control structures, operations, and definitions of key terms like arrays, queues, and binary trees. It emphasizes the need to prepare these questions based on past exam papers while also suggesting further study of other topics. Additionally, it includes requests for flowcharts, diagrams, and algorithms related to various data structure concepts.

Uploaded by

hol.and.h.i.z.en.ro
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
16 views1 page

Data Structures Imp

The document lists important questions related to data structures, including explanations of control structures, operations, and definitions of key terms like arrays, queues, and binary trees. It emphasizes the need to prepare these questions based on past exam papers while also suggesting further study of other topics. Additionally, it includes requests for flowcharts, diagrams, and algorithms related to various data structure concepts.

Uploaded by

hol.and.h.i.z.en.ro
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/ 1

2 .

Data Structures important questions


(Warning : I created below important questions list based on my experience and last 5 years question papers. So don’t
expect only these questions will come in your exams. But first prepare these questions and once you will get time prepare
other topics also)
Q.10 Explain with flowchart the following control structure:
(i) Sequence logic (ii) Selection logic (iii) Iteration logic
(Q3) List any six data structure operations.
(Q2) Explain Conditional Flow and Repeatative Flow used in data structure with diagram.
(Q.38) Define the following terms with reference to tree:
(i) Root
(ii) Leaf
(iii) Sibling
(iv) Depth
(Q12.) What is a Linear Array? If lower bound is 26 and upper bound is 45, then compute length of
Array.
(Q.12) Define the following terms with respect to data structures :
(i) Array
(ii) Queue
(iii) Stack
( Q26 ) Write two features of each of data structure:
(i) Record
(ii) Array
(iii) linked list
(Q2) Define linked list. Draw and explain labelled diagram of linked list with 5 nodes.
( Q32 ) How linked list are represented in memory ?
(Q32) Explain memory representation of linked list with suitable example.
(Q.60) Draw a binary tree structure for the following expression : F = (a - b) / ((P* m) + h) (Ch. 2/Q.
60/Pg. 2-40) (Most Important)
( Q42 ) What is Binary Tree? With suitable example show the relationship between Total Number
Nodes and Depth of Binary Tree. (Most Important)
(Q38.) Explain following terms used in Binary Tree: (Most Important)
(i) Sibling
(ii) Successor
(iii) Leaf
(Q.40) What is Binary Tree? Draw the Tree diagram for the expression. B = (3R/5T)²-(R+Q³) (Most
Important)
(Q44) Explain the memory representation of Binary Tree with suitable example. (Most Important)
(Q44) Explain linked representation of binary tree in memory with suitable example. (Most Important)
(Q63) Define Binary tree. Draw a Tree diagram for following expression. Y= [(a-b-c) + (a+b-c)]³/2 (Most
Important)

Any one algorithm will come in bubble sort and Traversing linear Array
(c) What is Array ? Write an algorithm for Traversing linear Array. (Ch. 2/Q. 15/Pg. 2-10)
(Q19) Explain Bubble sort algorithm with suitable examples.

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