GATE - IES -PSU TOPPER NOTES As Per New Syllabus SELF STUDY MATERIAL (100 % Selection Visit : PHOTOCOPYNOTES.COM Free Home Deliveryo- _ - @—OyHabus -_ oo os —Analysing Algo_( Te bt Sc) en @ Divide 65 Cong yen e (reedy “Technique e-Dynamic_Peogramming @—5—Hashing ——___ - @ @-lree to Graph_also sg eesese a le e— Definition » T+ is_c._combination_of sequence —_______af finite steps to salve a paioulan. a @ Problem. eee Art ~~ oe L ~ ee a = -—__—_—_ de: 5:..n Gis. Ter: - @—_2. Add _« fob and store in. Go 2 Ay pene Cp — oe * aaa i ee ——— @ |) cTerminat< uvithin_at finite. time - @ 2. Produce atteaxt one’ output _ ee @- Every Statement should be cleterministi co/unambiguas @ 4. Algorithm is independent _ SF eget Lang vas @ — Aigo. is super-set af progrom @ 5S: Every Statement should perform some Operation: @ Steps Aiquired -ip_constuiek, algorithm + = e ich = !Knousin coblem clranty. _ —majsping of_ayp bo O/P.2. Design a\gonithm = Kno ing all the ogics fs: he_reason_of studying algorithm : —lalnich Logic =t0. Apply_comes unde design aii DP, GS or Pec hich +o_apply a._How. chore _—_# u. Werification —h Manually) __- —ageriin tino -¢ 5__ZImplementation to Coding _] avo arngem. _¢ @ analysing algonithn {time ancl Space complexity) ¢ eine en spaced ——e Lathy-analysis = To solve 6 given problem. if mom —¢ _—___cthan_one_ alyorithms Ont. -nere , ‘then __¢ tho choose the hex among “them” Lane _neecl_andlysis¢ based. on two factors 1 TTimhe 2: Space ___¢ _—Time_.ompiexity is more ‘important as Cpu time __¢ —is_costty than main. memory sjpace-____¢ —e ee _ € Jime complexity = __ : ‘ — 4 —We)= cial ae) compile-time. muons time ¢ € —_— —_—_—__4 ig 4 _ PE dependent “ype of procmor depends —— camp Oe