Education In Pakistan

Papers, Notes, Books & Help For Students

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

Tag: 2005

VU CS601 – DATA COMMUNICATION FINALTERM solved unsolved past papers 2005

VU CS601 – DATA COMMUNICATION FINALTERM Solved Unsolved Past Papers 2005

 

 

CS601 Data Communication

Final Term Examination – February 2005

Time Allowed: 150 Minutes

Instructions

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.   Examination also consists of multiple-choice questions. Choose only one choice as

your answer.

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.

 

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

 

 

 

 

Total Marks: 60                                                                                                     Total

Questions: 12

 

Question No. 1                                                                                                             Marks : 2

 

Which of the following best describes a single-bit error?

1   A single bit is inverted

2   A single bit is inverted per transmission
3   A single bit is inverted per data unit

 

 

 

 

 

 

 

4   Any of the above

 

 

Question No. 2                                                                                                             Marks : 2

 

In fiber optic cable, the signal source is__________ waves

1   Infrared

2   Light
3   Radio

4   Very Low Frequency

 

 

 

 

Question No. 3                                                                                                             Marks : 2

 

In an environment with many high-voltage devices, the best transmission medium would be _________.

1   Atmosphere

2   Coaxial Cable

3   Twisted Pair

4   Fiber Optic Cable

 

 

Question No. 4                                                                                                             Marks : 2

 

Which of the following is not a guided medium?

1   Twisted Pair

2   Fiber Optic Cable
3   Coaxial Cable
4   Atmosphere

 

 

Question No. 5                                                                                                             Marks : 2

 

Which multiplexing technique involves signals composed of light beams?

1   TDM

2   FDM
3   WDM

4   None of the above

 

 

Question No. 6                                                                                                             Marks : 10

 

Briefly answer the following questions.

 

1)   After transmitting several frames, the transmitter receives a NAK ‘i’ frame. Describe how the transmitter reacts in the following error control protocols.

a.   Go-Back N

b.   Selective Reject

 

 

 

 

 

 

 

2)   A communication protocol is an agreement required between two or more communication entities and consists of three essential components. Name and describe briefly each
component

 

 

Question No. 7                                                                                                             Marks : 2

 

Layer 2 lies between the physical layer and the _______ layer.

1   Presentation

2   Application
3   Transport
4   Network

 

 

 

Question No. 8                                                                                                             Marks : 10

 

Solve the following. Show all the work to get full credit.

 

1)   A binary signal is sent over a 3 kHz. Channel. Signal’s S/N ratio is 3162 (36dB).
Calculate the maximum achievable data rate?

2)   Find the maximum data rate of a noiseless 4-kHz channel-using Analog encoding

e.g. QPSK with 2 bits per sample?

 

 

 

Question No. 9                                                                                                             Marks : 2

 

The _______ layer changes bits into electromagnetic signals.

1   Network

2   Application
3   Physical

4   Presentation

 

 

 

Question No. 10                                                                                                           Marks : 12

 

The following questions deal with CRC error detecting code.

a.   Given a message M = 1010001101, determine the CRC using the polynomial

P = x5 + x4 + x2 + 1.

b.   What is the transmitted message T.

c.   How does the receiver check whether the message T was transmitted without any
errors?

 

 

Question No. 11                                                                                                           Marks : 2

 

Flow Control is needed to prevent ____________

1   Overflow of sender buffer

 

 

 

 

 

 

 

2   Overflow of the receiver buffer
3   Bit Errors

4   Collision between sender and receiver

 

 

Question No. 12                                                                                                           Marks : 12

 

Draw the digital signals for the bit string 0101 0100 1100 111 using NRZ-I and RZ

encoding schemes. A 0 is represented by a high value and a 1 is represented by a low value.

 

VU CS601 – DATA COMMUNICATION FINALTERM Solved Unsolved Past Papers 2005

VU CS403- DATABASE MANAGEMENT SYSTEMS FINALTERM solved unsolved past papers Fall 2005

VU CS403- DATABASE MANAGEMENT SYSTEMS FINALTERM Solved Unsolved Past Papers Fall 2005

Page 1 of 2

 

 

CS403 Database Management System

 

Final Term Examination – February 2005

Time Allowed: 150 Minutes

 

Please read the following instructions carefully before attempting any of the questions:

 

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.

 

You are allowed to use MS VISIO to make diagrams. If you do so please remember to copy and paste your code into the examination solution area.

 

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

 

 

 

Total Marks: 55 Total Questions: 5
Question No. 1 Marks : 10

 

Consider the tables below:

 

EMP(empNo, eName, job, mgr, hireDate, sal, comm, deptNo)

 

(mgr stores the empNo of employee who is manager of the department in which an employee works, comm Stores the commission of the employee)

DEPT(deptNo, dName, loc)

 

Write the SQL statements for the following queries:

 

a)      Display the names of all employees whose commission is greater than their salary increased by 10%

b)      Display all employees’ names and their hire dates and their managers’ names and hire dates for all employees who were hired before their managers.

c)      Determine the number of managers without listing them.

d)     List all employees grouped department wise.

e)      Set the salaries of all employees to 20000 whose name contain the “DILDAR”

 

 

Question No. 2                                                                                                             Marks : 10

 

Do as appropriate:

 

a)      A relation that has no partial functional dependencies is in ___________ normal form.

b)      A transaction must acquire a ________ before doing any operation.

c)      A ________ is a simple identifier that serves to identify each transaction.

d)     The primary goal of physical database design is data processing security.(T/F)

e)      The last step in the design process is the ______________, which maps the local conceptual schemas to physical storage devices available at the corresponding sites.

f)       Join and subquery techniques may often be used to accomplish the same task.(T/F)

g)      The special value of the attribute is generally referred to as the ___________

h)      A join is a relational operation that causes two common attributes to be combined into a single composite attribute.(T/F)

i)        The hierarchical data model is the most commonly used model in contemporary database applications.(T/F)

j)        A ___________ key is an attribute in one table that acts as a primary key in another table.

 

 

 

Question No. 3

Marks : 6

Consider the tables below:

(2,3,1)

a)      Mention the major difference between B tree and B+ tree. How can selection of either of them as an index implementation approach can affect the number of accesses required performing a particular relational operator (say SELECT)?

b)      Consider the following relations:

Student(stud_id, stud_name, camp_add, GPA)

Registration (stud_id, course_id, grade)

 

Following is a typical query against these relations:

 

SELECT STUDENT.STUD_ID, STUD_NAME,STUD_NAME,COURSE_ID, GRADE

FROM STUDENT, REGISTRATION

WHERE STUDENT.STUD_ID=REGISTRATION.STUD_ID AND GPA>3.0

 

Page 2 of 2

 

  1. On what attributes should indexes be defined to speed up the above query? Give the reasons for each attribute selected.
  2. Write SQL command to create indexes for each attribute you identified in (a).

 

c)                  When a student has not chosen a major at a university, the university often enters a value of “Undecided” a default value or a way to represent the null value?

 

 

Question No. 4 Marks : 15
Differentiate the following: – 3 each

a)      Naïve and Sophisticated End Users.

b)      Process numbers in Diagram 0, Context diagram and detailed DFD (in all three of them).

c)      Clustered Verses Unclustered Indexes.

d)     Tuple Relational Calculus & Domain Relational Calculus.

e)      Total and partial participation of an entity.

 

 

 

Question No. 5

Marks : 14

Give short and precise answers of the following:

(2, 2, 2, 2, 2,4)

a)      The order of non-conflicting operations does not matter in an interleaved schedule, why?

b)      2PL ensures serializability but generates deadlock, how?

c)      What are the 3rd and 4th forms of normalization, explain with examples?

d)     How do we represent a multi-valued attribute in E-R diagram?

e)      Explain how can we say that granularity of locks effects concurrency?

f)       Let a file have following set of key values: {2,5,8,10,15,18,23,25,28,31,33}

Construct a B-Tree index assuming 4 key values per node. Also show the changes in the tree after the following operations:

 

  1. insert 24
  2. delete 2
  3. insert 35
  4. delete 18

 

VU CS403- DATABASE MANAGEMENT SYSTEMS FINALTERM Solved Unsolved Past Papers 2005

VU CS401- Computer Architecture and Assembly Language Programming FinalTerm solved unsolved past papers 2005

VU CS401- Computer Architecture And Assembly Language Programming FinalTerm Solved Unsolved Past Papers 2005

CS401 Computer Architecture and Assembly Language

 

Programming

Final Term Examination – February 2005

Time Allowed: 150 Minutes

 

Instructions

 

Please read the following instructions carefully before attempting any question:

 

  1. The duration of this examination is 120 minutes.
  2. This examination is open Handouts.
  3. Answer all questions.
    1. There is no choice.
    2. You will have to answer correctly all questions in this examination to get the maximum possible marks.

 

  1. Do not ask any questions about the contents of this examination from anyone.
    1. If you think that there is something wrong with any of the questions, attempt it to the best of your understanding.

 

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

 

  1. You have been provided with all assembly tools so you can use assembly tools also.
  2. Your paper contains 4 questions.

All Coding questions should be answered using the Assembly language syntax.

 

 

Total Marks: 60 Total
Questions: 4  
   
Question No. 1 Marks : 10
   

 

Answer the following Questions briefly.

 

  1. What is the change in the stack after int instructions is executed?

 

  1. Why procedures are used and what must be the last executable instruction in a procedure?

 

  1. Why cli and sti instructions are used during hooking an interrupt?
  2. What is multitasking?
  3. What are minimum numbers of pins required for serial communication? Also write their names?

 

 

Question No. 2                                                                                                             Marks : 10

 

Write valid instruction(s) to perform each function specified below.

 

 

  1. Provide instruction(s) to read a value from port number 0x312.

 

  1. Provide instruction(s) to move the value at the top of stack in ip register.
  2. Provide instruction(s) to move value of flag register in ax.
  3. Provide instruction(s) to divide value of ax by 8.
  4. Provide instruction(s) to write value of al at the port 0x12.

 

 

Question No. 3                                                                                                             Marks : 10

 

Write a function “ConvertBinaryToDecimal” that takes the address of a string containing binary of any decimal number via the stack. The function should print its equivalent decimal number. For example, if the string is “11011” then after the execution of this function, the program should print 27 and if the string is “1001” then after the execution of this function, the program should print 9 on the screen.

 

(Well commented and well indented program will be given extra mark)

 

Question No. 4                                                                                                             Marks : 10

 

Answer the following regarding Protected Mode descriptors

 

a.  Write the following descriptors in the format

 

dd        0x0000FFFF, 0x00CF9A00

 

Assume following values for attributes

 

1      A bit = 0

2      P bit = 1

3      G bit = 0

4      AVL bit = 1

5      r bit = 0

 

i. 32 bit, non conforming, execute-only code segment at level 2, with base at 0x00403333 and a limit of 0x0FFFF.

 

ii. 32-bit Read only data segment at level 0, with base at 0x00A0BBBB and limit of 0x1CCCC.

 

  1. Write 32 bit physical addresses for the following accesses where Base = 0x00A00000 and Limit = 0x30000, EBX contains 0x00001000, and ESI contains 0x00003000

 

i.[bx+si]

 

ii.[ebx+esi-0x0012FD]

 

VU CS401- Computer Architecture And Assembly Language Programming FinalTerm Solved Unsolved Past Papers 2005

Education In Pakistan © 2016