Education In Pakistan

Papers, Notes, Books & Help For Students

UPDATED EDUCATIONAL NEWS INTERVIEW HELP FOR ALL JOBS ONLINE BOOKS SCHOLARSHIPS AVAILABLE INTERNSHIP JOBS

Tag: FALL 2006

VU CS504- Software Engineering – I (Session – 1 ) FinalTerm solved unsolved past papers FALL 2006

VU CS504- Software Engineering – I (Session – 1 ) FinalTerm Solved Unsolved Past Papers FALL 2006

 

FINALTERM  EXAMINATION

FALL 2006

CS508 – MODERN PROGRAMMING LANGUAGES (Session – 1 )

 

Marks: 60

Time: 120min

 

StudentID/LoginID:

______________________________

Student Name:

______________________________

Center Name/Code:

______________________________

Exam Date:

Monday, February 19, 2007

 

           Please read the following instructions carefully before attempting any of the questions:Note: This paper is Close book and Close Handouts

1.  Attempt all questions. Marks are written adjacent to each question.

2.  Do not ask any questions about the contents of this examination from anyone.

a.   If you think that there is something wrong with any of the questions, attempt it to the best of your understanding.

b.   If you believe that some essential piece of information is missing, make an appropriate assumption and use it to solve the problem.

c.   Write all steps, missing steps may lead to deduction of marks.


**WARNING: Please note that Virtual University takes serious note of unfair means. Anyone found involved in cheating will get an `F` grade in this course.

 

 

 

For Teacher’s use only

Question

1

2

3

4

5

6

7

8

9

10

Total

Marks

 

 

Question No: 1    ( Marks: 2 )     –  Please choose one
         Java has a String class which is not exactly an array of 

►  Char 

 

 

►  Elements 

 

►  Indices 

 

►                    Long 

 

 

 

 

Question No: 2    ( Marks: 2 )     –  Please choose one
         How many string operators are in PHP? 

► 

 

► 

 

 

► 

 

►  10 

 

 

 

 

Question No: 3    ( Marks: 2 )     –  Please choose one
         If you want an argument to a function to always be passed by reference, you can prepend 

►  Percentage sign (%) to the argument name in the function definition 

 

►  Dollar sign ($)to the argument name in the function definition 

 

 

►  An ampersand (&) to the argument name in the function definition 

 

 

►                    Tilled sign (~)to the argument name in the function definition 

 

 

Question No: 4    ( Marks: 2 )     –  Please choose one
            How many modes for the source code are in C# ?

►  One 

 

►  Two 

 

 

 

►  Three 
►                          Four 

 

 

 

Question No: 5    ( Marks: 2 )     –  Please choose one
            Which chaining type is used by Prolog?

►  Backward 

 

►  Forward 

 

 

►  Up 

 

►  Horizontal 

 

 

 

 

Question No: 6    ( Marks: 10 )
      What is meant by binding time? What are the five possible binding times? Explain each briefly. 

 

 

Question No: 7    ( Marks: 10 )
            What are the enumeration and subrange types? Differentiate these two in points. 

 

 

Question No: 8    ( Marks: 10 )
            a) What is the purpose of type conversion? (5) 

b)  Differentiate between the implicit and explicit type conversion with respect to Java. (5)

 

 

 

Question No: 9    ( Marks: 10 )
         a) What are interpreted and compiled languages? Give examples (5) 

b) Differentiate between client side scripting and server side scripting languages? (5)

 

 

 

Question No: 10    ( Marks: 10 )
            a) Describe the programming steps in Prolog?  (5) 

b) Explain the Prolog features regarding its applications in real world. (5)

 

 

 

 

 

VU CS504- Software Engineering – I (Session – 1 ) FinalTerm Solved Unsolved Past Papers FALL 2006

VU CS601 – DATA COMMUNICATION FINALTERM solved unsolved past papers FALL 2006

VU CS601 – DATA COMMUNICATION FINALTERM Solved Unsolved Past Papers FALL 2006

 

FINALTERM  EXAMINATION

FALL 2006                                                   Marks: 70

CS601 – DATA COMMUNICATION                           Time: 120min

StudentID/LoginID:
Student Name:

Center Name/Code:
Exam Date:

 

Please read the following instructions carefully before attempting any question:

1. This examination is closed book, closed notes, closed neighbors.

2. Answer all questions.

a)  There is no choice.

b)  You will have to answer correctly all questions in this examination to get the
maximum possible marks.

3. Do not ask any questions about the contents of this examination from anyone.

a)  If you think that there is something wrong with any of the questions, attempt
it to the best of your understanding.

b)  If you believe that some essential piece of information is missing, make an
appropriate assumption and use it to solve the problem.

4. Choose only one choice as your answer in the multiple choice questions.

a)  If you believe that two (or more) of the choices are the correct ones for a
particular question, choose the best one.

b)  On the other hand, if you believe that all of the choices provided for a

particular question are the wrong ones, select the one that appears to you as being the least wrong.

c)  Objective question is compulsory

5. Calculator is allowed.

 

**WARNING: Please note that Virtual University takes serious note of unfair means. Anyone found involved in cheating will get an `F` grade in this course.

 

For Teacher’s use only

Question       1           2           3           4           5           6           7           8           9          10      Total

Marks

Question      11        12         13

Marks

 

Question No: 1    ( Marks: 1 )      –   Please choose one

 

OSI standard is practically implemented in the form of internet.

►   TRUE

►   FALSE

 

Question No: 2    ( Marks: 1 )      –   Please choose one

 

 

TCP/IP application layers combine the functions of OSI Application, Session and Transport

www.vu39.comlayers.

►   TRUE

►   FALSE

 

Question No: 3    ( Marks: 1 )      –   Please choose one

 

Unipolar use one voltage levels.

►   TRUE

►   FALSE

 

Question No: 4    ( Marks: 1 )      –   Please choose one

 

The material of core and cladding in fiber optic cable is same.

►   TRUE

►   FALSE

 

Question No: 5    ( Marks: 1 )      –   Please choose one

 

Burst error is easily corrected then bit error.

►   TRUE

►   FALSE

 

Question No: 6    ( Marks: 1 )      –   Please choose one

 

Set of rules governing communication is known as

►   OSI model

►   Protocol

 

►   Medium

 

Question No: 7    ( Marks: 1 )      –   Please choose one

 

WDM(wave division multiplexing) deals with

►   electric waves

►   light waves

 

 

►   both

 

Question No: 8    ( Marks: 1 )

www.vu39.com

–   Please choose one

 

 

A Null modem is a

 

►   traditional modem

 

►   technique to connect two DTE

 

 

►   both

 

 

Question No: 9    ( Marks: 1 )      –   Please choose one

 

 

Router work on

 

►   data link layer

 

►   physical layer

 

►   network layer

 

 

 

Question No: 10    ( Marks: 1 )      –   Please choose one

 

 

Poll/Select is a technique related with

 

►   line control

 

►   line discipline

 

 

►   error control

 

 

Question No: 11    ( Marks: 20 )

 

 

A)        Summarize the function of network support layers in OSI reference model?    [12

Marks]

 

B)   An analog signal carries 4 bits in each signal element. If 1000 signal elements are sent per second, find the Baud Rate and Bit Rate? [8 Marks]

Question No: 12    ( Marks: 20 )

 

A) What is the range of microwave? Explain microwave transmission and its types? [10 Marks]

 

B) Write a Brief transmission impairments. [10 Marks]

 

 

Question No: 13    ( Marks: 20 )

 

 

A)        Give exact mechanism and applications of token ring/bus and FDDI? [10 Marks]

B)  A TELEPHONE line normally has bandwidth of 3000 Hz, the signal to noise ratio is usually 35dB.calculate the capacity of the channel? [10 Marks]

 

v\:* {behavior:url(#default#VML);}
o\:* {behavior:url(#default#VML);}
w\:* {behavior:url(#default#VML);}
.shape {behavior:url(#default#VML);}

FINALTERM  EXAMINATION

www.vu39.com

FALL 2006                                                   Marks: 70

CS601 – DATA COMMUNICATION                           Time: 120min

StudentID/LoginID:
Student Name:

Center Name/Code:
Exam Date:

 

Please read the following instructions carefully before attempting any question:

1. This examination is closed book, closed notes, closed neighbors.

2. Answer all questions.

a) There is no choice.

b) You will have to answer correctly all questions in this examination to get the
     
maximum possible marks.

3. Do not ask any questions about the contents of this examination from anyone.

a) If you think that there is something wrong with any of the questions, attempt
     
it to the best of your understanding.

b) If you believe that some essential piece of information is missing, make an
     
appropriate assumption and use it to solve the problem.

4. Choose only one choice as your answer in the multiple choice questions.

a) If you believe that two (or more) of the choices are the correct ones for a
     
particular question, choose the best one.

b) On the other hand, if you believe that all of the choices provided for a

particular question are the wrong ones, select the one that appears to you as being the least wrong.

c) Objective question is compulsory

5. Calculator is allowed.

 

**WARNING: Please note that Virtual University takes serious note of unfair means. Anyone found involved in cheating will get an `F` grade in this course.

 

For Teacher’s use only

Question       1           2           3           4           5           6           7           8           9          10      Total

Marks

Question      11        12         13

Marks

 

Question No: 1    ( Marks: 1 )         Please choose one

 

OSI standard is practically implemented in the form of internet.

   TRUE

   FALSE

 

Question No: 2    ( Marks: 1 )         Please choose one


TCP/IP application layers combine the functions of OSI Application, Session and Transport

www.vu39.com

layers.

   TRUE

   FALSE

 

Question No: 3    ( Marks: 1 )         Please choose one

 

Unipolar use one voltage levels.

   TRUE

   FALSE

 

Question No: 4    ( Marks: 1 )         Please choose one

 

The material of core and cladding in fiber optic cable is same.

   TRUE

   FALSE

 

Question No: 5    ( Marks: 1 )         Please choose one

 

Burst error is easily corrected then bit error.

   TRUE

   FALSE

 

Question No: 6    ( Marks: 1 )         Please choose one

 

Set of rules governing communication is known as

   OSI model

   Protocol

 

   Medium

 

Question No: 7    ( Marks: 1 )         Please choose one

 

WDM(wave division multiplexing) deals with

   electric waves

   light waves



  both

 

Question No: 8    ( Marks: 1 )


www.vu39.com

   Please choose one


 

A Null modem is a


   traditional modem


   technique to connect two DTE


 

   both


 

Question No: 9    ( Marks: 1 )         Please choose one


 

Router work on


   data link layer


   physical layer


   network layer


 

 

Question No: 10    ( Marks: 1 )         Please choose one


 

Poll/Select is a technique related with


   line control


   line discipline


 

   error control


 

Question No: 11    ( Marks: 20 )


 

A)        Summarize the function of network support layers in OSI reference model?    [12

Marks]

 

B)   An analog signal carries 4 bits in each signal element. If 1000 signal elements are sent per second, find the Baud Rate and Bit Rate? [8 Marks]

Question No: 12    ( Marks: 20 )

 

A) What is the range of microwave? Explain microwave transmission and its types? [10 Marks]

 

B) Write a Brief transmission impairments. [10 Marks]



Question No: 13    ( Marks: 20 )


www.vu39.com


A)        Give exact mechanism and applications of token ring/bus and FDDI? [10 Marks]

B)  A TELEPHONE line normally has bandwidth of 3000 Hz, the signal to noise ratio is usually 35dB.calculate the capacity of the channel? [10 Marks]

 

Normal
0
false

false
false
false

EN-US
X-NONE
X-NONE

MicrosoftInternetExplorer4

/* Style Definitions */
table.MsoNormalTable
{mso-style-name:”Table Normal”;
mso-tstyle-rowband-size:0;
mso-tstyle-colband-size:0;
mso-style-noshow:yes;
mso-style-priority:99;
mso-style-qformat:yes;
mso-style-parent:””;
mso-padding-alt:0in 5.4pt 0in 5.4pt;
mso-para-margin-top:0in;
mso-para-margin-right:0in;
mso-para-margin-bottom:10.0pt;
mso-para-margin-left:0in;
line-height:115%;
mso-pagination:widow-orphan;
font-size:11.0pt;
font-family:”Calibri”,”sans-serif”;
mso-ascii-font-family:Calibri;
mso-ascii-theme-font:minor-latin;
mso-hansi-font-family:Calibri;
mso-hansi-theme-font:minor-latin;}

VU CS601 – DATA COMMUNICATION FINALTERM Solved Unsolved Past Papers FALL 2006

VU CS301 – Data Structures (Session – 3 ) FinalTerm solved unsolved past FALL 2006

VU CS301 – Data Structures (Session – 3 ) FinalTerm Solved Unsolved Past FALL 2006

FALL 2006

Marks: 40

CS301 – DATA STRUCTURES (Session – 3 )

Time: 60min

StudentID/LoginID:

______________________________

Student Name:

______________________________

Center Name/Code:

______________________________

Exam Date:

Wednesday, December 06, 2006

 

 

1. Attempt all questions. Marks are written adjacent to each question.

 

2. Do not ask any questions about the contents of this examination from anyone.

 

a. If you think that there is something wrong with any of the questions, attempt it to the best of your understanding.

 

b. If you believe that some essential piece of information is missing, make an appropriate assumption and use it to solve the problem.

 

 

c. Write all steps, missing steps may lead to deduction of marks.

 

d. All coding questions should be answered using the C ++ syntax.

 

You are allowed to use the Dev-C++ compiler to write and test your code. If you do so please remember to copy and paste your code into the examination solution area. (Do NOT share your code; your colleague could get higher marks than you!!)

 

**WARNING: Please note that Virtual University takes serious note of unfair means. Anyone found involved in cheating will get an `F` grade in this course.

 

 

For Teacher’s use only

Question

1

2

3

4

5

6

7

8

9

Total

Marks

Question No: 1

( Marks: 2 )

– Please choose one

 

The new operation in C++ for dynamically allocating memory returns a pointer to an object it has just created.

 

 

True

 

 

False

 

Question No: 2  ( Marks: 2 )   – Please choose one

 

A pointer can be declared without giving it a data type to point to

 

 

True

 

 

 

False

 

Question No: 3  ( Marks: 2 )   – Please choose one

 

An in-order traversal visits nodes in order of descending keys.

 

 

True

 

 

 

 

 

False

 

Question No: 4  ( Marks: 2 )   – Please choose one

 

An unbalanced tree is one whose root has many more left descendents than right descendants.

 

 

 

 

True

 

 

False

 

Question No: 5  ( Marks: 2 )   – Please choose one

 

A queue allows access to the first item that was inserted.

 

 

True

 

 

False

 

Question No: 6  ( Marks: 10 )

 

Write a function in C++ that will swap the second and third node in a singly linked list (having 5 nodes) by adjusting only the pointers (and not the data). You can use Node class and List class methods (such as getNext, setNext, next, get) without writing them. You can assume that the Node class and List class exists, i.e., do not write the code for these classes. The simple declaration of Node class and List class is as follow,

 

class  Node

 

{

public:

int      get() { return  object; };

void  set(int  object) { this->object  =  object; };

 

Node  * getNext() { return  nextNode; };  //returns the next node pointer

 

void     setNext(Node  * nextNode) { this->nextNode  =  nextNode; }; // set the next

 

node pointer

 

private:

 

int  object;

Node  * nextNode;

};

 

/* The List class */ class List

{

 

public:

List(); // constructor

void  add (int  addObject);  // add the nodes in list

int     get(); // returns the value of the current node

bool  next(); // returns true if next node exist otherwise returns false

 

friend void traverse(List list); // used to print the values of all the nodes in the list void swap();

private:

 

int      size;

 

Node * headNode; Node * currentNode; Node * lastCurrentNode;

 

};

 

void List ::swap() // Complete this code

 

{

 

}

 

 

Question No: 7  ( Marks: 5 )

 

Write the output for the following

 

 

Push the characters ‘c’, ‘d’, ‘m’, ‘a’, ‘b’ into the stack in the given order. Pop two elements from the stack one at a time. Then push two characters ‘f’, and ‘g’. Now pop all the characters. What is the result?

 

 

Question No: 8  ( Marks: 10 )

 

Convert the infix expression 2+(9-3 *2) to postfix. Show the trace of the algorithm, i.e., the stack, the infix expression and postfix expression using the following table pattern.

 

Stack infix postfix

 

 

Question No: 9  ( Marks: 5 )

 

Consider the following binary tree:

 

(a) Starting from the root node A, perform an In-order traversal of the binary tree below and write the letters in the nodes that will result during the visitations.

 

(b)  Write the nodes if a Pre-order traversal is performed starting with node A.

 

 

 

 

 

 

 

A

 

 

 

B                     C

 

 

 

D                   E

 

 

 

 

F               G

 

 

 

H

 

VU CS301 – Data Structures (Session – 3 ) FinalTerm Solved Unsolved Past FALL 2006

Education In Pakistan © 2016