Scribd
Upload
66 views7 pages

SE1052-Data Structures and Algorithms

Data Structures and Algorithms Sliit

Uploaded by

togil78406
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
66 views7 pages

SE1052-Data Structures and Algorithms

Data Structures and Algorithms Sliit

Uploaded by

togil78406
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 7
Sri Lanka Institute of Information Technology B.Sc. Honours in Computer Science/ B.Sc. Honours in Computer Systems Engineering Final Examination Year 1, Semester 1 (2024) SE1052—Data Structures and Algorithms Duration: 3 Hours May/June 2024 Instructions to Candidates: © This paper has 5 questions. Answer all the questions in the booklet given. ¢ total marks for the paper is 100. is paper contains 7 pages, including the cover page. # Electronic devices capable of storing and retrieving text, including calculators and mobile phones are not allowed. Question 1 (20 Marks) a) Compute the time complexity of each of the following and represent them in big O notation. Need to show your workouts. i. for(i = 07 i < 20; it+) j 3 -> 5 -> NULL List2: 2 -> 4 -> 6 -> NULL merged list: 1 -> 2 -> 3 -> 4 -> $ -> 6 -> NULL You are provided with the following structure definition for a singly linked list node and the functions. struct Node [ int val; struct Node *next; Page 6 of7 struct Node *insert_beg(struct Node *, struct Node *insert_end(struct Node *, Funetion prototype is struct Node merge sorted lists(struct Node* listl, struct ListNode* list2); (10 marks) Page 7of7

You might also like