11 views

Uploaded by Abinash Behera

- Cau truc Du Lieu & Giai Thuat
- Libro7
- Trees
- Lab 2. Binomial Heaps and Fibonacci Heaps
- AI file
- INDEX SORT
- Dynamic Distribution Approach for Construvting Decision Trees
- Copy - Move Image Forgery Detection in a Parallel Environment
- Fault Trees
- MC0080
- Data Structure Interview
- Answer All the Questions
- HeapAndHeapsort PDF
- 1sharon4-1
- Bst
- Ae Chapter2 Math
- Heap
- Lecture 9 h.bst
- Lecture 06
- 20160914_Transform_and_Conquer_2.pdf

You are on page 1of 5

1. Which data structure allows deleting data elements from front and inserting at

rear?

a. Stacks

b. Queues

c. Deques

d. Binary search tree

2. Identify the data structure which allows deletions at both ends of the list but

insertion at only one end.

a. Input-restricted deque

b. Output-restricted deque

c. Priority queues

d. None of above

a. Strings

b. Lists

c. Stacks

d. None of above

a. Strings

b. Lists

c. Queues

d. All of above

suitable?

a. Deque

b. Priority

c. Tree

d. All of above

6. A binary tree whose every node has either zero or two children is called

a. Complete binary tree

b. Binary search tree

c. Extended binary tree

d. None of above

a. Dn = n log2n

b. Dn = n log2n+1

c. Dn = log2n

d. Dn = log2n+1

8. When representing any algebraic expression E which uses only binary operations

in a 2-tree,

a. the variable in E will appear as external nodes and operations in internal nodes

b. the operations in E will appear as external nodes and variables in internal nodes

c. the variables and operations in E will appear only in internal nodes

d. the variables and operations in E will appear only in external nodes

a. by replacing each empty sub tree by a new internal node

b. by inserting an internal nodes for non-empty node

c. by inserting an external nodes for non-empty node

d. by replacing each empty sub tree by a new external node

10. When converting binary tree into extended binary tree, all the original nodes in

binary tree are

a. internal nodes on extended tree

b. external nodes on extended tree

c. vanished on extended tree

d. None of above

11. The post order traversal of a binary tree is DEBFCA. Find out the pre order

traversal

a. ABFCDE

b. ADBFEC

c. ABDECF

d. ABDCEF

a. Bubble sort

b. Insertion sort

c. Quick sort

d. All of above

a. Sub algorithm

b. Recursion

c. Polish notation

d. Traversal algorithm

14. In a binary tree, certain null entries are replaced by special pointers which point

to nodes higher in the tree for efficiency. These special pointers are called

a. Leaf

b. branch

c. path

d. thread

15. The in order traversal of tree will yield a sorted listing of elements of tree in

a. Binary trees

b. Binary search trees

c. Heaps

d. None of above

a. Values in a node is greater than every value in left sub tree and smaller than right

sub tree

b. Values in a node is greater than every value in children of it

c. Both of above conditions applies

d. None of above conditions applies

a. endpoints of e

b. adjacent nodes

c. neighbors

d. all of above

a. a tree graph

b. free tree

c. a tree

d. All of above

a. u is adjacent to v but v is not adjacent to u

b. e begins at u and ends at v

c. u is processor and v is successor

d. both b and c

a. isolated

b. complete

c. finite

d. strongly connected

Answers:

1. Which data structure allows deleting data elements from front and inserting at

rear?

b. Queues

2. Identify the data structure which allows deletions at both ends of the list but

insertion at only one end.

a. Input-restricted deque

d. None of above

d. All of above

suitable?

c. Tree

6. A binary tree whose every node has either zero or two children is called

c. Extended binary tree

d. Dn = log2n + 1

8. When representing any algebraic expression E which uses only binary operations

in a 2-tree,

a. the variable in E will appear as external nodes and operations in internal nodes

d. by replacing each empty sub tree by a new external node

10. When converting binary tree into extended binary tree, all the original nodes in

binary tree are

a. internal nodes on extended tree

11. The post order traversal of a binary tree is DEBFCA. Find out the pre order

traversal

c. ABDECF

c. Quick sort

b. Recursion

14. In a binary tree, certain null entries are replaced by special pointers which point

to nodes higher in the tree for efficiency. These special pointers are called

d. thread

15. The in order traversal of tree will yield a sorted listing of elements of tree in

b. Binary search trees

b. Values in a node is greater than every value in children of it

17. In a graph if e=[u, v], Then u and v are called

d. all of above

d. All of above

d. both b and c

b. complete

- Cau truc Du Lieu & Giai ThuatUploaded byTACOMPUTER
- Libro7Uploaded byMike Gálvez
- TreesUploaded byPrashant Sharma
- Lab 2. Binomial Heaps and Fibonacci HeapsUploaded byeu_seby_u
- AI fileUploaded byRaushanMishra
- INDEX SORTUploaded byAI Coordinator - CSC Journals
- Dynamic Distribution Approach for Construvting Decision TreesUploaded byShanti Prasad
- Copy - Move Image Forgery Detection in a Parallel EnvironmentUploaded byCS & IT
- Fault TreesUploaded byDjordje Anatasovic
- MC0080Uploaded byTamal Ghosh
- Data Structure InterviewUploaded byKumaran700
- Answer All the QuestionsUploaded bypitchrks19841
- HeapAndHeapsort PDFUploaded byLoai Labani
- 1sharon4-1Uploaded byrobinpt
- BstUploaded byRoneil
- Ae Chapter2 MathUploaded byjruan
- HeapUploaded bysumits708
- Lecture 9 h.bstUploaded byjnfz
- Lecture 06Uploaded byMrunal Ruikar
- 20160914_Transform_and_Conquer_2.pdfUploaded byFyyrree
- C23Uploaded byvijay
- lemcs1802Uploaded byHidayah Nurul Hasanah Zen
- Supplement 1 a Glossary 9 eUploaded byNahidul Alam Chowdhury
- Value of Information in DMUploaded byvivekranjan125
- lecture21.pptUploaded byAnonymous niE5VQOH
- How Do You Instantiate an Array in JavaUploaded byarpitmehta85051
- PublishedUploaded byPankaj Sethia
- New Microsoft Office Word Document (2)Uploaded bySonjoy Saha
- RFID Tag Anti-Collision Protocol Query Tree With Reversed IDsUploaded byvietbkfet
- Programming and Data Structure II - Lecture Notes, Study Materials and Important questions answersUploaded byBrainKart Com

- Surveillance RobotUploaded byAbinash Behera
- Central Motor Vehicles Rules, 1997Uploaded byAbinash Behera
- ED_CM_CN_ABUploaded byAbinash Behera
- industrial roboticsUploaded byV2
- Lecture 36Uploaded byccule
- Name ChangeUploaded byStuartRob
- Data StructuresUploaded byAbinash Behera
- Ds Objective Questions Set -1Uploaded byAbinash Behera
- FIFA, Laws of the Games (2013 14)Uploaded byTifoso Bilanciato
- introduction to energy sourceUploaded byShashwat Kanhaiya
- DS OBJECTIVE QUESTIONS SET -3.docUploaded byAbinash Behera
- InformationBrochureOJEE 2013.pdfUploaded byAbinash Behera
- Fourth Year EntcUploaded byAbinash Behera
- 2008_mech.pdfUploaded bymotuandgolu
- Non Conventional Energy SoursesUploaded byapi-3697484

- BTech Info_Tech SyllabusUploaded bynannurah
- adobe CUploaded byJitesh_Maharwa_2959
- Algorithms Chapter 1 Oct. 5 2011Uploaded bySaif Alayoub
- 4-huffman.pdfUploaded byHarshit Lalpura
- Moduri de parcurgereUploaded byAlex_GP
- Threaded Binary TreeUploaded byLn Amitav Biswas
- Amazon questions.docxUploaded bysatyam
- AlgorithmsUploaded bymuthuramrr
- Assignment IC Binary TreesUploaded byAditya Pawar
- Introduction to Data StructuresUploaded byism33
- MCA_2015.pdfUploaded byGagan Bansal
- Computer Science ISC Sample Paper 1Uploaded bysaradindu123
- Tree Traversal Without StackUploaded byRajya Vardhan Mishra
- Data StructuresUploaded byTB
- cs final 2011 v4aUploaded byapi-243009892
- Amazon InterviewUploaded byyashwanthr3
- Oraclecoding(Encrypted)Uploaded byAshish Gulshan
- Lowest Common AncestorUploaded byRaqibul Islam
- Bab 5 - TreeUploaded byVijay Fathur
- Binary TreeUploaded bynabil aldbeeb
- Data Structure and Algorithm AnalysisUploaded byAnbalagan Guru
- 2014-15-major-solUploaded byradiumtau
- Lect 8 Trees.pptxUploaded byAthanasious Ramsis
- Binary TreeUploaded byaliasadsahu9304
- 09 DS and Algorithm Session 13Uploaded byAshish Srivastava
- III - Viii Sem Reg Rr2008Uploaded by476764
- Data Structures and Algorithms Question BankUploaded byRamKrishnaMurti
- Lecture 12Uploaded byMarimuthu Muthaiyan
- Dsoop Qu AnsUploaded byKarthi Keyan Veera
- EI6001-Data Strucures and Algorithms QBUploaded byjgjeslin