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]: Formal construction of PDA intersecting a DFA

February 3, 2017March 27, 2017 ignougroup

Problem Detail: Given the PDA $P = (Q_P,Sigma,Gamma_P,delta_P,F_P)$ and the DFA $D = (Q_D, Sigma, delta_D,q_D,F_D)$ What is the 6-tuple definition of the PDA such that: $L(P’) = L(P) cap L(D)$ I don’t understand what the intersection of these two FAs Read More …

Uncategorized

[Solved]: Probability that a uniformly random sequence is already sorted

February 3, 2017March 27, 2017 ignougroup

Problem Detail: Now I tried tackling this question from different perspectives (and already asked a couple of questions here and there), but perhaps only now can I formulate it well and ask you (since I have no good ideas). Let there Read More …

Uncategorized

[Solved]: Recursive function calculating number of ways to sum $a + 2 b + 3 c = x$

February 3, 2017March 27, 2017 ignougroup

Problem Detail: Using python need to code a recursive function with one input and no global integers that calculates the number of options to get $x$ using $a*1+b*2+c*3$. Say $x=3$, there are four options: $lbrace (1,1,1),(1,2),(2,1),(3)rbrace$. Asked By : yuvalz Answered By Read More …

Uncategorized

[Solved]: Calculating time complexity of a code which may be incorrect

February 3, 2017March 27, 2017 ignougroup

Problem Detail: I am a sophomore taking a course in algorithm analysis. We were asked by our professor to calculate time-complexity of several C functions, but some of them were incorrect and would result in a compile error. As far as Read More …

Uncategorized

[Solved]: Trouble understanding this dynamic programming solution

February 3, 2017March 27, 2017 ignougroup

Problem Detail: Here is the question: I have a given tree with n nodes. The task is to find the number of subtrees of the given tree with outgoing edges to its complement less than or equal to a given number Read More …

Uncategorized

[Solved]: Combine abstract factory with decorator pattern

February 3, 2017March 27, 2017 ignougroup

Problem Detail: I’m working on a simple project of software engineering that should combine two patterns. I choose Abstract Factory and Decorator patterns to modify (dynamically) objects created with the concrete Factory classes. My question is: is delegating object decorations to Read More …

Uncategorized

[Solved]: Is there an efficient algorithm for expression equivalence?

February 3, 2017March 27, 2017 ignougroup

Problem Detail: e.g. $xy+x+y=x+y(x+1)$ ? The expressions are from ordinary high-school algebra, but restricted to arithmetic addition and multiplication (e.g. $2+2=4; 2.3=6$), with no inverses, subtraction or division. Letters are variables. If it helps, we can forbid any expression representable with Read More …

Uncategorized

[Solved]: Reducing optimization problem to decision problem

February 3, 2017March 27, 2017 ignougroup

Problem Detail: I’m trying to reduce an optimization problem to a decision problem, more specifically, consider the Max-Cut problem in its decision version: Given $(G=(V,E),k)$ as input, where $G$ is an undirected weighted graph (all weights are positive integers, formally: $w: Read More …

Uncategorized

[Solved]: Optimal myopic maze solver

February 3, 2017March 27, 2017 ignougroup

Problem Detail: I was fooling around with Google Blocky’s Maze demo, and remembered the old rule that if you want to solve a maze, just keep your left hand to the wall. This works for any simple-connected maze and can be Read More …

Uncategorized

[Solved]: EXPTIME vs Super-polynomial time

February 3, 2017March 27, 2017 ignougroup

Problem Detail: It is proven by Time hierarchy theorem that EXPTIME-complete do not belong to P even if we do not know if NP belong to P. Before I read wiki, I found EXPTIME algorithm for solving 3-sat, the brute algorithm 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