Mid Term Exam Collection of Past Papers Questions MSCS VU

Don't forget to share your Paper in Comment on https://studytimelearning.blogspot.com

My today's paper CS703  ---------------------- Paper was 1 hr duration

====================

1. How can Linux kernel be converted to Real Time kernel? What needed? ------------------- (10)

2. How severe Internal Fragmentation can occur in Simple Segregated Memory Allocater. --------------(5)

3. Discuss concept of Sleeper with two examples.---- (5) {My God what a strange term, not done}

------------------------------------------------------------------

& 10 MCQs

CS710.

Android runtime elements and funtions 10marks.

Functions OAL.exe 5marks.

Foundation device Middleware layer functions 5marks.

Difference btv multidevice and multimodel apps 5 marks
.. 10 MCQs mostly from slides.
1 Wimax range
2 first pervasive computing device
3 symbian open source.
4 embedded OS k baray ek Q tha.
5 Android kernal binder k baray ek Q tha

Thats all i could remember. Hope it will help others.

Cs706 paper today

What are problem faced during requirment ? 10 marks

What is abstraction? Different level and type of abstraction? 10 marks
What is inspection planning? Responsibilities regarding inspection planing and define ETVX model for IP? 10 marks

cs711 

total question 4

3 questions 5 marks waly

aik question 15 marks ka 

19-12-2015 time 10:30 am
sequential cohesion with example
association with example
staic mathod in java
aik code diya howa tha k ye kaha py violate or validate kr raha hy

CS701

Q.1 show that 234, 399 are relatively Prime or not
Q.2 If A<B and B is regular language show A is true regular
Q.3 L all={<M> l M is TM with input (sigma) and L(M)= (sigma)*}
Show that L all is Turing recognizable
Q.4. ¥y €x(x,x,y) and (a+b=c) prove the therorem fot™ T......

‎Network security paper CS707 mid term paper
Short Questions (5 marks each)
1. What is the difference between active attacks and passive attacks.
2. In context of hashing what is meant by compression.
3. What is X509 (I forgot the actual number) standard?
4. What are one way functions? How they are implemented in cryptography?
Long Questions (10 marks each)
1. What security measures are adopted in the layers of OSI model.
2. Define and discuss various components of PKI infrastructure.

Today cs706 paper 19 dec 2015

1:Explain Different kinds of Software requirements?(10 marks)answer on handout page#21 to 24

2:Explain review roles and their responsibilities?(10 marks) answer on handout page#47 to 48

3:Code of conduct for moderator(10marks) answer on handout page#74

my today mid term paper cs709 formal method for SE

total 4 question 4th question have 15 marks but other 3 have 5 marks each

4th question b OCL mn sy hee tha class diagram di hoi thi aur sath kuch constranints thy busnines rul os ka ocl syntex likhna tha

My 711 paper on 20th Dec at 1200

Q # 1: Difference between Abstract Class and Interface (5 marks)

Q # 2: Define Polymorphism with example. (5 marks)

Q # 3: Sequential Cohesion with example. (10 marks)
Q # 4: Aggregation with example. (10 marks)

1.scenario tha k aik counter ki class ha,us mein 2methods ho,aik addition and aik get count. and wo methods k through addition k function mein 5add kray. and it has to prinj 0,1,2,3,4,5,6 and so on..and ques tha k is clas ko define krain.. (5marks)

2.how extensibility help.explain in detail(5marks)

3.explain over riding and method hiding with examples.(10marks)

4.explain association with example(10marks)

Mine today paper 8:30

My cs701 paper today.

1. Thsese nmbrs are relatively prime or not 1274 and 10505.

2. Let A be a set of 123 and b set of 7654321. Table main values theen aur pocha tha k g (n ) one to one hy ya nhi..
3. Atm is not mapping reducible to Etm
4: new tha ye question. consider the sentence ∀y ∃x[R1(X,Y)] V[R1(Y,X)].
let take a model M2 (N, <= ) N for universe natural number aur <= is for R1. is its true. justify...

My CS711 PAPER TODAY AT 12:00PM TIME. 60MIN. Total question. 4. No MCQ

TOTAL MARKS. 30

1.SCENARIO THA K AIK COUNTER KI CLASS HA,US MEIN 2METHODS HO,AIK ADDITION AND AIK GET COUNT. AND WO METHODS K THROUGH ADDITION K FUNCTION MEIN 5ADD KRAY. AND IT HAS TO PRINJ 0,1,2,3,4,5,6 AND SO ON..AND QUES THA K IS CLAS KO DEFINE KRAIN.. (5MARKS)

2.HOW EXTENSIBILITY HELP.EXPLAIN IN DETAIL(5MARKS)
3.EXPLAIN OVER RIDING AND METHOD HIDING WITH EXAMPLES.(10MARKS)
4.EXPLAIN Association WITH EXAMPLE(10MARKS)

My cs701 paper today.

1. Thsese nmbrs are relatively prime or not 1274 and 10505.

2. Let A be a set of 123 and b set of 7654321. Table main values theen aur pocha tha k f (n ) onto btana tha hy ya nhi..

3. If A<B and B is regular language show A is true regular

4. L all={<M> l M is TM with input (sigma) and L(M)= (sigma)*}

CS702- TODAY(20-12-15) PAPER

1) Prove that f(n)=0(g(n))<=>g(n)=Of(n )

2) Write psedocode of Assembly line scheduling dynamic programming algorithm for print station.

3) Write the pesodocode of assembly line scheduling algorithm using dynamic programming.

4) Given a Sequence (A1,A2,A3,A4)

Order of A1=10X100

Order of A1=100X5

Order of A1=5X50

Order of A1=50X20

using brute force method compute the order of the product A1.A2.A3.A4 in such way that minimize the total number of scaler multiplication

MID-Term CS709

Three questions of 5 marks

One question of 15 marks

60 minute to solve the paper

Questions from the topics below

OCL

WP

DbC

CS702- TODAY PAPER

Prove that f(n)=0(g(n))<=>g(n)=Of(n )

Write psedocode of Assembly line scheduling dynamic programming algorithm for print station.

Write the pesodocode of assembly line scheduling algorithm using dynamic programming.

Write pesedocode of plane sweep algorithm in n- dimension.

cs707 paper today

10 MCQs

3 questions of 5 marks

1. question of 10 marks

q.1 whar r the charcterstics of strong streamb cipher

q 2. CBC-MAc drescibe its properties.

q 3. public key cryptography 3 uses

q4. define and describe the fields if digital certificate. 10 marks

Q.1 show that 234, 399 are relatively Prime or not

Q.2 If A<B and B is regular language show A is true regular

Q.3 L all={<M> l M is TM with input (sigma) and L(M)= (sigma)*}

Show that L all is Turing recognizable

Q.5: consider the sentence ∀y ∃x[R1(X,X,Y)]. Lets assign PLUS to R1 where PLUS(a,b,c) is TRUE. Whenever a+b=c. if universe is R(real number) is this statement TRUE? Justify

sequential cohesion with example

association with example

staic mathod in java

aik code diya howa tha k ye kaha py violate or validate kr raha hy

Today 20-12-2015 Paper

CS712 - Distributed DBMS

MCQs (10)

1. How to ensure checking of Completeness and Reconstruction (5)

2. Disjointness (5)

3. Purpose of Integrity Rule.How to apply (5)

4. Determine Attribute Affinity Matrix (10)

i) Queries are give

ii) Frequencies Table is given

My cs701 paper today.

1. Thsese nmbrs are relatively prime or not 1274 and 10505.

2. Let A be a set of 123 and b set of 7654321. Table main values theen aur pocha tha k g (n ) correspondence hy ya nai

3. Let A be a regular expression. Show that A is decidable.

4. Scpc top and bottom strings are of same length. Show that scpc is decidable.

My paper of CS702

1. Pseudo code of n line assembly

2. Print station n line assembly

3. From asymptotic notation prove theta function.

4. Algorithm of chain matrix multiplication.

My CS711 PAPER TODAY AT 12:00PM TIME. 60MIN. Total question. 4. No MCQ

TOTAL MARKS. 30

1.SCENARIO THA K AIK COUNTER KI CLASS HA,US MEIN 2METHODS HO,AIK ADDITION AND AIK GET COUNT. AND WO METHODS K THROUGH ADDITION K FUNCTION MEIN 5ADD KRAY. AND IT HAS TO PRINJ 0,1,2,3,4,5,6 AND SO ON..AND QUES THA K IS CLAS KO DEFINE KRAIN.. (5MARKS)

2.HOW EXTENSIBILITY HELP.EXPLAIN IN DETAIL(5MARKS)
3.EXPLAIN OVER RIDING AND METHOD HIDING WITH EXAMPLES.(10MARKS)
4.EXPLAIN Association WITH EXAMPLE(10MARKS)

Aoa dear fellows

713 paper
10 mcqs thay
4 question thy
Q1 starburst design and architecture 5
Q2 directory object in ODMG3.0 5
Q3 advance transection model 5
Q4 specification and implementation of ODMG3.0 10

Mine CS724 paper.
10 Mcq's from CMMI and CMM.
4 Ques:
1. Define Deming Approach
2. Tmie Management Stretegies.
3.Define KPA "Organization process Definition"
4. Explain Process Area "Process and Product Quality Assurance".

today my paper cs718

briefly note on BHC code and its working

why min rate of call is different from from traffic density

classes of A/Gb mode of GPRS

HOW MULTIMEDIA further divide in UMATS types likhni then.
HSCSD PE NOTE

Aoa dear fellows
713 paper
10 mcqs thay
4 question thy
Q1 starburst design and architecture 5
Q2 directory object in ODMG3.0 5
Q3 advance transection model 5
Q4 specification and implementation of ODMG3.0 10

A.o.A ! Dear cs718 paper today at 10:30 A.M

Q.1 write brief note on EDGE (5 marks)

Q.2 issues regarding handoff in interSystem (5 marks)

Q.3 write about QoS profile in GPRS bearer (5 marks)
Q.4 write about BCH codes (5 marks)
Q.5 Call routing in GSM network with Detailed diagram (10 Marks)

Cs.702 paper

1 hour.ka.paper tha

Total 4 question.thaa

Assebly line ma.sa 2 question
algorithm tha 1
Our print station wala tha

Closest point 2D

Min distance

Our aik f(x)=g(x)= omega

My paper of CS702

1. Pseudo code of n line assembly

2. Print station n line assembly
3. From asymptotic notation prove theta function.
4. Algorithm of chain matrix multiplication.

My BIF733 paper:
OLC DBG techniques for assembling
graphical approaches for assembly
independed and depemded variable
define stattistic
and quantitiatve and inferential stats

Cs 706 k paper mei yeh questions aey hai
1-
Software requirements k 10 quality attributes likhnay thay?
2-
Overview inspection and roles responsibility and ETVX k according overview likhna tha
3-
Usk ilawa third question design requirements attributes aor abstract design likhna tha

today CS710 Paper

1. memory management in android OS 10 marks
2 OAL.exe functions 5 marks
3. Context aware complexities 5 marks
4. Symbian middleware functions 10marks
10 mcqs from slides

Today my CS 702 paper.

Q1. Algorithm of n line computing

Q2 brute force chain matrix algo

Q3 knapsack algo of [0 1]

Q 4 prove that nlogn + 3n +2 = Ω nlogn...

My 711 paper on 20th Dec at 1200

Q # 1: Difference between Abstract Class and Interface (5 marks)

Q # 2: Define Polymorphism with example. (5 marks)

Q # 3: Sequential Cohesion with example. (10 marks)
Q # 4: Aggregation with example. (10 marks)

Top of Form

today my paper cs718

briefly note on BHC code and its working

why min rate of call is different from from traffic density

classes of A/Gb mode of GPRS

HOW MULTIMEDIA further divide in UMATS types likhni then.
HSCSD PE NOTE

Bottom of Form

My today Cs701 paper

Q.1 show that 234, 399 are relatively Prime or not (5)

Q.2 . Show that A is turing recognizeable. Also show if Am <= A bar

then A is decideable (5)

Q.3: Show that ATM is not mapping reducible to ETM . In other words show that no computable function reduces ATM to ETM. (10)

(Hint: Use a proof by contradiction and facts you already know about ATM and ETM)

Q4. A={<R>|R is a regular expression describing a language containing at

least one string w that has 111 as substring(i.e.w=x111y for some x,y }

show A is decideable. (10)

Mine CS724 paper.

10 Mcq's from CMMI and CMM.

4 Ques:

1. Define Deming Approach

2. Tmie Management Stretegies.
3.Define KPA "Organization process Definition"
4. Explain Process Area "Process and Product Quality Assurance".

My cs703 paper

1- 10 MCQ ( quite easy)

2- Concept of sleeper and two examples (5)

3- How thread library perform context switch between user level threads(5)
4- How scheduler deal with priorities (5)
5 - Find the size of the allocated blocks when a word of 4 byte. (Something like that 10 marks).

Although managed to attend all the questions yet doubtful regarding last one. Time is too short 60 min only

 Today my CS 702 paper.
Q1. Algorithm of n line computing
Q2 brute force chain matrix algo
Q3 knapsack algo of [0 1]
Q 4 prove that nlogn + 3n +2 = Ω nlogn.......

 My paper of CS702
1. Pseudo code of n line assembly 10
2. Print station n line assembly 5
3. From asymptotic notation prove theta function. 10
4. Algorithm of chain matrix multiplication.
Total 30 marks