Technorion 2025 to be held at ACEM on December 12 Kathmandu — December 12, 2025 The Advanced College of Engineering and Management (ACEM) is set to host Technorion 2025, the fifth edition of its flagship annual technology festival, on December 12 at the ACEM campus. Organized by the Advanced Robotic Club (ARC), the event has...
LINCOLN UNIVERSITY COLLEGE EXAMINATION PAPER FACULTY: COMPUTER SCIENCE AND MULTIMEDIA COURSE: MASTER OF COMPUTER SCIENCE YEAR/ SEMESTER:FIRST YEAR/SEMESTER ONE MODULE TITLE: DESIGN & ANALYSIS OF ALGORITHM CODE: MCS 112 TIME ALLOWED:3 HOURS Instruction to candidates 1. This question paper has THREE (3) Sections. 2. Answer ALL questions in Section A, VSAQ 3. Answer 7 questions...
This is a program for insertion sort The programming language used is ruby Data from the files are read Output is shown in a file Total time taken for sorting is shown def insertion_sort(array)for i in 1…(array.length)puts ij = iwhile j > 0if array[j-1] > array[j]temp = array[j]array[j] = array[j-1]array[j-1] = tempelsebreakendj = j –...
include include int charToInt (char stringNumber){return stringNumber – ‘0’;} int main (){char first_number[] = “55”;char second_number[] = “166”;char sum_string[500], str, sum_string_rev[500];int _first_number, _second_number;int sum, first_number_length, second_number_length, carry, count_up_to;first_number_length = strlen (first_number);second_number_length = strlen (second_number); count_up_to = first_number_length>second_number_length? first_number_length: second_number_length;carry = 0;int j=0;for(int i=count_up_to-1; i>=0;i–,j++){_first_number = 0;_second_number = 0;if(j<first_number_length){_first_number = charToInt(first_number[first_number_length-j-1]);} } if(carry){sum_string[j] = carry +...
Iteration Method Expand the relation so that summation dependent on n is obtained Bound the summation Example T(n)=2T(n/2)+1 T(1)=1 Solution: T(n)=2T(n/2)+1 Let there is k iteration. So, for the first iteration, k=1. K=2 represents second iteration and goes on. Let’s find what is T(n/2) For this, put it in original function T(n) i.e Replace n...
Recursive Algorithm It can be solved in terms of itself Recurrence relation defines sequenced based on rule those next terms as a function of previous terms. Next term is function of pervious terms. Defined by itself (in term of previous terms) Can model the cpmplexity of divide and conquer algorithm Solving Recurrence Relations To define...
Foundation of Algorithm Analysis Algorith and its properties RAM Model Time and Space Complexity Detail Analysis of Algorithm (Like Factorial Algorithm) Concept of Aggregate Analysis Asymptotic Notation Big Oh, Big Omega and Big Theta Notation, Their Geometrical Interpretation and examples Recurrences Recursive algorithm and recursive relations Solving Recurrences Recursion Tree Method, Substitution Method, Application of...
Algorithm Finite set of computational instructions Set of steps to solve the problem Properties: Input / output : some input from some standard set of input and must produce output Definiteness: each step must be unambiguous Finiteness: algorithm must terminate after finite tome or steps Correctness: correct set of output values must be provided from...