.... How to Find Your Subject Study Group & Join ....   .... Find Your Subject Study Group & Join ....  

We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

Looking For Something at vustudents.ning.com?Search Here

CS401 Assignment No 01 Solution & Discussion Due Date: 14-11-2017

Dear Students,

Assignment No.1 has been uploaded; its due date is Tuesday, 14-November-2017.

Note 1: Assignment will not be accepted via email in any case. Upload your assignment on VU-LMS with in due date.

Note 2: All times on VU-LMS as according to Pakistan Standard Time (PKT)

Share This With Friends......

How to Find Your Subject Study Group & Join.

Find Your Subject Study Group & Join.

+ Click Here To Join also Our facebook study Group.

This Content Originally Published by a member of VU Students.

+ Prohibited Content On Site + Report a violation + Report an Issue

+ Safety Guidelines for New + Site FAQ & Rules + Safety Matters

+ Important for All Members Take a Look + Online Safety

Views: 15589

See Your Saved Posts Timeline

Replies to This Discussion

is screen short ki help to mein fb page pe ker chuka hon is mein do jaga speace deeni ha

Note 1: You will use conditional jumps to solve the above problem. Marks will not be awarded for using
any other approach.

You used unconditional jump at first staetment.....

plz check this one is it correct or not.... I have completed the assignment using this code. I think it is not correct using conditional jump???

[org 0x0100]
jmp start;unconditionally jump over data
array1: dw 16h, 50h, 30h, 24h, 19h, 2h, 5h, 6h, 40h, 8h, 23h,16h, 17h, 28h, 46h
min: dw 0
max: dw 0
;-------- for finding minimum number
mov bx, 0;initialize array index to zero
mov ax, 0;initialize min to zero
mov ax,[array1+bx];minimum number to ax
mov cx,15
top1:cmp ax,[array1+bx];are we find the minimum number
jle end1;if less or equal number
mov ax,[array1+bx];ax contains the minimum number
add bx, 2; advance bx to next index
loop top1
mov dx, ax;write back minimum in memory
;----------for maximum number
mov bx, 0;initialize array index to zero
mov ax, 0;initialize max to zero
mov ax, [array1+bx];maximum number to ax
mov cx,15
top2: cmp ax, [array1+bx] ;are we find the maximum number
jge end2; if greater or equal number
mov ax,[array1+bx]; ax contains the maximum number
add bx, 2;advance bx to next index
loop top2
mov bx,dx
mov dx, 0

This code gives you correct answer but according to given instructions you can make assignment only using conditional statements not even using loops etc
Its not my current sub but if it is mine i can make assignment using only this code logic given in example 3.1 page 36 of handouts...
[org 0x0100]
mov bx, 0
mov ax, 0
l1: add ax, [num1+bx]
add bx, 2
cmp bx, 20
jne 11

mov [total], ax

mov ax, 0x4c00
int 0x21

num1:dw 10,20,30,40,50,10,20,30,40,50
total: dw 0

hammad Ali bhutta tum ny ye kysa kia hai please tell me. mount krny k baad folder me mera .com aur .lst ka folder nhi ban raha plz guide me

Compile sahi hojata ha ap ka program kia?

Please tell me program cmp hojat hy thek

ho sakta ha ise ap ki help ho jaye

ho sakta ha ise ap ki help ho jaye .com aur .lst ka problem yahan se solve ho jaye ga ager file sahi save as ki ha ya ager screen short mein jase s[eace nahi diya ager ye choti si problem ha to ise sahi kareen ho jaye ha meri com bi ho gayi or run bi  


cs401 assignment solution perfect

best of luck

Better then other solutions...

CS401 Guide Lines



Forum Categorizes

Job's & Careers (Latest Jobs)

Admissions (Latest Admissons)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

VU Study

Other Universities/Colleges/Schools Help

    ::::::::::: More Categorizes :::::::::::

Member of The Month

© 2018   Created by +~Malik~.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service