Balanced Parenthesis Multiple Choice Questions and Answers (MCQs)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Balanced Parenthesis”. 1. What is the time complexity of balancing parentheses algorithm? a) O (N) b) O (N log N) c) O (M log N) d) O (N2) 2. Which application of stack is used to ensure that the pair … Read more

advertisement

Data Structure Questions and Answers – Reverse a Word using Stack

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Reverse a Word using Stack”. 1. Reversing a word using stack can be used to find if the given word is a palindrome or not. a) True b) False 2. Which is the most appropriate data structure for reversing a … Read more

advertisement

Data Structure Questions and Answers – Towers of Hanoi

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Towers of Hanoi”. 1. The optimal data structure used to solve Tower of Hanoi is _________ a) Tree b) Heap c) Priority queue d) Stack 2. Select the appropriate code for the recursive Tower of Hanoi problem.(n is the number of disks) … Read more

advertisement

Postfix to Infix Conversion Multiple Choice Questions and Answers (MCQs)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Postfix to Infix Conversion”. 1. Which of the following data structure is used to convert postfix expression to infix expression? a) Stack b) Queue c) Linked List d) Heap 2. The postfix expression abc+de/*- is equivalent to which of the … Read more

advertisement

Prefix to Infix Conversion Multiple Choice Questions and Answers (MCQs)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Prefix to Infix Conversion”. 1. What would be the solution to the given prefix notation? – + 5 / 10 5 5 a) 2 b) 5 c) 10 d) 7 2. What would be the solution to the given prefix … Read more

advertisement

Infix to Postfix Conversion Multiple Choice Questions and Answers (MCQs)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Infix to Postfix Conversion”. 1. When an operand is read, which of the following is done? a) It is placed on to the output b) It is placed in operator stack c) It is ignored d) Operator stack is emptied … Read more

advertisement

Infix to Prefix Conversion Multiple Choice Questions and Answers (MCQs)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Infix to Prefix Conversion”. 1. What data structure is used when converting an infix notation to prefix notation? a) Stack b) Queue c) B-Trees d) Linked-list 2. What would be the Prefix notation for the given equation? A+(B*C) a) +A*CB … Read more

advertisement

Evaluation of a Postfix Expression Multiple Choice Questions and Answers (MCQs)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Evaluation of a Postfix Expression”. 1. What is the other name for a postfix expression? a) Normal polish Notation b) Reverse polish Notation c) Warsaw notation d) Infix notation 2. Which of the following is an example for a postfix … Read more

advertisement

Evaluation of a Prefix Expression Multiple Choice Questions and Answers (MCQs)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Evaluation of a Prefix Expression”. 1. How many stacks are required for evaluation of prefix expression? a) one b) two c) three d) four 2. While evaluating a prefix expression, the string is read from? a) left to right b) … Read more

advertisement

Data Structure Questions and Answers – Evaluation of an Infix Expression (Not Parenthesized)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Evaluation of an Infix Expression (Not Parenthesized)”. 1. How many stacks are required for applying evaluation of infix expression algorithm? a) one b) two c) three d) four 2. How many passes does the evaluation of infix expression algorithm makes … Read more

advertisement
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer & SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage, Advanced C Programming, SAN Storage Technologies, SCSI Internals & Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him @ LinkedIn | Youtube | Instagram | Facebook | Twitter