DSA Mid Term Syllabus

DSA Pre-Mid Topics

1.    All General Algorithms related to search and sort.

2.    Arrays. General arrays and traversal algorithms.

a.     Polynomial algorithms, general matrices.

b.    Dynamic arrays, dynamic declaration, dynamic growth and shrinking.

c.     Inorder insertion. Deletion, inorder deletion.

d.    2D array search, traversal. Complex 2D/3D loops for any purpose.

3.    Algorithm techniques:
         Brute Force vs Divide & Conquer.

4.    Time cost. Loop cost, nested loop, initialization and boundary checking cost. Exact cost verses order of complexity.

5.    Stack: 
          using Array and Linked list. Stack ordering, ToH problem, in-order insertion in stack using a temporary stack, stack search and delete using temporary stack, Sorting using stack.

Read More

DSA-Mids Solution-2018

Roll No:-BSCS-2017 Name:____________ Section:

Read More

DSA Assignment Guidelines

Guidelines for submitting Assignments

1.     Each assignment will be of 10 marks.

2.     One mark will be deducted if assignment is submitted on last date.

3.     After last date, 2 marks per day will be deducted.

4.     7 marks will be given for exactly following general requirements and hints. Extra 3 marks will be for those who implement all requirements and do more than required.

5.     Marks will not be deducted for small logical errors.

6.     Please do not get assignment from others or give to others. Also, do not get or give assignment help. Get help on data structures and programming. If you want to help others, teach them programming and algorithms. Assignment is for self preparation.

7.     5 Negative marks will be given for copied assignment for the first time. F grade will be given for 2^nd time submission of copied assignment.

8.     Please email source code to saeedturk@yahoo.com, (before submitting) or bring in USB. Also bring Printed Source Code at submission.

Read More

Recursion- DSA

By: Gulfam Tahir
Section : E2

                   Permutation Program through Recursive Call

#include<iostream>

using namespace std;

int punction(int,int);

int fac(int);

int fac(int n){

                if(n<=1){

                                return 1;           //base case

                }else{

                                return n*fac(n-1);     //recrssive case

                }

}

Read More