UGCNET Questions

The days of the week repeat every 7 days. We find the effective shift by computing 50 mod 7. Since 50 = 7 × 7 + 1, the remainder is 1, meaning the day moves forward by 1 from Wednesday. One day after Wednesday is Thursday, so 50 days from now it will be Thursday.

Option A:
Option A, Thursday, is exactly one day after Wednesday and corresponds to a remainder of 1 in the modulo-7 calculation, so it matches the correct reasoning.

Option B:
Option B, Saturday, is three days after Wednesday and would be correct only if the remainder were 3, not 1.

Option C:
Option C, Sunday, is four days after Wednesday and would require a remainder of 4, which does not arise from 50 ÷ 7.

Option D:
Option D, Monday, is five days after Wednesday, again inconsistent with the actual remainder of 1.

Formative assessment focuses on monitoring learning during the course and helping students improve before final evaluation. ICT tools like LMS platforms make it easy to schedule periodic quizzes, collect submissions and give quick feedback. Analytics dashboards can show which topics are problematic, allowing targeted remedial teaching. Thus, the example of regular online assessments with feedback aligns closely with the formative purpose.

Option A:
A single final exam is a summative assessment and does not provide ongoing guidance during the learning process. The long delay in declaring results further reduces its usefulness as feedback.

Option B:
Uploading only slides gives access to content but does not check understanding or provide performance-related feedback. Without tasks and responses, assessment is missing.

Option C:
This option correctly combines frequent assessment opportunities with responsive feedback. Students can track their own progress, and teachers can adjust teaching strategies based on LMS data.

Option D:
Administrative circulars may inform students about dates or rules but are not part of the assessment process. They do not measure or support learning outcomes directly.

Ranking algorithms consider factors such as keywords, links, freshness and user behaviour to estimate which pages match a query best. By presenting the most relevant pages at the top, search engines increase the likelihood that users will quickly find needed information. Although not perfect, this ranking is central to effective web searching. Thus, the main purpose is relevance-based ordering.

Option A:
This option accurately captures that the ranking algorithm’s aim is to prioritise pages that appear most relevant and useful for a given query. By pushing such pages towards the top of the results, search engines help users locate information efficiently.

Option B:
This option suggests that only advertisements are shown, which contradicts actual behaviour. Most search engines clearly separate paid ads from organic results and do not exclude genuine content.

Option C:
Randomly shuffling web pages would undermine user trust and make search engines unusable. Sophisticated algorithms are explicitly designed to avoid such randomness and instead approximate relevance.

Option D:
Deleting all academic pages would be the opposite of supporting information retrieval. Search engines index academic content along with other types of pages; they do not aim to remove it.

To solve the inequality 2x − 5 > 7, we first add 5 to both sides, giving 2x > 12. Then we divide both sides by 2, which is positive, so the inequality direction remains the same, yielding x > 6. Thus, the solution set consists of all real numbers greater than 6, and this is the equivalent inequality in terms of x.

Option A:
Option A captures the full result of correctly isolating x. It incorporates both the addition and division steps and expresses the final constraint directly as x > 6.

Option B:
Option B, x > 5, would follow only if the inequality were 2x − 5 > 5, not 2x − 5 > 7. It represents a weaker condition than required.

Option C:
Option C, x > 4, ignores more of the numerical shift and significantly broadens the solution set beyond what the original inequality allows.

Option D:
Option D, x > 3, is even looser and does not align with the operations needed to isolate x in the given inequality.

Nyāya requires that a sound hetu meet three conditions: it must be present in the pakṣa (pakṣadharmatā), present in all sapakṣa where the sādhya is known to be present, and absent from all vipakṣa where the sādhya is known to be absent. Together these ensure relevance, positive support and lack of counter examples.

Option A:
Option A inverts the pattern by demanding absence in sapakṣa and presence in vipakṣa, which would make the hetu useless for proving the sādhya.

Option B:
Option B correctly states the trairūpya pattern: presence in pakṣa and sapakṣa, absence in vipakṣa.

Option C:
Option C starts by saying the hetu is absent in the pakṣa, which already violates pakṣadharmatā and makes it an asiddha hetu.

Option D:
Option D imposes an irrelevant restriction to scriptural examples and excludes empirical instances, which has nothing to do with the formal threefold requirement.