One Stop for all the Old Question Papers of Jammu University.

Showing posts with label Semester 3rd. Show all posts

B.Com. III Semester (CBCS) Examination CBS-IIIs/4(R) 210101 COMMERCE Indian Contract Act Course No.: UBCTC-303 Time Allowed: 2½ Hours     ...

B.Com. III Semester (CBCS) Examination
CBS-IIIs/4(R)
210101
COMMERCE
Indian Contract Act
Course No.: UBCTC-303

Time Allowed: 2½ Hours                                                      Maximum Marks: 80

SECTION - A

Note: Attempt all the questions. Each question carries 3 marks.       (5×3=15)
Answer to each question should be within 70-80 words.

1. Define coercion and undue influence.

2. Define consideration.

3. Who is Pawnor?

4. Briefly discuss the extent of agents authority.

5. Who is unpaid seller?

SECTION - B

Note: Attempt all the questions. Each question carries 7 marks.       (5×7=35)
Answer to each question should be within 250-300 words.

1. Explain the legal rules as to offers.

2. What is discharge of contract?

3. Discuss the rights of surety.

4. What are the requirements for becoming a Principal?

5. Explain the implied conditions and warranties.

SECTION - C

Note: Attempt any two questions. Each question carries 15 marks.       (2×15=30)
Answer to each question should be within 500-600 words.

1. Discuss the various kinds of contracts with appropriate examples.

2. Explain in detail the contract with minor and persons of unsound mind.

3. Describe the rights and duties of bailee.

4. Explain the creation of agency and termination of agency.

5. Differentiate between sale and agreement to sell. Also explain rights of an unpaid seller.

B.Sc. 3rd Semester Examination BS-IIIS/11 228446 PHYSICS Course No. : PH-301 Time Allowed: 3 hours                               ...

B.Sc. 3rd Semester Examination
BS-IIIS/11
228446
PHYSICS
Course No. : PH-301
Time Allowed: 3 hours                                                                        Maximum Marks: 80

B.Sc. 3rd Semester Examination BS-IIIS/11 225435 PHYSICS Course No. : 301 Time Allowed: 3 hours                                  ...

B.Sc. 3rd Semester Examination
BS-IIIS/11
225435
PHYSICS
Course No. : 301
Time Allowed: 3 hours                                                                        Maximum Marks: 80

B.A. / B.Sc. / B.C.A. 3rd Semester Examination BS-IIIS/11 228406 Mathematics Course No. : 301 Time Allowed: 3 hours              ...

B.A. / B.Sc. / B.C.A. 3rd Semester Examination
BS-IIIS/11
228406
Mathematics
Course No. : 301
Time Allowed: 3 hours                                                                        Maximum Marks: 80

Ψ Ψ Ψ

B.A. / B.Sc. / B.C.A. 3rd Semester Examination BS-IIIS/11 225395 Mathematics Course No. : 301 Time Allowed: 3 hours             ...

B.A. / B.Sc. / B.C.A. 3rd Semester Examination
BS-IIIS/11
225395
Mathematics
Course No. : 301
Time Allowed: 3 hours                                                                        Maximum Marks: 80



Ψ Ψ Ψ

B.A. / B.Sc. 3rd Semester Examination BS-IIIS/11 225545 COMPUTER APPLICATIONS Course No. : CA-301 Time Allowed: 3 hours         ...

B.A. / B.Sc. 3rd Semester Examination
BS-IIIS/11
225545
COMPUTER APPLICATIONS
Course No. : CA-301
Time Allowed: 3 hours                                                                        Maximum Marks: 80

Note: Attempt total five questions in all, selecting one question from each unit. Q1 is compulsory. Each question carries 16 marks.

1. Answer the following

   a. What is Big-oh notation? Explain its use

   b. Explain dynamic memory allocation

   c. Distinguish between linear search and binary search

   d. What do you mean by ISAM? Explain

Unit-I

2. Write algorithms for insertion and deletion of an element in a circular queue

3. What is stack? How is it represented in memory? Discuss the applications of stack

Unit-II

4. Write algorithms for insertion and deletion of an element in a linked list

5. What is a tree? How is it different from a binary tree? Discuss the binary tree traversal with the help of examples

Unit-III

6. Write an algorithm for insertion sort? Discuss its best case and worst case complexity

7. Write an algorithm for merge sort? Discuss its time and space complexity

Unit-IV

8. What is indexed sequential file organization? Discuss its advantages and disadvantages

9. What do you mean by a collision in hashing? Explain in detail the techniques for resolving collisions

Ψ Ψ Ψ