CS101 | library containing common data structures and algorithms | Learning library

I have been given the input in string format:

My goal here is to read lines from a text file, check if they are palindromes, and then write those to a completely different file.

Now the problem, as far as I can see, lies in the if statement block where I check for palindromes successfully but can't seem to write them to another file because they are stored in a variable.

When I use the BufferedWriter write method and set the parameters as an actual string with quotes, everything works.

How can I solve this?

I need to print a dictionary value that matches the input of the user. For example, if the user enters the course number CS101 the output will look like:

CS101: Lab #12 Writing Classes II

In this lab you will write three classes: Die, PairOfDice, and Player.

The Die class mimics the rolling of a die. Specifically, this class will implement the following methods:

 A default constructor initializing the number of sides of a die to 6.

 An overloaded constructor that takes an integer number of sides (assume greater than 1).

 roll which generates and returns a random number between 1 and the number of sides (inclusive).

 An accessor method to read the value of the face on the die.

 A toString method returning the string representation of the face value.

The maximum number of sides should be stored as a private constant in the Die class. Also use the Random class for the random number generator.

The PairOfDice class mimics the rolling of two dice. Specifically, this class will implement the following methods:

 A default constructor that creates and initializes the number of sides of each die to 6.

 An overloaded constructor that creates and takes two integer number of sides, one for each die.

 roll rolls each die and returns the sum.

 An accessor method to read the sum of the dice.

The Player class implements the main method which creates the dice pair and rolls them several times reporting the results.

I came across this question on an exam.

Exam question: What is the result of the following code snippet?

I am trying to solve the following problem using Ruby:

I have a requirement to generate strings with variable bits length which contain only alphanumeric characters.

Here is what I have already found:

I have the following code working fine and returning the documents. I want to search based on only one field from the document and shall return the value of that field from all the documents.

I am currently taking the Udacity CS101 course (I am a complete beginner). Here is the last quiz of lesson 2: Define a procedure, find_last, that takes as input two strings, a search string and a target string,and returns the last position in the search string where the target string appears, or -1 if there are no occurences.

Example: find_last('aaaa', 'a') returns 3.

Here is the code that I wrote:

I just started doing my bachelor thesis and what I am trying to do is to create an algorithm that will provide personalized suggestions regarding course selection based on past academic performance. I am learning and using python and till now I have created a list of courses and a list of prerequisites that looks like this:

[['CS101'], ['CS105'], ['CS106', 'CS105'], ['CS107'], ['CS130'], ['CS151', 'CS105', 'MATH101'], ['CS180'], ['CS201', 'CS151'], ['CS205', 'CS105'], ...]

So for example in order to take CS101 you do not need to have taken any other course, but for you to take CS106 you have to already have taken CS105. Now, I have to do topological sort and even though I found some code from a similar problem that was provided here in Stack Overflow, it does not work. The solution was this (I modified only the part of my_lists in order to work for my code):