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

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
  • Contact
  • Delivery Policy for Sikshapath
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Contact
  • Delivery Policy for Sikshapath

Share & grow the world's knowledge!

We want to connect the people who have knowledge to the people who need it, to bring together people with different perspectives so they can understand each other better, and to empower everyone to share their knowledge.

Create A New Account
What's your question?
Follow us on Social Media
telegram instagram

SIKSHAPATH Latest Questions

JonSnow07
  • 0
JonSnow07
Asked: November 12, 2022In: University

Web and Mobile  Security worksheet All worksheet 1 to 10

  • 0

Web and Mobile  Security worksheet All worksheet 1 to 10

all worksheetcu worksheetweb mobile and security
  • 1 Answer
  • 30 Views
  • 0 Followers
Answer
Ankit kumarr
  • 0
Ankit kumarr
Asked: November 9, 2022In: Java

Create a student class object array of size four having …

  • 0

Create a student class object array of size four having attributes name, designation and salary. Let the student class have appropriate getter/setters methods for accessing these attributes. Initialize these attributes through the setter methods. Store this object into a file ...Read more

  • 1 Answer
  • 29 Views
  • 0 Followers
Answer
practice503
  • 0
practice503
Asked: October 23, 2022In: Data Structure

Find minimum spanning tree using prim and kruskal’s algorithm:

  • 0

Find minimum spanning tree using prim and kruskal’s algorithm:

assignmentdaa
  • 0 Answers
  • 18 Views
  • 0 Followers
Answer
practice503
  • 0
practice503
Asked: October 23, 2022In: Data Structure

Which algorithm is more efficient in constructing the minimum spanning …

  • 0

Which algorithm is more efficient in constructing the minimum spanning tree of a given graph:  Prim’s Algorithm or Kruskal’s Algorithm and why?

assignmentdaa
  • 1 Answer
  • 17 Views
  • 0 Followers
Answer
practice503
  • 0
practice503
Asked: October 23, 2022In: Data Structure

Analyse the algorithm (in terms of both time and space) …

  • 0

Analyse the algorithm (in terms of both time and space) of subset sum problem using dynamic programming technique. Also write down the part of mentioned algorithm that contributes most towards the time and space complexity.

assignmentdaa
  • 0 Answers
  • 19 Views
  • 0 Followers
Answer
practice503
  • 0
practice503
Asked: October 23, 2022In: Data Structure

A networking company uses a compression technique to encode the …

  • 0

A networking company uses a compression technique to encode the message before transmitting over the network. Suppose the message contains the following characters with their frequency: Read more

assignmentdaa
  • 0 Answers
  • 27 Views
  • 0 Followers
Answer
practice503
  • 0
practice503
Asked: October 23, 2022In: Data Structure

Solve the activity selection problem by sorting the activities according …

  • 0

Solve the activity selection problem by sorting the activities according to increasing finish times:

assignmentdaa
  • 0 Answers
  • 13 Views
  • 0 Followers
Answer
practice503
  • 0
practice503
Asked: October 23, 2022In: Data Structure

Solve using fractional knapsack: M=20, n=4 P= (3, 10, 15, …

  • 0

Solve using fractional knapsack: M=20, n=4 P= (3, 10, 15, 5) W= (5, 13, 12, 8).

assignmentdaa
  • 0 Answers
  • 10 Views
  • 0 Followers
Answer
practice503
  • 0
practice503
Asked: October 23, 2022In: Data Structure

For each of following Divide and Conquer algorithms, state the …

  • 0

For each of following Divide and Conquer algorithms, state the corresponding recurrence relation, and state a runtime bound (using O) (you do not need to show work for solving the runtime recurrence). A. If you solve 7 sub-problems of size n /7 ...Read more

asssigmentdaa
  • 0 Answers
  • 17 Views
  • 0 Followers
Answer
ADMIN 2
  • 0
ADMIN 2
Asked: October 19, 2022

Problem Solving Through Programming In C Week 12 Assignment Answers 2022

  • 0

Problem Solving through Programming In C week 12 assignment answers are given below:Read more

  • 1 Answer
  • 100 Views
  • 0 Followers
Answer
Load More Questions

Sidebar

Stats

  • Questions 1k
  • Answers 1k
  • Posts 138
  • Best Answers 65
  • Solution Revealed: NPTEL Programming in Java Week 1 Assignment 2023
  • NPTEL Joy of Computing Using Python Assignment Answers Week 1 2023
  • NPTEL Cloud Computing Assignment 1 Answers 2023
  • NPTEL An Introduction to Artificial Intelligence Week 1 Assignment Answers 2023
  • Ethical Hacking NPTEL Assignment 1 Answers 2023

Popular Questions

  • I'M ADMIN

    Internshala ethical hacking final test answers: Question sequence differs but ...

    • 6 Answers
  • AK

    You have a green lottery ticket, with ints a, b, ...

    • 4 Answers
  • mj

    Solve by Gauss Elimination Method 5x+y+z+w=4 ,x+7y+z+w=12 , x+y+6z+w=-5, x+y+z+4w=-6

    • 3 Answers

Explore

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

Footer

Helpful Links

  • Disclaimer
  • Privacy Policy Notice
  • TERMS OF USE
  • FAQs
  • Refund/Cancellation Policy

Follow

© 2021-2022 Sikshapath. All Rights Reserved