# CS 100 - Lecture 002 Report

Forfatter

Mohammad Ibrahim Ali

Sidst opdateret

5 år siden

Licens

Creative Commons CC BY 4.0

Resumé

The report explains the second lecture of the CS Freshmen Lecture Series, conducted by Habib University.

Forfatter

Mohammad Ibrahim Ali

Sidst opdateret

5 år siden

Licens

Creative Commons CC BY 4.0

Resumé

The report explains the second lecture of the CS Freshmen Lecture Series, conducted by Habib University.

```
% CS-100 Fall 2019 Guest Lecture Report
% Use this template to write a 250-word (at max.) report on the guest lecture.
\documentclass{report}
\usepackage[utf8]{inputenc}
\usepackage{hyperref}
\title{Easy and Hard Problems in Computer Science} %Title must be written exactly as ifiedspec
\author{By Dr. Shahid Hussain \\ \\ Reviewed by Mohammad Ibrahim Ali} %Speaker name must be written exactly as specified
\date{2 September 2019} % Date when report was written
\begin{document}
\par
\maketitle
This report reviews the first guest lecture of the CS Freshmen Seminar, delivered by Dr Shahid Hussain, \textit{Program Director} and \textit{Assistant Professor Computer Science} at \textit{Habib University}. The lecture aimed to highlight how a computational problem is classified.
\medskip
\par
The lecturer stated that computational problems are differentiated by their level of difficulty. He gave the example of \textbf{Travelling Salesperson Problem (TSP)}, in which six points were pointed on a map. The problem was to find the shortest route to travel through these points while starting and ending at the same point. Since there was no other way except to check each route and calculating the distance or time, it concluded that the increase in the number of points could turn the problem harder. Hence, it was classified as a \textbf{hard problem}. Contrary to this, the idea of an \textbf{easy problem} was discussed, which was defined as a problem that doesn’t require more time to solve with the increase in data, as in sorting numbers.
\medskip
\par
The lecturer also highlighted some interesting facts like,
\begin{itemize}
\item Even a fast computer that could compute 1 million operations per second would require 2 million years to solve a TSP problem with 25 points.
\item Hard problems could be not-very hard, and easy problems could be not-very easy, which leads to another classification.
\end{itemize}
\medskip
\par
The lecture concluded to the idea that a programmer should be able to detect the problem as easy or hard and should prefer easy problems, to bring productivity in his work.
\bigskip
\section*{References}
\url{http://bit.ly/2lOsUYI}
\end{document}
```

We only use cookies for essential purposes and to improve your experience on our site. You can find out more in our cookie policy.