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

SIKSHAPATH Latest Questions

Berlin
  • 0
Berlin
Asked: October 22, 2021In: DBMS

Write a query to create a view to getting a count of how many customers we have at each level of a grade.

  • 0
Write a query to create a view to getting a count of how many customers we have at each level of a grade.

Write a query to create a view to getting a count of how many customers we have at each level of a grade.

dbmsview
  • 2 Answers
  • 673 Views
Answer
shubham shrivastava
  • 0
shubham shrivastava
Asked: October 22, 2021In: DBMS

Write a program in PL/SQL to print 1st n numbers with a difference of 3 and starting from 1.

  • 0

DBMS question of 2.3 worksheet if anyone knows please help and explain it.

questions of dbms 2.3 worksheet
  • 1 Answer
  • 838 Views
Answer
Bluedragon
  • 0
Bluedragon
Asked: October 21, 2021In: Data Structure

Queue

  • 0

Write a program to calculate the number of items in a queue.

write a program to calculate the number of items in a queue
  • 1 Answer
  • 216 Views
Answer
Berlin
  • 0
Berlin
Asked: October 20, 2021In: Data Structure

Consider the graph given below. State all the simple paths from A to D, B to D, and C to D. Also, find out the in-degree and out-degree of each node. Is there any source or sink in the graph?

  • 0
Consider the graph given below. State all the simple paths from A to D, B to D, and C to D. Also, find out the in-degree and out-degree of each node. Is there any source or sink in the graph?

Consider the graph given below. State all the simple paths from A to D, B to D, and C to D. Also, find out the in-degree and out-degree of each node. Is there any source or sink in the graph?

data structuregraphsimple path
  • 1 Answer
  • 3k Views
Answer
Bluedragon
  • 0
Bluedragon
Asked: October 20, 2021In: Data Structure

Infix to prefix

  • 0

Write a program to convert the expression “a+b” into “+ab”.

write a program to convert the expression “a+b” into “ab+”.
  • 1 Answer
  • 161 Views
Answer
Berlin
  • 0
Berlin
Asked: October 20, 2021In: DBMS

Write a program in PL/SQL to FETCH multiple records and more than one columns from the same table.

  • 0

Write a program in PL/SQL to FETCH multiple records and more than one columns from the same table.

dbmsfetch multiple records
  • 1 Answer
  • 569 Views
Answer
1 … 217 218 219 … 224

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