Welcome Students!

MaTH601 Assignment Sol by Usama 

MATH 622 IMPORTANT QS FOR QUIZ,GRAND QUIZ PART (1)

Aj kal lock down me life beh ajeeb hogyyi hai.Lock down ne isane of ALLAH k qareeb kar diya hai.Insan Lock down se pehle Jo ALLAH dor tha ab lock down hee  k zariya banda ALLAH k qareeb hogya hai.Lekin khuch log and yah akhsar log ab beh ALLAH se door hein.Shahd in logo me beh shamil hun.ALLAH se door hona insan ka he nuqsan ha.Lekin woh Pher beh nuksan me nai dalta.Woh itna Raheem hai k manggo tu deta hai na manggo tu tub beh deta hai.Us ne humein Ashraf ul Makhlookat banaya hai.Frishty tu ALLAH ki ebadat karty  hein.Hum tu un se beh afzal hein humein chye hum tu din raat ebadat me guzar dein.Agar hum aisa krein ge tu us ki nematoon ka khuch sukhar ada hojye ga.Shahid yahi waja humein duniya akharat me  Kamyab kar de.....

                  Topic: Cs301: MCQS FOR QUIZ,GRAND QUIZ PART 1 1)Each node in singly linked list has pointer a)one b)two c)three d)four 2)Parameters in function call are passing using a)Stack b)Queue c)Binary Search Tree d)AVL Tree 3)Insertion in a linked list can be done a)front only b)back only c)middle only d)anywhere 4)The                   method of list data structure removes the element residing at current position a)Add b)Remove c)Next d)Find 5)A Array is a group of                 memory location a)consecutive b)isolated c)random d)scattered 6)Every AVL Tree is              a ) Binary Search Tree b)Complete Tree c)Heap d)Ternary Tree 7)Non recursive calls are faster than                   a)Parameterized b)Recursive c)Function d)Non functi...

Image 1 Image 2

*idd=id Cs301 ASSIGNMENT SOL 100%

                                                    Cs402 Assignment sol 100%

#include<iostream> using namespace std; class MYBooks {      private :         int current;         int books;         int size;         int *stack;             public :         MYBooks(int s, int b)         {size=s;         stack= new int[size];         books=b;         current=-1;         }         void push(int x) {         // -1 +1=0      stack[++current]=x; } int pop() {     return stack[current--]; } int top()     {         return stack[current];     }    int isEmpty()    {     return (current==-1);    }    int isFull()    {    ...