CT Week 5 Graded Assignments IIT Madras

Computational Thinking week 5 graded assignment Complete Solutions Are Discussed In This Blog. We Hope This Might Help You All In Matching Answers . Or For Some Others Reasons If Not Able To Complete Graded Assignments

1. What will be the value of mList at the end of the execution of the given pseudocode?

 
L = [[0, 210], [1, 198], [2, 188], [3, 173], [4, 240]]
mList = []
foreach element in L{
    mList = mList ++ [last(element)]
}

[0, 210, 1, 198, 2, 188, 3, 173, 4, 240]

[0, 1, 2, 3, 4]

[[0, 210], [1, 198], [2, 188], [3, 173], [4, 240]]

[210, 198, 188, 173, 240]

No, the answer is incorrect.
Score: 0

Accepted Answers:

[210, 198, 188, 173, 240]

2 points

2.What will be the value of mList at the end of the execution of the given pseudocode?

 
L = [[0, 210, 78], [1, 198, 91], [2, 188, 77], [3, 173, 78], [4, 240, 89]]
mList = []
foreach element in L{
    mList = mList ++ [last(init(element))]
}

[0, 210, 1, 198, 2, 188, 3, 173, 4, 240]

[0, 1, 2, 3, 4]

[[0, 210], [1, 198], [2, 188], [3, 173], [4, 240]]

[210, 198, 188, 173, 240]

No, the answer is incorrect.
Score: 0

Accepted Answers:

[210, 198, 188, 173, 240]

3.Let N be a list of first 50 positive integers (i.e., N = [1, 2, 3, ……, 49, 50]). What will be the value of count at the end of the execution of the given pseudocode? (NAT)

 
 
 
 
count = 0
A = someList(N)
B = someList(rest(N))
foreach Y in A{
    foreach Z in B{
        if(Z == Y){
            count = count + 1
        }
    }
}
Procedure someList(X)
    outlist = [], newList = X
    while(length(newList) > 0){
        outlist = outlist ++ [first(newList)]
        newList = rest(rest(newList))
    }
    return(outlist)
End someList
 

No, the answer is incorrect.
Score: 0

Accepted Answers:

(Type: Numeric) 0

3 points

Question (4-5)

Consider the procedure given below. If L1 and L2 are two lists, and L = eliminate(L1, L2), then answer the following questions.

 
 
 
 
 
Procedure eliminate(L1, L2)
    L3 = [], Found = False
    foreach i in L1{
        foreach j in L2{
            if(i == j){
                Found == True
            }
        }
        if(not Found){
            L3 = L3 ++ [i]
        }
        Found = False
    }
    return(L3)
End eliminate
 

4 points

4.Choose the correct options(s) regarding L. It is a Multiple Select Question (MSQ).

It will contain all the elements of L2 that are not present in L1

It will contain all the elements of L1 that are not present in L2

It will contain all the elements common to L1 and L2

It will contain the elements present in L1 or L2 but not both

No, the answer is incorrect.
Score: 0

Accepted Answers:

It will contain all the elements of L1 that are not present in L2

3 points

5.Which of the following condition(s) is/are always True? It is a Multiple Select Question (MSQ).

length(L1) – length(L2) = Length(L)

length(L1) > length(L2)

length(L1) >= length(L)

length(L2) <= length(L)

No, the answer is incorrect.
Score: 0

Accepted Answers:

length(L1) >= length(L)

5 points

6.A word is said to be perfect if no letter is repeated. Let isPerfect be a procedure that takes a row X in the “Words” table as input and returns True if the word in row X is a perfect word otherwise returns False. Choose the correct implementation of the procedure isPerfect.

 
 
 
 
 
Procedure isPerfect(X)
    C = []
    i = 1
    while(i <= X.LetterCount){
        A = ith letter in X.Word
        if(member(C,A)){
            return(False)
        }
        else{
            return(True)
        }
        i = i + 1
    }
End isPerfect
 

 
 
 
 
 
Procedure isPerfect(X)
    C = []
    i = 1
    while(i <= X.LetterCount){
        A = ith letter in X.Word
        if(member(C,A)){
            return(False)
        }
        else{
            C = C ++ [A]
        }
        i = i + 1
    }
    return(True)
End isPerfect
 

 
 
 
 
 
Procedure isPerfect(X)
    C = []
    i = 1
    while(i <= X.LetterCount){
        A = ith letter in X.Word
        if(member(C,A)){
            C = C ++ [A]
        }
        else{
            return(False)
        }
        i = i + 1
    }
    return(True)
End isPerfect
 

 
 
 
 
 
Procedure isPerfect(X)
    C = []
    i = 1
    while(i <= X.LetterCount){
        A = ith letter in X.Word
        if(member(C,A)){
            return(True)
        }
        else{
            C = C ++ [A]
        }
        i = i + 1
    }
    return(False)
End isPerfect
 

No, the answer is incorrect.
Score: 0

Accepted Answers:

 
 
 
 
 
Procedure isPerfect(X)
    C = []
    i = 1
    while(i <= X.LetterCount){
        A = ith letter in X.Word
        if(member(C,A)){
            return(False)
        }
        else{
            C = C ++ [A]
        }
        i = i + 1
    }
    return(True)
End isPerfect
 

7.The given pseudocode is executed using a dataset having the same fields as the “Words” dataset, and contains the following words –

“I ordered this product from Gitark. I am very happy to share my review regarding this awesome product. It is not only nice to use, but also has a very cool look. I think this is the best product which can be bought in this price range. ”

Consider the following information:

1. unique(L) returns a list of unique elements of list L. For example unique([“think”, “like”, “toppers”, “think”]) will return [“think”, “like”, “toppers”].

2. comNo(L1, L2) returns the number of common elements in lists L1 and L2.

3. Ignore the upper and lower case, and punctuation symbols while comparing with other words

 
 
 
 
positiveList = [“happy”, “awesome”, “nice”, “fine”, “best”, “cool”]
posSen = 0, L = []
while(Table 1 has more rows){
    Read the first row X in Table 1
    L = L ++ [X.Word]
    if(X.Word ends with full stop){
        L = unique(L)
        posCount = comNo(positiveList, L)
        if(posCount >= 2){
            posSen = posSen + 1
        }
        L = []
    }
    Move X to Table 2
}
 

What will be the value of posSen at the end of the execution of the above pseudocode?

No, the answer is incorrect.
Score: 0

Accepted Answers:

(Type: Numeric) 2

5 points

6 points

8.Mona tells Sona that at least 50 percent of sentences have nouns just after an adjective. Sona writes the following pseudocode to find if Mona is right or not. At the end of the execution of the pseudocode given below, A stores True if Mona is right otherwise False. But Sona might have made mistakes in one or more lines. Identify such lines (if any). It is a Multiple Select Question (MSQ). Assume that there is at least one adjective in every sentence.

 
 
 
 
A = False, trueCount = 0, totalCount = 0, posList = []
while(Table 1 has more rows){
    Read the first row X in Table 1
    posList = posList ++ [X.PartOfSpeech]
    if(X.Word ends with a full stop){
        if(isTrue(posList) == 0){
            trueCount = trueCount ++ [1]
        }
        else{
            totalCount = totalCount + 1
        }
        posList = []
    }
    Move X to Table 2
}
if(trueCount / totalCount >= 0.5){
    A = True
}
Procedure isTrue(L)
    count = 0
    while(length(L) >= 2){
        if(first(L) == "Adjective"){
            count = count + 1
            if(first(rest(L)) == "Noun"{
                count = count - 1
            }   
        }
        L = rest(L)
    }
    return(count)
End isTrue
 

Line 4: Invalid addition operation for appending in posList

Line 7: Invalid increment of trueCount

Line 9 – 11: These three lines should be replaced by

 
totalCount = totalCount + 1

Line 26: The current statement should be replaced by

 
count = count + 1

No mistakes

No, the answer is incorrect.
Score: 0

Accepted Answers:

Line 7: Invalid increment of trueCount

Line 9 – 11: These three lines should be replaced by

 
totalCount = totalCount + 1

QUESTION 9-10

Let a and b be positive integers. Procedure remainder(a, b) returns remainder if a is divided by b.

 
 
 
 
Procedure doSomething(X)
    j = 2, Flag = True
    if(X == 1){
        return(False)
    }
    while(j < X){
        if(remainder(X, j) == 0){
            Flag = False
            exitloop
        }
        j = j + 1
    }
    return(Flag)
End doSomething
 

5 points

9.When will procedure doSomething(X) return True?

X is a prime number

X is an even number

X is an odd number

X is more than 1

No, the answer is incorrect.
Score: 0

Accepted Answers:

X is a prime number

5 points

10.Consider the procedure discussed above. What will be the value of M at the end of the execution of the given pseudocode below?

 
 
 
 
L = [6, 10, 11, 23, 7, 50]
M = []
position = 1
foreach element in L{
    if(doSomething(position) and doSomething(element)){
        M = M ++ [element]
    }
    position = position + 1
}
 

M = [11, 7]

M = [11, 23, 7]

M = [11]

M = [23, 7]

No, the answer is incorrect.
Score: 0

Accepted Answers:

M = [11, 7]

CT Week 5 Graded Assignments IIT Madras

1. What will be the value of mList at the end of the execution of the given pseudocode?

No, the answer is incorrect.Score: 0

Accepted Answers:

2.What will be the value of mList at the end of the execution of the given pseudocode?

No, the answer is incorrect.Score: 0

Accepted Answers:

3.Let N be a list of first 50 positive integers (i.e., N = [1, 2, 3, ……, 49, 50]). What will be the value of count at the end of the execution of the given pseudocode? (NAT)

No, the answer is incorrect.Score: 0

Accepted Answers:

4.Choose the correct options(s) regarding L. It is a Multiple Select Question (MSQ).

No, the answer is incorrect.Score: 0

Accepted Answers:

5.Which of the following condition(s) is/are always True? It is a Multiple Select Question (MSQ).

No, the answer is incorrect.Score: 0

Accepted Answers:

6.A word is said to be perfect if no letter is repeated. Let isPerfect be a procedure that takes a row X in the “Words” table as input and returns True if the word in row X is a perfect word otherwise returns False. Choose the correct implementation of the procedure isPerfect.

No, the answer is incorrect.Score: 0

Accepted Answers:

7.The given pseudocode is executed using a dataset having the same fields as the “Words” dataset, and contains the following words –

No, the answer is incorrect.Score: 0

Accepted Answers:

No, the answer is incorrect.Score: 0

Accepted Answers:

No, the answer is incorrect.Score: 0

Accepted Answers:

10.Consider the procedure discussed above. What will be the value of M at the end of the execution of the given pseudocode below?

No, the answer is incorrect.Score: 0

Accepted Answers:

Leave a Reply Cancel reply

No, the answer is incorrect.
Score: 0

No, the answer is incorrect.
Score: 0

No, the answer is incorrect.
Score: 0

No, the answer is incorrect.
Score: 0

No, the answer is incorrect.
Score: 0

No, the answer is incorrect.
Score: 0

No, the answer is incorrect.
Score: 0

No, the answer is incorrect.
Score: 0

No, the answer is incorrect.
Score: 0

No, the answer is incorrect.
Score: 0