My answers Quizz - 1 - 2017 - Artificial Intellengence (S1-17_ISZC444)

Artificial Intellengence (S1-17_ISZC444)

 

A* with the heuristic h(n)=1 if n is not a goal node and h(n)=0

otherwise, is equivalent to

Select one:

BFS

Hill climbing

DFS

None of these

Feedback

Your answer is correct.

The correct answer is: BFS

For the Boolean Satisfiability Problem, we use A*, implemented thus: The problem is given in the form of CNF, wherein there are clauses which are ORs of several positive or negated variables and the Boolean expression is the AND of the clauses. Each node in the search tree will have one full assignment to all variables in it, and search progresses with one-variable-flip steps in the search tree. We do not care about uniqueness of assignment in different nodes.

An example Boolean CNF expression is: (x1ORx2¯¯¯¯¯)AND(x1¯¯¯¯¯ORx2ORx3) having 3 variables and 2 clauses.

For the heuristic function, we consider two possible heuristics, where a is the full assignment in the current node:

h1(a)= the Count of unsatisfied clauses

h2(a)=

the Ratio of the Count of unsatisfied clauses to the Maximum Number of clauses any of the variables appears in.

Which of these are adimissible?

Select one:

h2

h1

None

Both

1 variable flip can satisfy several clauses, thus the number of steps is less than h1

Feedback

Your answer is incorrect.

The correct answer is: h2

Backtracking search on the problem of deciding whether a Boolean expression is satisfiable, is

Select one or more:

Sound

None of these

Complete but not sound

Complete

Sound but not complete

Feedback

Your answer is correct.

The correct answer is: Sound, Complete

In which of the following cases of branching b and solution depth d

is BFS unusable?

Select one:

b=20,d=5

b=2,d=50

None of these

b=200,d=5

Total nodes 320Gig

Feedback

Your answer is incorrect.

The correct answer is: b=2,d=50

A chess playing agent with a bad EVAL function, losing games more often and keeping a low rating, is

Select one:

A reflex agent

Rational but dumb

Irrational

Unlucky

Feedback

Your answer is correct.

This is about the elementary notion that rationality doesn't mean brilliance.

The correct answer is: Rational but dumb

Sideways moves in hill-climbing will

Select one or more:

Escape from shoulders

Not escape from plateaux

Escape from local optima

None of the rest

Feedback

Your answer is partially correct.

You have correctly selected 1.

The correct answer is: Escape from shoulders, Not escape from plateaux

If in a finite but large search tree optimal goal states appear with a high chance among nodes, say a tenth, but only below a certain depth, then which of the following strategies will not be able to exploit their abundance?

Select one:

IDS

DFS

DLS

BFS

Feedback

Your answer is correct.

The correct answer is: BFS

Iterative deepening search with branching factor b and solution depth d, started with initial depth limit d−1

to be increased by step 1 in each deepening iteration, will search in the worst case

Select one:

2bd+bd+1−2

nodes

bd+1−1

nodes

bd

nodes

2bd+bd

nodes

Feedback

Your answer is correct.

The correct answer is: 2bd+bd+1−2

nodes

Which of the following does not fit in the notion of what can be an agent?

Select one:

Tea-Coffee Vending Machine

All of these are intelligent agents

Mobile Charger

Web Browser

Feedback

Your answer is incorrect.

The correct answer is: Mobile Charger

Suppose in a search tree with branching factor b and optimal solutions at depth d, we can always discern the best m siblings out of b

. We can make a saving of

Select one:

bd+1−1−bmd−b

(b−mb)d

md

No saving

Feedback

Your answer is incorrect.

The correct answer is: bd+1−1−bmd−b

 

How to Compare one Column to other Column contents in Excel using VBA script.... Traceability...

Sub Traceability()

Dim i As Long
Dim j As Long
Dim k As Long
Dim CheckReq As String


i = 1
j = 1
 Sheets("Req").Select
 Do While Not IsEmpty(Sheets("Req").Cells(i, 1))
 Sheets("Req").Select
 CheckReq = RTrim(Sheets("Req").Cells(i, 1))
 Sheets("Req").Rows(i & ":" & i).Select
 Selection.Copy
 Sheets("Availability").Select
 Sheets("Availability").Rows(j & ":" & j).Select
 ActiveSheet.Paste

 k = 1
 Do While Not IsEmpty(Sheets("TestSpec").Cells(k, 1))

 If (RTrim(Sheets("TestSpec").Cells(k, 1)) = CheckReq) Then
 Sheets("Availability").Select
 Sheets("Availability").Cells(j, 13) = "Available in Test Spec"
 Exit Do
 End If
 k = k + 1

 Loop



 'This below variables for Req
 j = j + 1
 i = i + 1
   
 Loop
   
End Sub

How to detect OS version in System

/*
 * Os_version.c
 *
 *  Created on: 09.02.2015
 *  Author: Karthikeyan D
 *  This C code will be useful to detect the OS version in System...
 *  It can be adopted in in various application like Installation mode selection, Directory prediction, etc...
 *
 */

# include <stdio.h>
# include <stdlib.h>
int main()
{
    // To execute system command in  C program

    system("systeminfo | findstr /C:\"OS\"");

    printf("\n@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\n");

    system(" systeminfo | findstr /B /C:\"OS Name\" /C:\"OS Version\"");

    printf("\n@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\n");

    system("systeminfo");

    return 0;
}

Round Robin Algorithm Implementation in C program

/*
 * Round_Robin_Alg.c
 *
 *  Created on: 13.01.2015
 *      Author: karthikeyan dharmalingam */

# include "main_header.h"

//Declaration part
int nRound_Robin_Algorithm_fun(void);

// Definition part
int nRound_Robin_Algorithm_fun()
{

    printf("\nInside Round robin algorithm \n");

    //Variale declaration
    int nQuantumTime;     // To ge the quantum or slice number from user
    int nProcess,nRemainingProcess;     // To ge the number of process
    int nArrivalTime[255], nBurstTime[255], nRemainingTime[255]; //To get the arrival, burst,and remaing time of process.
    int nLoop, nTime, nFlagComplete;

    printf("\nEnter the number of process \n");
    scanf("%d",&nProcess); //To get the user input for number of process
    //To update remaining process count to complete all process
    nRemainingProcess = nProcess;

    printf("Enter the Quantum/Slice size 1 <--> 255\n");
    scanf("%d",&nQuantumTime); // To get the slice value from user

    //To get the individual timing information on each process.
    for (nLoop = 0; nLoop < nProcess; nLoop++ )
    {
        printf("Enter the arrival and Burst timing for process: P%d: ",nLoop+1);
        scanf("%d",&nArrivalTime[nLoop]);
        scanf("%d",&nBurstTime[nLoop]);
        nRemainingTime[nLoop] = nBurstTime[nLoop];
    }
    printf("\nSuccessfully input received from user\n");
    //Round robin Agorithm to schedule all the process.
    for (nLoop = 0, nTime = 0; nRemainingProcess != 0;)
    {
        //Check for remaining time greater than or equals to slice.
        if(nRemainingTime[nLoop] <= nQuantumTime && nRemainingTime[nLoop] > 0 )
        {


            nTime = nTime + nRemainingTime[nLoop];
            nRemainingTime[nLoop] = 0;
            nFlagComplete = 1; //Set the flag to notice the completion
            printf("\nInside  IF \n");

        }
        //Check for remaining time lesser than slice.
        else if(nRemainingTime[nLoop] > 0)
        {
            nTime = nTime + nQuantumTime;
            nRemainingTime[nLoop] = nRemainingTime[nLoop] - nQuantumTime;
            printf("\nInside ELSE IF \n");
        }
        //process compeleted status
        if(nRemainingTime[nLoop] == 0 && nFlagComplete == 1)
        {
            nRemainingProcess--; //Reduce number of process by one.
            printf("P[%d]\t|\t%d\t|\t%d\n",nLoop+1,nTime-nArrivalTime[nLoop],nTime-nArrivalTime[nLoop]-nBurstTime[nLoop]);
            //Remove flag for uncompleted process
            nFlagComplete = 0;
        }

        if(nLoop == nProcess - 1)
        {
            nLoop  = 0;
            printf("\nInside I \n");
        }
        else if(nArrivalTime[nLoop] <= nTime)
        {
            nLoop++;
            printf("\nInside II \n");

        }else
        {
            printf("\nInside III \n");
            nLoop = 0;
        }



    }



    return 0;
}