IMCS University of Sindh BS(CS) Past Papers

University of Sindh BS(CS) Past Papers – COMP-310 & COMP-311 (Solved & Explained)

📅 Date Published: May 10, 2025
🏫 Institute: Institute of Mathematics & Computer Science, University of Sindh, Jamshoro

---

🔍 Introduction

Looking for University of Sindh BS(CS) past papers for first-year students? In this post, you’ll find two important papers:

• COMP-311: Computer Programming (Theory) – 2014

• COMP-310: Introduction to Computers – 2016

These past papers are especially useful for Regular, Improver, or Failure students preparing for upcoming exams. Whether you're revising key concepts or solving practice questions, these papers will guide your study.

---

🧑‍💻 COMP-311: Computer Programming (Theory) – Past Paper (2014)

• Course No.: COMP-311

• Date: 05-05-2014

• Duration: 2 Hours

• Class: BS(CS) Part-I

Note: Attempt any FIVE (5) questions. All questions carry equal marks.

Q1. Differences between switch and else if Statements

➡️ Discuss at least three key differences with examples.

Q2. Use of Translators

• Why are translators required in programming?

• Differentiate between a compiler and an interpreter.

Q3. Arrays in the C Language

(a) Define an array.
(b) Difference between array definition and initialization with examples.

Q4. Predict the Output of the Given Programs

Choose TWO programs and write their expected outputs. (Programs involve conditions, switches, and functions.)

Q5. Differentiate Between Any Two

Examples:

• while loop vs for loop

• int constant vs float constant

• Actual vs Formal parameters

• && vs || operator

Q6. Function Concepts

Define the following with examples:

• Function call

• Function definition

• Function prototype

Q7. Find Syntax Errors (Choose Any Two)

Correct syntax errors in the given C code segments.

---

💻 COMP-310: Introduction to Computers – Past Paper (2016)

• Course No.: COMP-310

• Date: 16-05-2016

• Duration: 2 Hours

• Class: BS(CS) Part-I — Regular 2016 / Improver / Failure

Note: Attempt any TEN (10) questions. All questions carry equal marks.

---

📌 Questions Overview:

1. Explain the Information Processing Cycle in detail.

2. Can a hard disk replace memory? Justify your answer.

3. What kind of instructions are stored in ROM/PROM?

4. Calculate the disk density (2880 sectors × 512 bytes).

5. Convert:

   • (1010101)₂ to decimal

   • Decimal 66 to hexadecimal

6. Why is memory faster than magnetic/optical storage?

7. List three differences between main memory and storage.

8. What is system software, and why is it important?

9. CPU speed factors and how they affect performance.

10. Define registers and their role in the CPU.

11. Impact vs Non-Impact Printers

12. Purpose of a computer’s internal clock

13. Define pits and lands in optical storage.

14. Data bus vs Address bus

15. Sequential vs Random access

Data Structures Exam Paper – COMP-410

🏛️ Institute of Mathematics & Computer Science, University of Sindh, Jamshoro

📅 Date: 09-May-2014
⏰ Time Allowed: 2 Hours
🎓 Class: BS(CS)-II (P.E)
📝 Category: Regular / Improvers / Failures

---

✅ Instructions:

• Attempt any 4 questions from Section A and Section B.

• All questions carry equal marks.

• Use clear examples where necessary.

---

🔹 Section A – Short Answer Questions (5 Marks Each)

Q1: Advantages & Disadvantages of Memory Allocation

What are the pros and cons of data structures that require contiguous memory (like arrays) versus those that do not (like linked lists)?

Q2: Role of Header Node in Linked List

Why should the header node in a linked list always point to the first node? Explain its role.

Q3: Logical vs Physical View of Data

What is the relationship between the logical and physical views of data?

Q4: Abstract Data Type (ADT) in Java

Define ADT (Abstract Data Type). Why is it useful? How is the ADT concept used in Java?

Q5: Indexed Data Elements

What properties define indexed data elements? How does indexing enhance performance?

Q6: Sorting Algorithm Comparison

Differentiate between the insertion sort and selection sort algorithms with examples.

Q7(A): Infix to Postfix Conversion

Convert the following infix expression to postfix:
B(A - D) / F + E(H / K + G)

OR

Q7(B): Postfix to Infix Conversion

Convert the following postfix expression to infix:
16 6 2 / 3 1 5 + , , ,

---

🔹 Section B – Long Answer Questions (15 Marks Each)

Q8: Bubble Sort – Descending Order

Apply bubble sort to arrange the following in descending order:
33, 77, 11, 88, 65, 55, 44, 100

Q9: Recursive String Reversal

Write a recursive function or algorithm that prints a string in reverse order.

Q10: Linked List Node Insertion Order

A linked list has nodes: 2 → 6 → 8 → 7 → 1.
The current pointer is at the node 8. A new node 9 is to be inserted. The following steps are wrongly ordered:

• (a) Point node 8 to node 9.

• (b) Point node 9 to node 7.

• (c) Set the current pointer to the node 9.

Task: Rearrange the steps in the correct order and explain the mistake.

Q11: Tree Traversals

Traverse the given binary tree using:

• Pre-order

• In-order

• Post-order

Q12: Array-Based Binary Tree Representation

Draw an array-based representation for the following binary tree:

mathematica
        A
       / \
      B   C
     / \   \
    D   E   F




UNIVERSITY OF SINDH, JAMSHORO
INSTITUTE OF MATHEMATICS & COMPUTER SCIENCE
BS PART-I COMPUTER SCIENCE
MATH-400 LINEAR ALGEBRA & ANALYTIC GEOMETRY OF 3 DIMENSION
FIRST SEMESTER EXAMINATION OF 2015
TIME ALLOWED: 2 HRS
MONDAY: 11-05-2015
MAX MARKS: 50/100
NOTE:
Attempt any FOUR questions, selecting ONE from each section. All questions carry EQUAL marks.
SECTION-I
Q#1
(a) Write the matrix whose elements are defined by each equation:
(i) $a_{ij}=2i-j$ where $i=1,2,3$ and $j=1,2,3$.
(ii) $a_{ij}=(-2{)}^{i+j}$ where $i=1,2,3,4$ and $j=1,2,3$.
(b) Write a $4\times 4$ matrix such that:
$$a_{ij}=\{\begin{array}{ll}2i-3j& \text{if }i\le j,\\ 1& \text{otherwise.}\end{array}$$
(c) Write a $4\times 3$ matrix such that:
$$a_{ij}=\{\begin{array}{ll}2i+j& \text{if }i=j,\\ -3& \text{otherwise.}\end{array}$$
Q#2
Use Cramer’s Rule to find the solution of the following system of equations if the determinant of the coefficients is not zero:
$$\{\begin{array}{l}x+3y-2z+w=2,\\ 4y+2z-3w=-1,\\ 2x+5y-z-w=1.\end{array}$$
SECTION-II
Q#3
(a) Express the following equation in Cylindrical Coordinates and Spherical Coordinates:
$$4x+y-3z=12$$
(b) Find the parametric equations, direction ratios, direction cosines, and direction angles of the straight line passing through the points $A(6,5,-3)$ and $B(4,1,1)$.
Q#4
(a) Find the equation of the plane passing through the points:
$$A(1,7,-13),B(-3,-2,-1),C(4,-1,2)$$
(b) Find the distance from point $A(2,-1,3)$ to the plane $4x+y-z-2=0$ and convert the given plane into its normal form.
SECTION-III
Q#5
(a) Determine whether the given sequence converges or diverges. If it converges, find its limit, where the $n$-th term is given by:
(i) $\left(\frac{2-n^2}{3+n^3}\right)$
(ii) $5^n+(-1{)}^n\cdot 5^{n+1}+(-1{)}^{n+1}$
(b) Determine whether the following series converges or diverges. If it converges, find its sum:
(i) ${\sum }_{n=1}^{\mathrm{\infty }}\frac{1}{9n^4+3n-2}$
(ii) ${\sum }_{n=1}^{\mathrm{\infty }}(\frac{1}{2^n}-\frac{1}{2^{n-1}})$
Q#6
Compute the eigenvalues and eigenvectors of the following matrix:
$$\left[\begin{array}{ccc}-2& 2& -3\\ 2& 1& -6\\ -1& -2& 0\end{array}\right]$$

---

🎯 Final Words

These past papers serve as a valuable revision tool for BSCS Part I students. To get the best results:

• Try solving questions yourself

• Cross-check with your class notes

• Stay consistent with practice

📥 Want a PDF version? Let me know in the comments or contact me, and I’ll share downloadable files soon.

---

🔖 Tags: University of Sindh, Past Papers, Computer Programming, Introduction to Computers, BSCS Part 1, COMP-310, COMP-311, Solved Papers