Sign Up

Sign In

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Sorry, you do not have permission to ask a question, You must login to ask a question.

Ask A Question

Harshdalal15

Asked: November 17, 2021In: Data Structure

Explain the terms infix expression, prefix expression, and postfix expression. Convert the following infix expressions to their postfix equivalents: (A) …

Explain the terms infix expression, prefix expression, and postfix expression. Convert the following infix expressions to their postfix equivalents: (A) ((A – B) + D / ((E + F) * G)) (B) ( A – 2 * (B ...

Harshdalal15

Asked: November 17, 2021In: Data Structure

Write a PL/SQL program to check whether a date falls on weekend i.e. SATURDAY or SUNDAY.

-1

ANAN

Asked: November 15, 2021In: Data Structure

Create a binary search tree with the input given below: 98, 2, 48, 12, 56, 32, 4, 67, 23, 87, …

-1

Create a binary search tree with the input given below: 98, 2, 48, 12, 56, 32, 4, 67, 23, 87, 23, 55, 46 (a) Insert 21, 39, 45, 54, and 63 into the tree

_sah_itya

Asked: November 14, 2021In: Data Structure

Explain the terms infix expression, prefix expression, and postfix expression. Convert the following infix expressions to their postfix equivalents: (a) A – B + C (b) A * B + C / D (c) (A – B ) + C * D / E – C (d) (A * B) + (C / D) – ( D + E)

DS Question

Nivas kumar

Asked: November 9, 2021In: Data Structure

Write a program to traverse a graph data structure using queue and stack data structure

Berlin

Asked: November 7, 2021In: Data Structure

Consider a two-dimensional array arr[20][20] which has base address = 1000 and the number of bytes per element of the array = 4. Now, compute the address of the element arr[9][6] assuming that the elements are stored in column-major order.

Consider a two-dimensional array arr[20][20] which has base address = 1000 and the number of bytes per element of the array = 4. Now, compute the address of the element arr[9][6] assuming that the elements are stored in column-major order.

1 … 11 12 13 … 18

Sign Up

Sign In

Forgot Password

SIKSHAPATH Latest Questions

Explain the terms infix expression, prefix expression, and postfix expression. Convert the following infix expressions to their postfix equivalents: (A) …

Write a PL/SQL program to check whether a date falls on weekend i.e. SATURDAY or SUNDAY.

Create a binary search tree with the input given below: 98, 2, 48, 12, 56, 32, 4, 67, 23, 87, …

Explain the terms infix expression, prefix expression, and postfix expression. Convert the following infix expressions to their postfix equivalents: (a) A – B + C (b) A * B + C / D (c) (A – B ) + C * D / E – C (d) (A * B) + (C / D) – ( D + E)

Write a program to traverse a graph data structure using queue and stack data structure

Consider a two-dimensional array arr[20][20] which has base address = 1000 and the number of bytes per element of the array = 4. Now, compute the address of the element arr[9][6] assuming that the elements are stored in column-major order.