Spring 2011_CS501_2 Sol.doc

check this soltion of Cs501 assignmetn number 02

Q#01

Specify the condition for the branch instruction and the status of the PC after the branch instruction executes with a true branch condition.

solution

Instruction	Condition	PC status
Jump[20]	Always	PC← PC+20
Jnz r3,[33]	If R[3] ≠ 0	PC← PC+33
Jz r1,[16]	If R[1] = = 0	PC← PC+16
Jpl r5,[37]	If R[5] ≥0	PC← PC+37
Jmi r7,[40]	If R[7] < 0	PC← PC+40

Q#02

Identify the addressing modes and Register Transfer Language(RTL) description(meaning) for the given Falcon-A instructions

solution

Instruction	Addressing Mode	RTL description(meaning)
Load r3,[r5+27]	Displacement	R[3] ← M[R[5] +27]
Jnz r5,[15]	Relative	(If R[5] ≠ 0): PC← PC+15
Shiftl r3,r2,5	Immediate	Shift r3 left 6 times and store in r2
Add r6,r5,r7	Register	R[6] ← R[5] + R[7]
Subi r4,r3,17	Immediate	R[4] ← R[3] -17

Read More

Auto Draft

Read More

STA301 Quiz 1st (11-4-201)

see the link to download file

http://vujungle.com/forum/viewtopic.php?f=9&t=1559

Read More

Old Assignments of CS and MTH and MGt subjects

please see the link for the old assignments of CS subjects of different smesters

http://vujungle.com/forum/viewforum.php?f=10

Read More

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 others

http://vujungle.com/forum/viewforum.php?f=11&sid=f9cbbe67fe7de2f36ca3df0ac8b1fb67

Read More

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 Accurate

All 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 looks like magic: simply drag-and-drop the desired PDF to program's window, click the Start button and get a Word document that accurately duplicates the source PDF file as a result.

The process is as easy as it could ever be! You don't need to mess up with hundreds of settings; forget about problems with PDF version incompatibilities; don't ever spend a minute on post-editing the resulting file. With Adobe PDF to Microsoft Word every document you convert looks exactly the same as before the conversion.

Versatile

Moreover, PDF to RTF works smoothly with any language. Due to the automatic encoding recognition system you will get a perfect final result even if a PDF document was written in half-Chinese, half-Hungarian (or any other set of exotic languages of your choice). For experienced users PDF to Word converter offers command line execution and advanced options that allow fine-tuning the conversion virtually up to a single bit.

A batch processing of multiple PDF documents adds even more convenience! What to say? It's just like that: simply select a dozen of PDF's and painlessly convert them to Word with a single click.

Download Link

http://www.mediafire.com/?5t2j7x9vkl2da6e

Read More

CS502 Latest Quiz

Question # 1 of 10 ( Start time: 11:09:54 AM ) Total Marks: 1 What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm? Select correct option: log (V) V.V E.E log (E)

Question # 2 of 10 ( Start time: 11:11:24 AM ) Total Marks: 1 A 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 v and vice versa.

Question # 3 of 10 ( Start time: 11:13:00 AM ) Total Marks: 1 What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm? Select correct option: O (log E) ? (V) ? (V+E) O (log V)

Question # 4 of 10 ( Start time: 11:14:35 AM ) Total Marks: 1 The relationship between number of back edges and number of cycles in DFS is, Select correct option: Both are equal Back edges are half of cycles Back edges are one quarter of cycles There is no relationship between no. of edges and cycles

Question # 5 of 10 ( Start time: 11:16:10 AM ) Total Marks: 1 You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.? Select correct option: ? (V + E) ? (V E) ? (V) ? (V^2)

Question # 6 of 10 ( Start time: 11:17:24 AM ) Total Marks: 1 What algorithm technique is used in the implementation of Kruskal solution for the MST? Select correct option: Greedy Technique Divide-and-Conquer Technique Dynamic Programming Technique algorithm combines more than one of the above techniques

Question # 7 of 10 ( Start time: 11:18:17 AM ) Total Marks: 1 You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ? Select correct option: ? (V) ? (V+E) V E

Question # 8 of 10 ( Start time: 11:18:44 AM ) Total Marks: 1 Which is true statement in the following. Select correct option: Kruskal algorithm is multiple source technique for finding MST. of a graph, time complexity of this algorithm is O(EV) Both of above

Question # 9 of 10 ( Start time: 11:20:18 AM ) Total Marks: 1 There is relationship between number of back edges and number of cycles in DFS Select correct option: Both are equal. Cycles are half of back edges. Cycles are one fourth of back edges. There is no relationship between back edges and number of cycles.

Question # 10 of 10 ( Start time: 11:21:10 AM ) Total Marks: 1 Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few edges. Select correct option: True False

Read More