C - SIKSHAPATH

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.

Search

Ask A Question

0

_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)

0

DS Question

0

_sah_itya

Asked: October 31, 2021In: Data Structure

Write a top-level program for creating a GRAPH instance and running both Prim’s and Kruskal’s algorithms on it, and printing out the respective MSTs returned, along with the total cost and runtime (in milliseconds) for each one. The input to this top-level program should be an n × n cost matrix for a graph, n being the number of vertices (assume the diagonal elements will always be 0, and elements corresponding to unconnected vertices will be set to −1); this can be read in from a text file. A sample input file is provided at http://web.iitd.ac.in/~sumeet/input_graph.txt, which corresponds to the graph depicted.

0

Assignment Question

0

Bluedragon

Asked: October 30, 2021In: DBMS

Identify the candidate key for R and highest normal form-Dbms

0

Given relation R (A,B,C,D) and the following FD’s. Identify the candidate key for R and highest normal form C->D, C->A, B->C

1 2