Nepal's #1 Tech Blog
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
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
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
include include int charToInt (char stringNumber){return stringNumber – ‘0’;} int main (){char first_number = “55”;char second_number = “166”;char sum_string, str, sum_string_rev;int _first_number, _second_number;int sum, first_number_length, second_number_length, carry, count_up_to;first_number_length = strlen
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
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
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
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