data structures & algorithms set 2 Detailed Explanation And More Example
MOST IMPORTANT computer mcq - 2 EXERCISES
The following question based on data structures & algorithms topic of computer mcq
(a) tables arrays
(b) matrix arrays
(c) both of the above
(d) none of the above
The correct answers to the above question in:
Answer: (c)
Discuss Form
Read more data structures and algorithms Based Computer Questions and Answers
Question : 1
The indirect change of the values of a variable in one module by another module is called
a) internal change
b) inter-module change
c) side effect
d) all the above
Answer »Answer: (c)
Question : 2
Linked lists are best suited for
a) relatively permanent collections of data
b) the size of the structure and the data in the structure are constantly changing
c) both of above situation
d) none of above situation
Answer »Answer: (b)
Question : 3
In a Heap tree values in a node is greater than
a) every value in left sub tree and smaller than right sub tree
b) every value in children of it
c) Both of above conditions are true
d) None of above conditions are true
Answer »Answer: (b)
Question : 4
If every node u in G is adjacent to every other node v in G, A graph is said to be
a) Isolated
b) Complete
c) Finite
d) Strongly connected
Answer »Answer: (b)
Question : 5
When representing any algebraic expression E the following 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) None of the above
Answer »Answer: (a)
Question : 6
The memory address of fifth element of an array can be calculated by the formula
a) LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array
b) LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array
c) LOC(Array[5]=Base(Array)+w(5-lower boun(D), where w is the number of words per memory cell for the array
d) None of the above
Answer »Answer: (c)
GET data structures & algorithms PRACTICE TEST EXERCISES
data structures & algorithms set 1
data structures & algorithms set 2
data structures & algorithms Shortcuts and Techniques with Examples
Verbal Reasoning
Question & Answer Quiz
Non Verbal Reasoning
Question & Answer Quiz
Quantitative Aptitude
Question & Answer Quiz
Computer MCQ
Question & Answer Quiz
General English
Question & Answer Quiz
History GK
Question & Answer Quiz
Polity GK
Question & Answer Quiz
Geography GK
Question & Answer Quiz
Economy GK
Question & Answer Quiz
General Awareness GK
Question & Answer Quiz
Recently Added Subject & Categories For All Competitive Exams
New Time and Distance Aptitude MCQ PDF for IBPS Clerk 2024
Latest Time and Distance multiple choice questions and answers with solution PDF for IBPS Clerk Prelims 2024. Practice Speed Aptitude based Objective Mcq
Continue Reading »
Word Formation Objective Questions MCQs for IBPS Clerk 2024
Current year Important Objective Questions and Answers with Explanation for IBPS Clerk Prelims 2024 exam. English Vocabulary multiple choice practice exercises
Continue Reading »
Time and work Questions with Solution PDF IBPS Clerk 2024
Free Time and Work Quants Aptitude concepts based Multiple Choice Questions and Answers Practice Test, Downloadable Quiz PDF for IBPS Clerk Prelims 2024 Exam
Continue Reading »
Series Completion Questions & Answers PDF IBPS Clerk 2024
Top Alphabet Number Series Completion based Verbal Reasoning Multiple choice questions with answers PDF, & Free IBPS Mock tests For IBPS Clerk Prelims 2024
Continue Reading »