Continuing on my series looking at some university exams, today i’m going to look at a computer science course. So this is a real exam with solutions from Cornell University and it was uploaded to their website. So the first link in the description will be a link to download this exam, and you can read through it at your own pace. It’s an introduction to computer science so it’s going to cover sort of some basic things like what is a programming language, some style and structure and then getting into some more basic algorithms and data structures. These are going to lay a ground base or a theory to write better code. It can be the difference between good and bad code, or code that’s fast to run and code that takes ages. So it’s kind of algorithms that keep you using the best practices so you can write code that’s efficient. That’s the difference between some of these theory courses in computer science that you’ll see and just trying to learn a language straight up without a bit more of this theory, is that yeah it helps you write better code. So this is an introductory course like I said which means that for someone who’s coming in to the study having already a bit of computer science knowledge, they might find it a breeze and that was what I saw happening when I took a course like this. That some people definitely found it easier than others. They found it easier than the people that hadn’t had any experience in the topic but it should be manageable for anyone if they pay attention in class and give it their best shot. So let’s have a look at what you’d be expected to do in this exam. We’ve got nine questions to do in two and a half hours. The first question deals with Big O notation which talks about how costly a certain algorithm is to implement. It gives an upper bound or a worst case scenario of the growth rate of a certain function depending on how much data you’re dealing with. It should be a reasonably straight forward question to pick out how costly some of these certain actions are. In this question we are given some functions in code and we’re asked to tell what the output is going to be. There’s kind of only a few options on what can be returned so it’s just a matter of making sure we know how to read this language. You wouldn’t have to worry about learning a whole bunch of languages, usually the language you’d see in an exam for a course like this is going to be what you’ve been learning throughout the course and what you’ve been using. So these two should be reasonably straightforward as long as you read the questions really carefully. In this question we’re looking at an algorithm specifically Dijkstra’s algorithm which concerns trying to find the shortest path between a bunch of nodes. So it’s sort of a question of if you’re trying to drop off a bunch of people at their houses, what’s going to be a good path to take to drop off those people? So in the question, which is this section, you’re sort of asked to show how you’re going to implement this algorithm and how you’re going to make updates to it, and then everything in the box is kind of an expected solution here. Obviously this is the model solution so demonstrating an understanding that you’d have a plan of implementing this algorithm, you should do all right. Then on the next page. I think these should be reasonably simple as well if you’ve paid attention during class but you’re being asked questions about spanning trees. So these are algorithms that connect a bunch of dots, so connecting a bunch of trees in a forest with let’s say the least possible amount of edges between the trees. Some of these questions are quite basic because the purpose of this exam is not for you to show that you can write complex code or long and involved work, what you’re trying to do is just show that you’ve understood the basic concepts that have gone on in class. You’re going to be tested on your ability to write more complex code in the course, but that’s going to come through things like assignments or weekly homework, something like that where you can actually have a lot more time to think and implement things the way you want to and actually like get out a lot of code and work on it for a long time. An exam is not that time, an exam has a different purpose. It’s not for you to show off your code, it’s just for you to show, yes, you’ve you’ve understood some of these basic ideas that your lecturer is trying to communicate to you. That’s why some of these exams might look easy, I don’t think that’d be the hardest part of the course, I think in computer science the hardest part of the course is doing those assignments which can be sometimes quite long and quite a lot of lines of coding. Then we’re moving on to some data structures, so these are ways that you would store data in an efficient manner. This particular question is about something called a hash table, so you’ve essentially got here eight buckets that you can put data into and in this case data is some numbers and there’s a few ways that these hash tables can work. Say you’re putting numbers into each bucket by some assignment process and this question here is asking you to show the difference between what happens if you’re trying to put two numbers into the same box. In (a) you deal with that by chaining, so you just sort of append the second number onto the end of the first one and then (b) you deal with that by linear probing, so if one box is full you move on to the next box and keep looking for boxes until you find one that’s empty and place the number in there. So different ways to deal with storing data in a table. Then we’ve got a bunch of true/false questions, some relating specifically to what would have been the programming language used in this course which looks like it was Java, and then a few more questions about algorithms and a few statements. You’ve got another big O notation down the bottom. One really useful thing in computer science is something called a binary tree and that’s what some of these questions are all about. A binary tree is something where you have say a parent node, and then you can have children coming off of that parent node so you can have one or two children and those are going to be related in some way and these binary trees are a way to organize data so that you can look up values, say the maximum or a minimum value in a set of data, they’re quite efficient at doing that. So we’ve got a bunch of questions here, again, they’re reasonably simple, you’re not being asked to write a bunch of code. You’re just being asked to understand what something like this can help you do. So just a few questions about maybe manipulating these or understanding them. This is a question where you are actually asked to write a bit of code as your answer and it might be a little bit daunting, I guess, but it’s a reasonably simple function compared to what you’ve probably done during the assignments, so it shouldn’t be too bad. This is a written exam so some people would find it weird to be writing code down with a pen and paper rather than typing it. You’ve just got to be neat with your notation but usually it’s kind of good actually to write code in an exam in this sense because if you do forget something like a semicolon, your lecture is probably going to be a bit more lenient because they understood what you meant to do. Compared to a computer who will just completely reject your answer. So I guess it has a benefit in that way. My uni where I did computer science in undergrad were phasing to not use paper exams at all and to do it all online on the computer so in that sense you would have to pay more attention to making sure the code you write in an exam is correct, but there’s benefits to both. So here yeah, we just have a few more questions about the structure of binary trees and then a final question which is maybe one of the most mathematical in here, it’s a proof by induction and again it relates to binary trees. So it again relates to the idea of efficiently dealing with data, how to sort through it, how to store it, and just how to write good code. I hope that wasn’t Scary and I hope it didn’t look too easy either, but yeah, it’s an introductory computer science course. There’s definitely a lot more advanced things you can do with this. Hopefully it was a good snippet at what you can expect, thanks for watching.

This is what a computer science exam looks like at university
Tagged on:                                                                                                                                             

100 thoughts on “This is what a computer science exam looks like at university

  • March 11, 2018 at 4:13 am
    Permalink

    Clarification: Only max 2 children in a binary tree – slip of the tongue

    Reply
  • October 24, 2018 at 6:14 am
    Permalink

    SKip to 1:48

    Reply
  • October 26, 2018 at 7:38 am
    Permalink

    Try solving IIT JAM Exam In India

    Reply
  • October 28, 2018 at 12:14 pm
    Permalink

    dataR

    Reply
  • October 31, 2018 at 9:52 am
    Permalink

    You should look at some of the papers from IIT Bombay or IISC Bangalore for CS.

    Reply
  • November 5, 2018 at 8:14 pm
    Permalink

    Your smile. FAAAAAAAAAAAK

    Reply
  • November 6, 2018 at 3:59 pm
    Permalink

    hi Tibees …..i like the way u talk…..😀

    Reply
  • November 6, 2018 at 4:01 pm
    Permalink

    Can u make videos on Dynamic Programming ?

    Reply
  • November 10, 2018 at 1:30 pm
    Permalink

    Where did you complete your graduation ?

    Reply
  • November 10, 2018 at 4:10 pm
    Permalink

    Whts your view on biology…..!???!?

    Reply
  • November 12, 2018 at 1:39 am
    Permalink

    pretty and smart 😄

    Reply
  • November 14, 2018 at 11:01 am
    Permalink

    really never saw such a beautiful genius !

    Reply
  • November 18, 2018 at 7:07 am
    Permalink

    So many "intellectuals" here. I learned all this stuff but 2 years later I've forgotten it. Why? Because I never needed to use it afterwards lol.

    Reply
  • November 19, 2018 at 5:47 pm
    Permalink

    Luckily I know what the questions are asking about and I can briefly answer them. But I haven't learnt some mathematics that are used in the questions.

    Reply
  • November 19, 2018 at 5:48 pm
    Permalink

    Nice Google shirt!

    Reply
  • November 21, 2018 at 1:07 am
    Permalink

    Are you from Australia? Cuz I heard a lot of “da ta “s. 🙂

    Reply
  • November 22, 2018 at 5:01 am
    Permalink

    Heyyy you're so beautiful

    Reply
  • November 23, 2018 at 4:52 pm
    Permalink

    Ggle

    Reply
  • November 24, 2018 at 8:50 am
    Permalink

    Damn she's cute

    Reply
  • November 24, 2018 at 12:45 pm
    Permalink

    Hey I'm in my first year of Computer science. Should show maths exams too haha

    Reply
  • November 25, 2018 at 1:50 am
    Permalink

    You are so beautiful :*

    Reply
  • November 25, 2018 at 4:15 pm
    Permalink

    How about a Mathematical Economics test? Stats.

    Reply
  • November 27, 2018 at 7:15 pm
    Permalink

    I love your t-shirt

    Reply
  • December 1, 2018 at 8:01 pm
    Permalink

    yo anyone here know how to calculate space complexity

    Reply
  • December 3, 2018 at 11:27 pm
    Permalink

    How beautiful you are..best.

    Reply
  • December 6, 2018 at 2:51 pm
    Permalink

    this is similar to our first semester of CS

    Reply
  • December 7, 2018 at 12:58 am
    Permalink

    How much time i have to solved?

    Reply
  • December 8, 2018 at 10:06 am
    Permalink

    At 3:04 there is a mistake. Dijkstra algorithm doesn't find the minimum distance between a bunch of nodes, it finds the minimum distance between 2 nodes. Moreover, the example with dropping off a bunch of people at their houses would be more suitable for a minimum spanning tree(see Kruskall or Prim algorithms).

    Reply
  • December 8, 2018 at 9:07 pm
    Permalink

    Khaleesi

    Reply
  • December 9, 2018 at 11:33 am
    Permalink

    lovley explanation

    Reply
  • December 11, 2018 at 1:01 am
    Permalink

    gOOgle shirt

    Reply
  • December 14, 2018 at 7:33 am
    Permalink

    I don't really understand anythhing, I'm here just to see Tibees lolol…

    Reply
  • December 15, 2018 at 11:04 am
    Permalink

    This is what the most beautiful woman in the world looks like.
    Lol. Smart girls <3

    Reply
  • December 15, 2018 at 12:00 pm
    Permalink

    Finally something that I understand

    Reply
  • December 15, 2018 at 3:31 pm
    Permalink

    Gross, too many words on this exam. I'm glad my compsci exams arent like this lol

    Reply
  • December 16, 2018 at 6:06 pm
    Permalink

    is it enough for me as i know HTML CSS Python where our country doesn't give a shit about computer science?

    Reply
  • December 18, 2018 at 9:33 am
    Permalink

    Contrived memory test like most other uni exams.

    Reply
  • December 20, 2018 at 2:44 am
    Permalink

    love her voice

    Reply
  • December 21, 2018 at 7:48 am
    Permalink

    DIES

    Reply
  • December 23, 2018 at 1:37 pm
    Permalink

    please do mechanical engineering ..!!

    Reply
  • December 24, 2018 at 1:57 am
    Permalink

    I'm going to do the exam in computer science concerning intellij (based on Java programming) and PLC after two weeks 😨😨😨, whatever Do you still have your Rapunzel hair? I really like it 😘

    Reply
  • December 27, 2018 at 7:20 pm
    Permalink

    Tibees can solve mathematics paper, can solve physics paper, can solve computer science paper 😉

    Reply
  • December 29, 2018 at 11:03 pm
    Permalink

    you pronounced Dijkstra wrong

    Reply
  • December 30, 2018 at 12:19 am
    Permalink

    This was easy

    Reply
  • December 31, 2018 at 10:26 am
    Permalink

    Certainly assignment take a lot of time (especially when you get stuck), but we actually also have exams that are hard from a theoretical standpoint. A good example is compilers, formal languages and this kind of stuff. Another good example is numerical analysis…at least when, as most CS students, you don't have any solid background in calculus.

    Reply
  • December 31, 2018 at 6:59 pm
    Permalink

    why the heck is this in my recommendations?

    Reply
  • January 1, 2019 at 2:44 am
    Permalink

    Lol, I'm kind of halfway into these topics at my actual study course (Computer Science at an Italian University), and seeing all them togheter feels really weird compared to my preparation: I've done Dijkstra and spanning trees during my Operations Research course; discrete maths topics in my first year discrete maths course, and going to do data structures like binary trees, O notations, hash tables, both in practice and theory next semester. 😀

    Reply
  • January 2, 2019 at 5:09 am
    Permalink

    This is the only video on this channel that doesn’t make me feel stupid.

    Reply
  • January 4, 2019 at 11:04 pm
    Permalink

    This is a strange exam. It's mixing all sorts of topics. Graph theory, data structures, runtimes, recursion, balancing trees, tables, etc. No way this is introductory. You should never see all these topics on the same exam either. Not sure what this is to be honest. I pity any student that has to take that exam. The others saying it's simple are lying. It's simple if you've been a programmer for a while, but you can start computer science not knowing what a computer language is. For that person, there's no way to cover all that material in one semester. Heck, they should throw in parser and compiler construction as well. It's the only thing missing.

    Reply
  • January 5, 2019 at 10:56 am
    Permalink

    You are looking so Charming♥️😍😍 Beauty with Brian ♥️♥️

    Reply
  • January 7, 2019 at 5:46 am
    Permalink

    CS has always been facinating to me but not as much as economy

    Reply
  • January 7, 2019 at 6:58 pm
    Permalink

    I have my Programming Exam in 2 weeks. I hate programming on paper

    Reply
  • January 9, 2019 at 12:59 pm
    Permalink

    looks like my data structures and algorithms paper

    Reply
  • January 16, 2019 at 6:44 pm
    Permalink

    It's pronounced colonel, and it's the highest rank in the military.

    Reply
  • January 28, 2019 at 7:39 pm
    Permalink

    Computer Science is EZ af

    Reply
  • January 28, 2019 at 7:40 pm
    Permalink

    Overall pretty basic

    Reply
  • January 29, 2019 at 1:54 am
    Permalink

    I am not surprised if a physicist sees CS relatively "easy". There's something in physics that enable people like Tibees to connect the dots into one giant understanding that CS guys can't see. It's probably in the math. I don't know. But from my experience, I can say that many physicist are naturally talented when it comes to CS, compiler and algorithm stuff. Dennis Ritchie (C inventor), Tim-Berners Lee (www inventor) and even Djikstra themselves were pure physics dudes. Btw I am just an average CS dude. LOL.

    Reply
  • January 29, 2019 at 9:44 am
    Permalink

    Binary tree each parent has only two children, left children is smaller value and right children is bigger value. The tree starts from one root

    Reply
  • February 4, 2019 at 5:09 pm
    Permalink

    Ok so I went to Cornell and to everyone arguing in the comments section about if this is an "intro" course or not let me address that. This class is the second CS class we take at Cornell right after the intro to programming class in python. As Tibees mentioned its relatively simple because CS can get a lot harder at Cornell. This one really isn't one of the "weeder" classes per se. Cornell's admissions is quite selective and in the class above this, even kids who were valedictorians and got great test scores in their high school did poorly. But yeah for anyone considering a CS program would highly recommend Cornell since the intro classes aren't that bad anyone who puts in some effort will be able to get something out of them and the program as a whole is quite rigorous and prepares you well for anything you want to do after.

    Reply
  • February 20, 2019 at 8:36 am
    Permalink

    This is Algorithms and Design Analysis! A final year or atleast third year course for most of the colleges/universities in my country.

    Reply
  • February 21, 2019 at 3:43 pm
    Permalink

    This exam says 211, introductory courses are 101 and 102.

    Reply
  • February 22, 2019 at 4:50 pm
    Permalink

    ♥️

    Reply
  • March 7, 2019 at 1:26 am
    Permalink

    Are you Scottish or Irish?

    Reply
  • March 14, 2019 at 1:51 am
    Permalink

    really? THIS is an examn? REALLY?! how simple is that.. We, students at the HHU, have this task, which grants us 5/100 points for the first module of the CS-Bachelor. Goddamn I have to live somewhereelse

    Reply
  • March 14, 2019 at 4:54 pm
    Permalink

    The best talking smile on Utube.

    Reply
  • March 26, 2019 at 1:00 pm
    Permalink

    I took computer science classes so long ago, I was learning how to write in FORTRAN. Each line of code was key punched into a punch card, then rubber banded together and dropped of at the computing center, and you had to wait until later in the day to pick up the print out.

    I also learned assembler, and found out why they had a 10 page limit on the print out, when an error in my code created 10 pages of hexadecimal dump. I learned other languages like ALGOL, SNOBOL, COBOL, all that I would never use again.

    Reply
  • March 27, 2019 at 3:24 pm
    Permalink

    Please learn how to pronounce Data

    Reply
  • March 31, 2019 at 6:35 pm
    Permalink

    A second year exam of a CS degree

    Reply
  • April 2, 2019 at 9:46 pm
    Permalink

    I am bachelor of IT science 🙂

    Reply
  • April 13, 2019 at 4:45 pm
    Permalink

    Back in the day it was mostly Fortran, cobal, C++, and Pascal…

    Reply
  • April 15, 2019 at 1:42 pm
    Permalink

    I love your videos 😍😊

    Reply
  • April 16, 2019 at 5:23 pm
    Permalink

    I failed a course because I missed two semicolons and accidentally instantiated a float instead of an int variable. I hate writing code in exams.

    Reply
  • April 19, 2019 at 9:06 pm
    Permalink

    I would love to see you go over a college music theory exam! It’s fun to try to solve questions from test that are unrelated to your major. Its random, i know, but I’m curious how you’d react!

    Reply
  • April 29, 2019 at 4:35 pm
    Permalink

    That test is from 2007?

    After looking at this test, getting a CS degree is a huge waste of time. Learn programming on your own by making actual apps & read few books on complexity & algorithms.

    Reply
  • April 29, 2019 at 11:43 pm
    Permalink

    This is very basic, I'm learning this now and I'm in my first year…

    Reply
  • May 1, 2019 at 4:20 pm
    Permalink

    3:28 Wow I always thought dijkstra is only for games programming.

    Reply
  • May 3, 2019 at 4:50 am
    Permalink

    poster of schrodinger at her wall

    Reply
  • May 3, 2019 at 9:37 pm
    Permalink

    Wow, this is way more advanced than the intro course gets in my school. Some of these topics didn't come up for me until the third class in the fundamentals sequence (although that class has exams much harder than this.)

    Reply
  • May 5, 2019 at 7:04 pm
    Permalink

    Yep.
    Never got higher than a 75% on any of these despite knowing all the material.

    Reply
  • May 7, 2019 at 6:52 am
    Permalink

    don’t go to university if u want to code for a living. it’s one of the few jobs where a degree really doesn’t matter.

    Reply
  • May 8, 2019 at 4:19 am
    Permalink

    People code on paper nowadays. Weird

    Reply
  • May 8, 2019 at 1:26 pm
    Permalink

    that's introductory? oh fk me

    Reply
  • May 10, 2019 at 5:03 pm
    Permalink

    Good day Miss

    Computer science is very difficult .
    Do not look at it.
    It is a horrible course .

    Reply
  • May 11, 2019 at 1:20 pm
    Permalink

    I don't know cornell's system, but normally a 2xx code means second year.

    Reply
  • May 17, 2019 at 6:48 am
    Permalink

    Omg so you litreally read all kinds of subjects 😱😱😱

    Reply
  • May 17, 2019 at 4:46 pm
    Permalink

    This exam was basically our Data Structures course! I'm a first year Computer Science student right now, I thought this was rather easy. Ended it with an 8 which is higher than most of my other courses.

    Reply
  • May 18, 2019 at 1:24 pm
    Permalink

    When Emma Watson and emila Clarke had a baby. She is her

    Reply
  • June 7, 2019 at 9:08 am
    Permalink

    That's an exam for a specific class. It's like saying, "Here is a math exam." and it shows only algebra. There is a lot more stuff out there.

    Reply
  • June 7, 2019 at 10:09 pm
    Permalink

    we can not download the exam

    Reply
  • June 13, 2019 at 1:28 am
    Permalink

    Why these types of videos are popping in my recommendations, does this mean that I am smart now?

    Reply
  • June 14, 2019 at 4:53 am
    Permalink

    Hey, just lending some context here as someone who took this exact class this past fall. This is the second class in the introductory CS curriculum, meant to be taken after CS 111 (now called 1110). It mainly focuses on object oriented programming and data structures, with a little bit of dabbling in graph algorithms and ending with a quick overview of concurrency.

    Reply
  • June 16, 2019 at 9:23 am
    Permalink

    Awesome channel for all of us that are passionate about knowledge. Btw u are super sweet and beautiful… greetings from Madrid…

    Reply
  • June 20, 2019 at 10:05 pm
    Permalink

    I like you girl

    Reply
  • June 22, 2019 at 7:52 am
    Permalink

    Dude i use to rock at Cornell with my bro Andy back in the day. Shoutout to the Narddog:)

    Reply
  • June 22, 2019 at 5:27 pm
    Permalink

    I guess my school or many schools use the same format. This looks exactly like the same format I have been used to for the last 4 years on every single misterm/final.

    Reply
  • August 4, 2019 at 2:10 am
    Permalink

    I'm sorry but your teeth are actually unreal, it's so straight.

    Reply
  • August 6, 2019 at 4:55 pm
    Permalink

    i wish my cs exams would look like this. We have like 70% coding and 30% knowledge questions. It was like this from my first semester on going..

    Reply
  • September 1, 2019 at 11:59 pm
    Permalink

    I found your channel through Cody's… Your videos and presentation style are awesome.. I've subscribed.. thanks for posting such fantastic content.

    Reply

Leave a Reply

Your email address will not be published. Required fields are marked *