.... 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

Mujtaba Ali Kiani
  • Male
  • Rawalpindi
  • Pakistan
  • Zero Semister
Share

Mujtaba Ali Kiani's Friends

  • Alezay
  • Muhammad Riaz
  • Robe aim
  • Shehzad Anwar
  • Afzaal Ahmed
  • bia mehar
  • red rose
  • Shan
  • Sana (online quiz application)

Mujtaba Ali Kiani's Discussions

New Students Alert

Started Oct 19, 2017 0 Replies

Watch And share itContinue

MTH001

Started this discussion. Last reply by Mujtaba Ali Kiani Jan 28, 2017. 1 Reply

GDB No.21)      If a student posts his/her solution in MDB to show up others, he/she would be awarded ZERO marks. Your solution must be posted in GDB.2)      Use only Google Chrome.Question:    Find…Continue

Poetry Muqabla

Started this discussion. Last reply by 1ikw9hdm8io9m Dec 9, 2016. 3 Replies

Nazar Andaaz krtey ho, Lo hat jatey hyn Nazroun sey , Inhi nazron se dhondo gay nazar jab hum na aein gy ..!!…Continue

Gifts Received

Gift

Mujtaba Ali Kiani has not received any gifts yet

Give a Gift

 

Mujtaba Ali Kiani's Page

Latest Activity

Mujtaba Ali Kiani replied to Iqra M's discussion CS301 assignment no 3 spring 2018 in the group CS301 Data Structures
"#include <iostream>#include <conio.h>using namespace std;void min_heapify(int *a,int i,int n){ int j, temp; temp = a[i]; j = 2 * i; while (j <= n) { if (j < n && a[j+1] < a[j]) j = j + 1; if (temp < a[j]) break; else…"
Jul 26
Mujtaba Ali Kiani replied to Iqra M's discussion CS301 assignment no 3 spring 2018 in the group CS301 Data Structures
"main kah jo raha hun ye just min heap of all nodes ki example ha odd wala ha hi ni isss main"
Jul 24
Mujtaba Ali Kiani replied to Iqra M's discussion CS301 assignment no 3 spring 2018 in the group CS301 Data Structures
"ni"
Jul 23
Mujtaba Ali Kiani replied to Iqra M's discussion CS301 assignment no 3 spring 2018 in the group CS301 Data Structures
"hoti ha na ye just example ha."
Jul 23
Mujtaba Ali Kiani replied to Iqra M's discussion CS301 assignment no 3 spring 2018 in the group CS301 Data Structures
"Check it min heap of all nodes  "
Jul 21
Mujtaba Ali Kiani replied to Iqra M's discussion CS301 assignment no 3 spring 2018 in the group CS301 Data Structures
"Mojjj kro sary #include <iostream>#include <conio.h>using namespace std;void min_heapify(int *a,int i,int n){ int j, temp; temp = a[i]; j = 2 * i; while (j <= n) { if (j < n && a[j+1] < a[j]) j = j + 1; if (temp <…"
Jul 20
Mujtaba Ali Kiani replied to Marha Khan's discussion Assignment No. 2 Visual Programming (CS 411) opened on May 15, 2018 and due date of assignment submission will be May 22, 2018. in the group CS411 Visual Programming
"complete"
May 22
Mujtaba Ali Kiani replied to Marha Khan's discussion Assignment No. 2 Visual Programming (CS 411) opened on May 15, 2018 and due date of assignment submission will be May 22, 2018. in the group CS411 Visual Programming
"Complete solved"
May 22
Mujtaba Ali Kiani is now friends with Alezay, Robe aim, Muhammad Riaz and 2 more
May 11
Mujtaba Ali Kiani replied to + AW (BSCS 7)'s discussion CS-411 Visual Programming Assignment#01 (GRADED) Due Date:09-05-2018 in the group CS411 Visual Programming
"yesss"
May 10
Mujtaba Ali Kiani replied to + AW (BSCS 7)'s discussion CS-411 Visual Programming Assignment#01 (GRADED) Due Date:09-05-2018 in the group CS411 Visual Programming
"ye ap k liye"
May 10
Mujtaba Ali Kiani replied to + AW (BSCS 7)'s discussion CS-411 Visual Programming Assignment#01 (GRADED) Due Date:09-05-2018 in the group CS411 Visual Programming
May 10
Mujtaba Ali Kiani joined + M.TariK MaliC's group
Thumbnail

ECO302 Principles of Microeconomics

ECO302 Principles of Microeconomics.Download / Upload Video Lectures, Handouts, Helping Materials, Assignment Solution, Online Quizzes, GDB, Past Papers, Solved Papers & more….See More
Feb 19
Mujtaba Ali Kiani replied to + ! ! ! ! ₳мσяє ^'s discussion CS601 - Data Communication GDB in the group CS601 Data Communication
"The transport layer, which is responsible for getting data from one end to the other Progressive streaming doesn't have the flexibility of true streaming, since the data rate can't be adjusted on the fly and the transmission can't be…"
Jan 30
Alezay liked Mujtaba Ali Kiani's profile
Jan 27
Mujtaba Ali Kiani joined + M.TariK MaliC's group
Thumbnail

CS615 Software Project Management

CS615 Software Project Management.Download/upload Video Lectures, Handouts, Helping Materials, Assignments Solution, Online Quizzes, GDB, Past Papers, Solved Papers and more….
Jan 27

Profile Information

City:
Rawalpindi
Study Program
Zero Semister
Semester
Other
Specialization (Like HRM, Management, Finance, Marketing, Banking, MIS etc)
IT
VUSTUDENTS is strictly for educational assistance to students of Virtual University of Pakistan and other educational institutes. Offensive, adult content, advertisement, spamming, promotion of other sites & groups, sharing contact details publically, violation of Moral & Ethical Code of Conduct will not be permitted. Non-Compliance to any of these will result in deletion of profile without warning. Do you Agree ?
Yes

Comment Wall

You need to be a member of Virtual University of Pakistan to add comments!

Join Virtual University of Pakistan

  • No comments yet!
 
 
 

Donation

A quality education changes lives & start with you.

Forum Categorizes

Job's & Careers (Latest Jobs)

Admissions (Latest Admissons)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

VU Subject Study Groups

Other Universities/Colleges/Schools Help

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

Member of The Month

© 2018   Created by + M.TariK MaliC.   Powered by

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