Faculty of Computer Science and Engineering Department of Computer Science Part 1 doc

... Faculty of Computer Science and Engineering Department of Computer Science Page 1/ 5 LAB SESSION 1 BASIC OPERATIONS ON LINKED LIST 1. OBJECTIVE The objectives of Lab 1 are (1) to ... else valid = 0; } Faculty of Computer Science and Engineering Department of Computer Science Page 4/5 return pList; } a. Rewrite the main funct...

Ngày tải lên: 22/03/2014, 12:20

... Faculty of Computer Science and Engineering Department of Computer Science Page 1/ 7 LAB SESSION 1 BASIC OPERATIONS ON LINKED LIST 1. OBJECTIVE The objectives of Lab 1 are (1) to ... buildPosLinkedList() { List pList = new List; int valid =1; char choice; int num; Faculty of Computer Science and Engineering Department of Computer...

Ngày tải lên: 22/03/2014, 12:20

... Faculty of Computer Science and Engineering Department of Computer Science Page 1/ 4 LAB SESSION 2 POLYNOMIAL LIST 1. OBJECTIVE The objectives of Lab 2 are (1) to introduce ... pTemp->data = newdata; pTemp->next = pHead; pHead = pTemp; Faculty of Computer Science and Engineering Department of Computer Science Page 2/4 co...

Ngày tải lên: 22/03/2014, 12:20

... Faculty of Computer Science and Engineering Department of Computer Science 1/ 3 LAB SESSION 3 RECURSION on BINARY TREE 1. OBJECTIVE The objectives of Lab 3 are (1) to introduce ... Listing 1 // this is the content of tree.cpp #include "Tree.h" Tree::Tree() { root = NULL; Faculty of Computer Science and Engineering...

Ngày tải lên: 22/03/2014, 12:20

... value of g corresponding to n 1 if (n = 1) 1 return 1 2 else 1 return g(n – 1) + 1 End g Solution: T (1) = 1; T(n) = 1 + T(n -1) = 1 + 1 + T(n-2) = 1 + 1 + … + 1 + 1 + T (1) = n = O(n) Faculty ... input of size 10 24? Solution: It takes: 2 10 24 log 2 (10 24) 10 -9 ≈ 10 360 s Question 7. Faculty of Computer Science and Engineering...

Ngày tải lên: 28/03/2014, 15:20

... value of g corresponding to n 1 if (n = 1) 1 return 1 2 else 1 return g(n – 1) + 1 End g n^3*log2(n) 40*2 ^10 24 *10 ^-9 U n = U +1 U = 1 O(n) n -1 1 Faculty of Computer Science and Engineering ... Faculty of Computer Science and Engineering Department of Computer Science Released on 24/08/2 012 20:06:39 1/ 4 DATA STRUCTURES &...

Ngày tải lên: 28/03/2014, 15:20

... 4 x 2 4x 3 - 3x 2 -5 + - -4x 19 2X 2 +1 3/2x 3x 3 -1/ 2 Faculty of Computer Science and Engineering Department of Computer Science Page 2 /10 a. f – k b. f *k c. f\ 10 d. f\ x e. f* f 2 Faculty of Computer ... s2 {1, 9,4,2} s1{7 ,10 } s1{2,4,9 ,1, 7 ,10 }s2{rong} s1{9 ,1, 7 ,10 } s2{4,2} pop(SourceStack,x) pop(SourceStack,y) Push(SourceStack,...

Ngày tải lên: 28/03/2014, 15:20

... Faculty of Computer Science and Engineering Department of Computer Science 1/ 4 DATA STRUCTURES & ALGORITHMS Tutorial 3 Questions Recursion and Binary Tree Part 1. Recursion ... return (compute(a,n)>compute(a,n -1) )?compute(a,n):compute(a,n -1) 3233 6,5,4 4,5,6 Faculty of Computer Science and Engineering Department of Computer S...

Ngày tải lên: 13/02/2014, 13:20

... Faculty of Computer Science and Engineering Department of Computer Science 1/ 3 DATA STRUCTURES & ALGORITHMS Tutorial 4 Questions AVL Tree and Heap Part 1. AVL Tree ... merge the contents of two binary search trees into one. What is the running time of your algorithm? Faculty of Computer Science and Engineering Department of Compu...

Ngày tải lên: 13/02/2014, 13:20

Ngày tải lên: 07/11/2012, 14:17