أسواق
27-10-2013, 12:50 AM
حل واجب M180 اتصل 0544321455/00966544321455 ايميل [email protected] (http://www.aswaqcity.com/thread1310695.html)
حل واجبات الجامعة العربية المفتوحة
اتصل : O544321455 - OO966544321455
واتس اب: 966544321455+
ايميل : [email protected]
سكايبي : a_al_shora
حل واجب (http://www.aswaqcity.com/thread1310695.html) 0.5.4.4.3.2.1.4.5.5 الجامعة العربية المفتوحة
حل واجبات الجامعة العربية المفتوحة O54.4.3.2.1.4.5.5 - OO96654.4.3.2.1.4.5.5
ايميل : a_al_shora @ h.o.t.m.ail.c.o.m
سكايبي: a_al_shora
واتس اب: OO96654.4.3.2.1.4.5.5
M180: Data Structure and Algorithms in
Tutor-Marked Assignment (Fall 2013/2014)
Cut-Off Date: December 7, 2013
Total Marks: 20
s
Question 1: (4 marks)
Assume that we have two algorithms for solving one specific algorithm. The first algorithm (A) takes time n, while algorithm (B) takes time 3lg n+5. When should we choose algorithm A, and when should we choose algorithm B?
Question 2: (7 marks)
Given a Node P in a list of nodes (linked list) that contains [3, 5, 4, 1]. Draw the initial list and the results of the following statements, applied in the same order below:
(a) P.next = P.next.next;
(b) P.next = new Node(7, P.next);
(c) P.next.next = new Node(8);
(d) P.next.next = P;
Question 3: (5 marks)
Define a class for circular doubly linked lists with the following two procedures:
(A) Insert one node at the head of the list.
(B) Delete any given node in the list
Question 4: (4 marks)
Given the following binary tree below:
Draw the resulted tree after performing the following operations (Add 5, Add 17, Delete 23, and Delete 9)
حل واجبات الجامعة العربية المفتوحة
اتصل : O544321455 - OO966544321455
واتس اب: 966544321455+
ايميل : [email protected]
سكايبي : a_al_shora
حل واجب (http://www.aswaqcity.com/thread1310695.html) 0.5.4.4.3.2.1.4.5.5 الجامعة العربية المفتوحة
حل واجبات الجامعة العربية المفتوحة O54.4.3.2.1.4.5.5 - OO96654.4.3.2.1.4.5.5
ايميل : a_al_shora @ h.o.t.m.ail.c.o.m
سكايبي: a_al_shora
واتس اب: OO96654.4.3.2.1.4.5.5
حل واجبات الجامعة العربية المفتوحة
اتصل : O544321455 - OO966544321455
واتس اب: 966544321455+
ايميل : [email protected]
سكايبي : a_al_shora
حل واجب (http://www.aswaqcity.com/thread1310695.html) 0.5.4.4.3.2.1.4.5.5 الجامعة العربية المفتوحة
حل واجبات الجامعة العربية المفتوحة O54.4.3.2.1.4.5.5 - OO96654.4.3.2.1.4.5.5
ايميل : a_al_shora @ h.o.t.m.ail.c.o.m
سكايبي: a_al_shora
واتس اب: OO96654.4.3.2.1.4.5.5
M180: Data Structure and Algorithms in
Tutor-Marked Assignment (Fall 2013/2014)
Cut-Off Date: December 7, 2013
Total Marks: 20
s
Question 1: (4 marks)
Assume that we have two algorithms for solving one specific algorithm. The first algorithm (A) takes time n, while algorithm (B) takes time 3lg n+5. When should we choose algorithm A, and when should we choose algorithm B?
Question 2: (7 marks)
Given a Node P in a list of nodes (linked list) that contains [3, 5, 4, 1]. Draw the initial list and the results of the following statements, applied in the same order below:
(a) P.next = P.next.next;
(b) P.next = new Node(7, P.next);
(c) P.next.next = new Node(8);
(d) P.next.next = P;
Question 3: (5 marks)
Define a class for circular doubly linked lists with the following two procedures:
(A) Insert one node at the head of the list.
(B) Delete any given node in the list
Question 4: (4 marks)
Given the following binary tree below:
Draw the resulted tree after performing the following operations (Add 5, Add 17, Delete 23, and Delete 9)
حل واجبات الجامعة العربية المفتوحة
اتصل : O544321455 - OO966544321455
واتس اب: 966544321455+
ايميل : [email protected]
سكايبي : a_al_shora
حل واجب (http://www.aswaqcity.com/thread1310695.html) 0.5.4.4.3.2.1.4.5.5 الجامعة العربية المفتوحة
حل واجبات الجامعة العربية المفتوحة O54.4.3.2.1.4.5.5 - OO96654.4.3.2.1.4.5.5
ايميل : a_al_shora @ h.o.t.m.ail.c.o.m
سكايبي: a_al_shora
واتس اب: OO96654.4.3.2.1.4.5.5