Wednesday, 27 April 2011

Spring 2011_CS501_2 Sol.doc

check this soltion of Cs501 assignmetn number 02Q#01Specify the condition for the branch instruction and the status of the PC after the branch instruction executes with a true branch condition.solutionInstructionConditionPC statusJump[20]AlwaysPC← PC+20Jnz r3,[33]If R[3] ≠ 0PC← PC+33Jz r1,[16]If R[1] = = 0PC← PC+16Jpl r5,[37]If R[5] ≥0PC← PC+37Jmi r7,[40]If R[7] < 0PC← PC+40Q#02Identify the addressing modes and Register Transfer Language(RTL) description(meaning) for the given Falcon-A instructionssolutionInstructionAddressing ModeRTL description(meaning)Load r3,[r5+27]DisplacementR[3] ← M[R[5] +27]Jnz r5,[15]Relative(If R[5] ≠ 0): PC← PC+15Shiftl r3,r2,5ImmediateShift r3 left 6 times and...

Auto Draft

...

Monday, 11 April 2011

STA301 Quiz 1st (11-4-201)

see the link to download filehttp://vujungle.com/forum/viewtopic.php?f=9&t=1...

Sunday, 6 March 2011

Old Assignments of CS and MTH and MGt subjects

please see the link for the old assignments of CS subjects of different smestershttp://vujungle.com/forum/viewforum.php?f...

Monday, 7 February 2011

CS subjects Final term Solved papers

Aslam o Likum Please the link given below for Solved CS final term papers, Also upload your papers for othershttp://vujungle.com/forum/viewforum.php?f=11&sid=f9cbbe67fe7de2f36ca3df0ac8b1f...

Tuesday, 1 February 2011

Quick-PDF PDF To Word Converter v2.2 Portable | 5.4 MB

Many people seem to feel puzzled about how they can edit their numerous PDF's or at least convert them to Word documents. Indeed, converting a PDF to Word or an RTF file isn't that obvious. These document formats have in-depth differences after all.Easy and AccurateAll the more do astonish the great capabilities of PDF to MS Word product! With this neat piece of software you would never imagine the task had some complexity beneath! It really...

CS502 Latest Quiz

Question # 1 of 10 ( Start time: 11:09:54 AM )Total Marks: 1What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?Select correct option:log (V)V.VE.Elog (E)Question # 2 of 10 ( Start time: 11:11:24 AM )Total Marks: 1A digraph is strongly connected under what condition?Select correct option:A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .pair of vertices u, v e V, u can reach v and vice versa.A digraph is strongly connected if for at least one pair of vertex u, v e V,  u can reach v and vice versa.pair  of vertices u, v e V, u can reach...

Page 1 of 812345Next
Twitter Delicious Facebook Digg Stumbleupon Favorites More