Cmput 201 - Study guides, Class notes & Summaries

CMPUT 201 (Fall) Final Examination: Version December Department of Computing Science University of Alberta Instructors: G. Lin Time: 120 Minutes Your name (last, first): Your student ID (last 4 digits): • Read these instructions and wait for the time to start. • Do NOT detach any page from the staple, 3 physical pages in total. • There are 7 problems; 28 marks in total. • Use space below the questions, and the next empty page if needed, to write your solutions legibly. • No...

Consider the following code snippet: char str[15] = "e"; str[9] = 'c'; How many null characters are present in the array str? - ANS-13 Consider the following string: char str[] = "CMPUT 0 201"; Assume you called strlen on this string. What would it return? - ANS-6 What is true about the following code snippet? char str1[12] = "Hello World!"; char str2[9] = "CMPUT201"; strcpy(str2, str1); - ANS-Some problem will occur. Consider the following code snippet: char str[10] = ...

Consider the following code snippet: char str[15] = "e"; str[9] = 'c'; How many null characters are present in the array str? - ANS-13 Consider the following string: char str[] = "CMPUT 0 201"; Assume you called strlen on this string. What would it return? - ANS-6 What is true about the following code snippet? char str1[12] = "Hello World!"; char str2[9] = "CMPUT201"; strcpy(str2, str1); - ANS-Some problem will occur. Consider the following code snippet: char str[10] = ...

Part 1: Graphs and linked lists In this part of the lab, you will work with linked lists by creating a graph representation. A graph is an abstract data structure, in which there are nodes and edges between nodes. The graph representation we will be using in this lab is the adjacenty list, which is an array of linked lists that shows the edges in the graph. Here is an example of a simple graph and its adjacenty list: Adjacenty List Representation: 0 3 1 0 2 5 . 2 5 . 3 0 2 4 5 5 2 4 . Note that,...