HomeEngineeringComputer ScienceData StructureConsider the usual algorithm for determining whether a sequence of par...
Consider the usual algorithm for determining whether a sequence of par...

		        
Q. Consider the usual algorithm for determining whether a sequence of parentheses is
balanced. What is the maximum number of parentheses that will appear on the stack
AT ANY ONE TIME when the algorithm analyzes: (()(())(()))
1
2
3
4

										report_problem Report 
										bookmark Save 
filter_dramaExplanation
Answer is : C

							  None.
							  
Report QuestionQuestion:  Consider the usual algorithm for determining whether a sequence of parentheses is
balanced. What is the maximum number of parentheses that will appear on the stack
AT ANY ONE TIME when the algorithm analyzes: (()(())(()))
Given Answer:  C
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
			Discussion
		
No one started the discussion yet. Break the ice and start the conversation.
Please Login to be part of the discussion.

			Similar Questions
		
1. Entries in a stack are 
A collection of stacks is sortable
Stack entries may be compared with the 
The entries are stored in a linked list
There is a Sequential entry that is one by one

										report_problem Report 
										bookmark Save 
										remove_red_eye View 
filter_dramaExplanation
Answer is : D

							  None.
							  
Report QuestionQuestion:  Entries in a stack are 
Given Answer:  D
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
2. push() and pop() functions are found in
queues
lists
stacks
trees

										report_problem Report 
										bookmark Save 
										remove_red_eye View 
filter_dramaExplanation
Answer is : C

							  None.
							  
Report QuestionQuestion:  push() and pop() functions are found in
Given Answer:  C
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
3. Post fix form of -(A + B) * C
AB + C*
ABC * +
ABC + *
AB * C +

										report_problem Report 
										bookmark Save 
										remove_red_eye View 
filter_dramaExplanation
Answer is : A

							  None.
							  
Report QuestionQuestion:  Post fix form of -(A + B) * C
Given Answer:  A
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
4. Select the code snippet which returns the top of the stack.
public int top()
{
       if(q1.size()>0)
       {
            return q1.poll();
       }
       else if(q2.size()>0)
       {
            return q2.poll();
       }
       return 0;
}
public int top()
{
       if(q1.size()==0)
       {
            return q1.peek();
       }
       else if(q2.size()==0)
       {
            return q2.peek();
       }
        return 0;
    }
public int top()
{
       if(q1.size()>0)
       {
            return q1.peek();
       }
       else if(q2.size()>0)
       {
            return q2.peek();
       }
       return 0;
}
public int top()
{
       if(q1.size()>0)
       {
            return q2.peek();
       }
       else if(q2.size()>0)
       {
            return q1.peek();
       }
       return 0;
}

										report_problem Report 
										bookmark Save 
										remove_red_eye View 
filter_dramaExplanation
Answer is : C

							  None.
							  
Report QuestionQuestion:  Select the code snippet which returns the top of the stack.
Given Answer:  C
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
5. The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is
600
350
650
588

										report_problem Report 
										bookmark Save 
										remove_red_eye View 
filter_dramaExplanation
Answer is : B

							  None.
							  
Report QuestionQuestion:  The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is
Given Answer:  B
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
			Data StructureTopics
		
		folderData Structure BasicsTotal MCQS : 128
			  
grade
 logoutView

		folderAbstract data typesTotal MCQS : 37
			  
grade
 logoutView

		folderArraysTotal MCQS : 133
			  
grade
 logoutView

		folderListsTotal MCQS : 166
			  
grade
 logoutView

		folderStacksTotal MCQS : 165
			  
grade
 logoutView

		folderQueuesTotal MCQS : 61
			  
grade
 logoutView

		folderTreesTotal MCQS : 133
			  
grade
 logoutView

		folderBinary TreesTotal MCQS : 120
			  
grade
 logoutView

		folderB TreesTotal MCQS : 7
			  
grade
 logoutView

		folderHeapsTotal MCQS : 36
			  
grade
 logoutView

		folderHash based structuresTotal MCQS : 7
			  
grade
 logoutView

		folderGraphsTotal MCQS : 175
			  
grade
 logoutView

		folderMixedTotal MCQS : 2533
			  
grade
 logoutView

		folderQueue and StructureTotal MCQS : 9
			  
grade
 logoutView

		folderArray and LinkedListTotal MCQS : 11
			  
grade
 logoutView

                  leaderboardLeaderboard
                
            Rahul Kumar
                             191 Points
                          
VIKRAM JEET
                             54 Points
                          
GEETHIKA CHOWDARY
                             53 Points
                          
sunita saini
                             52 Points
                          
Zain
                             49 Points