└── README.md /README.md: -------------------------------------------------------------------------------- 1 | # VIT MCA Previous year questions 2 | Hi, 3 | This respository is to help VITMEE MCA candidates. When I gave VITMEE back in 2018, there was no resource to see what type of questions does VIT asks. It's 2022 and the condition is still same. 4 | On my youtube channel- Codevenger, I created few VIT MCA videos after which I got lot of messages from students who scored well in the test. Same students helped me to create this resource. 5 | Don't forget to check my youtube channel - https://www.youtube.com/channel/UC5iNzobJXXaqBmzJcuAzpGA 6 | 7 | # VITMEE 2022, MCA 8 | 9 | ## Bharti, Rank 132 10 | In my set, there were 20 questions of English, around 8-10 of maths and the rest were on computer. 11 | For the English section, the questions were very very easy. There was very basic grammar. Some of the questions around 4-5 were not even from grammar like the questions I remember are--> 12 | 1. What is the name of a graph which shows data in the form of pictures? 13 | 2. What does the first line of the Memos state? 14 | 3. What we shouldn't do after writing a document? In this question one of the option is literally "tear that document and start writing a new one" 15 | Maths questions were from Probability, P&C, mode of data. And these were very basic that can be made from the basic formula. 16 | Now for the Computer, around 6-8 questions were from basic coding. For example, 17 | 1. a short code with If Else statement. We need to tell the output. 18 | 2. short code using "for statement" and tell output. 19 | 3. In 2 questions, maybe of "for statement" the answer was resulting in error. 20 | 4. One was from while loop also. 21 | Other questions were mostly theoretical ones. For eg: 22 | 1. Name the data structure used to print fibonacci series. 23 | 2. Name the data structure used to print factorials of a number. 24 | 3. Choose the best case for the time complexity in quicksort, binary sort, merge sort etc. 25 | 4. There were 3-4 questions directly on Big O notation, time complexity but they were very easy. 26 | 5. Asked that which protocol is not an application layer protocol. 27 | 6. Similarly, which is a transport layer protocol? 28 | 7. 4-5 questions were directly from protocols and layers. 29 | 8. What is not done in normalisation? 30 | 9. There were 5-6 questions from relational schema. 31 | 10. Some questions were from conceptual, physical and internal level. 32 | 11. 3-4 Direct questions from Binary tree and graphs. 33 | 12. IP address format and its layer in OSI. 34 | 13. There was a question from K shell also. 35 | 14. Name the queue used by a medium level scheduler. 36 | 15. Definition of Throughput, Response time. 37 | Overall, the exam was very easy but one thing that I didn't expect was that there were 4 theoretical questions from JAVA specifically asked about java system calls. 38 | Also in my set there was not a single question from Pointers, malloc, calloc, linked lists, prefix or postfix expressions. 39 | 40 | 41 | ## Ishan, Rank 16 42 | Q. How long is a MAC address?- 48 bits 43 | Q. Which of the following is not a class of IP Address- class F 44 | Q. Question related to vonn neumann architecture. 45 | Q. Data link layer- which of the following is an error detection technique. 46 | Q. If there are multiple bit error, which method would we used to detect it. 47 | Q. Simplify (x-5)(x+4) 48 | Q. If a,b,c are in hp, find the relation between a,b and c 49 | Q. Question related to semaphore 50 | Q. Code question where in switch case break wasn't used, so we need to tell till where would the code print if case is executed. 51 | Q. One question on storage types in C- auto, extern etc. 52 | Q. Question on independent or depend probability. (A∩B) = P(A) · P(B) 53 | English 54 | Q. Some questions related to types of questionnaire. 55 | Q. Where do we sign when writing minutes- bottom left, right, top left right etc. 56 | Q. What kind of language should we use when writing technical instructions. 57 | Q. Fill in the blanks. 58 | 59 | ## Chirag, Rank 45 60 | I'll try to recall as much as I can... 61 | This time I think there were more qtns from COA specially from flip flops (atleast 4). 62 | There were couple of C programs which were tricky. 63 | 4 questions from physical layer. 64 | In DBMS there were qtns regarding your knowledge in keys and Normalization. 65 | Time complexity questions regarding couple of c programs given. 66 | One can expect questions from scheduling algorithms topics but the question will not be directly regarding any numerical. Instead it would be a small numerical which can be solved in a min. 67 | There can be some questions which are not included in the syllabus specifically but could be asked. Specially regarding hardware. 68 | Studying all layers in CN is must. Probably the most important topic in the exam to be expected. 69 | 70 | ## Vyom, Rank 34 71 | 20 questions from English 72 | DSA -> basic theory-based question 73 | ->LinkedList and array 74 | ->Binary Search 75 | -> Time Complexity 76 | C -> I/O questions, memory management 77 | OS-> scheduling algorithm 78 | DBMS-> only basic theory (No SQL queries) 79 | CN-> layers and IP, MAC addresses. 80 | COA-> left/right shift, ALU, pipelines 81 | Maths-> 2 probability questions, 1 basic quad equation and 1 differentation. 82 | 83 | ## Raghav 84 | 25 question from english - easy level 85 | from remaining 75 around 4-5 questions were from maths from topics like - probability, p and c, binomial, stats 86 | remaing all questions were from computer 87 | around 6-8 questions were code based where you had tell output 88 | some numericals from computer networks 89 | in my set majority theory questions were from dsa algo 90 | 91 | ## Govind 92 | Active Passive Voice 93 | Newton raphson method 94 | IP address 95 | Sorting Algorithms - 5-6 question 96 | Register 97 | Time complexity 98 | Big O 99 | Dbms-attribute related 100 | ISI Model se ek question 101 | C ka Code ka output 102 | Stack queue se related ques 103 | Network Protocols 104 | Baud Rate 105 | FIFO ANF LIFO 106 | Arithmetic Operator Precedance 107 | Probability 108 | 109 | ## Sakshi, Rank 244 110 | The test level is moderate there were the basics of computer and personally in my paper there were 5-6 questions for maths of probability, matrices and complex number and and if you study for 10 days before exam you can clear it. I just study for 10 days and the result is here. Just focus on basics of computer and just see the English topics once ie. Minutes and memos 111 | 112 | ## Vaibhav, 113 | Mostly the questions are from core subjects Like networking, computer organization, operating system and stuff very few maths questions only 2-3 questions were from maths. I don't rememer the questions exactly but the most questions were from operating system and organization but the questions was a bit difficult in depth. 114 | 115 | ## Ullas, 116 | From what I remember matrix 2-3 questions I got. Most of the questions are from c such as find the error in the below code or find the output etc Then computer network, scheduling algo are important. Maths I just guessed and wrote and English was way too easy. 117 | 118 | ## Sagar, 119 | computer awareness thoda jaada tha 20 english jo easy tha. math thoda difficult ho sakata hai but koi fark nhi padega kui ki no of question 5 se 6 hi hoga 120 | 121 | ## Shivam, Rank 385 122 | the computer questions were pretty generic from Our BSc./BCA syllabus. 123 | Many of them about 124 | - "what will be the output of the following?" 125 | - Complexity of Binary Search tree 126 | - Transversal (binary tree) 127 | In mathematics i remember 2 questions: 1 from probability and the other Sum of Infinite GP 128 | 129 | ## Ehan, Rank 422 130 | English to ekdam basic koi bhi English mock test dedo wesa hi tha . 131 | Maths me probability ke questions the basic wale hi ek differentiation tha 132 | Programing ke 4-5 the jo output nikalne the bas . 133 | DSA ke topics wale the 134 | Memory management, computer networks, osi model se ek tha , database management system ke basic 135 | 136 | ## Prince, Rank 627 137 | There was one question in which we have to find moduls of a complex number. One question was from probability.Mostly questions were very easy level And there were questions about string 138 | Arrays. C programs, there were some programs written we have to predict the output what will print. 139 | --------------------------------------------------------------------------------