GATE 2018 Previous Year Paper Solution Question 20 :- Computer Science

Views:0|Rating:0.00|View Time:3:36Minutes|Likes:0|Dislikes:0This video includes question which was asked in the exam of GATE 2018. Question :- The postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree is 8,6,9,4,7,2,5,1,3. The height of a tree is the length of the longest path from the root to any leaf. The height of… Read More


GATE 2018 Previous Year Paper Solution Question 16 :- Computer Science

Views:0|Rating:0.00|View Time:5:14Minutes|Likes:0|Dislikes:0This video includes question which was asked in the exam of GATE 2018. Question :- The value of ∫_0^(π/4)▒〖x cos⁡〖〖(x〗^2)dx〗 〗correct to three decimal places (assuming that π = 3.14) is ___________. Solution is explained in the video.… Read More


GATE 2018 Previous Year Paper Solution Question 13 - Computer Science

Views:1|Rating:5.00|View Time:1:47Minutes|Likes:1|Dislikes:0In this video question which was asked in the exam of GATE 2018 is discussed. Question :- Match the following : Field Length in bits P. UDP Header’s Port Number 1. 48 Q. Ethernet MAC Address 2. 8 R. IPv6 Next Header 3. 32 S. TCP Header’s Sequence Number 4. 16 A. P-3, Q-4,… Read More


GATE 2018 Previous Year Paper Solution Question 14 - Computer Science

Views:0|Rating:0.00|View Time:4:16Minutes|Likes:0|Dislikes:0In this video question which was asked in the exam of GATE 2018 is discussed. Question :- Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note the cwnd stands for the TCP congestion window and MSS denotes the Maximum Segment Size. 1. The cwnd increases by 2… Read More


GATE 2018 Previous Year Paper Solution Question 11 - Computer Science

Views:0|Rating:0.00|View Time:4:7Minutes|Likes:0|Dislikes:0In this video question which was asked in the exam of GATE 2018 is discussed. Question :- In an Entity-Relationship (ER) model, suppose R is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in R and that the cardinality of E1 is greater than… Read More


GATE 2018 Previous Year Paper Solution Question 9 - Computer Science

Views:0|Rating:0.00|View Time:5:54Minutes|Likes:0|Dislikes:0In this video question which was asked in the exam of GATE 2018 is discussed. Question :- The following are some events that occur after a device controller issues an interrupt while process L is under execution. P. The processor pushes the process status of L onto the control stack. Q. The processor finishes… Read More


GATE 2018 Previous Year Paper Solution Question 6 - Computer Science

Views:0|Rating:0.00|View Time:4:20Minutes|Likes:0|Dislikes:0In this video question which was asked in the exam of GATE 2018 is discussed. Question :- Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily true ? A. k ≥〖 n〗^2… Read More


GATE 2018 Previous Year Paper Solution Question 7 - Computer Science

Views:2|Rating:5.00|View Time:4:24Minutes|Likes:2|Dislikes:0In this video question which was asked in the exam of GATE 2018 is discussed. Question :- The set of all recursively enumerable language is A. closed under complementation B. closed under intersection C. a subset of a set of all recursive languages D. an uncountable set Solution is given in the video.… Read More


GATE 2018 Previous Year Paper Solution Question 8 - Computer Science

Views:1|Rating:5.00|View Time:4:9Minutes|Likes:1|Dislikes:0In this video question which was asked in the exam of GATE 2018 is discussed. Question :- Which one of the following statement is FALSE ? A. Context-free grammar can be used to specify both lexical and syntax rules. B. Type checking is done before parsing C. High-level language programs can be translated to… Read More


GATE 2018 Previous Year Paper Solution Question 10 - Computer Science

Views:0|Rating:0.00|View Time:3:16Minutes|Likes:0|Dislikes:0In this video question which was asked in the exam of GATE 2018 is discussed. Question :- Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is M units if the corresponding memory page is available in memory, and D units… Read More


GATE 2018 Previous Year Paper Solution Question 3 - Computer Science

Views:0|Rating:0.00|View Time:8:52Minutes|Likes:0|Dislikes:0In this video questions which were asked in the exam of GATE 2018 are solved. Question :- A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let enqueue… Read More


GATE 2018 Previous Year Paper Solution Question 2 - Computer Science

Views:0|Rating:0.00|View Time:4:58Minutes|Likes:0|Dislikes:0In this video questions which were asked in the exam of GATE 2018 are solved. Question :- Consider the following C program # include {stdio.h} struct Ournode{ char x,y,z; }; int main (){ struct Ournode p = {‘1′,’0’,’a’+2}; struct Ournode *q = &p ; printf(“%c, %c”,*((char*)q+1),*((char*)q+2)); return 0 ; } The output of the… Read More


GATE 2018 Previous Year Paper Solution Question 5 - Computer Science

Views:1|Rating:0.00|View Time:3:56Minutes|Likes:0|Dislikes:0In this video questions which were asked in the exam of GATE 2018 are solved. Question :- Consider the following processor design characteristics. 1. Register-to-register arithmetic operations only 2. Fixed-length instruction format 3. Hard wired control unit Which of the characteristics above are used in the design of a RISC processor ? A. 1… Read More