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/Computer Science/Page 90

SIKSHAPATH Latest Questions

Nivas kumar
  • 1
Nivas kumar
Asked: November 9, 2021In: Data Structure

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

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

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

journal of experimentwrite a program to traverse a graph data structure using queue and stack data structure
  • 1 Answer
  • 1k Views
Answer
Jaysingh123
  • 0
Jaysingh123
Asked: November 8, 2021In: DBMS

Consider a three-dimensional array defined as int A[2][2][3]. Calculate the number of elements in the array

  • 0

Consider a three-dimensional array defined as int A[2][2][3]. Calculate the number of elements in the array. Also, show the memory representation of the array in the row-major order and the column-major order.

  • 2 Answers
  • 108 Views
Answer
sujalkumar5499
  • 0
sujalkumar5499
Asked: November 8, 2021In: DBMS

Determine the normal Form of given Relation R(ABCDE) FDs are : AB-> C, C-> D, D-> E, E-> A, D-> B

  • 0

Determine the normal Form of given Relation   R(ABCDE) FDs are : AB-> C, C-> D, D-> E, E-> A, D-> B

  • 1 Answer
  • 116 Views
Answer
Berlin
  • 0
Berlin
Asked: November 7, 2021In: DBMS

Write a query to create a view that finds the salesman who has the customer with the highest order at least 3 times on a day.

  • 0

Write a query to create a view that finds the salesman who has the customer with the highest order at least 3 times on a day. 

  • 1 Answer
  • 324 Views
Answer
Miachel
  • 0
Miachel
Asked: November 7, 2021In: DBMS

Write a PL/SQL program to check whether a given number is positive, negative or zero.

  • 0

Write a PL/SQL program to check whether a given number is positive, negative or zero.

  • 1 Answer
  • 800 Views
Answer
Berlin
  • 0
Berlin
Asked: November 7, 2021In: DBMS

Write a query to create a view that shows the average and total orders for each salesman after his or her name. (Assume all names are unique)

  • 0

Write a query to create a view that shows the average and total orders for each salesman after his or her name. (Assume all names are unique)

averagesalesmanview
  • 1 Answer
  • 306 Views
Answer
1 … 89 90 91 … 109

Sidebar

store ads

Stats

  • Questions 1k
  • Answers 1k
  • Posts 149
  • Best Answers 89
  • 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
  • AI News: 🤝 Biden Meets Xi on AI Talks, 💡 Xavier Niel’s Advice for Europe, ♻️ Hong Kong’s Smart Bin Revolution, 🚀 AI x Huawei

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