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

[Solved]: Clarifications on polynomial reducibility for problems in P and NP-complete

January 28, 2017March 27, 2017 ignougroup

Problem Detail: Can I always increase the complexity of a problem via polynomial reduction? (in which case ‘reduction‘ is really a misnomer) For example, if I have a classic P problem (say, finding the smallest element in an array, by iterating Read More …

Uncategorized

[Solved]: median filter one after the other

January 28, 2017March 27, 2017 ignougroup

Problem Detail: Operate on an image by performing Median Filtering in a 3×3 window. Operate on the resulting image by performing, again, Median Filtering in a 3×3 window. Can the resulting image be obtained from a single Median filtering? my initial Read More …

Uncategorized

[Solved]: Time complexity of Depth First Search

January 28, 2017March 27, 2017 ignougroup

Problem Detail: Please forgive me for asking a novice question, but I’m a beginner at algorithms and complexities, and it’s sometimes hard to understand how the complexity for a specific algorithm has come about. I was reading the DFS algorithm from Read More …

Uncategorized

[Solved]: Finding vertices for which there either exists a path to all other vertices or other vertices have a path to them

January 28, 2017March 27, 2017 ignougroup

Problem Detail: Or in other words, find all $v in V$ such that there exists a path $forall w in V$ $v rightarrow w$ or $w rightarrow v$. This is for a directed acyclic graph. I need to find an $O(|E| Read More …

Uncategorized

[Solved]: Why is the reduction from Vertex-Cover to Subset-Sum of polynomial time?

January 28, 2017March 27, 2017 ignougroup

Problem Detail: In the standard proof why Subset-Sum is (weakly) NP-complete, one reduces Vertex Cover to Subset-Sum by using suitable numbers with O(m+n) bits (where m is the number of edges and n the number of vertices). But how can we Read More …

Uncategorized

[Solved]: Time complexity of 8-queen, by placeing one by one without attack

January 28, 2017March 27, 2017 ignougroup

Problem Detail: I am new to artificial intelligence. I have been trying to analyse the time complexity of 8-queen, by placing one by one without attack. One approach to achieve goal state is to “add a queen to any square in Read More …

Uncategorized

[Solved]: Why can’t I run a mac program natively on windows?

January 28, 2017March 27, 2017 ignougroup

Problem Detail: Basically, I believe that if you have something like a .dmg file the OS opens it with a certain program which takes the code behind it and does things to it. So why couldn’t you then take the program Read More …

Uncategorized

[Solved]: Why does the state remain unchanged in the small-step operational semantics of a while loop?

January 28, 2017March 27, 2017 ignougroup

Problem Detail: Usually I see that in the structural operational semantics representation for the while loop, the program state don’t change: $(while > B > do >S, sigma) rightarrow (if >B > then >S; (while > B > do >S) > Read More …

Uncategorized

[Solved]: How does ‘deforestation’ remove ‘trees’ from a program?

January 28, 2017March 27, 2017 ignougroup

Problem Detail: I think understand how deforestation consumes and produces a list at the same time (from a fold and an unfold function — see this good answer on CodeReview here), but when I compared that with the wikipedia entry on Read More …

Uncategorized

[Solved]: What is Simultaneous Multithreading

January 28, 2017March 27, 2017 ignougroup

Problem Detail: I come from an electronics background. I know that there are three types of implementations of multithreading (see Computer Architecture: A Quantitative Approach, 5th Edition): Fine-grain multithreading issues instructions for different threads after every cycle. Coarse-grain multithreading only switches 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