Sign Up

Have an account? Sign In Now

Sign In

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

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

Have an account? Sign In Now

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

Forgot Password?

Need An Account, Sign Up Here
Sign InSign Up

SIKSHAPATH

SIKSHAPATH Logo SIKSHAPATH Logo

SIKSHAPATH Navigation

  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Search
Ask A Question

Mobile menu

Close
Ask A Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Home/c/Page 2

SIKSHAPATH Latest Questions

_sah_itya
  • 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

c
  • 1 Answer
  • 811 Views
Answer
_sah_itya
  • 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

c
  • 1 Answer
  • 263 Views
Answer
Bluedragon
  • 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

bb->ccc->ad) and the following fd’s. identify the candidate key for r and highest normal form c->dgiven relation r (a
  • 1 Answer
  • 49 Views
Answer
1 2

Sidebar

store ads

Stats

  • Questions 1k
  • Answers 1k
  • Posts 150
  • Best Answers 89
  • Cloud Computing Notes 101: Learn Fundamentals, Service Models, and Virtualization!
  • This Free AI Tool Translates Entire Books in Minute !
  • AI News: 🎬 Hollywood’s AI Studios, 🎓 OpenAI’s Latest Gift to Educators, 🚚 Class8 Bags $22M, 🧠 Google Gemini’s Memory Upgrade
  • AI NEWS: Legal Action Against OpenAI, $16M Paid, & Elon Musk’s Praise from Investor 🤖💰📑 | AI Boosts Cloud Seeding for Water Security 🌱💧
  • AI News: 🎬AI Video Tool Scam Exposed🤯, 🛰️ AI-Powered Drones to Ukraine 😱, Google’s $20M AI Push, Sam Altman Joins SF’s Leadership Team

Explore

  • Recent Questions
  • Questions For You
  • Answers With Time
  • Most Visited
  • New Questions
  • Recent Questions With Time

Footer

SIKSHAPATH

Helpful Links

  • Contact
  • Disclaimer
  • Privacy Policy Notice
  • TERMS OF USE
  • FAQs
  • Refund/Cancellation Policy
  • Delivery Policy for Sikshapath

Follow Us

© 2021-24 Sikshapath. All Rights Reserved