Subjective ] Note: Attempt all questicns. 6x4=24 t t (QHD: Find the gene-al form o! 4, = 64,4-12 solultor af recurrence relation G53: If a Composite intaner then fat prime divisor less then ar equal JA wnapeear ess Meme (tt £0} es lnsse Combination of M4 and 89 ‘ONS: Fina the . Wwww.talentstareducatio Qi: Suppee the relation R and 5. om ec are representeM awe YAN ? ymecorn ing the matsia represciting rie Reluiion RoS rms innivingt*invtne expression of [3~2x)" GAP: Suppose thet re'ationT una set ic represented by the mars fi | ' ‘ aR ii : wet do i) Refexive 4h, Sym i) Anii= SynuensisG.C University, Faisalabad Final Term Examination Paper ifferential Equations QNo,2: Solve by separable equation: 2(y— Idy = (3x? + 4x + 2)ds a | QNo.3: Solve Homogenous equation: eS ae caine hoes) os QNo.5: aN an LF): (6) oe —xdy =0 (Problems):liner equation (6) QS; xy?Subjective Part ‘Subject: Basic Electronics ‘Course Code: Phy-323 Class: BS (CS) Semester: 1" ‘Time Allowed: 90 Min Total Marks: 36 Name of Students: Roll No. _ instructions: ‘© Please read the question carefully, each question enrries equal marks. © All questions must be answered: ‘© Make sure your Name, Roll No and Attendance are properly wi {of each answer sheet Q#2 Write down the working of amplifier and asd) rit its types? (0) Q#3 Define RF? Differentiate b/w modul: QU4 How clippers and clampers are uséxtin) daily life? Explain with suitible examples? (6) (QMS Describe band theory of sofids withthe help of examples and diagrams? © Q#6 Select a minimum yale Yor the emitter by pass capacitor C2 if the emplifier must nd demodulation? 6) operate over a frequene MustBe from 200 hz to 10 kh with diagram? ©GOVERNMENT COLLEGE UNIVERSITY, FAISALABAD esc3 Semester Examination. Fall 2019-20 oie Cou'se Code: 51-401 ‘Cousse Tile Data Strugtufes ahd Algoritims OBJECTIVE PART Time Allowed! 30 sinatas, Ta marks) i Note: Question No.1 is compulsory ane its all pars cany quai Midis please"atemot ihe ‘answer on same paper and return ito the center Superintendent wii theirs owes QE MCOS 1. Choose the est dats strgcture fom te following I whieh the size of ae fs unknown. The ‘tice ned te be entered they come in Entries mute dele wh they are no gee needed. Wis tportent tht sructare has @uihe emery ananagerett same rik List ostek dQueve rurrecuserd 6.4 by What fe reurncd hy cal recuse FB) a7 m9) NE Oly 9 2 't 5. vatuate and write the real forthe flloning integra, abcetdent ges where act, be end dod by ge sre 39 | ae ass {1 Which of the alsing pplication maker ave nf ical ie Hist? 8] Uno vation inet oct 1 Recursive fs els ) Alleatng CPU trace 4 implement ti Fees 5: Which th ollring be mun pico of sack? : sisatationa paces henry fie een {Which soring algorithm perform best im worst ease seearin? 1Doibie Sort hy dnsetion Sa Sond) Quick Son 2. Chose the best data structure fr the ow dn whieh 3 Mat must he maid so rat ements cam be aed the egitim OF “yan hy Single Link Lise A) Crea Lik Lise sete binary trce Hs ein bo he initnum no of ea oes psible bn terme 2 bah am Given a eoeton algrthin aeFus on OL) Otmtogn) O4anOK4"2), OCH), OF S)041) Canaan, O1nkOUa"2y-Ofcbay BAO) = bad Bi Cm,O49-21, Otoloen Con) EAN Orlow Di Oley GEL Fn! Noni ge 10 Suppose that te comple wf 0 atgoriton i OUH"2). Supe tha He ra that wes the lgoritn ru i 10 seen foradata sta stem the tne double na log La faeappeosimatl) tar the program? wT SO ex6-7 ince DW Now. 1 Which fe falling twat an aa of tee? . stilted are Fier scars heater slaves 4 Urdetsopsrations ns noted 1 Whe at the flowin atement is ene? sy Gea ee pot ar tre al a ae sph hu ot al ran res tes Wee: no pote! reed all set te op a il raph oe ee General osm sb anal eee ph tal pe te res SS Gener re emo a iy ee und I eae gape and wo al papi are WsGOVT. COLLEGE UNIVERSITY FAISALABAD DEPARTMENT OF COMPUTER SCIENCE, ‘ina-Torm Faaminaion Fail 20 Note: Attempt all questions. Question No.2 sree ei ofayintl wbler Dace taba dn wucere for ain ales oe Cre Question Nu. 3 we, ‘Wh re pars techniques” Briefly discuss various techniques used in Top-Down parsing, (4) uation No 1) Chimjnete let reewrsion from the following grammars (SP SX| SSH]XS | (i) 8-9 S0sts| 01 ibsey 0) Corsi tne fetowing contin grammar th terminal symbols 2 ©, ¢ are ner ‘Bybots A and B where A is the stant smoot (AS eas fo Btelele Which ofthe fofowing strings srt iillanguage ofthe Grammar? app (beac (i) Lbceabt GH) Boat ey) beach ‘Question No.3._ Briefly discuss various phases ofa compiler design o ‘Question No.4 Consider the grammar (32) S—encajacse hone emealecle {a} Computa the Fist and Follow sets fr each ofthe non-trminals in he grammar. (b) Construct an LL(1) parsing tebe for the grammar {Question No, S. Given the feloning grammar: a Gos! > Expr TS: spe + Tees | Expr—Term [Term “rend Aga? tage ers + Factor Factor Facte> (ExT Non Nan CConstoct sparse re forte folowing expression #2.¥ al 2b, , et MORE VERSIE COLLEGE UNITY Discitine BS-CS (2 Semester) Course Cader ESI 405 Course Ties Dscrese Strict ‘Time Alleweds 30 Mines Sbeninea Marke: Suintent 20 ell = Oiecine tse eon on | esa reser ee ecetitis Sas t kcal I iomoaree| Teer | a Reenter ans] ee L Sere —— aa ares} eae] ba ee Ter | SI TRCN] — RT a aaa maa | TERT | aa | Ca RTT | reese oS ay parce Reet | = lear | erg : = | Sa i SVE vest Na? (ea 8 Marts) duction Nos 2 6 nfarky SatG.C University, Faisalabad Final Term Examination Paper eet (For Affiliated Colleges)-Fall-2018 | Subjective Part Class: BS.CS- Semester: Ist Time Allowed: 120 Min. Total Marks; 20 concrete examples of each computer. Question # 3. Provide appropriate difference for th 8) High Level Language VS b)_ Application Softwaire Question #4. @ Briefly explain how, i jons of Artificial Intelligence change our daily with the help of e Question #5. ® * Question #2. @ Elaborate the type of computers which are classifigdystec ‘hnology and provide @ Solve tl 68)y!into Binary, Decimal and Hexadecimal number. «into Octal, Binary and Decimal number. ,. “ ie areas where mainframe computers are used in our daily tife.G.C University, Faisalabad Final Term Examination Paper ee eee cS. ‘Time Atlowed:90 Min ‘Total Marks:12 [Name of Stadents: Roll No. O Wht ome le storage device? see ew waka or 22 Imaging wees what device to Input data: (a) Seance (WY Hom (@) Bare ender_ (4) TH |S. Smullest unt of memory ts (a) Byte opi a Word 4. The mlcrophome converts thea (a) Mechanica signals ¢b) Electrica iputer fle (8) Sofware « v= many pair's computers can wt 2 2. tain communtention Wea (a) Sender ° iver (6) Transfer Medium () All 5. Am Lakjet print Ne imple of «| (9) Laser printer, yo) impact printer (@) COM printer (@)Nom-tmpact printer bia) code. ; 7 wos ws fenion between a computer and 1 keyboard Involves: (&) Hale duplex (6) Full duplex (@) Atomic comer wt home cam be weed fer! ‘Keqping records (B) Making budasts(@) Watching Movies) All ofthe above 12; Software to peruse the Intermet: (a) Gateway WEFT ()Drowser (4) Teleconferencing.GOVT. COLLEGE UNIVERSITY FAISALABAD DEPARTS IENY OF DEPARTMENT OF COMPUTER SCENES ag at aT i ree a Tag wot aT peers aad ie nF", sentence was ast eae a heme = ae ae = | sateen |e er L tate Tie = = ES Wiggs = a aaa eo in "Ge al “Suossne a =| Acree Rae salt a 7Lon, Someone a ox 1. What do yes a fon? 1 hat isscaion se Ii Ma cere bncndy stl ne wait ‘Whats ey In ataton uray duirtien” Y Risweeness eee Wry am . lagen, sis >. Ean te Nei Car; ueion Node + abies "Com ' Dane eines pa ae nd psy frac ‘Question Na pes a Bap te ween Fr Loop Wes rogam matin he allowing euBeatie oa Thee : = BSCS ‘Semester 9" Examination Fa 201820, * rie Courwe Cate, C8401 | Course We: Data Strictures AnoAlgorithms ‘SUBJECTIVEPART Time Alouad T20Ninnles, TT Finns: 35 4= 12) pvings: “Ee Which data strats i ued epreseal priory queve and wi we ANT asi does fot work on ihe fi of FO. ¥ ji, oe do you jawify shat bes cata structure with eificient algorirn provide smart of the problevn ard efficent algorithm but with inappeopriat selection of dus ve ineiicien! solution to he problem. Justify your answer with examples and time anmplexites| iii How wnald you impleynent Queue data structure foncionality wsig Stack dats siete, Write a code snippet usiry Stick abjec) iv. Hos to represent general tece and Binary tne using array dato stuetare and what will be the problem representing Bena tee tongh ry. aS your answer with Gg ane ray diggin, Questiont 3: (stark: 8) (Create the Binary Searels TSS (US PY ie following values 5.20, 34.24, Perorm the followin operation . the resultant US in av arty ard He ef ight hdl indew Formule : ie Repres ii, Which Troe Traversal algorithm sil he usod to get sor einen display the sorted Values aller versa iii, Show the steps of snd 19 From the resultant (3ST it secre. Questiont : (Marks: 4) 1w the gph belew, use your BF algoritho wp compute whether thee is pt fein node A to tage F that as cost of at mast 4. fn particular. ishenever BPS expends a new node. sho's the content of the ma ‘data structure thet MIS sini Hak tos ily.Course Code: CSI 405 ‘Marke: 30 ‘Attach the question paper elong answer sheet. ‘Question no. marks Let p,q and be the propositions ': Gz bears have been seen inthe area, (Hiking isthe safe en the tral. Berries are ripe along the tail ‘Waite these propositions using pq nd ran logical conncstive. 1) Berries are ripe along the til but grizzly bears have not been seen in the area ) Grizaly bears have not been scen in the area and hikg on the trails safe, but Denies ae ripe along the tral. ©) Ifbemies are ripe along the tail, hiking is sae if nd ony if grizaly bears have ‘at been seen in the area. 4) ts not safe to hike on the trai, but grizzly bears hve not been seen in tun the berries along te iil are ripe. ) Forbiking onthe tral 1 be sue, itis necessary but wot nt beipe along the tral and for grizzly bears nat to hav> been rare. 9 meeieatacu eae RR in the area and berries ae ripe slong the tal, fas oe as 2) Nei tte og sme rs Iiyp0iten zat ona the inital assertion y-3 art the final assertion 2-6 econ Smacks hi Shere the relative salaries of thre: coworkers Using two facts, ree ‘if Fred is not the highest pa ofthe thc, ten Janice isthe second, {Janice isnot the lowest paid then Magaie is paid the mos. I it posible ‘ the relative salaries of Fred, Maggie, nd Janice fom what Steve knows? If is pid the most and who the lust? Explain your reasoning. Question no. 4 6 marks ‘Writ the algorithm of Bubble sort and also write the comity of thie algorithm. Question no. 5 orks Define the following terms. “Asymplote notation, Growth of facron, Nel Solaneprofem of computation, ‘completes of sorting algorithms, Langest prime number.G.CU , Faisalabad Final Term Examination Paper, Fall — 2018 (For Affiliated Colle; ‘Subjective Part Subject: Progeamming Fundamentals Course Code: CSEIOL Class: BS (CS) j* “Time Allowed: 150 Minutes Name of Suen: Rott No, [Aitempr all questions. Each question carry 6 marks) 3. Whot is meant by nested loops? Writea program SUT at 3 Q4. What are recursive funclions? Write # recur Ch of a given number > below? #include void main() int i, x= xf tore, iS: < ST a ie MTT MET Cie [BST I” | oa anne Objective Pat Enel or Tick the Appi Acone Cuties or ered (6 as) 1. ova ten seeopec ase pewac QUNWACL MARK 2 Acomporereatundersand onl s)SouveCoie Saas) SmayCake Wd) ObjetCae 21 mami md ean ex an bth he dieton bat ani oly oe Simplex )Hapie ——e)Fellptn od) Semiapen 4 Encryption aks pace at which ayer? a Payscal | teproeniatin Application. Seaton 5. Arena oun ae? state take )Reksonip 3) Atrbue 16 anor wich 'sehesbtcatiaaiy? ©) BRAN. 1») SRAM cathe asim 2) ater Resour Lang) Pp Uaioe Reseach Lace ‘3Usilom Rees Unk {ANDasoor Rese Lik 8, Which of te flowing is component of CAND, )cabis NIC Bridge oat [FOL Nae ao 1 Sanjeee | CST RRS Ca oR TT | Cae [BSCR ET] Maer and Nie) ‘Short Questions, Attempt al questions, Qvesion 2 @X4 Markey want RomPespin wipes. i, Woatinte incon DANE ii, Whats MAN? Blain with cs fn, Desert the Emit? ‘Queso 3: Explain he workirg of following ayers in OST 1) Preset layer2) ssl layer 3) aplication layer (4 Marts (Question 4: Whee Sertoplogy’? Explain it wring wih ingrr,Discs ite advantage aed dinsdvasages (otcrth se e (R19 Blmit Boa ey : Ha a)Course Code: CS1-604 Class: Subject: Computer Graphics BS(CS)-7" Attempt all Questions Question 1: 2D Transformation 7) Give a. sequence of transformation matrices in homoge/ols ce itates that transforms the object ABCD. into the object ‘N'BIC'D! [You do not need to multiply your matrices) Question 2: 2D Transformation on ‘Show that transformation matrix for a reflection about the line equivalent 0 a reflection to the x-axis followed by an anti-clockwise rotation of 90° Question 3: (06) Suppose a 2-dimensional clipping rectangle has its lower let cower at (30, 50) and its upper right comer at 200, 240). Apply the Cohan Sutherland algorithas onthe following line segments and find out the visible segments of these lines Line A (40, 140) to (100,300) Line B: (20, 10) to 20, 200) PRACTICAL. ‘Do all questions. QI. Write a program to display a line using DDA Algorithm. Q. Writ 4 program to draw the cireles as shown in figureGOVERNMENT COLLE inl Term Exar #505 (00) ‘is civeshortand appropriate answers tthe ollawing questions Draw ies or dagrams ‘borate your aver Ifnecess7 Wy allcon prefered over german ith How ean you diferente between LEDS 2. Define BIT transistor. Give te characte (0, Whats reciston! pan the alma Usgrame whereveryou ned to laborspal Thee 02 wh Cote oak eS La 3 HK allied Sone [prav— 4d-4)a = 3 ~~ EHF UH EK oe “3 Ps he » A Bo hu He inch Dyndne FF ae eS yi kar sam = gles al? Iolam : —_——— “5 A, B= SeQuestion # 4 = th Sees pvr cs ys ra a ee ‘manage synchronization so that there a= 80 USN, HOES een or een Sottss we writers Fe they wanton fe aero wed object dat. For example - Iwo readers access he eject atthe same ne tee he abject e. jc sac a ie a rd anes mae soe {75 sre anid rr eat a solve thi stuaton a writ soul pt excite aces east we abject no reader or weiter may access. weve males cn oe Implement the above situation using semaphores Question #5 sen wing the matgpgnanasn ea! wien sing th ma e-meny model. Let the number o pe rater than the m8 ores inthe system, Diseuss the performance impllatios of te following seaees: a. The number of kernel threads allocated to the program is Iss han the numberof processin ais equa to the number of pees te nuiber of OEE oie ‘The number of kemel threads allocated to the prow al thenads allocated tothe program is preaer than iser-level threads in the program Consider multicore system and a moltithreaded program D“Guention ‘inte ewe Question # S onsite amcor rysem a meine prog wien ig ee SH ag a a erdo ts propor iw ore ona ea ote be nten, Deus he porate Sk T Theoumberofterel ends abound he roman son un es Ge ttt yoga nea othe mani APS The nmmber of kere threads alloc reads allocated ote program er eve reads er of kernel hy cores bt es than the numberofis euro? Write a ecusive algorithm for pratng mmbers rom tom. pe arecursive algorithm tat pays the able of any number passed 0 funtion. 2405) “What ithe giference between com {Write an algoro for selection sore (om05) 4 Whats ashing? What re he aptcaions of ashing in smputing? “+ Draw the hash able for 15.21, 14,27, 10, 12,7 using hash funtion b= (ol}41) % 7 Use stent and rehash approach if yo find any collision Question #04 (03408) + Whatis Divide and Conquer appro?“ + Draw the step-by-step reson ary(s to sont numbers 15, 21,28, 1.27 10,82, 7 using merge son sort json and nor-comparison sorting algorithms? ~ (Practical) a9) a0) or the following array using counting sor. Draw all seps used to sont “ i317 [27174 ing radix son. How many passes are required to sor this array? Draw 613 [218 | 380] 157) 108 457)Fam Fie . a Tita tls. vetictecbobs en ahaa a Date Fo a- aor gS SE Define : U2 Tamgettond Pome tad gral, UD Laphe Hamstpim Gli? Cteem’S Theoten im To Plane UN? Netmak surtpee imtyial iy Stabe? treoten. ee Bo Evalue 5.5 (4 Wg dy de — ws, ER gg Raanyt-Fd, cmrtante SR ae, where 6 Te gm em, Case fer T X9- flare , Yer, fem Coe & is. 6-4 t as comput £4 é j. whet, a a constobancl sea, (ou, 6D Pred te Laphiee Manshetem of cetat. wm, Bb use the Lapbs Maris heim & Solu Age -f, gues, Department of ‘Computer Science Government College University, Faisalabad Final Term Examination, Fall 2021 Program; BS Computer Science Semester 5" Course Code; MTH-324 Course Title : Multivariate Calculus Date + 8" February 2022 Duration: 02 Hours Max Marks: 30 L- © Note: Attempt all the questions, All questions carry equal marks. (6x5#30), Quen Nod Stow at f= 72 forte ton f(a, 9) Question No.2 Evaluate the double integral f fede Feat Question No Evaluate the wipe integral fF de to ne ‘Question No.d Use Green's theorem to evaluate the integral {(y*dx—x?dy), where Cis the positively oriented circle of radius 2 at the origin, ima + yal and S the is ‘Question No.S Use Stoke's theorem to evaluate the integral ff curl, where the portion of the sphere of radius 4 with 220 and the upward orientation,~~ (mar)G.C University, Faisalabad Final Term Examination Paper, Fall 2018 (For Affiliation Colleges) ‘Subject: Compiler Construction Course Code: CSI-S05 Class: BS (C5)5* Time Allowed: 120min Total Marks: 18 ‘Name of Student: Roll No: ‘Note: Attempt All Questions. (Q#2 Answer the Followings 6 a) Define interpreter bb) Define the Lexical analyzer ©) What are the different phases in compilation process? Write names only of the phases, (Q#3 Suppose the following programming statement written in C++ programming language. You are to convert it into tokens and make abstract syntax tee AST. 6 xt3°S (Qi Discuss Directed Acjclic Graph (DAG) in details, whatare the benefits that are obtained while using DAG in compilation process. Give some example to suppott your concept. 6recursive algorithm tat displays the table of any number passed to a fanetion.~ 02408) is he difference between comparison and non-comparison sorting algorithms? (03208) “+ What is bashing? What are the applications of hashing in computing? "eDraw the hash table foe 15, 21, 14,27, 10, 12,7 using hash function b= (a]*i+1) % 7, Use ‘exten and rehash approach ify0u find any collision. Question #4 (03403) | ie ; . 7 © What is Divide and Conquer approach? Ds the spy any eta ray) at rambo 1.2128 1.271882, 7 wing mee sort algorithm, (Practical) “Question #01: ao) fate the LIFO and FIFO using examples and enlist the operations used for both. Also write two foreach. yn 02: (19) Sort the following array using counting sort. Draw al steps used to sor Sp4pap2;e;ots[7[2y7 plete | ings lw any passes re equre To som this aay? Daw 613 | 218] 350 157] 108 457rth se e (R19 Blmit Boa ey : Ha a)aw (Crm)J ecursion? Write a recursive algorithm for printing numbers ftom | ton. b= ia recursive algorithm that displays the table of any number passed to a function (205) ‘Whats the difference between comparison and non-comparison sorting algorithms? ~ "+ Write an algorithm for seeetion sort. mos (03205) 4 What is hashing? What are the applications of hashing in comput ‘© Draw the hash tble for 15. 21, 14, 27,10, 12, 7 using hash function h = (ai}*i=1) % 7. Use extent and rehash approach ifyou find any colision Question #4 (03405) ‘© Whats Divide and Conguer approach?“ ‘= Draw the step-by-step resultant aray(s) to sort numbers 15, sort algorithm. 28, 14,27, 10,92, 7 using merge (Practical) Question # 01: O) ‘Dilferenate the LIFO and FIFO using examples and enlist the operations used for bath. Also write Wo a0, Sorte allowing ary using counting so. Draw al steps use to so Pitt? eye] DE TT?) | 17] eyez T aay pss ae eae sn hs ray Dt reach ps. 613 [218 [350] 157 | 108 [ 57)G.C University, Faisalabad Final Term Examination Paper, Fall-2018 (or Affiliation Colleges) Subjective Part ‘Subject: Operating System Course Code: CSI-402 Chass: BS (CS)4%* Time Allowed: 2:30min Total Marks: 30 Name of Student: Roll No: Note: Attempt All Questions. (Q#2 Briefly describe “Operating System” and as services. 6 (Q#3 What are the main characteristics of “Muti-processing System™ 6 as 6 a) How can we deny Wait-For condition in order to Prevent deadlock? ) Give the example of Unsafe State and explain it. (QS What is Semaphore? How semaphore work for synchronization of processors. 6 (Q#6 What is a “Time Sharing” Operating System? 6GOVERNMENT COLLEGE UNIVERSITY, FAISALABAD = 2 Final :xamination Fall-202 i — 'BS (Computer Science)-5” Semester /£ ) Course Code, SWE~40) Max Marks: 30 Time; 02:00 hours Course Tite: Introduction to Software Enginesring, Cr. Hr: 38-0) Note: Each question carries equal marks Question # I Discuss the core activities of Software Architecture design Question # 2 Explain briefly the key question related to baseline management Question what is the importance of configuration management, what happen if configuration management is ignored? Question # 4 Describe the laws of software Evolution ‘Question #5 Describe the importance of agile development.‘91? Conse Gans forward inerpoain gui and vals ven the ible Below ($45) Tee fot pats +26" - meth tga peify+ http + wees =_[- 1.0 fae ra Sp henge? UtGe) | 27185 | ysz0y farossa | 4.9530 | 6. ©) Desi the formula for calculating fe. o from Guass forward formula 1 fl derivative rom Guass y is the seri i formula to calculate 7 3) - Consider 4) oo the values given inthe tble below ol ety z [0,4 T | ls | ss tise r Lie Find f° F(x)dx using Trspezoidal rule and Simpson's 13 formula Q3: Consider the function (5). = aeGomput ie vais of? = Frou pesese eit fF) Stee (6) =n 3 4 main the Romberg integration table I | = T 2 3 a | | (eos 2 Ts es te iE ‘5 method, Jost show fist 3 4: Solve the following linear system of equations wing Jacobi's method. Just shew a xy ty + 2x 2 Te, + 6x, 43%; 519, 3x, +2x3-%