Doğu Akdeniz Üniv. - Algorithms and Data Structures eski sınav soruları

aga

Doğu Akdeniz Üniversitesi Elektrik Elektronik Mühendisliği bölümü, Data Structures dersinin eski sınav soruları...

*--------------
eee212-MT1_S05_06sol.doc
MT1_S04_05sol.doc
mt1-f0506.pdf
MT2_F04_05Sol.doc
MT2_S04_05sol.doc

----------
Q U E S T I O N S & SOLUTIONS

------------------------------------------------------------------------------------------------------------------------------
1. Given that we have two linearlyed lists pointed by pointers plist1 and plist2, where each node in the lists contains the student information including the student name & surname, student number and the CGPA;

(a) (%2) Write an appropriate node structure definition for the lists.
(b) (%20) Write a function which concatenates two lists (add list 2 to the end of list 1) and returns a pointer to the beginning of the new list.

a) struct node{
char Name[15];
char Sname[15];
int StNo;
float CGPA;
struct node *next;
};