Howdy, Stranger!
It looks like you're new here. If you want to get involved, click one of these buttons!
Quick Links
Categories
Our Friends
Who's Online 0
Don't Hesitate for ask Question, post your assignment with hope you will find best solution.
CS301 MidTerm past papers mega files solved
ansarali
Posts: 25,240
CS301 All current and MidTerm Past Paper Download,
Share you’re MidTerm Term Papers (Questions/Pattern) & Past Papers as well here to help each other. Thanks
Following type of Document can comments in this discussion:
CS301 MidTerm Solved MCQs
CS301 MidTerm solved Subjective
CS301 MidTerm solved papers mega file
CS301 MidTerm Solved Up to date
CS301 MidTerm solved papers mega file
CS301 MidTerm Solved MCQs and Subjective with References by Moaaz
Note:
For Important Helping Material related to subject CS301 (Solved MCQs, solved past Papers, Short Notes, E-Books, FAQ, Short Questions Answers & more). You must view all the Discussion in this subject group.
Comments
Waqar Siddhu Files Download
Moaaz Files Download
Midterm Solved Latest Papers Download
cs301 MCQS BY MOAZ.pdf, 367 KB
CS301-MIDTERM SUBJECTIVE SOLVED WITH REFRENCES BY MOAAZ & AWAIS.pdf, 245 KB
CS 301 Current paper
Paper one
Q1; how we make sure the value of an object will not change after the initialization?
Q2: There are 5 tellers in the bank T1 =3 , T2 = 3, T3=4, T4=4, T5 = 3 clients. You will select which teller and why?
Q3: in a Binary_Tree call their are three variables val1 ,val2,val3 and a (pointe)rPBT. So have to right the cose that how can we access the code? the code statements.
Q4: One question was about ,.. a tree was given and i have to tell the descended about that tree. how many descended that tree has?
Q5: One question was given about a binary tree and i have to tell the ordered level of tree.
Q6: A binary tree was given and i have to tell about tree after deletion a node?
and second part was ,... in that tree i have to add a node
Paper two
Q1:the remove method in BST countain two arguments.
Q2:Height and depth of the tree
Q3Describe three basic operation of priority queue
Paper 3
10 integers ko binery tree structre main convert karna tha 2 question link list ko transform karna tha binery tree structre main 3rd question priorety que kya ha uss ka tha q4 tha node *newnode= new node;
ager yeah object banaya jaye after caling the function yea khud delete ho jye ga k nhi explain kre
Paper 4
1: Difference between strict binary search and complete binary search.
2 and 3: About node deletion .
4: What type of recursion use in given code.
5: Write a code for In-Order recursion.
6: Write in-order traversal and pre-order traversal for given tree.
Mcqs normal thy mostly from tree section
Paper 5
1.difference between call by value & reference
2.which queue best for simulation
3. question bst tree my sy thy
4. tree the us sy khush node delet karny thy
Paper 6
1: Difference between strict binary search and complete binary search.
2 and 3: About node deletion .
4: What type of recursion use in given code.
5: Write a code for In-Order recursion.
6: Write in-order traversal and pre-order traversal for given tree.
Mcqs normal thy mostly from tree section.
Paper 7
Q1.call by reference n call by value
Q2.references program ka output mention
Q3.stack n Queue program ka output mention.
Q4.Binary tree
Q5 recursive call
Q6 postfix n prefix
Paper 8
why we use length() function?
recursive function to add a key to any nod in tree
5 marks ka tha ye
or ek yehi function dia hua tha recursive function
phr 2 parts ka question tha
k if key is inserted in node than what happens to BST
B) Describe the steps of function to add key to BST
ek tha k agar key already insert ho ho to than function ko kia ho ga
Today cs301 paper 8am ka
1Basic queue operations ty
2Bst ki type
3Convert bst to avl
4Ak progrm ki output
5What is queue priority
12 mcqs ty past sy
[11:49 AM, 6/18/2019] +92 332 1602510: Cs 301 current paper 15 june 2019
Total question 23
18 mcqs
5 subjective question
Mcqs mostly past paper sa
Subjective
Q1 balance tree single order rotation
Q2 code tha jis ma error btana tha
Void main(voud)
{
Int actual= 123;
Int &other= actual;
Int natural= 456;
Other = ♮
}
Q3 add node in duoblink link list c++ code
Q4 just draw add node in any variable in link list structure
Q5
a) consider the following function.
Void quiz(int i)
{
If(i>1)
{
quiz(i/2);
quiz(i/2);
}
Cout<<"*";
}
How many asteriks will be printed by the function calling quize(5)?
b) consider the following mystery function.
Int Mystery (int num)
{
If (num>4)
{
return 2+ Mystery(num-5)+Mystery(num-2);
}
return 1;
}
What is the value return from the Mystery call(9)?
[11:51 AM, 6/18/2019] +92 332 1602510: Cs302
10 mcqs ty past sy...
Sbjctv
1 :Drwa NOR gates using NAND..
2 : if A 1000 B = 1010 find A < B, A >B, A=B,
3 : define continues and discre value
*Height of student
*Grade level
*number of head when fliping three coin
* nmbr of classes
SOP experssion bna,na tha.. 1 tblt dia howa tha uska...
mcqs all from past papers..
3 programs ay..
binary tree..
linear and non linear..
programs mn n suna tha ni ay gy..but 3 ay...baqi log v programmes kr k jayn ready from chp 16till22 mn sy..
CS301
19 Mcqs from past mostly .
Question 1 .inorder was given write the left child .
2. What are the function of current and head pointers.
3. A program was given about reference and identity the errors in program.
4.Make a node x between p and q node In link list .and also write the c++ statement to add the node and current pointer point to x .
5 .A tree was given and make a binary search tree with in order traversal .
A Link for mid term Past Paper Almost all subject
All VU Subject Mid & Final Term Papers Data Shared by Moaazpk
Orignal Solved Final Term Papers By Waqar.siddhu
Solved Final Tem Papers Share By Malikooo
Final Term Made by waqar shiddu and solved by hadi
All Final Term Papers
Final Tem Solved Papers
Final Term Past Papers by(Sheri Khan)
Another Final Term Past Papers by(Sheri Khan)
FINAL TERM PASTPAPER MADE BY WAQAAR
Final Term Past Papers by(Sheri Khan)
Finalterm Papers 2016
Finalterm Papers 2015
All final term 2014 papers
Finalterm Solved Papers
Please share your current mid term papers to help others
Thanks
Best of luck
A Link for mid term Past Paper Almost all subject
Guidelines to get Good Marks in Mid Term Examination (For New Students Specially)
Dear Students As we all know that Mid Term Exams Fall 2019 is about to begin. Most of the students who have recently joined Virtual University have no idea about VU examination system (What type of paper they will have to attempt.. How they should prepare... How they should attempt their paper to get Maximum marks to be successful with flying colors...?Here are some guidelines for Mid term Examination preparation.
In VU Exams are computer based. Mostly mistake that I have noticed is poor time management while attempting exam. More you take time to solve the paper, more there will be chances to left the paper incomplete. So be quick in the start of your paper.
Mid term Paper is conducted from first 22 Lectures Multiple Choice questions are more than subjective part. In Exams Approximately 22 are MCQs and 5 are subjective Questions (2, 3 or 5 Marks each subjective question). Pattern of paper is different for different subjects but scheme is same (Objective + Subjective)
Most of the students do mistake that they only attempt Multiple choice questions and leave subjective questions unsolved. This thing results in deduction of marks. Never leave paper unsolved. Attempt each question and dont forget to save it. If you do not know the exact answer or definition of subjective (long) question then dont leave it Solve it according to your concept. (In VU exact definition is not necessary, only your concept clearance matters)
Try to go through all of 22 lectures. If you cant memorize all 22 lectures then atleast cast a glance on all the 22 Lectures and take the concept. First read the handout then read past (correctly solved with reference) solved papers files. Never use Solved MCQs files without reference. It can cause deduction in Marks.
Most of the students do mistake that if there is some error in Exam System software then they close the paper by clicking on "Finish Paper" and then clicking on "Confirm" option. Never do that until you are finished with your paper because if you do this then you will not be able to Login again as your paper will be finished (no matters you have enough time left). Always close your paper by clicking on cross sign of Internet explorer in case of error or any trouble.
you have to answer it like that as a manager I would act as a couch, facilitator or a motivator to guide my employees in achievement of their goals because when a manager treats his employees like a motivator or facilitator their trust on manager increases and they become more satisfied and productive resulting in achievement of positive results
Thats it do not provide definition for such kind of concept based questions. first try to understand the question and then use your own thoughts to answer it in logical way.
MCQs questions are of 1 mark. Do not leave them, Attempt all the questions and save them before going to next question, If you do not know the answer of any MCQ then make logical guess but do not leave it as there is no negative marking in VU. Choose the answer that you think is closely related to the asked question.
After attempting all Questions Before finishing the paper, remember to check that you have attempted all the required questions and then finish the paper.
I Hope It will be helpful for all of you inshaAllah
Good Luck and Remember me in your Prayers
19 Mcqs from past mostly .
1. Three association of data structure 3 marks
2. if delete the root node then which node take place 3 marks
3. AVL tree add two nodes and balance 5 marks
4. binary tree 5 marks
5. code was given and we have to modify it by taking prime number output.
Question 1 Inorder was given write
the left child .
2. What are the function of current and head
pointers.
3. A program was given about reference and
identity the errors in program.
4.Make a node x between p and q node In
link list .and also write the c++ statement to
add the node and current pointer point to x .
5 .A tree was given and make a binary
search tree with in order traversal .
Objective kuch past ppr sy thy
Huffman coding
chaining hash table
arry implemetation
Union by height
or ak output likhna tha
Q1.biner tree bnawa tha OS k levels btao.
Q2.carictrics of avl tree.
Q3.if node leaf and non leafe in binry tree then what the hight of tree of its depth is 7?
Q.4hight of nodes if hight is 5?
Q.6 [2 9 7 5 8] sort it.
Q.7 ik tree tha osko array mn conert krna tha.
Q8.crictristics of union method
Mostly mcqs and questions are from moazz files.
1. AVL tree se aik node delete kr k rotation kr k balance krna tha 5 marks
2. Binary tree agar sorted data ka bnana ho to kiya issue aata hai aur oska solution kya hai? 5Marks
3. Frequency table bnana tha text ka 3 marks
4. Insertion sort se data sort krna tha with all steps 3marks
5. Threaded tree banana tha 5 marks
6. Path compression se find kese easy hota hai explain krna tha 3 marks
Mcqs mostly from past papers
subjective.
1.Application of Hashing
2.Transitivity relationship
3.Deleta a node from max heap and draw again.
4.Frequency table
5.Program given and write about variable
6.bubble sort after two iterations. 5 Marks
7.Threded binary tree given and for one node write its four varaibles values
a.left flag
B.Right flag
C.left pointer node.
D.Right pointer node.
5 Marks
8. AVL tree after deleting one node draw Balance tree. 5 marks
9.For furniture selling compay to customer s write
a) What are basic operation must select for the databese system
b)On what basic points the data structure is select for this company. 5 Marks
10.Write and Explain Union and Find operation for Dynamic Equivalence Problem.