English
Hindi

Question

Download Solution PDF

Consider the following postfix expression with single digit operands:

6 2 3 * / 4 2 * + 6 8 * -

The top two elements of the stack after second * is evaluated, are:

This question was previously asked in
UGC NET Computer Science (Paper 2) Dec 2018 Paper
Attempt in App
View all UGC NET Papers >
  1. 6, 3
  2. 8, 1
  3. 8, 2
  4. 6, 2

Answer (Detailed Solution Below)

Option 2 : 8, 1
Free Tests
View all Free tests >
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
50 Qs. 100 Marks 60 Mins
Start Now

Detailed Solution

Download Solution PDF

Postfix expression: 6 2 3 * / 4 2 * + 6 8 * -

Download Solution PDF
Latest UGC NET Updates

Last updated on Jun 12, 2025

-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

Exams Tests Super Practice

More Applications Questions

Q1.The postfix equivalent of the infix expression (a + b)*(c*d - e) * f/g is :
Q2.What is the postfix representation of the following infix expression? (A + B) * C – D * E / F
Q3.For implementation of recursion system uses _______ data structure.
Q4.A stack is implemented with an array of ‘A [0..N – 1]’ and a variable ‘pos’. The push and pop operations are defined by the following code. push(x)                 A[pos] ← x                 pos ← pos – 1 end push pop( )                 pos ← pos + 1                 return A[pos] end pop Which of the following will initialize an empty stack with capacity N for the above implementation?
Q5.Consider the following postfix expression with single digit operands: 6 2 3 * / 4 2 * + 6 8 * - The top two elements of the stack after second * is evaluated, are:

More Stack Questions

Q1.The postfix equivalent of the infix expression (a + b)*(c*d - e) * f/g is :
Q2.What is the result of evaluating the postfix expression “43*25* + 8 -” ? 
Q3.In a stack, we can access the element-
Q4.Which of the following is a linear data structure? 
Q5.Given an expression (A + B * D)/(E - F) + G A. The prefix notation is +/+A*DB - EFG B. The prefix expression is the reverse of the postfix expression C. The order of operands in infix expression and postfix expression are the same. D. The order of operands in infix expression, prefix expression and postfix expression are the same. Choose the most appropriate answer from the options given below: 
Q6.What would be the prefix notation for the given equation? (a+(b/c) *(d^e)-f)
Q7.What is the outcome of the prefix expression +, -, *, 3, 2, /, 8, 4, 1?
Q8.Consider the following stack implemented using stack - # define SIZE 11 Struct STACK { int arr [SIZE]; int top = -1; } What would be the maximum value of the top that does not cause the overflow of the stack?
Q9.Stack is also known as
Q10.Stack-oriented machine

More Programming and Data Structure Questions

Q1.What is the output of the following code? int i = 1 ; while ( i <= 10 ) printf ( "%d\n", i );
Q2.Which of the following is the syntax of the conditional operator in C?
Q3.Which of the following is a unary operator in C?
Q4.If a C program contains only one function, it must be __________.
Q5.Which operator is used for bitwise OR in C?
Q6.What is the purpose of the sizeof operator in C?
Q7.Which of the following functions is used to find the length of a string in C?
Q8.The ternary operator can be used as a replacement for which loop/statement?
Q9.What is the limitation of the conditional operator (? :) in C?
Q10.What is a recursive function?
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
support@testbook.com
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Hot Links： teen patti casino teen patti download real cash teen patti