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

Shortest Path on an Undirected Graph?

January 13, 2017March 15, 2018 ignougroup

Question Detail: So I thought this (though somewhat basic) question belonged here: Say I have a graph of size 100 nodes arrayed in a 10×10 pattern (think chessboard). The graph is undirected, and unweighted. Moving through the graph involves moving three Read More …

Uncategorized

Is Morse Code binary, ternary or quinary?

January 13, 2017March 15, 2018 ignougroup

Question Detail: I am reading the book: “Code: The Hidden Language of Computer Hardware and Software” and in Chapter 2 author says: Morse code is said to be a binary (literally meaning two by two) code because the components of the Read More …

Uncategorized

Convert DFA to Regular Expression

January 13, 2017March 15, 2018 ignougroup

Question Detail: In this old exam-task I don’t understand all the steps to convert the DFA below to a Regular Expression. The $q_2$ state is eliminated first. The provided solution to eliminate $q_2$ is: If we first eliminate $q_2$ we obtain Read More …

Uncategorized

How does an admissible heuristic ensure an optimal solution?

January 13, 2017 ignougroup

Question Detail: When using A* or any other best path finding algorithm we say that the heuristic used should be admissible i.e. it should never overestimate the actual solution path (moves). Can someone tell me how this is true? Please avoid Read More …

Uncategorized

Doubt regarding cache hit ratios and access time

January 13, 2017 ignougroup

Question Detail: Question 1: What is the average access time for a 3-level memory system with access time $T_1$, $2T_1$ and $3T_1$? (Hit ratio $h_1$ = $h_2$ = 0.9) The solution given is: $0.9[T_1] + 0.1(0.9[2*T_1] + 0.1[3*T_1]) = 1.11[T_1]$ (Method Read More …

Uncategorized

Selection Sort runtime in terms of Big O

January 13, 2017March 15, 2018 ignougroup

Question Detail: I’m trying to understand why the sorting algorithm Selection Sort has asymptotic runtime in $O(n^2)$. Looking at the math, the runtime is $qquad T(n) = (n-1) + (n-2) + dots + 2 + 1$. And this is stated to Read More …

Uncategorized

Deletion in min/max heaps

January 13, 2017March 15, 2018 ignougroup

Question Detail: I think I’m confused about deletion in heaps, and since I have an exam today, I’m looking for your help to correct me. I will post photos since it will makes it a bit more clear. Note(forget about deleting Read More …

Uncategorized

Why is it best to use a prime number as a mod in a hashing function?

January 12, 2017March 15, 2018 ignougroup

Question Detail: If I have a list of key values from 1 to 100 and I want to organize them in an array of 11 buckets, I’ve been taught to form a mod function $$ H = k bmod 11$$ Now Read More …

Uncategorized

What is pass-by-value-result and its advantage and disadvantage?

January 12, 2017March 15, 2018 ignougroup

Question Detail: I have searched on Google, but I can’t quite understand what is pass-by-value-result. What is the advantage and disadvantage of using pass-by-value-result? If I have a program code like this, what will be the result when parameters are passed Read More …

Uncategorized

How does increasing the page size affect the number of page faults?

January 12, 2017March 15, 2018 ignougroup

Question Detail: If we let the physical memory size remain constant, What effect does the size of the page have on the number of frames? What effect does the number of frames have on the number of page faults? Also, please 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