Thursday, 21 February 2019

CS302-Digital Logics and Design Final Term Past Papers | SSWT


CS302 Past Papers
CS302_Final_term_past_papers_file_01 Download
CS302_Final_term_past_papers_file_02 Download
CS302_Final_term_past_papers_file_03 Download
CS302_Final_term_past_papers_file_04 Download

CS302 Past Papers by MOAZ
CS302_Final_term_papers_Objective_Questions Download
CS302_Final_term_papers_Subjective_Questions Download

Tuesday, 19 February 2019

CS401-Computer Architecture and Assembly language Programming Final Term Past Papers | SSWT



CS401 Short Notes by Superstarwebtech
CS401_mid_term_short_notes_by_sswt Download
CS401_final_term_short_notes_by_sswt Download

CS401 Past Papers MCQS
CS401_Final_term_papers_MCQS_file_01 Download

CS401 Past Papers SUBJECTIVE + MCQs
CS401_Final_term_papers_Subj_MCQs_all_in_one_file Download

CS401 Past Papers by MOAZ
CS401_Final_term_papers_Objective_Questions Download
CS401_Final_term_papers_Subjective_Questions Download

CS401 Past Papers Zip
CS401_Final_term_papers_Zip_file_01 Download
CS401_Final_term_papers_Zip_file_02 Download
CS401_Final_term_papers_Zip_file_03 Download
CS401_Final_term_papers_Zip_file_04 Download
CS401_Final_term_papers_Zip_file_05 Download

CS401 Assembly Language Final Term Short Notes And Important Points Chapter 8-17 (lecture 23-45)


CS401-Computer Architecture Assembly Language Helping Material

Dear Students, here you can find all lecture notes for Final Term Exam preparations for subject CS401-Computer Architecture and Assembly Language Programming. We are providing Helping material for CS401 such as important lecture notes, Chapter wise short notes, and MCQS. Important lecture notes are in the form of pdf for each lecture. "All important points are marked and highlighted for each chapter" And All possible MCQs have been created for lectures 23-45 with Answers available in pdf format also. Chapter Wise Short notes are also available in pdf. You can read online as well as download Helping Material for CS401-Assembly language.


👉 Recommended: CS401 Midterm Notes

CS401-Chapter wise Short Notes Chapter 8-17 (Lecture 23-45)

Here you can find short notes for CS401, read them online or Download as per your requirements
CS401_CHAPTER 08 Software Interrupts.pdf Download
CS401_CHAPTER 09 Real Time Interrupts & HW Interfacing.pdf Download
CS401_CHAPTER 10 Debug Interrupts.pdf Download
CS401_CHAPTER 11 Multitasking.pdf Download
CS401_CHAPTER 12 Video Services.pdf Download
CS401_CHAPTER 13 Secondary Storage.pdf Download
CS401_CHAPTER 14 Serial Port Programming.pdf Download
CS401_CHAPTER 15 Protected Mode Programming.pdf Download
CS401_CHAPTER 16 Interfacing With High-Level Languages.pdf Download
CS401_CHAPTER 17 Comparison With Other Processors.pdf Download

CS401-Chapter Imp. highlighted Notes Chapter 8-17 (Lecture 23-45)

Here you can find important chapter notes for CS401, read them online or Download as per your requirements
CS401_CHAPTER 08 Software Interrupts.pdf Download
CS401_CHAPTER 09 Real Time Interrupts & HW Interfacing.pdf Download
CS401_CHAPTER 10 Debug Interrupts.pdf Download
CS401_CHAPTER 11 Multitasking.pdf Download
CS401_CHAPTER 12 Video Services.pdf Download
CS401_CHAPTER 13 Secondary Storage.pdf Download
CS401_CHAPTER 14 Serial Port Programming.pdf Download
CS401_CHAPTER 15 Protected Mode Programming.pdf Download
CS401_CHAPTER 16 Interfacing With High-Level Languages.pdf Download
CS401_CHAPTER 17 Comparison With Other Processors.pdf Download

CS301-Data Structures Final Term Past Papers | SSWT


CS301 Past Papers SUBJECTIVE QUESTIONS
CS301_Final_term_papers_Subj_Ques_file_01 Download
CS301_Final_term_papers_Subj_Ques_file_02 Download

CS301 Past Papers By Waqar and Hadi
CS301_Final_term_past_papers_file_01 Download
CS301_Final_term_past_papers_file_02 Download
CS301_Final_term_past_papers_file_03 Download
CS301_Final_term_past_papers_file_04 Download
CS301_Final_term_past_papers_file_05 Download

CS301 Past Papers by MOAZ
CS301_Final_term_papers_Objective_Questions Download
CS301_Final_term_papers_Subjective_Questions Download

CS201-Introduction to Programming Final Term Past Papers | SSWT


CS201 Past Papers MCQS
CS201_Final_term_papers_MCQS_file_01 Download

CS201 Past Papers 2005
CS201_Final_term_papers_2005_file_01 Download
CS201_Final_term_papers_2005_file_02 Download

CS201 Past Papers 2006
CS201_Final_term_papers_2006_file_01 Download
CS201_Final_term_papers_2006_file_02 Download

CS201 Past Papers 2009
CS201_Final_term_papers_2009_file_01 Download
CS201_Final_term_papers_2009_file_02 Download
CS201_Final_term_papers_2009_file_03 Download

CS201 Past Papers 2010
CS201_Final_term_papers_2010_file_01 Download
CS201_Final_term_papers_2010_file_02 Download
CS201_Final_term_papers_2010_file_03 Download
CS201_Final_term_papers_2010_file_04 Download

CS201 Past Papers by MOAZ
CS201_Final_term_papers_Objective_Questions Download
CS201_Final_term_papers_Subjective_Questions Download

Monday, 18 February 2019

CS101-Introduction to Computing Final term Past Papers | SSWT


CS101 Past Papers MCQS
CS101_Final_term_papers_MCQS_file_01 Download
CS101_Final_term_papers_MCQS_file_02 Download
CS101_Final_term_papers_MCQS_file_03 Download
CS101_Final_term_papers_MCQS_file_04 Download

CS101 Past Papers SUBJECTIVE QUESTIONS
CS101_Final_term_papers_Subj_Ques_file_01 Download
CS101_Final_term_papers_Subj_Ques_file_02 Download
CS101_Final_term_papers_Subj_Ques_file_03 Download
CS101_Final_term_papers_Subj_Ques_file_04 Download

CS101 Past Papers by MOAZ
CS101_Final_term_papers_Objective_Questions Download
CS101_Final_term_papers_Subjective_Questions Download

CS101 Past Papers Short Notes
CS101_Final_term_past_papers_Short_Notes Download

CS101 Past Papers Zip
CS101_Final_term_past_papers_Zip_file_01 Download
CS101_Final_term_past_papers_Zip_file_02 Download
CS101_Final_term_past_papers_Zip_file_03 Download
CS101_Final_term_past_papers_Zip_file_04 Download

ACC501-Business Finance Final Term Past Papers | SSWT


ACC501 Past Papers
ACC501_Final_term_papers_MCQS_file Download

ACC501 Past Papers 2006
ACC501_Final_term_past_papers_2006_file_01 Download
ACC501_Final_term_past_papers_2006_file_02 Download
ACC501_Final_term_past_papers_2006_file_03 Download
ACC501_Final_term_past_papers_2006_file_04 Download

ACC501 Past Papers 2008
ACC501_Final_term_past_papers_2008_file_01 Download
ACC501_Final_term_past_papers_2008_file_02 Download
ACC501_Final_term_past_papers_2008_file_03 Download
ACC501_Final_term_past_papers_2008_file_04 Download

ACC501 Past Papers 2007, 2009, 2011
ACC501_Final_term_past_papers_2007_file_01 Download
ACC501_Final_term_past_papers_2009_file_01 Download
ACC501_Final_term_past_papers_20011_file_01 Download

ACC501 Past Papers Zip
ACC501_Final_term_past_papers_Zip_file_01 Download
ACC501_Final_term_past_papers_Zip_file_02 Download

Saturday, 16 February 2019

ACC301-Fundamentals of Auditing Final term Past Papers | SSWT



ACC301 Past Papers  
ACC301_Final_term_past_papers_file_01  Download
ACC301_Final_term_past_papers_file_02 Download

ACC301 Past Papers 2009 
ACC301_Final_term_past_papers_file_01 Download
ACC301_Final_term_past_papers_file_02 Download

ACC301 Past Papers Zip
ACC301_Final_term_past_papers_Zip_file  Download

Thursday, 14 February 2019

VU Final term Past Papers | SSWT

Dear Students, here you can find past papers for Final Term Exam (Spring / Fall) preparations for all subjects (ACC,CS,MTH,ENG,...STA). We are providing Helping material for all subjects such as: Past papers by Waqar Sidhu, Moaz, and others. Past papers are in different file formats (PDF, .docx, zip). Here you can download Latest / Past Papers by Virtual University of Pakistan. You can read them online as well download Helping Material for all subjects.

ACC - Fundamentals of Auditing and Business

ACC301 | ACC501

BIF - Bioinformatics

BIF731 | BIF732 | BIF733

BIO - Biology

BIO201 | BIO202 | BIO301 | BIO302 | BIO732

BNK - Banking

BNK601 | BNK603

BT - Biotechnology

BT731 | BT733

CS - Computer Science

CS101 | CS201 | CS206 | CS301 | CS302 | CS304 | CS311 | CS312 | CS401 | CS402 | CS403 | CS408 | CS410 | CS411 | CS501 | CS502 | CS504 | CS506 | CS507 | CS508 | CS601 | CS602 | CS604 | CS605 | CS606 | CS607 | CS609 | CS610 | CS614 | CS615 | CS701 | CS702 | CS703 | CS704 | CS706 | CS707 | CS708 | CS709 | CS710 | CS711 | CS712 | CS713 | CS716 | CS718 | CS721 | CS723 | CS724 | CS726

ECO - Economics

ECO401 | ECO402 | ECO403 | ECO404 | ECO501 | ECO506

EDU - Education

EDU101 | EDU201 | EDU301 | EDU303 | EDU304 | EDU305 | EDU402 | EDU405 | EDU406 | EDU410 | EDU411 | EDU501 | EDU505 | EDU512 | EDU515 | EDU516 | EDU601 | EDU602 | EDU603 | EDU654

ENG - English

ENG001 | ENG101 | ENG201 | ENG301

ETH - Ethics

ETH202

FIN - Finance

FIN611 | FIN621 | FIN622 | FIN623 | FIN625 | FIN630

GSC - General Science

GSC101 | GSC201

HRM - Human Resource Management

HRM617 | HRM624 | HRM627 | HRM713

ISL - Islamiyat

ISL201

IT - Information Technology

IT430

MCM - Mass Communication

MCM101 | MCM301 | MCM304 | MCM310 | MCM311 | MCM401 | MCM404 | MCM411 | MCM501 | MCM511 | MCM514 | MCM515 | MCM516 | MCM604 | MCM610

MGMT - Management Sciences

MGMT611 | MGMT614 | MGMT622 | MGMT623 | MGMT625 | MGMT627 | MGMT628 | MGMT629 | MGMT630 | MGMT727

MGT - Management Sciences

MGT101 | MGT111 | MGT201 | MGT211 | MGT301 | MGT401 | MGT402 | MGT404 | MGT411 | MGT501 | MGT502 | MGT503 | MGT504 | MGT510 | MGT520 | MGT601 | MGT602 | MGT603 | MGT604 | MGT610 | MGT611 | MGT612 | MGT613 | MGT621 | MGT705

MKT - Marketing

MKT501 | MKT530 | MKT603 | MKT610 | MKT611 | MKT621 | MKT624 | MKT625 | MKT630

MTH - Mathematics

MTH001 | MTH100 | MTH101 | MTH201 | MTH202 | MTH301 | MTH302 | MTH303 | MTH401 | MTH501 | MTH601 | MTH603

PAK - Pakistan Studies

PAK301 | PAK302

PHY - Physics

PHY101 | PHY301

PSC - International Relations

PSC201 | PSC401

PSY - Psychology

PSY101 | PSY401 | PSY403 | PSY404 | PSY405 | PSY406 | PSY407 | PSY408 | PSY409 | PSY502 | PSY504 | PSY510 | PSY511 | PSY512 | PSY513 | PSY514 | PSY610 | PSY631 | PSY632

SOC - Sociology

SOC101 | SOC401

STA - Statistics

STA301 | STA630 | STA730

URD - Urdu

URD101

Thursday, 7 February 2019

ENG101 English Comprehension | Assignment No.2 Solution | Spring 2018 | Due Date : May 2018

Eng101-English Comprehension

Spring 2018
Assignment No. 2
Total Marks: 20
Lectures: 10-18

Instructions:

·         Upload your assignments in a proper format, i.e. MS word file. Corrupt files will be awarded zero marks.

·         The assignments should be zoomed in at 100%.

·         Please avoid plagiarism; plagiarized work will be marked zero.

·         After the due date, the assignments submitted via email would not be entertained.

·         Please avoid submitting copied assignments; otherwise, such a case would be referred to the discipline committee.

·         The font color should be preferably black and font size 12 Times New Roman.

Q1. Writers use different techniques to bring their characters to life. They use these techniques to translate their vision of people using words. Some extracts from different writings are given below. In each paragraph, identify the technique used by the writer for “character representation”.                                                                                 

Choose an appropriate technique from the following:     

  • In action
  • In speech
  • By direct statement
  • By choice of words and picking out a particular feature or detail
  • By associating the character with a point of view


Q2. One vital concept of reading comprehension is to evaluate texts. Two passages have been given to evaluate the writer’s intention regarding running on a treadmill. Read the passages carefully and compare them by answering the multiple choice questions given below.                                                                                                                     (2*5=10 Marks)



Passage (1)

     The treadmill began to whir, and I gripped its handlebars as the belt started moving me backwards.  All I could do now was run -- or begrudgingly barrel forward -- toward an outdated screen that showed me the terrain I was supposed to be running on.  It was made of red squares stacked up, one on top of another: the higher stacks were supposed to be steep hills, and the lower ones, valleys.  I tried to picture them as burning coals to see if that would make me speed up or at least feel like this exercise was somehow connected to nature -- even one of its cruel parts.



Passage (2)

     The treadmill began to whir, and my heart sped up faster than the belt could go. Instead of pressing "select" on my remote control to escape into a TV show, I had just selected "Power Run."  A sleek screen with a simple set of red lines showed me the terrain on which I was running.  Those red lines looked like a pulse, and they got me to run farther and faster than I could ever run when I'm outside, worried about weather, cars, or other people.  It may not have looked like I was going anywhere that night, but I had just broken out of a ten-year slump. 


Wednesday, 6 February 2019

CS602 Computer Graphics Quiz MCQS Lecture 23-45 FinalTerm Objective Questions | SUPERSTARWEBTECH

CS602-Computer Graphics Quiz  MCQS #Objective #Questions #Finalterm

1. To convert the information in the A matrix into that required for the P matrix, we do some simple matrix algebra. First, we have GP=
NP
UP
NU
UNP ✔
2. With similar expressions for y(u) and z(u). Again the a, b, c and d terms are constant coefficients. As we did with Equation for a plane curve, we combine the x(u), y(u), and z(u) expressions into a single vector equation :
Au2+bu1+cu+d
Au4+bu3+cu2+d1
Au3+bu2+cu2+d
Au3+bu2+cu+d ✔
3. NURBS stands for __
Non-Universal Rational Binary Spline
Non-Uniform Rational Binary Splines
Non-Uniform Rational Beta Splines ✔
Non-Universal Rational Beta Splines 
4. An independent consortium, the OpenGL Architecture Review Board, guides the OpenGL specification. With broad industry support, OpenGL is the only truly open, vendor-neutral, ___ graphics standard. 
Tertiary
Binary
Single platform
Multiplatform ✔
5. A space curve is not confined to a plane. It is free to twist through space. To define a space curve we must use parametric functions that are ____ 
Binary Polynomials
Mono Polynomials
Quadratic Polynomials
Cubic Polynomials ✔
6. ___ sets the reshape callback for the current window. The reshape callback is triggered when a window is reshaped
glutMainLoop
glutIdleFunc
glutReshapeFunc ✔
glutDisplayFunc
7. The reflected light wave turns out to be a ___ case since light is reflected at the same angle as the incident wave (when the surface is smooth and uniform, as we'll assume for now). 
Unknown
Simple ✔
Complex
Abnormal
8. Signed integer colour components, when specified, are linearly mapped to floating-point values such that the most positive representable value maps to 1.0, and the most negative representable value maps to ___.
-1.0
0.0
2.0
1.0✔
Floating-point values are mapped directly.
9. To ensure a smooth transition from one section of a piecewise ___ to the next, we can impose various continuity conditions at the connection points.
non-parametric curve
parametric curve
polygon vector ✔
None
10. If the current matrix (according to glMatrixMode) is multiplied by this translation matrix, with the product replacing the current matrix. That is if M is the current matrix and T is the translation matrix, then M is replaced with ___.
M-T
M+T
M/T
M*T ✔
11. glutReshapeWindow requests a change in the size of the current window. The width and height parameters are size extents in pixels. The width and height must be ___
Neutral
Negative
Positive
None

Sunday, 3 February 2019

MTH501 Linear Algebra Quiz 2 Lecture 28-32 FALL 2018 Due date: 04 Feb, 2019 | SSWT

MTH501-Linear Algebra
QUIZ 2
Lecture 28-32
FALL 2018
due date: 04 Feb., 2019

The null-space of a linear transformation T is the set of all vectors v such that T(v)=

If A is an n x n matrix, then the following statements are equivalent EXCEPT

If A is triangular matrix then the eigenvalues of A are the entries on the main diagonal of A

A row interchange ____ the sign of determinant

The characteristics polynomial of a 3 x 3 identity matrix is ___ if x is the eigen value of the given 3 x 3 identity matrix

An n x n matrix with n distinct eigen values is ___

If   λ is an eigen value of a matrix A and x is a corresponding eigenvector, and if k is any positive integer then λ k
is an eigenvalue of ___ and x is corresponding eigenvector.

If 3 is an eigenvalue of A and x is a corresponding eigenvector then what is the eigenvalue of A^2?

The dominant or principal eigenvector of a matrix is an eigenvector corresponding to the eigenvalue of ___ magnitude (for real numbers, largest absolute value) of that matrix.

If n x n matrices A and B are similar. then they have the ___ characteristic polynomial.
If A be n x n matrix, then det(A^T)=

An n x n matrix A is diagonalizable if and only if A has n linearly ___ eigenvectors

If A is a m x n matrix and A=A^T which of the following must always be true?

An n x n matrix with n distinct values is ___

The dominant or principal eigenvector of a matrix is an eigenvector corresponding to the eigenvalue of ___ magnitude (for real numbers, largest absolute value) of that matrix

If n x n matrices A and B are similar, then they have the ___ characteristic polynomial

Two matrices with the same characteristic polynomial ___ similar

If x-2 is a factor of the characteristic polynomial of matrix C then an eigenvalue of C is

If A and B are n x n matrices, then det (AB) =

A row interchange ___ the sign of the determinant