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 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/Data Structure/Page 4

SIKSHAPATH Latest Questions

Pavanagg
  • 6
Pavanagg
Asked: May 7, 2022In: Data Structure

What is the time complexity to count the number of elements in the linked list?

  • 6

Que.What is the time complexity to count the number of elements in the linked list?a.O(n)b.O(1)c.O(n2)d.O(logn)

  • 1 Answer
  • 509 Views
Answer
Pavanagg
  • 5
Pavanagg
Asked: May 7, 2022In: Data Structure

Inserting an item into the stack when stack is not full is called …

  • 5

 Q.Inserting an item into the stack when stack is not full is called ___ Operation and deletion of item form the stack, when stack is not empty is called ___ operation. a.push, pop b.pop, push c.insert, delete d.delete, insert

  • 1 Answer
  • 192 Views
Answer
Pavanagg
  • 4
Pavanagg
Asked: May 7, 2022In: Data Structure

Representation of data structure in memory is known as

  • 4

Que.Representation of data structure in memory is known as: a. Recursive b. Storage Structure c. File Structure d. Abstract data type

  • 1 Answer
  • 309 Views
Answer
Pavanagg
  • 6
Pavanagg
Asked: May 7, 2022In: Data Structure

______ is not the component of data structure.

  • 6

Q._ is NOT the component of data structure.a. Operationsb. Storage Structuresc. Algorithmsd. None of the above

  • 1 Answer
  • 282 Views
Answer
Pavanagg
  • 6
Pavanagg
Asked: May 7, 2022In: Data Structure

If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively …

  • 6

If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively and each element occupies 2 bytes then the array has been stored in _________ order. a. column major b. matix major c. row major d. none of the above

ds
  • 1 Answer
  • 290 Views
Answer
billu
  • 1
billu
Asked: May 6, 2022In: Data Structure

Find the optimal solution for the following fractional Knapsack problem. …

  • 1

Find the optimal solution for the following fractional Knapsack problem. n=4, m = 60, W={40, 10, 20, 24} and P={280, 100, 120, 120}

fractional knapsack problem
  • 1 Answer
  • 647 Views
Answer
1 … 3 4 5 … 18

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