Ankit Pandey ♦♦ 10
Reputation:
10
Status:
Trusted
Location:
Scholar ID:
Last seen:
11 hours ago
Joined:
4 months ago
Email:
a**************@gmail.com

#### Posts by Ankit Pandey

<prev • 2,197 results • page 1 of 220 • next >
0
6
views
0
... **Subject:** Operating System **Topic:** Process Management **Difficulty:** Medium **Marks :** 10M ...
written 12 hours ago by Ankit Pandey ♦♦ 10
0
5
views
0
... ------------ As per Choice Based Grading System ------------ **1. Overview of Operating System** Introduction: Operating System Structure and operations, Process management, Memory management, storage management, Protection and security, Distributed and special purpose Systems; System Structur ...
written 14 hours ago by Ankit Pandey ♦♦ 10
0
11
views
0
... ##Operating Systems - Dec 18 ###Information Technology (Semester 4) Total marks: 80 Total time: 3 Hours INSTRUCTIONS (1) Question 1 is compulsory. (2) Attempt any three from the remaining questions. (3) Draw neat diagrams wherever necessary. 1.a. Explain the two main categories of services ...
written 14 hours ago by Ankit Pandey ♦♦ 10
0
12
views
0
... ##Operating Systems - May 18 ###Information Technology (Semester 4) Total marks: 80 Total time: 3 Hours INSTRUCTIONS (1) Question 1 is compulsory. (2) Attempt any three from the remaining questions. (3) Draw neat diagrams wherever necessary. 1.a. What are the major activities of an Operati ...
written 15 hours ago by Ankit Pandey ♦♦ 10
2
844
views
2
... SO in the string 000 or 010 have to be there exclusive the number of the occurences of other 0‟s or 1‟s. The regular expressions that are permitted are $(0+1)^*000(0+1)^*$ or $(0+1)^*010(0+1)^*$ ![enter image description here][1] $\epsilon$-- NFA for the problem To convert this ε – NFA to NF ...
written 15 hours ago by Ankit Pandey ♦♦ 10
2
1.6k
views
2
... We require a branch condition that can accept either 00 or 11 as the ending of a string. The starting symbols can be either 0 or 1 which can be represented as a loop. ![enter image description here][1] [1]: https://i.imgur.com/DF2rTK0.png ...
written 15 hours ago by Ankit Pandey ♦♦ 10
2
179
views
2
... NFA is Non-deterministic Finite Automata. Formally NFA can be defined as follows - It is a five tuples definition which include $M = {Q, Σ, δ, q*, F}$ Q- Set of states in FA Σ- Set of input alphabets for FA δ- Set of transistions in FA q• - Initial State F - Set of final states ...
written 15 hours ago by Ankit Pandey ♦♦ 10
2
101
views
2
... Grammar is said to be linear and regular if - 1) LHS of every producion rule contains only one non-terminal. 2) RHS of every producion rule contains only one non-terminal which can appear at the leftmost or rightmost position. 3) These regular languages can be expressed by simpler expressions cal ...
written 16 hours ago by Ankit Pandey ♦♦ 10
0
3
views
0
... **Mumbai University > Information Technology> sem 4> computer organization and architecture** ...
written 17 hours ago by Ankit Pandey ♦♦ 10
0
5
views
0
... **Mumbai University > Information Technology> sem 4> computer organization and architecture** ...
written 18 hours ago by Ankit Pandey ♦♦ 10

#### Latest awards to Ankit Pandey

Oracle 23 days ago, created more than 1,000 posts (questions + answers + comments).
Centurion 3 months ago, created 100 posts.
Rising Star 3 months ago, created 50 posts within first three months of joining.