Skip to main content

MTH603 Current Midterm Paper by Ahmad, Spring 2014

MTH 603 paper was easy

MCQ were 80% new but easy and from handouts...........only 3 to 5 mcqs were from
moazz file

subjectives were:

1 ek vector diya hua tha us ko normalize kama tha or phir eigen values or eigen
vector likhna tha ........2marks

2. backward difference table banana tha 3 values x kl or 3 y ki di hui theen......2
marks

3. 3 equations di hui theen un ko diagonally dominant form mai diya hua tha......3
marks

4. theta kl value maloom kami thi jacobi method say marks

5. power method say 2 iterations karni thi.......5 marks

6. prove delta meu = delta+uIta delta/2 (see interpolation chapter this question is as it
is available there)

Important topics for subjectives are:

1. Eigen values and Eigen vectors chapters (both with power method and jacobi
methods are important)

2. interpolation k sary chapters are very very and very important us may say kuch
mat choma........

3. Gauss seidal and jacobi iterative method for solving linear equation are very im-
portant.

INSHALLAH ap ka subjectives ka part acha hojai ga uper batai huay topics mai say
maine bhi sirf yeh topics prepare kiye the b/c is may say bohat ziada a raha
hai.............

For MCQs read handouts carefully and do moazz fiIe........Don't rely only on moazz
file.............

Pray For me

Thanks

Comments

Post a Comment

Please give us your feedback & help us to improve this site.

Popular posts from this blog

CS301 Current Finalterm Paper Spring 2014 Shared By M. Waleed

My Tday's Cs301 Paper: Mcq's Are From Moaz And Some Are From Handouts. Subjective Is From Moaz Majority One. 1- The Image Segmentation Define? 2- The Maximum Number Level Of Nodes In Binary Tree 3-The Iteration Array Have To Sort. 4- The Hapified Array Have To Solved 5- The Algorithm Of Binary Seaoh Tree 6-Sara Arrays Wala He Tha Ya Heap Wala. 7-....Wala Wala Wala...
1 comment
Read more

CS614 Quiz No.3 Shared by Students (Solved), Spring 2014

______ index stores first value in each block in the sequential file and a pointer to the block.  Select correct option:   Dense  Sparse  B-Tree  Hash In context of data parallelism, the work done by query processor should be:  Select correct option:  Almost zero  Maximum  Pipelined  Filtered across partitions The optimizer uses a hash join to join two tables if they are joined using an equijoin and  Select correct option:   Outer table has less number of rows  Inner table has less number of rows  Cardinality of tables is equal  Large amount of data needs to be joined Bitmap index is appropriate for:  Select correct option:  Low cardinality data  High cardinality data  Clustered data  Aggregated data If a task takes “T” time units to execute on a single data item, then execution of this task on “N” data items will take __...
Post a Comment
Read more

CS301 Quiz No.2 Shared by Tayyeba

Binary search algorithm can not be applied to ____ Select correct option: sorted linked list sorted binary trees        ok sorted linear array pointer array During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition. Select correct option: It will not have left child        ok It will not have right child It will not have both left and right children None of given options Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Select correct option: Input-restricted deque Output-restricted deque Priority queues        ok A BST generated from the data in ascending order is ____________. Select correct option: Linear Nonlinear Balanced        ok Un sorted In a program a reference variable, say x, can be declared as Sele...
1 comment
Read more