Skip to content
  • [email protected]
Notice: This is not official website of IGNOU. For IGNOU website CLICK HERE

IgnouGroup

IgnouGroup Social Campus

  • Home
  • About
    • Jobs for Ignou Students
  • Online Admission
  • Products
    • Solved Assignments
    • Other Downloads
  • Blog
  • Contact
  • Ask Questions

Category: Uncategorized

Finding the maximum bandwidth along a single path in a network

January 23, 2017March 27, 2017 ignougroup

Problem Detail: I am trying to search for an algorithm that can tell me which node has the highest download (or upload) capacity given a weighted directed graph, where weights correspond to individual link bandwidths. I have looked at the maximal Read More …

Uncategorized

Is this language regular or non-regular: {ww : w ∈ {a,b}* }

January 23, 2017March 27, 2017 ignougroup

Problem Detail: This is a question from a text book that’s giving me some trouble. The question is: Determine whether or not this language is regular. Justify your answer. $$L = {ww : w in {a,b}^* }$$ I think this language Read More …

Uncategorized

Is computation expression the same as monad?

January 23, 2017March 27, 2017 ignougroup

Problem Detail: I’m still learning functional programming (with f#) and I recently started reading about computation expressions. I still don’t fully understand the concept and one thing that keeps me unsure when reading all the articles regarding monads (most of them Read More …

Uncategorized

Correctness proof of greedy algorithm for 0-1 knapsack problem

January 23, 2017March 27, 2017 ignougroup

Problem Detail: We have a 0-1 knapsack in which the increasing order of items by weight is the same as the decreasing order of items by value. Design a greedy algorithm and prove that the greedy choice guarantees an optimal solution. Read More …

Uncategorized

Why are NP-complete problems so different in terms of their approximation?

January 23, 2017March 27, 2017 ignougroup

Problem Detail: I’d like to begin the question by saying I’m a programmer, and I don’t have a lot of background in complexity theory. One thing that I’ve noticed is that while many problems are NP-complete, when extended to optimization problems, Read More …

Uncategorized

Multitape Turing machines against single tape Turing machines

January 23, 2017March 27, 2017 ignougroup

Problem Detail: Introduction: I recently learned that a multi-tape Turing Machine $text{TM}_k$ is no more “powerful” than a single tape Turing machine $text{TM}$. The proof that $text{TM}_k equiv text{TM}$ is based on the idea that a $text{TM}$ can simulate a $text{TM}_k$ Read More …

Uncategorized

the convention for declaring arrays in pseudocode

January 23, 2017March 27, 2017 ignougroup

Problem Detail: I have a very simple question. What is the right standard convention to use for declaring arrays? I understand that for a simple declaration of a variable as an integer, this is the convention: DECLARE myVar : INTEGER What Read More …

Uncategorized

Local Search vs Classical Search

January 23, 2017 ignougroup

Problem Detail: I have some questions regarding local search / optimization as explained in chapter 4 of the book : http://aima.cs.berkeley.edu/ In classical search (Chap 3), the search starts from an initial node, then the search continues based on strategies of Read More …

Uncategorized

Which algorithms are usable for heatmaps and what are their pros and cons

January 23, 2017 ignougroup

Problem Detail: This is a cross post from Stack Overflow, and DSP at Stackexchange since I cannot really decide which part of Stackexchange is most fitting. If this is the wrong place please tell me and I’ll remove the question. I Read More …

Uncategorized

Why is Relativization a barrier?

January 23, 2017 ignougroup

Problem Detail: When I was explaining the Baker-Gill-Solovay proof that there exists an oracle with which we can have, $mathsf{P} = mathsf{NP}$, and an oracle with which we can have $mathsf{P} neq mathsf{NP}$ to a friend, a question came up as Read More …

Uncategorized

Posts navigation

Older posts
Newer posts

For Assignment

Click Here Online Classes

IGNOU Exam Date Sheet

CLICK HERE For Assignment

Ask Question

Important Links


Re-Registration BCA_New 2025 Started


IGNOU hall ticket January

MCA _new Portal

BCA _New Portal

MBA Portal

 Previous Year Question Paper

Application form for Reevaluation

Recent Posts

  • IUL PHD – Entrance – Computer Application
  • Integral University Entrance Test [IUET]-2025
  • Briefly discuss the importance of Foreign Language learning. – JULY 2023 CGL ASSIGNMENTS
  • Ergänzen Sie die Lücken!
  • Ques : Describe Component Based Development

Products

  • Placeholder Reverse Withdrawal Payment ₹0.00
  • Placeholder Test 1 (Copy)
  • Placeholder Test 1
  • IGNOU MCA 5th Semester Solved Assignment December 2022-23 IGNOU MCA 5th Semester Solved Assignment December 2022-23 ₹25.00 Original price was: ₹25.00.₹20.00Current price is: ₹20.00.
  • IGNOU MCA 5th Semester Solved Assignment December 2022-23 IGNOU MCA 5th Semester Solved Assignment December 2022-23 ₹25.00 Original price was: ₹25.00.₹20.00Current price is: ₹20.00.

Categories

Archives

Services

  • About Us
  • Contact Us
  • Privacy Policy
  • Terms & Conditions
  • Exchange & Cancellation Policy

Products

  • Placeholder Reverse Withdrawal Payment ₹0.00
  • Placeholder Test 1 (Copy)
  • Placeholder Test 1

Partnership & Affiliation

  • Organic Farming
  • Festivals & Rituals
  • Indian Politics 360
  • Activity
  • Groups
  • Members
  • Register
  • About
  • Privacy Policy
  • Exchange & Cancellation Policy
  • Terms and Conditions
Copyright. All rights reserved.
Proudly powered by WordPress | Education Hub by WEN Themes
sponsored