(A) Symmetric
(B) Reflexive
(C) Associative
(D) Transitive
Category: Data Structures Mcqs
Data Structures Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Data Structures Mcqs section will help users to prepare mcqs of Data Structures for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Data Structures portion from here.
If we have 1000 sets each containing a single different person. Which of the following relation will be true on each set:
(A) Symmetric
(B) Reflexive
(C) Transitive
(D) Associative
If there are N internal nodes in a binary tree then what will be the no. of external nodes in this binary tree?
(A) N+1
(B) N-1
(C) N+2
(D) N
If there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?
(A) N-1
(B) N+1
(C) N
(D) N+2
For compiler a postfix expression is easier to evaluate than infix expression?
(A) True
(B) False
What will be postfix expression of the following infix expression? Infix Expression : a+b*c-d.
(A) ab+c*d-
(B) abc*+d-
(C) abc+*d-
(D) abcd+*-
Which one of the following is known as “Last-In, First-Out” or LIFO Data Structure?
(A) Stack
(B) Linked list
(C) Queue
(D) Tree
A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time.
(A) True
(B) False