Pak 301 Mid Term Paper Fall November 2011

Pak 301 Mid Term Paper Fall November 2011:Today was my Pak 301 mid term paper, I remember some of long questions that were asked and I want to share them with you so you will be able to prepare yourself with an idea of current paper. There were 3 question of 2 marks each, 2 question of 3 marks each, and 2 question of 5 marks each.
1. Explain the poona Pact. (2 marks)
2. What do you know about Mohammadan Anglo indian College in Agra.(2 marks)
3.what was hierarchy system in british india.(2 marks)
4.what was hierarchy system in british india.(3 marks)
above two question were same i don't know why? and 1 question of 3 marks I forgot:)
5.What were the policies of Congress Government towards Muslims.(5 marks)
6. Explain the government of india ACT 1935. (5 marks)
published on 28 November, 2011

Pak 301 Mid Term Paper Fall November 2011

ENG 201 Quiz No 2 Solved 25 November 2011

• Sarah washed the apples _________them in the fridge

, and put
; and put
, she put
and put

• When a customer, making a claim, is at fault what should you definitely avoid when you respond to him/her

Preaching to the customer.
Refusing the claim.
Justifying your refusal to comply with the claim (not sure)
Complying with the claim.

• Where is the bad news placed in a negative message using the indirect approach?

at the end of the message

• Which type of letter states the positive aspects of the applicant's personality and how he/she would be an asset for the organization?

Letter of recommendation
Letter of acknowledgement

• A sentence consists of two parts; one is a subject which is the second one?

preposition
predicate
adjective
adverb

• Which of the following should be kept in mind to achieve Completeness?

Provide all necessary information
Use accurate grammar
Avoid unnecessary details
Use 'You attitude'

• Marie wanted to buy a new book, _________ she could not remember the title or the name of the author.

but
nor
for
so

ENG 201 Quiz No 2 Solved 25 November 2011

CS101 Quiz No 2 Solved November 2011

In Analysis of Algorithms ________ generally measured in terms of the number of steps required to execute an algorithm
JavaScript can be used along with HTML to
Creat interactivity in Web


Small programs that are a part of the Web page and run on the user’s (client’s) computer are called ______
Client side Scripts
Server Side Scripts

What step\steps is\are not correct in following sorting algorithm? Step 1 Repeat the following steps while the list is sorted: Step 2 Start with the first object in the listStep 3 Swap it with the one next to it if they are in the correct order Step 4 Repeat the same with the next to the first object Step 5 Keep on repeating until you reach the last object in the list
Select correct option:

Step 1
Step 3 and Step 2
Step 4
Step 1 and Step 3

During one of the international cricket tournaments, one of the teams intentionally lost a match, so that they could qualify for the next round If they had won that particular match, some other team would have qualified This is an example of a _________________
greedy algorithm
Non-greedy algorithm
The process that can be used to solve a problem is termed as the ______________
Use Case
 
Protocol
Algorithm
Flow Diagram

CS101 Quiz No 2 Solved November 2011

MTH 301 Assignment 2 Solution 2011

MTH 301 Assignment 2 Solution November 2011, Solution of assignment No 2 MTH 301, the last date of submitting this assignment is 21 november 2011 you can get idea from this solution and add some more steps in solving this problem. Click on the image given bleow to see the assignment solution clearly, moreover to get more assignment solution join this blog from right side widget or subscribe by email to get solutions in your email box, thanks.

MTH 301 Assignment 2 Solution 2011

CS 101 Assignement NO 2 Solution November 2011

CS 101 Assignement NO 2 Solution November 2011

Q. 1. Here is a Comparison table given below showing different Operating Systems. You are required to fill the columns a, b, c and d respectively by searching the following: (10 Marks)

Instructions for Column “a” to “d”:

a) The operating system is “Single User” or “Multi User”.

b) It supports “Single Tasking” or “Multi Tasking”.

c) It supports “Uni-Processor” or “Multi-Processor”.

d) You have to mention how much secure the operating system is, by filling it with “Excellent” , “Good”, “Very Good” and “Poor”.

Operating System	a. User (Single or Multiple)	b. Task (Single or Multi)	c. Processor (Uni/Multi)	d. Security
DOS	Single	Single	Uni	Poor
Windows XP	Multi	Multi	Multi	Very Good
Macintosh	Single	Multi	Multi	Poor
Unix	Multi	Multi	Multi	Excellent
Windows Server	Multi	Multi	Multi	Poor
Linux	Multi	Multi	Multi	Good
Windows 7	Single	Multi	Multi	Very Good

Answer No. 2

A		B
1	Operating System	D	Windows XP, Linux
2	Application Software	G	Web Publishing
3	Machine Language	I	Binary
4	Utility Software	F	Backup Software
5	Device Driver	J	System Software
6	Shareware	A	Distributed without payment
7	Trial Version Software	C	Useable for a short period
8	Engineering Software	E	AutoCAD
9	Vector Graphics	H	Corel Draw
10	Raster Graphic	B	Adobe Photoshop

CS 101 Assignement NO 2 Solution November 2011

CS 402 Quize Nov 2011

Q1

A DFA with n states must accept at least one string of length greater than n.

Choices:

True

False

Q2

FA corresponding to an NFA can be built by introducing a state corresponding to the combination of states, for a letter having

Choices:

no transition at certain state

one transition at certain state

more than one transitions at certain state

none of the given options

Q3

Which of the following statement is NOT true?

Choices:

FA can be considered to be an NFA

FA can be considered to be an NFA with null string

NFA can be considered to be an TG

TG can be considered to be an NFA

Q4

For every three regular expressions R, S, and T, the languages denoted by R(S U T) and (RS) U (RT) are the same.

Choices:

True

False

Q5

Does the empty string match the regular expression |y+a|?

Choices:

Yes

No

Q6

If an FA already accepts the language expressed by the closure of certain RE, then the given FA is the required FA.

Choices:

True

False

Q7

Which of the following statement is true about NFA with Null String?

Choices:

Infinite states

Infinite set of letters

Infinite set of transitions

Transition of null string is allowed at any stage

Q8

If R is a regular language and L is some language, and L U R is a regular language, then L must be a regular language.

Choices:

True

False

Q9

FA corresponding to an NFA can be built by introducing an empty state for a letter having

Choices:

no transition at certain state

one transition at certain state

two transition at certain state

more than two transitions at certain state

Q10

Let FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must correspond to the initial state of

Choices:

FA1 only

FA2 only

FA1 or FA2

FA1 and FA2

CS 402 Quize Nov 2011