Skip to main content

CS201 Current Midterm paper Shared by Ali, Spring 2014

My Todays CS201 Paper Shukr Alhmdulillah Acha ho gya

1- Considering the following structure, write the code for initializing the structure and
then displaying the value of each variable. (5)

struct student{

char name[64]; char oourse[128]; int age; int year;

2- Consider the following code segment. What will be the output of the following pro-
gram before and after calling the function updateAge?(5)

void updateAge (int U)

int main(){int age[5] ={10};

cout << “Array elements before passing array to function” << endl

for (int i =0; i <5; i++)

cout << “Array element"<< i+1 << <<age[i] [ << endl

updateAge(age); A

cout << "Array elements after passing array to function" << endl

for (int i =0; i <5; i++)

cout << “Array eIement"<< i+1 << <<age[i] [ << endl

void updateAge(int age[], int size){ age[3] = 20

3- If you are provided two methods for accessing a file; random and sequential.
Which method will you prefer and why? (3)

4- Determine the output of following code segment.(2) i

int x[5] = (2, 4, 5, 7, 1}

int "ptr =&x[2]; cout << ("ptr)++ <<endl ; cout << 'ptr++

5- Write a statement for opening file trans.txt for input; using an ifstream object called
inTransaction.(2)

6- Write a declaration statement for an array of 10 elements of type float. Also initial-
ize first four elements of array to 1.0, 2.0, 3.0 and 4.0.(2)

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

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

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