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]: MGU and Variable Standardization – CNF

February 8, 2017March 27, 2017 ignougroup

Problem Detail: I have been reading on converting first order logic sentences to conjunctive normal form, and then performing resolution. One of the steps of converting to CNF, is to Standardize variables: rename all variables so that each quantifier has its Read More …

Uncategorized

[Solved]: How do I classify my emulator input optimization problem, and with which algorithm should I approach it?

February 8, 2017March 27, 2017 ignougroup

Problem Detail: Due to the nature of the question, I have to include lots of background information (because my question is: how do I narrow this down?) That said, it can be summarized (to the best of my knowledge) as: What Read More …

Uncategorized

[Solved]: Maximum independent nodes subset algorithm with strong constraint

February 8, 2017March 27, 2017 ignougroup

Problem Detail: I’ve a tree with weighed nodes, the problem is to flag a subset of nodes with the following constraints: The selected nodes must be the optimal solution (maximal sum of weight). If one node is flagged no adjacent nodes Read More …

Uncategorized

[Solved]: How to build/recognise a deadlock-free order of resources

February 8, 2017March 27, 2017 ignougroup

Problem Detail: I have been faced with a problem where three concurrent processes X, Y ,Z execute three different code segments that access and update certain shared variables. Before entering the respective code segments : Process X executes the P operation Read More …

Uncategorized

[Solved]: Practical applications of Weighted Independent Set in path graph?

February 8, 2017March 27, 2017 ignougroup

Problem Detail: Consider Weighted Independent Set in a path graph, i.e., a graph where all the vertices are in a single path. Does this problem have practical applications? What are some? This problem is used in many CS courses as an Read More …

Uncategorized

[Solved]: Minimize Deterministic Finite Automata with no accepting states

February 8, 2017March 27, 2017 ignougroup

Problem Detail: I have a finite automaton with no final/accepting states, so F is empty. How do I minimize it? I got this on a test and I didn’t know how to approach the problem because the automaton had no accepting Read More …

Uncategorized

[Solved]: Hash table versus binary search lookup for unchanging data

February 8, 2017March 27, 2017 ignougroup

Problem Detail: Let’s say I have some static, unchanging data (no adds, modifies or deletes) which is looked up by a string value, and that I’m looking to minimize size in memory while also trying to minimize lookup time. It seems Read More …

Uncategorized

[Solved]: Software mutexes and consensus number 1

February 8, 2017March 27, 2017 ignougroup

Problem Detail: There are numerous possibilities to implement a software mutex using only shared memory (e.g. Dekker’s algorithm). Recently I’ve read the following from a paper “Wait-free Synchronization” by M. Herlihy: there exists no two-process consensus protocol using multireader/multiwriter atomic registers. And Read More …

Uncategorized

[Solved]: Language with $loglog n$ space complexity?

February 8, 2017March 27, 2017 ignougroup

Problem Detail: We know that every non-regular language can be recognized with $ Omega (loglog n) $ space complexity. I’m looking for an example of a language which is $ Theta (loglog n) $ space complexity (if such exists). Asked By Read More …

Uncategorized

[Solved]: randomized algorithm for checking the satisfiability of s-formulas, that outputs the correct answer with probability at least $frac{2}{3}$

February 8, 2017March 27, 2017 ignougroup

Problem Detail: I’m trying to practice myself with random algorithms. Lets call a CNF formula over n variables s-formula if it is either unsatisable or it has at least $frac{2^n}{n^{10}}$ satisfying assignments. I would like your help with show a randomized 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