CS403 Assignment No. 2 Solution Fall 2016

By: // No comments:

CS403 Assignment No. 2 Fall 2016

Dear Students. Here You can get CS403 Assignment No. 2 Solution for Fall 2016. CS403 – Database Management Systems Assignment Due Date: 02/12/2016. Total Marks= 15.

CS403 Assignment Uploading instructions: 

  • Your assignment should be in .doc /.docx format. 
  • Save your assignment with your ID (e.g. bc000000000.doc). 
  • No assignment will be accepted through email. 

CS403 Assignment Rules for Marking: 

It should be clear that your assignment will not get any credit if:
  • The assignment is submitted after due date. 
  • The submitted assignment does not open, execute or file is corrupted. 
  • Your assignment is copied from internet, handouts or from any other student (Strict disciplinary action will be taken in this case).  

You Should Also read:

CS403 Assignment Question: (15 Marks) 

As you all know that Virtual University of Pakistan provides an interface to the student for making their own exam date-sheet according to their convenience. In date-sheet interface, students are required to enter their VU allocated ID and password to get logged in the system. In next step, students are required to select exam city/center of their choice before further proceedings. After that, a list of students’ registered courses will be displayed and students will select the date and time of exam for each course to finalize their date-sheet. 
Also, note that students and exam data is managed by a system administrator in the date-sheet system. 

Now, by keeping the above scenario in your mind, you are required to:
  • Identify all the Entities along with proper attributes. [5 Marks] 
  • Make an ER Diagram of the system showing all entities, their attributes and relations among the entities. [10 Marks] 
NOTE: Do not put any query on MDB about this assignment, 

if you have any query then email at cs403@vu.edu.pk

Deadline: Your assignment must be uploaded/submitted on or before 2nd December 2016. 

CS403 Assignment No. 2 Solution 

You can Download the Solution of CS403 Assignment No. 2 Solution Fall 2016 from the Links Below:

MTH202 Midterm Solved - Unsolved Past Papers

By: // No comments:

MTH202 Midterm Solved and Unsolved Past Papers

Here We have huge range of mth202 virtual university past papers available to download. You can download mth202 midterm papers MTH202 ALL Current Mid Term Papers Fall 2014 & Past Mid Term Papers.

Also Read: CS 201 all past solved midterm papers 2015

MTH202- Discrete Mathematics MIDTERM Past Paper


Time: 60 min
Marks: 40

MTH202 Midterm Question No: 1 ( Marks: 1 ) - Please choose one
The negation of “Today is Friday” is


  • Today is Saturday
  • Today is not Friday
  • Today is Thursday
Also Read: Mth301 midterm Solved past papers


MTH202 Midterm Question No: 2 ( Marks: 1 ) - Please choose one
An arrangement of rows and columns that specifies the truth value of a 
compound proposition for all possible truth values of its constituent propositions 
is called


  • Truth Table 
  • Venn diagram
  • False Table
  • None of these
Also Read: CS101 Latest Solved MCQs


MTH202 Midterm Question No: 3 ( Marks: 1 ) - Please choose one
For two sets A,B
A B C A B A C       ( ) ( ) ( )is called
  • Distributivity of intersection over union
  • Distributivity of union over intersection
  • Distributivity Law
  • None of these 
MTH202 Midterm Question No: 4 ( Marks: 1 ) - Please choose one
An argument is _____ if the conclusion is true when all the premises are true.
  • Valid 
  • Invalid
  • False
  • None of these
MTH202 Midterm Question No: 5 ( Marks: 1 ) - Please choose one
The row in the truth table of an argument where all premises are true is called


  • Valid row
  • Invalid row
  • Critical row
  • None of these
You Can Also Download Solved Mid Term Papers, Short Notes, Assignment Solutions, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quiz , Solved Mid Term Subjective Papers , Solved Mid Term Objective Papers From This Discussion For Preparation Mid Term Papers of Fall 2015-16.

Download MTH202 Midterm Complete Past Papers

Here is the download links for Complete MTH202 Midterm Solved and Unsolved Past Papers. Click on the Link below to download.

CS506 Assignment no. 2 Solution Fall 2016

By: // No comments:

CS506 Assignment no. 2 Fall 2016

Dear Students as You may know CS506 Assignment no. 2 has been uploaded. The due date of this assignment is December 02, 2016.

CS506 Assignment No. 02
Semester: Fall 2016
Web Design and Development -CS506
CS506 Assignment Total Marks: 20
Due Date: December 02, 2016.

CS506 Assignment Instructions: 

Please read the following instructions carefully before submitting assignment:
  • You should submit your assignment before or on due date on VULMS.
  • Your assignment should be your own work. It should not be copied from internet, handouts or books.
  • You are suggested to use Netbeans IDE for developing your assignment.
  • You should import java swing and java awt packages in your classes.
  • You should create project with your Roll No. in Netbean IDE and create required classes in it.
  • You should zip your complete project (along with .java,.class and .jar files etc.) and upload on VULMS as a single file.
  • Your zipped file should be in .zip or .rar file format only. Any compressed format other than .zip or .rar of your programs will be considered the incorrect files and rewarded by zero. 
  • Assignment sent via Email will not be replied and accepted in any case.
  • If the submitted assignment does not open or file is corrupt, it will not be marked and awarded Zero marks.

CS506 Assignment Objectives:


  • To build knowledge about how event handling works in Java
  • To develop basic GUI application
  • To know how to use different GUI components of AWT and Swing packages 
For any query about the assignment, contact at CS506@vu.edu.pk

CS506 Assignment Question:

Marks 20

You are required to develop a small java program named as “Printer” by creating following Graphical User Interface (GUI) with functionality.

GUI

Functionalities Required

  • Print Quality drop down list should contain two values as; High and Low
  • Upon Pressing OK button, new dialog box should be opened with the following text;
  • “Thanks for using this application” and program must exit successfully.
  • Upon Pressing Cancel button, new dialog box should be opened with the following text;
  • “You Pressed Cancel Button”.
  • Upon pressing Help button, new dialog box should be opened containing following text;
  • “For more help, please contact CS506@vu.edu.pk”

You Can Also Download Solved Mid Term PapersShort NotesAssignment SolutionsLecture Wise Questions Answers FilesSolved MCQsSolved Quiz , Solved Mid Term Subjective Papers , Solved Mid Term Objective Papers From This Discussion For Preparation Mid Term Papers of Fall 2015-16.

CS506 Assignment no. 2 Solution

You can download CS506 Assignment No. 2 Solution from the Link Below:

CS301 Assignment No. 2 Solution Fall 2016

By: // No comments:

CS301 Assignment No. 2 Fall2016

CS301 - Data Structures Assignment No. 2 Solution Fall 2016 Due Date: Nov 29, 2016
CS301 Assignment No. 2
Semester: Fall 2016
CS301 – Data Structures
CS301 Assignment Total Marks: 20
CS301 Assignment Due Date: Tuesday, November 29, 2016


Also Read: CS502 Assignment No. 02 Solution Fall 2016

CS301 Assignment Instructions

Please read the following instructions carefully before submitting assignment:
It should be clear that your assignment will not get any credit if:

  • Assignment is submitted after due date.
  • Submitted assignment does not open or file is corrupt.
  • Assignment is copied (From internet/ to from students).
For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file. Other format will not be accepted and will be graded zero marks.
Note: Use ONLY Dev-C++ IDE for writing and executing your code.

Also Read : Free Microsoft Office Specialist (MOS) for Virtual University

CS301 Assignment Objectives:

The purpose of this assignment is to make you familiar with following topics:
  • Tree
  • Binary Tree
  • Terminologies of a Binary Tree
  • Level
  • Complete Binary Tree
  • Level of a Complete Binary Tree
Also Read: PM Laptop Scheme for Virtual University Students 2016-17

CS301 Assignment Submission Instructions

You have to submit only .cpp on the Assignments interface of CS301 at VULMS. Assignment submitted in any other format will not be accepted and will be graded zero marks.

CS301 Assignment No. 2

Marks= 20

CS301 Assignment Question 1: 

Write down C++ code to create a complete binary Tree in which user can add any number of node/elements (Numeric). After Creating a complete binary tree , You need to calculate the product of the 2nd lowest level and find the smallest number in the binary tree as given in the example:

CS301 Assignment No. 2 Solution Fall 2016

Product of Elements in 2nd last level (N-1)= 20

Smallest number in Binary Tree = 2

Note: N levels mean any number of levels.

CS301 Assignment Deadline:

Your assignment must be uploaded on or before Tuesday, November 29, 2016. We shall not accept your solution through email after the due date.

Also Read: financial accounting MGT101 Solved Papers



CS301 Assignment No. 2 Solution Fall 2016

Here You can download CS301 Assignment No. 2 Solution & Discussion for Fall 2016.

CS301 Assignment No. 2 Solution

#include <stdio.h>
#include <iostream>
using namespace std;
struct Node
{
int val;
struct Node *left, *right;
};
Node *newNode(int data)
{
Node *temp = new Node;
temp->val = data;
temp->left = temp->right = NULL;
return temp;
}
// A utility function to find deepest leaf node.
// lvl: level of current node.
// maxlvl: pointer to the deepest left leaf node found so far
// isLeft: A bool indicate that this node is left child of its parent
// resPtr: Pointer to the result
void deepestLeftLeafUtil(Node *root, int lvl, int *maxlvl,
bool isLeft, Node **resPtr)
{
// Base case
if (root == NULL)
return;
// Update result if this node is left leaf and its level is more
// than the maxl level of the current result
if (isLeft && !root->left && !root->right && lvl > *maxlvl)
{
*resPtr = root;
*maxlvl = lvl;
return;
}
// Recur for left and right subtrees
deepestLeftLeafUtil(root->left, lvl+1, maxlvl, true, resPtr);
deepestLeftLeafUtil(root->right, lvl+1, maxlvl, false, resPtr);
}
// A wrapper over deepestLeftLeafUtil().
Node* deepestLeftLeaf(Node *root)
{
int maxlevel = 0;
Node *result = NULL;
deepestLeftLeafUtil(root, 0, &maxlevel, false, &result);
return result;
}
Node* insert(Node* node, int val)
{
/* 1. If the tree is empty, return a new,
single node */
if (node == NULL)
return(newNode(val));
else
{
/* 2. Otherwise, recur down the tree */
if (val <= node->val)
node->left = insert(node->left, val);
else
node->right = insert(node->right, val);
/* return the (unchanged) node pointer */
return node;
}
}
int minValue(Node* node) {
Node* current = node;
/* loop down to find the leftmost leaf */
while (current->left != NULL) {
current = current->left;
}
return(current->val);
}
// Driver program to test above function
int main()
{
int a, b, c, d, e, f, g, h, i, j;
cout"Enter 10 Numbers in Tree:\n";
cin>>a>>b>>c>>d>>e>>f>>g>>h>>i>>j;
Node* root = newNode(a);
root->left = newNode(b);
root->right = newNode(c);
root->left->left = newNode(d);
root->right->left = newNode(e);
root->right->right = newNode(f);
root->right->left->right = newNode(g);
root->right->right->right = newNode(h);
root->right->left->right->left = newNode(i);
root->right->right->right->right = newNode(j);
root = insert(root, a);
insert(root, b);
insert(root, c);
insert(root, d);
insert(root, e);
insert(root, f);
insert(root, g);
insert(root, h);
insert(root, i);
insert(root, j);
Node *result = deepestLeftLeaf(root);
if (result){
cout "Product of 2nd lowest level of a binary tree is: " result->val * result->val;
}
else{
cout "There is no left leaf in the given tree";
}
printf("\nMinimum value in BST is %d", minValue(root));
return 0;
}

Download CS301 Solution file:


CS301 Solution 2 Fall 2016- By_irfan.cpp, 3 KB9

CS502 Assignment No. 02 Solution Fall 2016

By: // No comments:

C502 Assignment No. 02 Fall 2016

CS502- Fundamentals of Algorithms Assignment No. 02 Solution Fall 2016 C502 Assignment No. 02 Assignment No. 02
Semester:Fall 2016
Fundamentals of Algorithms – CS502
Total Marks: 15
Due Date:04/12/2016

Also Read: PM Laptop Scheme for Virtual University Students 2016-17

CS502 Assignment Instructions:

Please read the following instructions carefully before submitting the assignment:
  • You will submit your assignment before or on due date on VU-LMS.
  • Assignment sent via Email will not be replied and accepted/graded in any case.
  • If the submitted assignment does not open or file is corrupt, it will not be graded.
  • Assignment should be completed by your own efforts it should not be copied from internet, handouts or books.
  • You will submit solution only in the Microsoft Word File.
  • Assignment is covered from lectures 1 to 15.
Also Read: ISL 201 Mid term SOlved Papers

CS502 Assignment Questions
CS502 Assignment Total Marks 15

CS502 Assignment Question No. 01 

(Marks=10)

Draw the final Max-Heap structure for the following array,Show the final result (tree) only.

50    31    45    30    2    7    40    12    28    1

CS502 Assignment Question No. 02

(Marks=5)

Which of the following sorting algorithms is stable? Write Yes/No against each algorithm

Sorting Algorithm                   Stable
Merge Sort
Heapsort
Quicksort
Counting Sort
Bubble Sort

You Can Also Download Solved Mid Term PapersShort NotesAssignment SolutionsLecture Wise Questions Answers FilesSolved MCQsSolved Quiz , Solved Mid Term Subjective Papers , Solved Mid Term Objective Papers From This Discussion For Preparation Mid Term Papers of Fall 2015-16.

CS502 Assignment No. 02 Solution

CS502 assignement 2 SOlved by Rubaisha.pdf, 89 KB
CS502 assignement 2 SOlved by Amanullah.docx, 247 KB

ENG301 All Midterm Past Papers - Fall 2015

By: // No comments:

ENG301 Midterm Past Papers

You you can discuss and Download ENG301 All Midterm Past Papers of Fall 2015 from 19th Dec to 31st Dec.
Total question:17
Total Marks: 35
Total MCQs of 1 Marks:10
Total short subjective question of 2 Marks = 2
Total short subjective question of 3 Marks = 2
Total short subjective question of 5 Marks = 3

ENG301 All Midterm Past Papers -Fall 2015

Q1: Enlist and explain optional part of letter?
Q2: what is ethnocentric stereotyping?
Q3: Write the parts of letter head?
Q4: English is international language then why American want to learn other cultures?
Q5: Facial expressions and body language is important for communicaton. comment?
Q6: What is Direct Approach?
Q7: Write the Body of an Order Letter.

ENG301 Midterm Paper was as follows:

10 mcqs 
10 true false (in Subjective questions) 
Subjective Questions:
1- Disadvantages of Email
2- Laws and Regulations 
3- short summary of meeting during extracurricular activity 

Eng301 Midterm Paper on Dec 21 2015

At 10:30 :P

Total Questions were 17

10 MCQ’s = 10 marks

1 true and false = 2 marks

MCQs ENG301 Midterm Exam

1. Barriers in communication due to the difference of sensory perception are called________ barriers.
2. ____________ include vocal but non-verbal aspects.
3. When a vice president in an organization send message to the sales manager which type of flow is it?
4. _______ represent nation cultural variable.
5. By using buffer ……….. yeh wala bhool gai sholi :(
6. MA/na is the appropriate way to represent ___________ in business letter.
7. Which of the following is optional part of a letter .?
8. Which of the following approach is used to write a letter of “Thank you” to a customer
9. Which of the following is applied to make the message vivid?
10. Functional coordination is one important reason for communication with______?

Short Questions ENG301 Midterm Exam

True / False
1. I) It is significant to know about eating habit of the host country if you are planning to travel abroad?

II) Table manner are same in all parts of the world ??
2. Write any two points of writing a letter of refusal an order? 2 marks

3. (3marks)
I) The aim of cross-cultural communication training is to___________. ( create strong cultural ties, or develop business etiquette )

II) An e-mail style is determined by a person ___________ . ( culture , communicative ability )

III) Hearing and listening are same things? True / False
4. Choose the non-discriminatory expressions, ( 3 marks)
Sales person
Chairman
News caster
Business person

5. What is the role of “ Personal space” in affective communication ? 5 marks
6. Fill in blanks related to topic Decision making in handouts page number 49
7. Fill in blanks two two options were given ( 5 Marks)

MCQ's Answers ENG301 Midterm Papers

Psychological Barriers , ( in handouts page 16)
paralanguage on page 19 last paragraph
Downward flow
Economic baqi 3 options bhi thy but wo individual k thy in handouts page 43
yaad ni pal me ny tukka lagaya tha i think koi good well ka :P
Reference section page 61 last paragraph
4 option were given in which attention line was optional part and others were standard parts.
Me ny direct wala select tia tha but i m confuse about it :(

You Can download papers by a simple click on file. All the uploaded filed are in Zip file or PDF format So Install Adobe Reader and Winrar Software’s to open these Files

Note: If you download files with Internet Download Manager (IDM), you would face problem of damage files. All files are correct and no damage file, If you face this problem, Open IDM > Click on Options > Click on File Types > Remove PDF and ZIP from files types and save. After it download again files, files will work properly.OR Press alt+click the file.

You Can Also Download Solved Mid Term PapersShort NotesAssignment SolutionsLecture Wise Questions Answers FilesSolved MCQsSolved Quiz , Solved Mid Term Subjective Papers , Solved Mid Term Objective Papers From This Discussion For Preparation Mid Term Papers of Fall 2015-16.
Virtual University of Pakistan's Assignments, Papers and Quiz, Solved questions and much more is available for Students Help. Virtual Study Solutions Offer Virtual University Of Pakistan, Assignments, Mid-Term/Final-Term Papers And Quiz, Solved Questions And Much More For Students Of Virtual University.We are here to facilitate your learning and do not appreciate the idea of copying or replicating solutions.