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

Author: ignougroup

[Solved]: Sort array of 5 integers with a max of 7 compares

January 28, 2017March 27, 2017 ignougroup

Problem Detail: How can I sort a list of 5 integers such that in the worst case it takes 7 compares? I don’t care about how many other operations are performed. I don’t know anything particular about the integers. I’ve tried Read More …

Uncategorized

[Solved]: Possible to connect arbitrary number of dots without intersections?

January 28, 2017March 27, 2017 ignougroup

Problem Detail: A (now closed) question on SO made me think about the following problem: Given an arbirtary number of points (2D), draw a path that consists of straight lines between points, visits each point exactly once and does not intersect Read More …

Uncategorized

[Solved]: Linear-time algorithm to find an odd-length cycle in a directed graph

January 28, 2017March 27, 2017 ignougroup

Problem Detail:  Problem: Give a linear-time algorithm to find an odd-length (directed) cycle in a directed graph. (Exercise 3.21 of Algorithms by S. Dasgupta, C. Papadimitriou, and U. Vazirani.) The related [email protected] asks for the existence of an odd-length directed Read More …

Uncategorized

[Solved]: Undecidability of telling if a program returns true or false

January 28, 2017March 27, 2017 ignougroup

Problem Detail: Consider the problem of taking an input Turing machine and determining if the final cell is a $0$ or $1$ after computation halts. On cases where it writes something else or does not halt, you are allowed to give Read More …

Uncategorized

[Solved]: Generating inputs for random-testing graph algorithms?

January 28, 2017March 27, 2017 ignougroup

Problem Detail: When testing algorithms, a common approach is random testing: generate a significant number of inputs according to some distribution (usually uniform), run the algorithm on them and verify correctness. Modern testing frameworks can generate inputs automatically given the algorithms Read More …

Uncategorized

[Solved]: Does the DFS algorithm differentiate between an ancestor and a parent while computing back edges?

January 28, 2017March 27, 2017 ignougroup

Problem Detail: Below is the general code for DFS with logic for marking back edges and tree edges. My doubt is that back edges from a vertex go back and point to an ancestor and those which point to the parent 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

[Solved]: Is there a flaw in this Wikipedia proof of cycle property of Minimum Spanning Tree?

January 28, 2017March 27, 2017 ignougroup

Problem Detail: On wikipedia, there is a proof for the cycle property of the Minimum Spanning Tree as follows: Cycle Property: For any cycle C in the graph, if the weight of an edge e of C is larger than the 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